/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:56:06,537 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:56:06,540 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:56:06,551 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:56:06,551 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:56:06,552 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:56:06,553 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:56:06,555 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:56:06,557 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:56:06,557 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:56:06,558 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:56:06,559 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:56:06,559 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:56:06,560 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:56:06,561 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:56:06,562 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:56:06,563 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:56:06,564 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:56:06,565 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:56:06,567 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:56:06,569 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:56:06,570 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:56:06,571 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:56:06,571 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:56:06,573 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:56:06,574 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:56:06,574 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:56:06,575 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:56:06,575 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:56:06,576 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:56:06,576 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:56:06,577 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:56:06,578 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:56:06,578 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:56:06,579 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:56:06,579 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:56:06,580 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:56:06,580 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:56:06,580 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:56:06,581 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:56:06,582 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:56:06,583 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 12:56:06,597 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:56:06,597 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:56:06,598 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:56:06,598 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:56:06,598 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:56:06,598 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:56:06,599 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:56:06,599 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:56:06,599 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:56:06,599 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:56:06,599 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:56:06,600 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:56:06,600 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:56:06,600 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:56:06,600 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:56:06,600 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:56:06,600 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:56:06,601 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:56:06,601 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:56:06,601 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:56:06,601 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:56:06,601 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:56:06,602 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:56:06,602 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:56:06,602 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:56:06,602 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:56:06,602 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:56:06,602 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:56:06,603 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:56:06,764 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:56:06,777 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:56:06,781 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:56:06,782 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:56:06,782 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:56:06,783 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:56:06,879 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_Aue2Ep/tmp/274885b5d9024aa49d2d3de2a7c5ba13/FLAGbfe588c2b [2020-07-01 12:56:07,216 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:56:07,216 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:56:07,217 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:56:07,223 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_Aue2Ep/tmp/274885b5d9024aa49d2d3de2a7c5ba13/FLAGbfe588c2b [2020-07-01 12:56:07,609 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_Aue2Ep/tmp/274885b5d9024aa49d2d3de2a7c5ba13 [2020-07-01 12:56:07,620 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:56:07,622 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:56:07,623 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:56:07,623 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:56:07,627 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:56:07,627 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:56:07" (1/1) ... [2020-07-01 12:56:07,631 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@274b837a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:56:07, skipping insertion in model container [2020-07-01 12:56:07,631 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:56:07" (1/1) ... [2020-07-01 12:56:07,639 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:56:07,657 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:56:07,893 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:56:07,905 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:56:07,924 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:56:07,940 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:56:07,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:56:07 WrapperNode [2020-07-01 12:56:07,941 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:56:07,942 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:56:07,942 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:56:07,942 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:56:07,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:56:07" (1/1) ... [2020-07-01 12:56:07,961 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:56:07" (1/1) ... [2020-07-01 12:56:07,985 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:56:07,985 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:56:07,985 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:56:07,986 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:56:07,996 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:56:07" (1/1) ... [2020-07-01 12:56:07,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:56:07" (1/1) ... [2020-07-01 12:56:07,998 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:56:07" (1/1) ... [2020-07-01 12:56:07,999 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:56:07" (1/1) ... [2020-07-01 12:56:08,005 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:56:07" (1/1) ... [2020-07-01 12:56:08,010 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:56:07" (1/1) ... [2020-07-01 12:56:08,011 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:56:07" (1/1) ... [2020-07-01 12:56:08,014 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:56:08,015 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:56:08,015 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:56:08,015 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:56:08,016 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:56:07" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:56:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:56:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:56:08,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:56:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:56:08,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:56:08,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:56:08,368 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:56:08,368 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-01 12:56:08,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:56:08 BoogieIcfgContainer [2020-07-01 12:56:08,372 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:56:08,373 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:56:08,373 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:56:08,375 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:56:08,375 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:56:08" (1/1) ... [2020-07-01 12:56:08,390 INFO L313 BlockEncoder]: Initial Icfg 40 locations, 46 edges [2020-07-01 12:56:08,392 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:56:08,393 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:56:08,393 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:56:08,394 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:56:08,396 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:56:08,396 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:56:08,397 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:56:08,421 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:56:08,454 INFO L200 BlockEncoder]: SBE split 19 edges [2020-07-01 12:56:08,459 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 12:56:08,460 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:56:08,496 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-07-01 12:56:08,499 INFO L70 RemoveSinkStates]: Removed 6 edges and 3 locations by removing sink states [2020-07-01 12:56:08,500 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:56:08,500 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:56:08,501 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:56:08,501 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:56:08,502 INFO L313 BlockEncoder]: Encoded RCFG 30 locations, 53 edges [2020-07-01 12:56:08,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:56:08 BasicIcfg [2020-07-01 12:56:08,502 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:56:08,504 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:56:08,504 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:56:08,507 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:56:08,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:56:07" (1/4) ... [2020-07-01 12:56:08,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@284bb4a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:56:08, skipping insertion in model container [2020-07-01 12:56:08,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:56:07" (2/4) ... [2020-07-01 12:56:08,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@284bb4a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:56:08, skipping insertion in model container [2020-07-01 12:56:08,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:56:08" (3/4) ... [2020-07-01 12:56:08,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@284bb4a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:56:08, skipping insertion in model container [2020-07-01 12:56:08,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:56:08" (4/4) ... [2020-07-01 12:56:08,511 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:56:08,522 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:56:08,529 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2020-07-01 12:56:08,543 INFO L251 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2020-07-01 12:56:08,567 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:56:08,567 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:56:08,567 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:56:08,567 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:56:08,567 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:56:08,568 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:56:08,568 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:56:08,568 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:56:08,583 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2020-07-01 12:56:08,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:56:08,589 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:56:08,590 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:56:08,590 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:56:08,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:56:08,596 INFO L82 PathProgramCache]: Analyzing trace with hash 200436536, now seen corresponding path program 1 times [2020-07-01 12:56:08,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:56:08,606 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296147326] [2020-07-01 12:56:08,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:56:08,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:08,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:56:08,786 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296147326] [2020-07-01 12:56:08,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:56:08,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:56:08,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229224453] [2020-07-01 12:56:08,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:56:08,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:56:08,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:56:08,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:56:08,810 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. [2020-07-01 12:56:08,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:56:08,944 INFO L93 Difference]: Finished difference Result 30 states and 53 transitions. [2020-07-01 12:56:08,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:56:08,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:56:08,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:56:08,960 INFO L225 Difference]: With dead ends: 30 [2020-07-01 12:56:08,960 INFO L226 Difference]: Without dead ends: 29 [2020-07-01 12:56:08,963 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:56:08,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-01 12:56:08,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-01 12:56:09,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-01 12:56:09,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 51 transitions. [2020-07-01 12:56:09,003 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 51 transitions. Word has length 5 [2020-07-01 12:56:09,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:56:09,004 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 51 transitions. [2020-07-01 12:56:09,004 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:56:09,004 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 51 transitions. [2020-07-01 12:56:09,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:56:09,005 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:56:09,005 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:56:09,007 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:56:09,007 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:56:09,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:56:09,007 INFO L82 PathProgramCache]: Analyzing trace with hash 200436538, now seen corresponding path program 1 times [2020-07-01 12:56:09,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:56:09,008 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815158070] [2020-07-01 12:56:09,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:56:09,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:09,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:56:09,044 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815158070] [2020-07-01 12:56:09,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:56:09,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:56:09,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824209169] [2020-07-01 12:56:09,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:56:09,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:56:09,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:56:09,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:56:09,047 INFO L87 Difference]: Start difference. First operand 29 states and 51 transitions. Second operand 3 states. [2020-07-01 12:56:09,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:56:09,134 INFO L93 Difference]: Finished difference Result 30 states and 51 transitions. [2020-07-01 12:56:09,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:56:09,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:56:09,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:56:09,136 INFO L225 Difference]: With dead ends: 30 [2020-07-01 12:56:09,136 INFO L226 Difference]: Without dead ends: 29 [2020-07-01 12:56:09,137 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:56:09,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-01 12:56:09,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-01 12:56:09,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-01 12:56:09,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 50 transitions. [2020-07-01 12:56:09,142 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 50 transitions. Word has length 5 [2020-07-01 12:56:09,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:56:09,143 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 50 transitions. [2020-07-01 12:56:09,143 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:56:09,143 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 50 transitions. [2020-07-01 12:56:09,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:56:09,143 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:56:09,144 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:56:09,144 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:56:09,144 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:56:09,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:56:09,144 INFO L82 PathProgramCache]: Analyzing trace with hash 200436539, now seen corresponding path program 1 times [2020-07-01 12:56:09,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:56:09,145 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024071795] [2020-07-01 12:56:09,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:56:09,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:09,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:56:09,192 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024071795] [2020-07-01 12:56:09,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:56:09,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:56:09,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125284422] [2020-07-01 12:56:09,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:56:09,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:56:09,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:56:09,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:56:09,194 INFO L87 Difference]: Start difference. First operand 29 states and 50 transitions. Second operand 4 states. [2020-07-01 12:56:09,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:56:09,276 INFO L93 Difference]: Finished difference Result 29 states and 50 transitions. [2020-07-01 12:56:09,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:56:09,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-07-01 12:56:09,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:56:09,277 INFO L225 Difference]: With dead ends: 29 [2020-07-01 12:56:09,277 INFO L226 Difference]: Without dead ends: 28 [2020-07-01 12:56:09,278 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:56:09,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-01 12:56:09,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-01 12:56:09,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-01 12:56:09,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 49 transitions. [2020-07-01 12:56:09,282 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 49 transitions. Word has length 5 [2020-07-01 12:56:09,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:56:09,283 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 49 transitions. [2020-07-01 12:56:09,283 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:56:09,283 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 49 transitions. [2020-07-01 12:56:09,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:56:09,283 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:56:09,283 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:56:09,284 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:56:09,284 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:56:09,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:56:09,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1918564540, now seen corresponding path program 1 times [2020-07-01 12:56:09,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:56:09,285 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341782546] [2020-07-01 12:56:09,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:56:09,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:09,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:56:09,313 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341782546] [2020-07-01 12:56:09,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:56:09,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:56:09,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435386630] [2020-07-01 12:56:09,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:56:09,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:56:09,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:56:09,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:56:09,315 INFO L87 Difference]: Start difference. First operand 28 states and 49 transitions. Second operand 3 states. [2020-07-01 12:56:09,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:56:09,392 INFO L93 Difference]: Finished difference Result 28 states and 49 transitions. [2020-07-01 12:56:09,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:56:09,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 12:56:09,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:56:09,393 INFO L225 Difference]: With dead ends: 28 [2020-07-01 12:56:09,393 INFO L226 Difference]: Without dead ends: 27 [2020-07-01 12:56:09,394 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:56:09,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-01 12:56:09,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-01 12:56:09,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 12:56:09,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 47 transitions. [2020-07-01 12:56:09,398 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 47 transitions. Word has length 6 [2020-07-01 12:56:09,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:56:09,398 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 47 transitions. [2020-07-01 12:56:09,398 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:56:09,398 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 47 transitions. [2020-07-01 12:56:09,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:56:09,399 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:56:09,399 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:56:09,399 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:56:09,399 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:56:09,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:56:09,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1918564542, now seen corresponding path program 1 times [2020-07-01 12:56:09,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:56:09,400 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141893788] [2020-07-01 12:56:09,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:56:09,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:09,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:56:09,437 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141893788] [2020-07-01 12:56:09,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:56:09,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:56:09,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315539802] [2020-07-01 12:56:09,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:56:09,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:56:09,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:56:09,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:56:09,439 INFO L87 Difference]: Start difference. First operand 27 states and 47 transitions. Second operand 4 states. [2020-07-01 12:56:09,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:56:09,527 INFO L93 Difference]: Finished difference Result 28 states and 47 transitions. [2020-07-01 12:56:09,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:56:09,528 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-07-01 12:56:09,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:56:09,528 INFO L225 Difference]: With dead ends: 28 [2020-07-01 12:56:09,529 INFO L226 Difference]: Without dead ends: 27 [2020-07-01 12:56:09,529 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:56:09,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-01 12:56:09,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-01 12:56:09,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 12:56:09,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 46 transitions. [2020-07-01 12:56:09,533 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 46 transitions. Word has length 6 [2020-07-01 12:56:09,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:56:09,533 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 46 transitions. [2020-07-01 12:56:09,534 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:56:09,534 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2020-07-01 12:56:09,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:56:09,534 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:56:09,534 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:56:09,535 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 12:56:09,535 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:56:09,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:56:09,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1918564543, now seen corresponding path program 1 times [2020-07-01 12:56:09,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:56:09,536 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363305319] [2020-07-01 12:56:09,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:56:09,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:09,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:56:09,569 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363305319] [2020-07-01 12:56:09,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:56:09,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:56:09,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733906625] [2020-07-01 12:56:09,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:56:09,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:56:09,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:56:09,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:56:09,570 INFO L87 Difference]: Start difference. First operand 27 states and 46 transitions. Second operand 3 states. [2020-07-01 12:56:09,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:56:09,655 INFO L93 Difference]: Finished difference Result 27 states and 46 transitions. [2020-07-01 12:56:09,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:56:09,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 12:56:09,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:56:09,657 INFO L225 Difference]: With dead ends: 27 [2020-07-01 12:56:09,657 INFO L226 Difference]: Without dead ends: 26 [2020-07-01 12:56:09,657 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:56:09,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-01 12:56:09,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-01 12:56:09,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-01 12:56:09,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 45 transitions. [2020-07-01 12:56:09,661 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 45 transitions. Word has length 6 [2020-07-01 12:56:09,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:56:09,661 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 45 transitions. [2020-07-01 12:56:09,662 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:56:09,662 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 45 transitions. [2020-07-01 12:56:09,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 12:56:09,662 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:56:09,662 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:56:09,663 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 12:56:09,663 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:56:09,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:56:09,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1199589599, now seen corresponding path program 1 times [2020-07-01 12:56:09,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:56:09,664 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562790496] [2020-07-01 12:56:09,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:56:09,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:09,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:56:09,711 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562790496] [2020-07-01 12:56:09,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:56:09,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:56:09,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664937525] [2020-07-01 12:56:09,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:56:09,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:56:09,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:56:09,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:56:09,713 INFO L87 Difference]: Start difference. First operand 26 states and 45 transitions. Second operand 4 states. [2020-07-01 12:56:09,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:56:09,796 INFO L93 Difference]: Finished difference Result 26 states and 45 transitions. [2020-07-01 12:56:09,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:56:09,796 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-07-01 12:56:09,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:56:09,797 INFO L225 Difference]: With dead ends: 26 [2020-07-01 12:56:09,797 INFO L226 Difference]: Without dead ends: 24 [2020-07-01 12:56:09,797 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:56:09,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-01 12:56:09,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-01 12:56:09,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-01 12:56:09,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 41 transitions. [2020-07-01 12:56:09,801 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 41 transitions. Word has length 8 [2020-07-01 12:56:09,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:56:09,802 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 41 transitions. [2020-07-01 12:56:09,802 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:56:09,802 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2020-07-01 12:56:09,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 12:56:09,802 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:56:09,802 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:56:09,803 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 12:56:09,803 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:56:09,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:56:09,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1199589601, now seen corresponding path program 1 times [2020-07-01 12:56:09,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:56:09,804 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155653985] [2020-07-01 12:56:09,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:56:09,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:09,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:56:09,869 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155653985] [2020-07-01 12:56:09,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:56:09,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-01 12:56:09,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907540318] [2020-07-01 12:56:09,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 12:56:09,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:56:09,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 12:56:09,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:56:09,871 INFO L87 Difference]: Start difference. First operand 24 states and 41 transitions. Second operand 6 states. [2020-07-01 12:56:10,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:56:10,009 INFO L93 Difference]: Finished difference Result 35 states and 59 transitions. [2020-07-01 12:56:10,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:56:10,010 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2020-07-01 12:56:10,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:56:10,010 INFO L225 Difference]: With dead ends: 35 [2020-07-01 12:56:10,010 INFO L226 Difference]: Without dead ends: 33 [2020-07-01 12:56:10,011 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:56:10,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-01 12:56:10,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2020-07-01 12:56:10,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-01 12:56:10,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 51 transitions. [2020-07-01 12:56:10,016 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 51 transitions. Word has length 8 [2020-07-01 12:56:10,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:56:10,016 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 51 transitions. [2020-07-01 12:56:10,016 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 12:56:10,017 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 51 transitions. [2020-07-01 12:56:10,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-01 12:56:10,017 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:56:10,017 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:56:10,017 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 12:56:10,018 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:56:10,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:56:10,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1467427036, now seen corresponding path program 1 times [2020-07-01 12:56:10,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:56:10,018 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701269129] [2020-07-01 12:56:10,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:56:10,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:10,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:56:10,059 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701269129] [2020-07-01 12:56:10,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:56:10,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:56:10,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615491088] [2020-07-01 12:56:10,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:56:10,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:56:10,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:56:10,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:56:10,061 INFO L87 Difference]: Start difference. First operand 28 states and 51 transitions. Second operand 4 states. [2020-07-01 12:56:10,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:56:10,145 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2020-07-01 12:56:10,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:56:10,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-07-01 12:56:10,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:56:10,146 INFO L225 Difference]: With dead ends: 28 [2020-07-01 12:56:10,146 INFO L226 Difference]: Without dead ends: 27 [2020-07-01 12:56:10,147 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:56:10,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-01 12:56:10,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-01 12:56:10,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 12:56:10,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 47 transitions. [2020-07-01 12:56:10,151 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 47 transitions. Word has length 9 [2020-07-01 12:56:10,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:56:10,151 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 47 transitions. [2020-07-01 12:56:10,151 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:56:10,152 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 47 transitions. [2020-07-01 12:56:10,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-01 12:56:10,152 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:56:10,152 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:56:10,152 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-01 12:56:10,152 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:56:10,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:56:10,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1467427034, now seen corresponding path program 1 times [2020-07-01 12:56:10,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:56:10,153 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246828906] [2020-07-01 12:56:10,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:56:10,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:10,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:56:10,190 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246828906] [2020-07-01 12:56:10,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:56:10,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 12:56:10,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231509415] [2020-07-01 12:56:10,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:56:10,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:56:10,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:56:10,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:56:10,191 INFO L87 Difference]: Start difference. First operand 27 states and 47 transitions. Second operand 5 states. [2020-07-01 12:56:10,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:56:10,280 INFO L93 Difference]: Finished difference Result 29 states and 47 transitions. [2020-07-01 12:56:10,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:56:10,281 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-07-01 12:56:10,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:56:10,282 INFO L225 Difference]: With dead ends: 29 [2020-07-01 12:56:10,282 INFO L226 Difference]: Without dead ends: 28 [2020-07-01 12:56:10,282 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:56:10,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-01 12:56:10,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-07-01 12:56:10,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 12:56:10,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 46 transitions. [2020-07-01 12:56:10,286 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 46 transitions. Word has length 9 [2020-07-01 12:56:10,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:56:10,287 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 46 transitions. [2020-07-01 12:56:10,287 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:56:10,287 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2020-07-01 12:56:10,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-01 12:56:10,287 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:56:10,287 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:56:10,288 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-01 12:56:10,288 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:56:10,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:56:10,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1467427033, now seen corresponding path program 1 times [2020-07-01 12:56:10,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:56:10,288 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113575399] [2020-07-01 12:56:10,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:56:10,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:10,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:56:10,349 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113575399] [2020-07-01 12:56:10,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:56:10,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-01 12:56:10,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674144476] [2020-07-01 12:56:10,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 12:56:10,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:56:10,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 12:56:10,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:56:10,351 INFO L87 Difference]: Start difference. First operand 27 states and 46 transitions. Second operand 6 states. [2020-07-01 12:56:10,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:56:10,469 INFO L93 Difference]: Finished difference Result 28 states and 46 transitions. [2020-07-01 12:56:10,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 12:56:10,469 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-07-01 12:56:10,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:56:10,470 INFO L225 Difference]: With dead ends: 28 [2020-07-01 12:56:10,470 INFO L226 Difference]: Without dead ends: 27 [2020-07-01 12:56:10,471 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:56:10,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-01 12:56:10,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-01 12:56:10,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 12:56:10,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 45 transitions. [2020-07-01 12:56:10,474 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 45 transitions. Word has length 9 [2020-07-01 12:56:10,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:56:10,474 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 45 transitions. [2020-07-01 12:56:10,474 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 12:56:10,475 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 45 transitions. [2020-07-01 12:56:10,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 12:56:10,475 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:56:10,475 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:56:10,475 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-01 12:56:10,476 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:56:10,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:56:10,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1448187237, now seen corresponding path program 1 times [2020-07-01 12:56:10,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:56:10,477 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633775588] [2020-07-01 12:56:10,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:56:10,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:10,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:56:10,518 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633775588] [2020-07-01 12:56:10,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:56:10,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 12:56:10,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257892412] [2020-07-01 12:56:10,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:56:10,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:56:10,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:56:10,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:56:10,519 INFO L87 Difference]: Start difference. First operand 27 states and 45 transitions. Second operand 5 states. [2020-07-01 12:56:10,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:56:10,618 INFO L93 Difference]: Finished difference Result 27 states and 45 transitions. [2020-07-01 12:56:10,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:56:10,618 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-01 12:56:10,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:56:10,619 INFO L225 Difference]: With dead ends: 27 [2020-07-01 12:56:10,619 INFO L226 Difference]: Without dead ends: 26 [2020-07-01 12:56:10,619 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:56:10,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-01 12:56:10,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-01 12:56:10,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-01 12:56:10,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 43 transitions. [2020-07-01 12:56:10,623 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 43 transitions. Word has length 11 [2020-07-01 12:56:10,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:56:10,623 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 43 transitions. [2020-07-01 12:56:10,623 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:56:10,623 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 43 transitions. [2020-07-01 12:56:10,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 12:56:10,624 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:56:10,624 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:56:10,624 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-01 12:56:10,624 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:56:10,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:56:10,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1448187235, now seen corresponding path program 1 times [2020-07-01 12:56:10,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:56:10,625 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099661991] [2020-07-01 12:56:10,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:56:10,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:10,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:56:10,676 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099661991] [2020-07-01 12:56:10,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:56:10,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-01 12:56:10,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504879195] [2020-07-01 12:56:10,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 12:56:10,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:56:10,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 12:56:10,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:56:10,678 INFO L87 Difference]: Start difference. First operand 26 states and 43 transitions. Second operand 6 states. [2020-07-01 12:56:10,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:56:10,804 INFO L93 Difference]: Finished difference Result 32 states and 52 transitions. [2020-07-01 12:56:10,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 12:56:10,805 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-07-01 12:56:10,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:56:10,805 INFO L225 Difference]: With dead ends: 32 [2020-07-01 12:56:10,806 INFO L226 Difference]: Without dead ends: 31 [2020-07-01 12:56:10,806 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-01 12:56:10,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-01 12:56:10,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2020-07-01 12:56:10,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 12:56:10,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 44 transitions. [2020-07-01 12:56:10,810 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 44 transitions. Word has length 11 [2020-07-01 12:56:10,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:56:10,810 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 44 transitions. [2020-07-01 12:56:10,810 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 12:56:10,810 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 44 transitions. [2020-07-01 12:56:10,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-01 12:56:10,811 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:56:10,811 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:56:10,811 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-01 12:56:10,811 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:56:10,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:56:10,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1944059446, now seen corresponding path program 1 times [2020-07-01 12:56:10,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:56:10,812 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264567919] [2020-07-01 12:56:10,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:56:10,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:10,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:56:10,844 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264567919] [2020-07-01 12:56:10,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:56:10,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:56:10,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010624897] [2020-07-01 12:56:10,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:56:10,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:56:10,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:56:10,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:56:10,846 INFO L87 Difference]: Start difference. First operand 27 states and 44 transitions. Second operand 4 states. [2020-07-01 12:56:10,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:56:10,914 INFO L93 Difference]: Finished difference Result 27 states and 44 transitions. [2020-07-01 12:56:10,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:56:10,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-07-01 12:56:10,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:56:10,915 INFO L225 Difference]: With dead ends: 27 [2020-07-01 12:56:10,915 INFO L226 Difference]: Without dead ends: 26 [2020-07-01 12:56:10,915 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:56:10,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-01 12:56:10,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-01 12:56:10,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-01 12:56:10,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 42 transitions. [2020-07-01 12:56:10,918 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 42 transitions. Word has length 12 [2020-07-01 12:56:10,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:56:10,919 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 42 transitions. [2020-07-01 12:56:10,919 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:56:10,919 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 42 transitions. [2020-07-01 12:56:10,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-01 12:56:10,919 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:56:10,919 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:56:10,920 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-01 12:56:10,920 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:56:10,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:56:10,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1944059444, now seen corresponding path program 1 times [2020-07-01 12:56:10,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:56:10,920 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838764042] [2020-07-01 12:56:10,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:56:10,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:11,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:56:11,006 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838764042] [2020-07-01 12:56:11,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:56:11,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-01 12:56:11,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790590060] [2020-07-01 12:56:11,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-01 12:56:11,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:56:11,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 12:56:11,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:56:11,007 INFO L87 Difference]: Start difference. First operand 26 states and 42 transitions. Second operand 8 states. [2020-07-01 12:56:11,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:56:11,180 INFO L93 Difference]: Finished difference Result 34 states and 52 transitions. [2020-07-01 12:56:11,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-01 12:56:11,180 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2020-07-01 12:56:11,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:56:11,181 INFO L225 Difference]: With dead ends: 34 [2020-07-01 12:56:11,181 INFO L226 Difference]: Without dead ends: 33 [2020-07-01 12:56:11,181 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-07-01 12:56:11,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-01 12:56:11,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2020-07-01 12:56:11,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 12:56:11,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 43 transitions. [2020-07-01 12:56:11,185 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 43 transitions. Word has length 12 [2020-07-01 12:56:11,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:56:11,185 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 43 transitions. [2020-07-01 12:56:11,185 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-01 12:56:11,185 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 43 transitions. [2020-07-01 12:56:11,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-01 12:56:11,186 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:56:11,186 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:56:11,186 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-01 12:56:11,186 INFO L427 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:56:11,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:56:11,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1944059443, now seen corresponding path program 1 times [2020-07-01 12:56:11,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:56:11,187 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89396373] [2020-07-01 12:56:11,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:56:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:11,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:56:11,240 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89396373] [2020-07-01 12:56:11,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:56:11,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-01 12:56:11,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625513318] [2020-07-01 12:56:11,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-01 12:56:11,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:56:11,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-01 12:56:11,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:56:11,241 INFO L87 Difference]: Start difference. First operand 27 states and 43 transitions. Second operand 7 states. [2020-07-01 12:56:11,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:56:11,373 INFO L93 Difference]: Finished difference Result 28 states and 43 transitions. [2020-07-01 12:56:11,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 12:56:11,373 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2020-07-01 12:56:11,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:56:11,374 INFO L225 Difference]: With dead ends: 28 [2020-07-01 12:56:11,374 INFO L226 Difference]: Without dead ends: 25 [2020-07-01 12:56:11,375 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-07-01 12:56:11,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-01 12:56:11,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-01 12:56:11,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-01 12:56:11,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 38 transitions. [2020-07-01 12:56:11,378 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 38 transitions. Word has length 12 [2020-07-01 12:56:11,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:56:11,378 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 38 transitions. [2020-07-01 12:56:11,378 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-01 12:56:11,378 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 38 transitions. [2020-07-01 12:56:11,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-01 12:56:11,379 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:56:11,379 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:56:11,379 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-01 12:56:11,379 INFO L427 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:56:11,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:56:11,380 INFO L82 PathProgramCache]: Analyzing trace with hash -55512069, now seen corresponding path program 1 times [2020-07-01 12:56:11,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:56:11,380 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075528] [2020-07-01 12:56:11,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:56:11,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:11,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:56:11,545 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075528] [2020-07-01 12:56:11,545 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954609877] [2020-07-01 12:56:11,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:56:11,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:11,620 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 27 conjunts are in the unsatisfiable core [2020-07-01 12:56:11,626 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:56:11,669 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_22|], 1=[|v_#valid_33|]} [2020-07-01 12:56:11,679 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:56:11,690 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 12:56:11,691 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:56:11,702 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:56:11,709 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-01 12:56:11,710 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:56:11,718 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:56:11,719 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:56:11,719 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2020-07-01 12:56:11,752 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-07-01 12:56:11,753 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:56:11,765 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:56:11,765 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:56:11,766 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2020-07-01 12:56:11,812 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2020-07-01 12:56:11,813 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:56:11,835 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:56:11,838 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-07-01 12:56:11,838 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:40 [2020-07-01 12:56:11,965 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:56:11,966 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2020-07-01 12:56:11,967 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:56:11,970 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:56:11,989 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:56:11,991 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:56:11,994 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 12:56:11,995 INFO L539 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:56:11,995 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:34 [2020-07-01 12:56:12,047 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:56:12,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:56:12,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:56:12,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2020-07-01 12:56:12,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534890463] [2020-07-01 12:56:12,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-01 12:56:12,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:56:12,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-01 12:56:12,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2020-07-01 12:56:12,076 INFO L87 Difference]: Start difference. First operand 25 states and 38 transitions. Second operand 15 states. [2020-07-01 12:56:12,567 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2020-07-01 12:56:12,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:56:12,822 INFO L93 Difference]: Finished difference Result 39 states and 56 transitions. [2020-07-01 12:56:12,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-01 12:56:12,823 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2020-07-01 12:56:12,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:56:12,824 INFO L225 Difference]: With dead ends: 39 [2020-07-01 12:56:12,824 INFO L226 Difference]: Without dead ends: 37 [2020-07-01 12:56:12,825 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2020-07-01 12:56:12,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-01 12:56:12,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2020-07-01 12:56:12,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-01 12:56:12,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 44 transitions. [2020-07-01 12:56:12,829 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 44 transitions. Word has length 15 [2020-07-01 12:56:12,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:56:12,829 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 44 transitions. [2020-07-01 12:56:12,829 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-01 12:56:12,829 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 44 transitions. [2020-07-01 12:56:12,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-01 12:56:12,830 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:56:12,830 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:56:13,031 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-07-01 12:56:13,031 INFO L427 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:56:13,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:56:13,031 INFO L82 PathProgramCache]: Analyzing trace with hash -55512068, now seen corresponding path program 1 times [2020-07-01 12:56:13,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:56:13,032 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843047482] [2020-07-01 12:56:13,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:56:13,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:13,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:56:13,084 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843047482] [2020-07-01 12:56:13,084 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440533528] [2020-07-01 12:56:13,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:56:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:13,121 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 12:56:13,122 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:56:13,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:56:13,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 12:56:13,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2020-07-01 12:56:13,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004758450] [2020-07-01 12:56:13,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:56:13,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:56:13,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:56:13,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:56:13,143 INFO L87 Difference]: Start difference. First operand 29 states and 44 transitions. Second operand 4 states. [2020-07-01 12:56:13,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:56:13,221 INFO L93 Difference]: Finished difference Result 30 states and 44 transitions. [2020-07-01 12:56:13,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:56:13,222 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-07-01 12:56:13,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:56:13,222 INFO L225 Difference]: With dead ends: 30 [2020-07-01 12:56:13,222 INFO L226 Difference]: Without dead ends: 28 [2020-07-01 12:56:13,223 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:56:13,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-01 12:56:13,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-01 12:56:13,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-01 12:56:13,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 41 transitions. [2020-07-01 12:56:13,227 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 41 transitions. Word has length 15 [2020-07-01 12:56:13,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:56:13,227 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 41 transitions. [2020-07-01 12:56:13,227 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:56:13,227 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 41 transitions. [2020-07-01 12:56:13,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-01 12:56:13,228 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:56:13,228 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:56:13,428 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-07-01 12:56:13,429 INFO L427 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:56:13,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:56:13,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1720873140, now seen corresponding path program 1 times [2020-07-01 12:56:13,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:56:13,430 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835318490] [2020-07-01 12:56:13,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:56:13,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:13,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:56:13,489 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835318490] [2020-07-01 12:56:13,489 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944390384] [2020-07-01 12:56:13,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:56:13,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:13,539 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 12:56:13,541 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:56:13,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:56:13,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:56:13,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2020-07-01 12:56:13,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477841224] [2020-07-01 12:56:13,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-01 12:56:13,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:56:13,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 12:56:13,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:56:13,555 INFO L87 Difference]: Start difference. First operand 28 states and 41 transitions. Second operand 8 states. [2020-07-01 12:56:13,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:56:13,705 INFO L93 Difference]: Finished difference Result 29 states and 41 transitions. [2020-07-01 12:56:13,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 12:56:13,706 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-07-01 12:56:13,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:56:13,706 INFO L225 Difference]: With dead ends: 29 [2020-07-01 12:56:13,707 INFO L226 Difference]: Without dead ends: 28 [2020-07-01 12:56:13,707 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-07-01 12:56:13,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-01 12:56:13,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-01 12:56:13,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-01 12:56:13,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2020-07-01 12:56:13,711 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 16 [2020-07-01 12:56:13,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:56:13,712 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2020-07-01 12:56:13,712 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-01 12:56:13,712 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2020-07-01 12:56:13,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-01 12:56:13,713 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:56:13,713 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:56:13,913 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:56:13,914 INFO L427 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:56:13,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:56:13,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1720873139, now seen corresponding path program 1 times [2020-07-01 12:56:13,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:56:13,915 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107686035] [2020-07-01 12:56:13,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:56:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:14,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:56:14,075 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107686035] [2020-07-01 12:56:14,076 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119742841] [2020-07-01 12:56:14,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:56:14,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:14,126 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 39 conjunts are in the unsatisfiable core [2020-07-01 12:56:14,128 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:56:14,161 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-07-01 12:56:14,162 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:56:14,174 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:56:14,176 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-01 12:56:14,177 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2020-07-01 12:56:14,411 INFO L172 IndexEqualityManager]: detected equality via solver [2020-07-01 12:56:14,450 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:56:14,451 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 78 [2020-07-01 12:56:14,453 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-01 12:56:14,453 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:56:14,454 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 12:56:14,455 INFO L477 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-07-01 12:56:14,456 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-01 12:56:14,457 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:56:14,457 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 12:56:14,458 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-01 12:56:14,459 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-01 12:56:14,461 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-01 12:56:14,461 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 12:56:14,463 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2020-07-01 12:56:14,611 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-07-01 12:56:14,612 INFO L619 ElimStorePlain]: treesize reduction 414, result has 11.2 percent of original size [2020-07-01 12:56:14,615 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:56:14,616 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 12:56:14,618 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:56:14,618 INFO L539 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-01 12:56:14,619 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:59, output treesize:23 [2020-07-01 12:56:14,655 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:56:14,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:56:14,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:56:14,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2020-07-01 12:56:14,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102572510] [2020-07-01 12:56:14,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-01 12:56:14,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:56:14,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-01 12:56:14,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2020-07-01 12:56:14,660 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 17 states. [2020-07-01 12:56:15,164 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2020-07-01 12:56:15,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:56:15,560 INFO L93 Difference]: Finished difference Result 30 states and 42 transitions. [2020-07-01 12:56:15,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-01 12:56:15,561 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2020-07-01 12:56:15,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:56:15,561 INFO L225 Difference]: With dead ends: 30 [2020-07-01 12:56:15,561 INFO L226 Difference]: Without dead ends: 29 [2020-07-01 12:56:15,562 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2020-07-01 12:56:15,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-01 12:56:15,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-01 12:56:15,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-01 12:56:15,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2020-07-01 12:56:15,566 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 16 [2020-07-01 12:56:15,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:56:15,566 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2020-07-01 12:56:15,566 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-01 12:56:15,566 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2020-07-01 12:56:15,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-01 12:56:15,567 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:56:15,567 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:56:15,767 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:56:15,768 INFO L427 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:56:15,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:56:15,768 INFO L82 PathProgramCache]: Analyzing trace with hash -196759229, now seen corresponding path program 1 times [2020-07-01 12:56:15,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:56:15,768 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245119681] [2020-07-01 12:56:15,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:56:15,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:15,803 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 12:56:15,803 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245119681] [2020-07-01 12:56:15,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:56:15,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:56:15,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077463026] [2020-07-01 12:56:15,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:56:15,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:56:15,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:56:15,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:56:15,805 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand 4 states. [2020-07-01 12:56:15,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:56:15,866 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2020-07-01 12:56:15,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:56:15,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-07-01 12:56:15,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:56:15,867 INFO L225 Difference]: With dead ends: 30 [2020-07-01 12:56:15,867 INFO L226 Difference]: Without dead ends: 29 [2020-07-01 12:56:15,867 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:56:15,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-01 12:56:15,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-01 12:56:15,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-01 12:56:15,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2020-07-01 12:56:15,871 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 18 [2020-07-01 12:56:15,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:56:15,871 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2020-07-01 12:56:15,871 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:56:15,871 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2020-07-01 12:56:15,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-01 12:56:15,872 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:56:15,872 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:56:15,872 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-07-01 12:56:15,872 INFO L427 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:56:15,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:56:15,873 INFO L82 PathProgramCache]: Analyzing trace with hash -196759228, now seen corresponding path program 1 times [2020-07-01 12:56:15,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:56:15,873 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609711448] [2020-07-01 12:56:15,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:56:15,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:15,933 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:56:15,934 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609711448] [2020-07-01 12:56:15,934 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036861470] [2020-07-01 12:56:15,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:56:15,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:15,979 INFO L264 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 12:56:15,980 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:56:15,993 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:56:15,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:56:15,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2020-07-01 12:56:15,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312486918] [2020-07-01 12:56:15,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-01 12:56:15,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:56:15,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 12:56:15,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:56:15,995 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 8 states. [2020-07-01 12:56:16,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:56:16,129 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2020-07-01 12:56:16,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 12:56:16,130 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-07-01 12:56:16,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:56:16,131 INFO L225 Difference]: With dead ends: 29 [2020-07-01 12:56:16,131 INFO L226 Difference]: Without dead ends: 28 [2020-07-01 12:56:16,131 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-07-01 12:56:16,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-01 12:56:16,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-01 12:56:16,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-01 12:56:16,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2020-07-01 12:56:16,134 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 18 [2020-07-01 12:56:16,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:56:16,135 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2020-07-01 12:56:16,135 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-01 12:56:16,135 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2020-07-01 12:56:16,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-01 12:56:16,135 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:56:16,136 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:56:16,336 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2020-07-01 12:56:16,336 INFO L427 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:56:16,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:56:16,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1804496922, now seen corresponding path program 1 times [2020-07-01 12:56:16,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:56:16,337 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702518210] [2020-07-01 12:56:16,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:56:16,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:16,385 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 12:56:16,385 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702518210] [2020-07-01 12:56:16,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:56:16,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-01 12:56:16,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683766589] [2020-07-01 12:56:16,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 12:56:16,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:56:16,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 12:56:16,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:56:16,387 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand 6 states. [2020-07-01 12:56:16,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:56:16,491 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2020-07-01 12:56:16,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 12:56:16,491 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-07-01 12:56:16,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:56:16,492 INFO L225 Difference]: With dead ends: 28 [2020-07-01 12:56:16,492 INFO L226 Difference]: Without dead ends: 25 [2020-07-01 12:56:16,492 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-07-01 12:56:16,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-01 12:56:16,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-01 12:56:16,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-01 12:56:16,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2020-07-01 12:56:16,495 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 19 [2020-07-01 12:56:16,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:56:16,495 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2020-07-01 12:56:16,495 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 12:56:16,496 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2020-07-01 12:56:16,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-01 12:56:16,496 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:56:16,496 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:56:16,496 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-07-01 12:56:16,497 INFO L427 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:56:16,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:56:16,497 INFO L82 PathProgramCache]: Analyzing trace with hash 123238305, now seen corresponding path program 2 times [2020-07-01 12:56:16,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:56:16,497 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679420682] [2020-07-01 12:56:16,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:56:16,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:16,786 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:56:16,787 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679420682] [2020-07-01 12:56:16,787 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986226144] [2020-07-01 12:56:16,787 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:56:16,834 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 12:56:16,834 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 12:56:16,836 INFO L264 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 29 conjunts are in the unsatisfiable core [2020-07-01 12:56:16,838 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:56:16,842 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_23|], 1=[|v_#valid_34|]} [2020-07-01 12:56:16,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:56:16,846 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 12:56:16,846 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:56:16,854 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:56:16,858 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-01 12:56:16,859 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:56:16,865 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:56:16,866 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:56:16,866 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2020-07-01 12:56:16,897 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-07-01 12:56:16,897 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:56:16,907 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:56:16,908 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 12:56:16,908 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2020-07-01 12:56:16,946 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2020-07-01 12:56:16,946 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:56:16,958 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:56:16,959 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-07-01 12:56:16,959 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2020-07-01 12:56:17,121 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:56:17,121 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2020-07-01 12:56:17,122 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:56:17,123 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:56:17,137 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:56:17,138 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:56:17,139 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-01 12:56:17,140 INFO L539 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-01 12:56:17,140 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:23 [2020-07-01 12:56:17,180 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:56:17,185 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 12:56:17,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:56:17,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2020-07-01 12:56:17,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886093496] [2020-07-01 12:56:17,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-01 12:56:17,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:56:17,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-01 12:56:17,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2020-07-01 12:56:17,186 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand 17 states. [2020-07-01 12:56:17,726 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 63 [2020-07-01 12:56:18,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:56:18,151 INFO L93 Difference]: Finished difference Result 26 states and 36 transitions. [2020-07-01 12:56:18,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-01 12:56:18,152 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 22 [2020-07-01 12:56:18,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:56:18,152 INFO L225 Difference]: With dead ends: 26 [2020-07-01 12:56:18,152 INFO L226 Difference]: Without dead ends: 25 [2020-07-01 12:56:18,153 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=169, Invalid=533, Unknown=0, NotChecked=0, Total=702 [2020-07-01 12:56:18,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-01 12:56:18,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2020-07-01 12:56:18,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-01 12:56:18,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2020-07-01 12:56:18,156 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 22 [2020-07-01 12:56:18,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:56:18,157 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2020-07-01 12:56:18,157 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-01 12:56:18,157 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2020-07-01 12:56:18,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-01 12:56:18,157 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:56:18,158 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:56:18,358 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:56:18,358 INFO L427 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:56:18,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:56:18,359 INFO L82 PathProgramCache]: Analyzing trace with hash -474578841, now seen corresponding path program 2 times [2020-07-01 12:56:18,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:56:18,359 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776517197] [2020-07-01 12:56:18,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:56:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:18,590 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:56:18,591 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776517197] [2020-07-01 12:56:18,591 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230809469] [2020-07-01 12:56:18,591 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:56:18,647 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 12:56:18,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 12:56:18,649 INFO L264 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 62 conjunts are in the unsatisfiable core [2020-07-01 12:56:18,652 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:56:18,666 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:56:18,666 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-07-01 12:56:18,667 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:56:18,684 INFO L619 ElimStorePlain]: treesize reduction 10, result has 67.7 percent of original size [2020-07-01 12:56:18,685 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:56:18,685 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:12 [2020-07-01 12:56:18,707 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2020-07-01 12:56:18,707 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:56:18,712 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:56:18,712 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:56:18,712 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:12 [2020-07-01 12:56:18,718 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-07-01 12:56:18,718 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:56:18,725 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:56:18,725 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 12:56:18,725 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:22 [2020-07-01 12:56:18,939 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:56:18,939 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 52 [2020-07-01 12:56:18,941 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-01 12:56:18,941 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:56:18,942 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-01 12:56:18,943 INFO L477 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-07-01 12:56:18,943 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:56:18,944 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-07-01 12:56:19,000 INFO L619 ElimStorePlain]: treesize reduction 72, result has 47.1 percent of original size [2020-07-01 12:56:19,002 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-01 12:56:19,003 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:56:19,004 INFO L477 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-07-01 12:56:19,005 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-01 12:56:19,006 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2020-07-01 12:56:19,007 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:79 [2020-07-01 12:56:19,059 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:56:19,063 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:56:19,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:56:19,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2020-07-01 12:56:19,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220662607] [2020-07-01 12:56:19,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-01 12:56:19,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:56:19,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-01 12:56:19,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2020-07-01 12:56:19,065 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 19 states. [2020-07-01 12:56:20,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:56:20,022 INFO L93 Difference]: Finished difference Result 32 states and 44 transitions. [2020-07-01 12:56:20,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-01 12:56:20,033 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2020-07-01 12:56:20,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:56:20,034 INFO L225 Difference]: With dead ends: 32 [2020-07-01 12:56:20,034 INFO L226 Difference]: Without dead ends: 31 [2020-07-01 12:56:20,035 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2020-07-01 12:56:20,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-01 12:56:20,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-01 12:56:20,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-01 12:56:20,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2020-07-01 12:56:20,039 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 23 [2020-07-01 12:56:20,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:56:20,039 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2020-07-01 12:56:20,039 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-01 12:56:20,039 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2020-07-01 12:56:20,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-01 12:56:20,040 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:56:20,040 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:56:20,241 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2020-07-01 12:56:20,241 INFO L427 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:56:20,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:56:20,241 INFO L82 PathProgramCache]: Analyzing trace with hash -2138374643, now seen corresponding path program 3 times [2020-07-01 12:56:20,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:56:20,242 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788105606] [2020-07-01 12:56:20,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:56:20,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:20,383 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-07-01 12:56:20,383 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788105606] [2020-07-01 12:56:20,384 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24571552] [2020-07-01 12:56:20,384 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:56:20,449 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-07-01 12:56:20,449 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 12:56:20,451 INFO L264 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 38 conjunts are in the unsatisfiable core [2020-07-01 12:56:20,453 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:56:20,474 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:56:20,475 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-07-01 12:56:20,475 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:56:20,494 INFO L619 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2020-07-01 12:56:20,495 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:56:20,495 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2020-07-01 12:56:20,519 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-07-01 12:56:20,519 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:56:20,526 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:56:20,526 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 12:56:20,527 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2020-07-01 12:56:20,660 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:56:20,660 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 50 [2020-07-01 12:56:20,662 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:56:20,662 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 12:56:20,663 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-01 12:56:20,663 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:56:20,664 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-01 12:56:20,665 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-07-01 12:56:20,713 INFO L619 ElimStorePlain]: treesize reduction 32, result has 63.2 percent of original size [2020-07-01 12:56:20,715 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:56:20,716 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-01 12:56:20,716 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:23 [2020-07-01 12:56:20,751 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:56:20,755 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-07-01 12:56:20,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:56:20,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2020-07-01 12:56:20,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628529471] [2020-07-01 12:56:20,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-01 12:56:20,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:56:20,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-01 12:56:20,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2020-07-01 12:56:20,757 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand 15 states. [2020-07-01 12:56:21,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:56:21,144 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2020-07-01 12:56:21,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-01 12:56:21,145 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 30 [2020-07-01 12:56:21,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:56:21,146 INFO L225 Difference]: With dead ends: 31 [2020-07-01 12:56:21,146 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:56:21,146 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2020-07-01 12:56:21,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:56:21,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:56:21,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:56:21,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:56:21,147 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2020-07-01 12:56:21,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:56:21,147 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:56:21,147 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-01 12:56:21,147 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:56:21,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:56:21,348 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2020-07-01 12:56:21,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:56:21,813 WARN L192 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 79 [2020-07-01 12:56:21,824 INFO L268 CegarLoopResult]: For program point L27(lines 27 29) no Hoare annotation was computed. [2020-07-01 12:56:21,824 INFO L268 CegarLoopResult]: For program point L27-2(lines 24 38) no Hoare annotation was computed. [2020-07-01 12:56:21,825 INFO L268 CegarLoopResult]: For program point L17(line 17) no Hoare annotation was computed. [2020-07-01 12:56:21,825 INFO L268 CegarLoopResult]: For program point L17-2(line 17) no Hoare annotation was computed. [2020-07-01 12:56:21,825 INFO L268 CegarLoopResult]: For program point L15-1(lines 15 20) no Hoare annotation was computed. [2020-07-01 12:56:21,825 INFO L268 CegarLoopResult]: For program point L13(lines 13 14) no Hoare annotation was computed. [2020-07-01 12:56:21,825 INFO L268 CegarLoopResult]: For program point L15-2(lines 15 20) no Hoare annotation was computed. [2020-07-01 12:56:21,825 INFO L264 CegarLoopResult]: At program point L15-4(lines 15 20) the Hoare annotation is: (let ((.cse16 (select |#length| ULTIMATE.start_cstrncmp_~s2.base)) (.cse17 (select |#length| ULTIMATE.start_main_~nondetString1~0.base))) (let ((.cse0 (exists ((ULTIMATE.start_main_~nondetString1~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString1~0.offset 0) (<= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrncmp_~s1.base) (+ ULTIMATE.start_main_~nondetString1~0.offset (select |#length| ULTIMATE.start_cstrncmp_~s1.base) (- 1))))))) (.cse1 (= .cse17 ULTIMATE.start_main_~length1~0)) (.cse2 (<= 1 ULTIMATE.start_main_~length2~0)) (.cse3 (= 1 (select |#valid| ULTIMATE.start_cstrncmp_~s2.base))) (.cse4 (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString1~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset .cse17 (- 1))))) (.cse5 (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))) (.cse6 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base))) (.cse7 (exists ((ULTIMATE.start_main_~nondetString2~0.base Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (not (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrncmp_~s1.base))))) (.cse8 (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)) (.cse9 (= 0 ULTIMATE.start_main_~nondetString2~0.offset)) (.cse10 (= 0 ULTIMATE.start_main_~nondetString1~0.offset)) (.cse12 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base))) (.cse13 (<= (+ ULTIMATE.start_cstrncmp_~s2.offset 1) .cse16)) (.cse14 (<= 1 .cse17)) (.cse11 (select |#length| ULTIMATE.start_cstrncmp_~s1.base)) (.cse15 (= 1 (select |#valid| ULTIMATE.start_cstrncmp_~s1.base)))) (or (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_cstrncmp_~s2.offset) (= 0 ULTIMATE.start_cstrncmp_~s1.offset) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (exists ((ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= 0 ULTIMATE.start_main_~nondetString2~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrncmp_~s2.base) (+ (select |#length| ULTIMATE.start_cstrncmp_~s2.base) ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))) .cse9 .cse10 (<= 1 .cse11) .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 (= 0 (select (select |#memory_int| ULTIMATE.start_cstrncmp_~s2.base) (+ .cse16 (- 1)))) (<= 1 ULTIMATE.start_cstrncmp_~s1.offset) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 (<= 1 ULTIMATE.start_cstrncmp_~s2.offset) .cse13 .cse14 (<= (+ ULTIMATE.start_cstrncmp_~s1.offset 1) .cse11) .cse15)))) [2020-07-01 12:56:21,826 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:56:21,826 INFO L268 CegarLoopResult]: For program point L30-1(lines 30 32) no Hoare annotation was computed. [2020-07-01 12:56:21,826 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:56:21,826 INFO L268 CegarLoopResult]: For program point L18(line 18) no Hoare annotation was computed. [2020-07-01 12:56:21,826 INFO L268 CegarLoopResult]: For program point L18-1(lines 18 19) no Hoare annotation was computed. [2020-07-01 12:56:21,826 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:56:21,826 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:56:21,826 INFO L268 CegarLoopResult]: For program point L16-1(line 16) no Hoare annotation was computed. [2020-07-01 12:56:21,826 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:56:21,827 INFO L268 CegarLoopResult]: For program point L16-2(lines 16 17) no Hoare annotation was computed. [2020-07-01 12:56:21,827 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:56:21,827 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:56:21,827 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:56:21,827 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:56:21,827 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:56:21,827 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 36) no Hoare annotation was computed. [2020-07-01 12:56:21,827 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 35) no Hoare annotation was computed. [2020-07-01 12:56:21,827 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:56:21,828 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 36) no Hoare annotation was computed. [2020-07-01 12:56:21,828 INFO L268 CegarLoopResult]: For program point L35(line 35) no Hoare annotation was computed. [2020-07-01 12:56:21,828 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 35) no Hoare annotation was computed. [2020-07-01 12:56:21,828 INFO L268 CegarLoopResult]: For program point L35-1(line 35) no Hoare annotation was computed. [2020-07-01 12:56:21,830 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:56:21,838 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:56:21,839 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:56:21,840 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:56:21,840 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:56:21,841 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:56:21,841 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:56:21,841 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:56:21,841 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:56:21,842 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:56:21,842 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:56:21,842 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:56:21,843 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:56:21,843 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:56:21,844 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:56:21,844 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:56:21,844 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:56:21,844 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:56:21,848 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:56:21,849 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:21,849 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:21,850 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:56:21,850 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:21,850 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:56:21,850 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:21,851 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:21,851 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:56:21,851 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:21,851 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:21,852 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:21,852 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:21,852 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:56:21,852 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:21,853 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:21,853 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:56:21,853 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:21,853 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:56:21,854 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:21,854 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:56:21,854 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:21,854 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:21,855 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:21,855 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:21,855 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:21,863 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:56:21,864 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:56:21,864 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:56:21,865 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:56:21,865 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:56:21,865 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:56:21,865 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:56:21,866 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:56:21,866 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:56:21,866 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:56:21,867 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:56:21,867 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:56:21,867 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:56:21,868 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:56:21,868 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:56:21,868 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:56:21,868 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:56:21,870 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:56:21,871 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:21,871 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:21,871 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:56:21,872 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:21,872 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:56:21,872 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:21,872 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:21,873 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:56:21,873 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:21,873 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:21,873 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:21,873 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:21,874 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:56:21,874 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:21,874 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:21,874 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:56:21,875 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:21,875 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:56:21,875 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:21,875 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:56:21,876 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:21,876 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:21,876 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:21,876 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:21,876 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:21,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:56:21 BasicIcfg [2020-07-01 12:56:21,880 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:56:21,881 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:56:21,881 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:56:21,884 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:56:21,884 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:56:21,885 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:56:07" (1/5) ... [2020-07-01 12:56:21,885 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d686f8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:56:21, skipping insertion in model container [2020-07-01 12:56:21,885 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:56:21,885 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:56:07" (2/5) ... [2020-07-01 12:56:21,886 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d686f8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:56:21, skipping insertion in model container [2020-07-01 12:56:21,886 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:56:21,886 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:56:08" (3/5) ... [2020-07-01 12:56:21,886 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d686f8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:56:21, skipping insertion in model container [2020-07-01 12:56:21,886 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:56:21,886 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:56:08" (4/5) ... [2020-07-01 12:56:21,887 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d686f8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:56:21, skipping insertion in model container [2020-07-01 12:56:21,887 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:56:21,887 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:56:21" (5/5) ... [2020-07-01 12:56:21,888 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:56:21,908 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:56:21,908 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:56:21,908 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:56:21,908 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:56:21,909 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:56:21,909 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:56:21,909 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:56:21,909 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:56:21,912 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2020-07-01 12:56:21,916 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-01 12:56:21,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:56:21,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:56:21,921 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:56:21,921 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:56:21,921 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:56:21,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2020-07-01 12:56:21,922 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-01 12:56:21,923 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:56:21,923 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:56:21,923 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:56:21,923 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:56:21,928 INFO L794 eck$LassoCheckResult]: Stem: 26#ULTIMATE.startENTRYtrue [182] ULTIMATE.startENTRY-->L27: Formula: (and (= 0 |v_#NULL.base_2|) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_4|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_5|, ULTIMATE.start_main_#t~ret14=|v_ULTIMATE.start_main_#t~ret14_4|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_#t~malloc12.base, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~ret14, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0] 5#L27true [79] L27-->L27-2: Formula: (and (= v_ULTIMATE.start_main_~length1~0_4 1) (< v_ULTIMATE.start_main_~length1~0_5 1)) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_5} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length1~0] 18#L27-2true [91] L27-2-->L30-1: Formula: (and (< v_ULTIMATE.start_main_~length2~0_5 1) (= v_ULTIMATE.start_main_~length2~0_4 1)) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_5} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length2~0] 24#L30-1true [143] L30-1-->L35: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc11.base_4| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_4|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc12.offset_4|) (= 0 |v_ULTIMATE.start_main_#t~malloc11.offset_4|) (> 0 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc12.base_4|) (= |v_#valid_6| (store .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4| 1)) (< 0 |v_ULTIMATE.start_main_#t~malloc11.base_4|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc11.base_4|) (= 0 (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc11.base_4|)) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4|) 0) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (= 0 |v_ULTIMATE.start_main_#t~malloc12.offset_4|) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc11.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc12.base_4| v_ULTIMATE.start_main_~length2~0_7) |v_#length_1|) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_4|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_4|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_4|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_4|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_4|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_6|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_#t~malloc12.base, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset] 31#L35true [116] L35-->L35-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (<= 1 .cse0) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 28#L35-1true [183] L35-1-->L13: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (= v_ULTIMATE.start_cstrncmp_~n_7 |v_ULTIMATE.start_cstrncmp_#in~n_2|) (<= 1 .cse0) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2| v_ULTIMATE.start_main_~nondetString2~0.offset_7) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|) (= v_ULTIMATE.start_cstrncmp_~s2.offset_7 |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrncmp_~s1.base_11 |v_ULTIMATE.start_cstrncmp_#in~s1.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= v_ULTIMATE.start_cstrncmp_~s1.offset_9 |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|) (= 1 (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_cstrncmp_~s2.base_7 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_main_#t~nondet13_5| |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= |v_#memory_int_10| (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0))))) InVars {ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_5|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_8|, ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_7|, ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_5|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_7, ULTIMATE.start_cstrncmp_#res=|v_ULTIMATE.start_cstrncmp_#res_6|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_7|, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_7|, ULTIMATE.start_cstrncmp_#t~mem5=|v_ULTIMATE.start_cstrncmp_#t~mem5_5|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_5|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_11, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_8|, ULTIMATE.start_cstrncmp_#in~s2.offset=|v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrncmp_#t~pre4.offset=|v_ULTIMATE.start_cstrncmp_#t~pre4.offset_6|, #length=|v_#length_18|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_9, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrncmp_#in~n=|v_ULTIMATE.start_cstrncmp_#in~n_2|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_7|, ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_7|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrncmp_#in~s1.offset=|v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_7, ULTIMATE.start_cstrncmp_#in~s2.base=|v_ULTIMATE.start_cstrncmp_#in~s2.base_2|, ULTIMATE.start_cstrncmp_#in~s1.base=|v_ULTIMATE.start_cstrncmp_#in~s1.base_2|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrncmp_#t~pre4.base=|v_ULTIMATE.start_cstrncmp_#t~pre4.base_7|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post1.base, ULTIMATE.start_cstrncmp_#t~mem8, ULTIMATE.start_cstrncmp_#t~mem6, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#res, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~mem5, ULTIMATE.start_cstrncmp_#in~n, ULTIMATE.start_cstrncmp_#t~post1.offset, ULTIMATE.start_cstrncmp_#t~pre0, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#in~s1.offset, ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#in~s2.offset, ULTIMATE.start_cstrncmp_#in~s2.base, ULTIMATE.start_cstrncmp_#in~s1.base, ULTIMATE.start_cstrncmp_#t~pre4.offset, #memory_int, ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~pre4.base, ULTIMATE.start_cstrncmp_#t~post7.offset] 29#L13true [155] L13-->L15-4: Formula: (< 0 v_ULTIMATE.start_cstrncmp_~n_4) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} OutVars{ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} AuxVars[] AssignedVars[] 27#L15-4true [2020-07-01 12:56:21,929 INFO L796 eck$LassoCheckResult]: Loop: 27#L15-4true [185] L15-4-->L16-1: Formula: (and (= v_ULTIMATE.start_cstrncmp_~s2.offset_9 |v_ULTIMATE.start_cstrncmp_#t~post1.offset_8|) (<= (+ v_ULTIMATE.start_cstrncmp_~s1.offset_10 1) (select |v_#length_19| v_ULTIMATE.start_cstrncmp_~s1.base_12)) (= v_ULTIMATE.start_cstrncmp_~s2.offset_8 (+ |v_ULTIMATE.start_cstrncmp_#t~post1.offset_8| 1)) (= 1 (select |v_#valid_28| v_ULTIMATE.start_cstrncmp_~s1.base_12)) (= |v_ULTIMATE.start_cstrncmp_#t~mem2_8| (select (select |v_#memory_int_12| v_ULTIMATE.start_cstrncmp_~s1.base_12) v_ULTIMATE.start_cstrncmp_~s1.offset_10)) (= v_ULTIMATE.start_cstrncmp_~s2.base_8 |v_ULTIMATE.start_cstrncmp_#t~post1.base_9|) (<= 0 v_ULTIMATE.start_cstrncmp_~s1.offset_10) (= v_ULTIMATE.start_cstrncmp_~s2.base_9 |v_ULTIMATE.start_cstrncmp_#t~post1.base_9|)) InVars {ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_9, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_9, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_12, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_10} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_9|, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_8, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_8, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_8|, #valid=|v_#valid_28|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_8|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_12, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_10} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post1.base, ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~post1.offset] 3#L16-1true [75] L16-1-->L16-2: Formula: (and (<= (+ |v_ULTIMATE.start_cstrncmp_#t~post1.offset_3| 1) (select |v_#length_10| |v_ULTIMATE.start_cstrncmp_#t~post1.base_3|)) (= 1 (select |v_#valid_15| |v_ULTIMATE.start_cstrncmp_#t~post1.base_3|)) (= |v_ULTIMATE.start_cstrncmp_#t~mem3_2| (select (select |v_#memory_int_6| |v_ULTIMATE.start_cstrncmp_#t~post1.base_3|) |v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|)) (<= 0 |v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|)) InVars {ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_3|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_3|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_2|, #valid=|v_#valid_15|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem3] 16#L16-2true [90] L16-2-->L18: Formula: (and (= v_ULTIMATE.start_cstrncmp_~s1.offset_7 (+ |v_ULTIMATE.start_cstrncmp_#t~post7.offset_2| 1)) (= v_ULTIMATE.start_cstrncmp_~s1.base_9 |v_ULTIMATE.start_cstrncmp_#t~post7.base_2|) (= |v_ULTIMATE.start_cstrncmp_#t~mem3_6| |v_ULTIMATE.start_cstrncmp_#t~mem2_6|) (= |v_ULTIMATE.start_cstrncmp_#t~post7.offset_2| v_ULTIMATE.start_cstrncmp_~s1.offset_8) (= |v_ULTIMATE.start_cstrncmp_#t~post7.base_2| v_ULTIMATE.start_cstrncmp_~s1.base_10)) InVars {ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_10, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_6|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_8} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_7|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_2|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_5|, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_5|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_9, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_7, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post1.base, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~post1.offset, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~post7.offset] 9#L18true [83] L18-->L18-1: Formula: (and (= 1 (select |v_#valid_21| |v_ULTIMATE.start_cstrncmp_#t~post7.base_3|)) (<= (+ |v_ULTIMATE.start_cstrncmp_#t~post7.offset_3| 1) (select |v_#length_16| |v_ULTIMATE.start_cstrncmp_#t~post7.base_3|)) (= (select (select |v_#memory_int_9| |v_ULTIMATE.start_cstrncmp_#t~post7.base_3|) |v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|) |v_ULTIMATE.start_cstrncmp_#t~mem8_2|) (<= 0 |v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|)) InVars {#memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_3|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_2|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_3|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem8] 7#L18-1true [174] L18-1-->L15-1: Formula: (< 0 |v_ULTIMATE.start_cstrncmp_#t~mem8_6|) InVars {ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_6|} OutVars{ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_5|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_7|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem8, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#t~post7.offset] 32#L15-1true [119] L15-1-->L15-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstrncmp_~n_6 (- 1)))) (and (= |v_ULTIMATE.start_cstrncmp_#t~pre0_4| .cse0) (= v_ULTIMATE.start_cstrncmp_~n_5 .cse0))) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_6} OutVars{ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_4|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~pre0, ULTIMATE.start_cstrncmp_~n] 30#L15-2true [180] L15-2-->L15-4: Formula: (> 0 |v_ULTIMATE.start_cstrncmp_#t~pre0_2|) InVars {ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_2|} OutVars{ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_1|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~pre0] 27#L15-4true [2020-07-01 12:56:21,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:56:21,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1885123510, now seen corresponding path program 1 times [2020-07-01 12:56:21,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:56:21,930 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632594457] [2020-07-01 12:56:21,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:56:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:21,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:56:21,948 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632594457] [2020-07-01 12:56:21,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:56:21,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:56:21,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496459195] [2020-07-01 12:56:21,949 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:56:21,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:56:21,949 INFO L82 PathProgramCache]: Analyzing trace with hash 660213727, now seen corresponding path program 1 times [2020-07-01 12:56:21,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:56:21,949 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947825786] [2020-07-01 12:56:21,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:56:21,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:56:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:56:21,975 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:56:22,092 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2020-07-01 12:56:22,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:56:22,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:56:22,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:56:22,126 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. [2020-07-01 12:56:22,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:56:22,169 INFO L93 Difference]: Finished difference Result 30 states and 50 transitions. [2020-07-01 12:56:22,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:56:22,172 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 12:56:22,175 INFO L168 Benchmark]: Toolchain (without parser) took 14553.67 ms. Allocated memory was 514.9 MB in the beginning and 728.2 MB in the end (delta: 213.4 MB). Free memory was 436.1 MB in the beginning and 618.6 MB in the end (delta: -182.6 MB). Peak memory consumption was 30.8 MB. Max. memory is 50.3 GB. [2020-07-01 12:56:22,175 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 455.7 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:56:22,176 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.52 ms. Allocated memory was 514.9 MB in the beginning and 555.2 MB in the end (delta: 40.4 MB). Free memory was 435.4 MB in the beginning and 523.0 MB in the end (delta: -87.6 MB). Peak memory consumption was 28.5 MB. Max. memory is 50.3 GB. [2020-07-01 12:56:22,176 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.24 ms. Allocated memory is still 555.2 MB. Free memory was 523.0 MB in the beginning and 521.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 50.3 GB. [2020-07-01 12:56:22,176 INFO L168 Benchmark]: Boogie Preprocessor took 28.95 ms. Allocated memory is still 555.2 MB. Free memory was 521.4 MB in the beginning and 519.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 50.3 GB. [2020-07-01 12:56:22,177 INFO L168 Benchmark]: RCFGBuilder took 357.62 ms. Allocated memory is still 555.2 MB. Free memory was 519.6 MB in the beginning and 496.6 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 50.3 GB. [2020-07-01 12:56:22,177 INFO L168 Benchmark]: BlockEncodingV2 took 129.82 ms. Allocated memory is still 555.2 MB. Free memory was 496.6 MB in the beginning and 486.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 50.3 GB. [2020-07-01 12:56:22,177 INFO L168 Benchmark]: TraceAbstraction took 13376.33 ms. Allocated memory was 555.2 MB in the beginning and 728.2 MB in the end (delta: 173.0 MB). Free memory was 485.8 MB in the beginning and 673.3 MB in the end (delta: -187.5 MB). Peak memory consumption was 248.8 MB. Max. memory is 50.3 GB. [2020-07-01 12:56:22,178 INFO L168 Benchmark]: BuchiAutomizer took 293.31 ms. Allocated memory is still 728.2 MB. Free memory was 673.3 MB in the beginning and 618.6 MB in the end (delta: 54.7 MB). Peak memory consumption was 54.7 MB. Max. memory is 50.3 GB. [2020-07-01 12:56:22,180 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 40 locations, 46 edges - StatisticsResult: Encoded RCFG 30 locations, 53 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 455.7 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 318.52 ms. Allocated memory was 514.9 MB in the beginning and 555.2 MB in the end (delta: 40.4 MB). Free memory was 435.4 MB in the beginning and 523.0 MB in the end (delta: -87.6 MB). Peak memory consumption was 28.5 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 43.24 ms. Allocated memory is still 555.2 MB. Free memory was 523.0 MB in the beginning and 521.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 28.95 ms. Allocated memory is still 555.2 MB. Free memory was 521.4 MB in the beginning and 519.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 50.3 GB. * RCFGBuilder took 357.62 ms. Allocated memory is still 555.2 MB. Free memory was 519.6 MB in the beginning and 496.6 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 129.82 ms. Allocated memory is still 555.2 MB. Free memory was 496.6 MB in the beginning and 486.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 50.3 GB. * TraceAbstraction took 13376.33 ms. Allocated memory was 555.2 MB in the beginning and 728.2 MB in the end (delta: 173.0 MB). Free memory was 485.8 MB in the beginning and 673.3 MB in the end (delta: -187.5 MB). Peak memory consumption was 248.8 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 293.31 ms. Allocated memory is still 728.2 MB. Free memory was 673.3 MB in the beginning and 618.6 MB in the end (delta: 54.7 MB). Peak memory consumption was 54.7 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 35]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 35]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 36]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 36]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant [2020-07-01 12:56:22,189 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:56:22,190 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:56:22,190 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:56:22,191 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:56:22,191 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:56:22,191 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:56:22,191 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:56:22,191 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:56:22,192 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:56:22,192 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:56:22,192 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:56:22,192 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:56:22,193 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:56:22,193 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:56:22,193 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:56:22,193 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:56:22,194 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:56:22,195 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:56:22,195 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:22,196 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:22,196 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:56:22,196 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:22,196 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:56:22,197 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:22,197 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:22,197 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:56:22,197 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:22,197 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:22,198 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:22,198 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:22,198 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:56:22,198 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:22,198 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:22,199 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:56:22,199 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:22,199 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:56:22,199 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:22,200 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:56:22,200 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:22,200 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:22,200 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:22,200 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:22,200 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:22,201 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:56:22,202 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:56:22,202 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:56:22,202 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:56:22,203 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:56:22,203 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:56:22,203 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:56:22,203 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:56:22,203 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:56:22,204 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:56:22,204 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:56:22,204 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:56:22,204 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:56:22,205 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:56:22,205 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:56:22,205 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:56:22,205 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:56:22,207 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:56:22,207 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:22,207 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:22,207 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:56:22,208 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:22,208 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:56:22,208 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:22,208 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:22,209 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:56:22,209 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:22,209 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:22,209 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:22,209 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:22,209 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:56:22,210 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:22,210 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:22,210 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:56:22,210 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:22,211 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:56:22,211 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:22,211 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:56:22,211 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:22,211 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:22,212 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:22,212 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:22,212 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((((((((((\exists ULTIMATE.start_main_~nondetString1~0.offset : int :: (ULTIMATE.start_main_~nondetString1~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString1~0.offset) && 0 == unknown-#memory_int-unknown[s1][ULTIMATE.start_main_~nondetString1~0.offset + unknown-#length-unknown[s1] + -1]) && unknown-#length-unknown[nondetString1] == length1) && 1 <= length2) && 0 == s2) && 0 == s1) && 1 == \valid[s2]) && 0 == unknown-#memory_int-unknown[nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1]) && !(nondetString1 == nondetString2)) && 1 == \valid[nondetString2]) && (\exists ULTIMATE.start_main_~nondetString2~0.base : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: 0 == unknown-#memory_int-unknown[ULTIMATE.start_main_~nondetString2~0.base][unknown-#length-unknown[ULTIMATE.start_main_~nondetString2~0.base] + ULTIMATE.start_main_~nondetString2~0.offset + -1] && !(ULTIMATE.start_main_~nondetString2~0.base == s1))) && unknown-#length-unknown[nondetString2] == length2) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (0 <= ULTIMATE.start_main_~nondetString2~0.offset && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + ULTIMATE.start_main_~nondetString2~0.offset + -1]) && ULTIMATE.start_main_~nondetString2~0.offset <= 0)) && 0 == nondetString2) && 0 == nondetString1) && 1 <= unknown-#length-unknown[s1]) && 1 == \valid[nondetString1]) && s2 + 1 <= unknown-#length-unknown[s2]) && 1 <= unknown-#length-unknown[nondetString1]) && 1 == \valid[s1]) || (((((((((((((((((((\exists ULTIMATE.start_main_~nondetString1~0.offset : int :: (ULTIMATE.start_main_~nondetString1~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString1~0.offset) && 0 == unknown-#memory_int-unknown[s1][ULTIMATE.start_main_~nondetString1~0.offset + unknown-#length-unknown[s1] + -1]) && unknown-#length-unknown[nondetString1] == length1) && 1 <= length2) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1]) && 1 <= s1) && 1 == \valid[s2]) && 0 == unknown-#memory_int-unknown[nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1]) && !(nondetString1 == nondetString2)) && 1 == \valid[nondetString2]) && (\exists ULTIMATE.start_main_~nondetString2~0.base : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: 0 == unknown-#memory_int-unknown[ULTIMATE.start_main_~nondetString2~0.base][unknown-#length-unknown[ULTIMATE.start_main_~nondetString2~0.base] + ULTIMATE.start_main_~nondetString2~0.offset + -1] && !(ULTIMATE.start_main_~nondetString2~0.base == s1))) && unknown-#length-unknown[nondetString2] == length2) && 0 == nondetString2) && 0 == nondetString1) && 1 == \valid[nondetString1]) && 1 <= s2) && s2 + 1 <= unknown-#length-unknown[s2]) && 1 <= unknown-#length-unknown[nondetString1]) && s1 + 1 <= unknown-#length-unknown[s1]) && 1 == \valid[s1]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 14 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 12.7s, OverallIterations: 26, TraceHistogramMax: 4, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 151 SDtfs, 1561 SDslu, 1267 SDs, 0 SdLazy, 2823 SolverSat, 309 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 365 GetRequests, 150 SyntacticMatches, 1 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 26 MinimizatonAttempts, 25 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 3 NumberOfFragments, 268 HoareAnnotationTreeSize, 1 FomulaSimplifications, 426 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 140 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 481 NumberOfCodeBlocks, 481 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 447 ConstructedInterpolants, 37 QuantifiedInterpolants, 79546 SizeOfPredicates, 86 NumberOfNonLiveVariables, 1102 ConjunctsInSsa, 206 ConjunctsInUnsatCore, 34 InterpolantComputations, 19 PerfectInterpolantSequences, 40/121 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 12:56:04.341 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp/BenchExec_run_Aue2Ep/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:56:22.438 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check