./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_12.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 906a4fb5 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/locks/test_locks_12.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fbb7e06bf350f46f725ea0ddc5d1215829061b3a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.25-906a4fb [2020-10-19 18:54:08,480 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-19 18:54:08,482 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-19 18:54:08,506 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-19 18:54:08,507 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-19 18:54:08,508 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-19 18:54:08,509 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-19 18:54:08,511 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-19 18:54:08,513 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-19 18:54:08,514 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-19 18:54:08,515 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-19 18:54:08,516 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-19 18:54:08,517 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-19 18:54:08,518 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-19 18:54:08,519 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-19 18:54:08,520 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-19 18:54:08,521 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-19 18:54:08,522 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-19 18:54:08,523 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-19 18:54:08,525 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-19 18:54:08,527 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-19 18:54:08,528 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-19 18:54:08,529 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-19 18:54:08,530 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-19 18:54:08,532 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-19 18:54:08,533 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-19 18:54:08,533 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-19 18:54:08,534 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-19 18:54:08,534 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-19 18:54:08,535 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-19 18:54:08,536 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-19 18:54:08,537 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-19 18:54:08,537 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-19 18:54:08,538 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-19 18:54:08,539 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-19 18:54:08,539 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-19 18:54:08,540 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-19 18:54:08,540 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-19 18:54:08,541 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-19 18:54:08,542 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-19 18:54:08,542 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-19 18:54:08,543 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-19 18:54:08,569 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-19 18:54:08,569 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-19 18:54:08,570 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-19 18:54:08,571 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-19 18:54:08,571 INFO L138 SettingsManager]: * Use SBE=true [2020-10-19 18:54:08,571 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-19 18:54:08,571 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-19 18:54:08,572 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-19 18:54:08,572 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-19 18:54:08,572 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-19 18:54:08,573 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-19 18:54:08,573 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-19 18:54:08,573 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-19 18:54:08,573 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-19 18:54:08,574 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-19 18:54:08,574 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-19 18:54:08,576 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-19 18:54:08,576 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-19 18:54:08,576 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-19 18:54:08,577 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-19 18:54:08,577 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-19 18:54:08,577 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-19 18:54:08,578 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-19 18:54:08,578 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-19 18:54:08,579 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-19 18:54:08,579 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-19 18:54:08,580 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-19 18:54:08,580 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-19 18:54:08,582 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-19 18:54:08,582 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-19 18:54:08,583 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-19 18:54:08,583 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-19 18:54:08,584 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-19 18:54:08,585 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fbb7e06bf350f46f725ea0ddc5d1215829061b3a [2020-10-19 18:54:08,919 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-19 18:54:08,931 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-19 18:54:08,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-19 18:54:08,936 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-19 18:54:08,937 INFO L275 PluginConnector]: CDTParser initialized [2020-10-19 18:54:08,937 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_12.c [2020-10-19 18:54:08,995 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/031a7600f/979769f94f7449d9bc08f846ca76b2cc/FLAGe1765c061 [2020-10-19 18:54:09,435 INFO L306 CDTParser]: Found 1 translation units. [2020-10-19 18:54:09,436 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_12.c [2020-10-19 18:54:09,446 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/031a7600f/979769f94f7449d9bc08f846ca76b2cc/FLAGe1765c061 [2020-10-19 18:54:09,822 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/031a7600f/979769f94f7449d9bc08f846ca76b2cc [2020-10-19 18:54:09,825 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-19 18:54:09,832 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-19 18:54:09,833 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-19 18:54:09,833 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-19 18:54:09,837 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-19 18:54:09,837 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 06:54:09" (1/1) ... [2020-10-19 18:54:09,840 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@769d862d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:54:09, skipping insertion in model container [2020-10-19 18:54:09,840 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 06:54:09" (1/1) ... [2020-10-19 18:54:09,848 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-19 18:54:09,871 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-19 18:54:10,053 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 18:54:10,064 INFO L203 MainTranslator]: Completed pre-run [2020-10-19 18:54:10,153 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 18:54:10,169 INFO L208 MainTranslator]: Completed translation [2020-10-19 18:54:10,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:54:10 WrapperNode [2020-10-19 18:54:10,170 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-19 18:54:10,171 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-19 18:54:10,171 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-19 18:54:10,171 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-19 18:54:10,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:54:10" (1/1) ... [2020-10-19 18:54:10,188 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:54:10" (1/1) ... [2020-10-19 18:54:10,215 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-19 18:54:10,215 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-19 18:54:10,215 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-19 18:54:10,215 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-19 18:54:10,223 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:54:10" (1/1) ... [2020-10-19 18:54:10,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:54:10" (1/1) ... [2020-10-19 18:54:10,225 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:54:10" (1/1) ... [2020-10-19 18:54:10,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:54:10" (1/1) ... [2020-10-19 18:54:10,230 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:54:10" (1/1) ... [2020-10-19 18:54:10,235 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:54:10" (1/1) ... [2020-10-19 18:54:10,237 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:54:10" (1/1) ... [2020-10-19 18:54:10,239 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-19 18:54:10,240 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-19 18:54:10,240 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-19 18:54:10,240 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-19 18:54:10,241 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:54:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:54:10,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-19 18:54:10,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-19 18:54:10,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-19 18:54:10,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-19 18:54:10,618 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-19 18:54:10,619 INFO L298 CfgBuilder]: Removed 7 assume(true) statements. [2020-10-19 18:54:10,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:54:10 BoogieIcfgContainer [2020-10-19 18:54:10,622 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-19 18:54:10,623 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-19 18:54:10,624 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-19 18:54:10,629 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-19 18:54:10,630 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:54:10,631 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.10 06:54:09" (1/3) ... [2020-10-19 18:54:10,632 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69b71147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 06:54:10, skipping insertion in model container [2020-10-19 18:54:10,633 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:54:10,633 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:54:10" (2/3) ... [2020-10-19 18:54:10,634 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69b71147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 06:54:10, skipping insertion in model container [2020-10-19 18:54:10,634 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:54:10,634 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:54:10" (3/3) ... [2020-10-19 18:54:10,637 INFO L373 chiAutomizerObserver]: Analyzing ICFG test_locks_12.c [2020-10-19 18:54:10,688 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-19 18:54:10,688 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-19 18:54:10,689 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-19 18:54:10,689 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-19 18:54:10,689 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-19 18:54:10,689 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-19 18:54:10,690 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-19 18:54:10,690 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-19 18:54:10,708 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states. [2020-10-19 18:54:10,734 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2020-10-19 18:54:10,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:54:10,735 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:54:10,743 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:54:10,743 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:54:10,744 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-19 18:54:10,744 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states. [2020-10-19 18:54:10,748 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2020-10-19 18:54:10,749 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:54:10,749 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:54:10,750 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:54:10,750 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:54:10,759 INFO L794 eck$LassoCheckResult]: Stem: 40#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 11#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;havoc main_~cond~0; 43#L183-1true [2020-10-19 18:54:10,760 INFO L796 eck$LassoCheckResult]: Loop: 43#L183-1true assume !false;main_~cond~0 := main_#t~nondet19;havoc main_#t~nondet19; 5#L49true assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0; 24#L78true assume 0 != main_~p1~0;main_~lk1~0 := 1; 16#L78-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 6#L82-1true assume !(0 != main_~p3~0); 39#L86-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 48#L90-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 33#L94-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 14#L98-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 3#L102-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 10#L106-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 45#L110-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 30#L114-1true assume !(0 != main_~p11~0); 12#L118-1true assume 0 != main_~p12~0;main_~lk12~0 := 1; 25#L122-1true assume !(0 != main_~p1~0); 37#L128-1true assume !(0 != main_~p2~0); 26#L133-1true assume !(0 != main_~p3~0); 35#L138-1true assume !(0 != main_~p4~0); 46#L143-1true assume !(0 != main_~p5~0); 8#L148-1true assume !(0 != main_~p6~0); 20#L153-1true assume !(0 != main_~p7~0); 34#L158-1true assume !(0 != main_~p8~0); 44#L163-1true assume !(0 != main_~p9~0); 7#L168-1true assume !(0 != main_~p10~0); 17#L173-1true assume !(0 != main_~p11~0); 31#L178-1true assume !(0 != main_~p12~0); 43#L183-1true [2020-10-19 18:54:10,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:10,767 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-19 18:54:10,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:10,778 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256989039] [2020-10-19 18:54:10,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:10,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:10,885 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:10,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:10,907 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:10,931 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:54:10,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:10,932 INFO L82 PathProgramCache]: Analyzing trace with hash -819199544, now seen corresponding path program 1 times [2020-10-19 18:54:10,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:10,933 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616987587] [2020-10-19 18:54:10,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:10,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:54:11,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:54:11,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616987587] [2020-10-19 18:54:11,030 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:54:11,030 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 18:54:11,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249400969] [2020-10-19 18:54:11,037 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 18:54:11,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:54:11,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 18:54:11,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 18:54:11,057 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2020-10-19 18:54:11,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:54:11,100 INFO L93 Difference]: Finished difference Result 87 states and 154 transitions. [2020-10-19 18:54:11,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 18:54:11,103 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 154 transitions. [2020-10-19 18:54:11,110 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 75 [2020-10-19 18:54:11,117 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 77 states and 123 transitions. [2020-10-19 18:54:11,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2020-10-19 18:54:11,125 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 77 [2020-10-19 18:54:11,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 123 transitions. [2020-10-19 18:54:11,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:54:11,130 INFO L691 BuchiCegarLoop]: Abstraction has 77 states and 123 transitions. [2020-10-19 18:54:11,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 123 transitions. [2020-10-19 18:54:11,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2020-10-19 18:54:11,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-10-19 18:54:11,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 123 transitions. [2020-10-19 18:54:11,200 INFO L714 BuchiCegarLoop]: Abstraction has 77 states and 123 transitions. [2020-10-19 18:54:11,200 INFO L594 BuchiCegarLoop]: Abstraction has 77 states and 123 transitions. [2020-10-19 18:54:11,200 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-19 18:54:11,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 123 transitions. [2020-10-19 18:54:11,210 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 75 [2020-10-19 18:54:11,213 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:54:11,214 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:54:11,215 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:54:11,215 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:54:11,216 INFO L794 eck$LassoCheckResult]: Stem: 184#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 159#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;havoc main_~cond~0; 160#L183-1 [2020-10-19 18:54:11,217 INFO L796 eck$LassoCheckResult]: Loop: 160#L183-1 assume !false;main_~cond~0 := main_#t~nondet19;havoc main_#t~nondet19; 185#L49 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0; 198#L78 assume !(0 != main_~p1~0); 197#L78-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 196#L82-1 assume !(0 != main_~p3~0); 182#L86-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 183#L90-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 179#L94-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 164#L98-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 142#L102-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 143#L106-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 158#L110-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 190#L114-1 assume !(0 != main_~p11~0); 189#L118-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 188#L122-1 assume !(0 != main_~p1~0); 181#L128-1 assume !(0 != main_~p2~0); 172#L133-1 assume !(0 != main_~p3~0); 174#L138-1 assume !(0 != main_~p4~0); 145#L143-1 assume !(0 != main_~p5~0); 155#L148-1 assume !(0 != main_~p6~0); 157#L153-1 assume !(0 != main_~p7~0); 208#L158-1 assume !(0 != main_~p8~0); 186#L163-1 assume !(0 != main_~p9~0); 150#L168-1 assume !(0 != main_~p10~0); 151#L173-1 assume !(0 != main_~p11~0); 154#L178-1 assume !(0 != main_~p12~0); 160#L183-1 [2020-10-19 18:54:11,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:11,218 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-10-19 18:54:11,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:11,218 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599874616] [2020-10-19 18:54:11,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:11,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:11,253 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:11,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:11,280 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:11,291 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:54:11,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:11,294 INFO L82 PathProgramCache]: Analyzing trace with hash -953213050, now seen corresponding path program 1 times [2020-10-19 18:54:11,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:11,295 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906400570] [2020-10-19 18:54:11,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:11,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:54:11,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:54:11,361 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906400570] [2020-10-19 18:54:11,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:54:11,362 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 18:54:11,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955133317] [2020-10-19 18:54:11,364 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 18:54:11,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:54:11,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 18:54:11,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 18:54:11,367 INFO L87 Difference]: Start difference. First operand 77 states and 123 transitions. cyclomatic complexity: 48 Second operand 3 states. [2020-10-19 18:54:11,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:54:11,412 INFO L93 Difference]: Finished difference Result 150 states and 238 transitions. [2020-10-19 18:54:11,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 18:54:11,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 238 transitions. [2020-10-19 18:54:11,422 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 148 [2020-10-19 18:54:11,426 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 150 states and 238 transitions. [2020-10-19 18:54:11,428 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 150 [2020-10-19 18:54:11,429 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 150 [2020-10-19 18:54:11,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 238 transitions. [2020-10-19 18:54:11,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:54:11,432 INFO L691 BuchiCegarLoop]: Abstraction has 150 states and 238 transitions. [2020-10-19 18:54:11,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 238 transitions. [2020-10-19 18:54:11,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2020-10-19 18:54:11,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-10-19 18:54:11,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 238 transitions. [2020-10-19 18:54:11,456 INFO L714 BuchiCegarLoop]: Abstraction has 150 states and 238 transitions. [2020-10-19 18:54:11,456 INFO L594 BuchiCegarLoop]: Abstraction has 150 states and 238 transitions. [2020-10-19 18:54:11,457 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-19 18:54:11,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 150 states and 238 transitions. [2020-10-19 18:54:11,466 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 148 [2020-10-19 18:54:11,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:54:11,466 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:54:11,467 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:54:11,469 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:54:11,469 INFO L794 eck$LassoCheckResult]: Stem: 417#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 392#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;havoc main_~cond~0; 393#L183-1 [2020-10-19 18:54:11,469 INFO L796 eck$LassoCheckResult]: Loop: 393#L183-1 assume !false;main_~cond~0 := main_#t~nondet19;havoc main_#t~nondet19; 441#L49 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0; 439#L78 assume !(0 != main_~p1~0); 437#L78-2 assume !(0 != main_~p2~0); 438#L82-1 assume !(0 != main_~p3~0); 415#L86-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 416#L90-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 468#L94-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 467#L98-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 466#L102-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 465#L106-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 427#L110-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 428#L114-1 assume !(0 != main_~p11~0); 423#L118-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 424#L122-1 assume !(0 != main_~p1~0); 462#L128-1 assume !(0 != main_~p2~0); 461#L133-1 assume !(0 != main_~p3~0); 459#L138-1 assume !(0 != main_~p4~0); 457#L143-1 assume !(0 != main_~p5~0); 455#L148-1 assume !(0 != main_~p6~0); 453#L153-1 assume !(0 != main_~p7~0); 451#L158-1 assume !(0 != main_~p8~0); 449#L163-1 assume !(0 != main_~p9~0); 447#L168-1 assume !(0 != main_~p10~0); 444#L173-1 assume !(0 != main_~p11~0); 443#L178-1 assume !(0 != main_~p12~0); 393#L183-1 [2020-10-19 18:54:11,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:11,470 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2020-10-19 18:54:11,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:11,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828910084] [2020-10-19 18:54:11,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:11,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:11,493 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:11,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:11,503 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:11,509 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:54:11,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:11,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1536315912, now seen corresponding path program 1 times [2020-10-19 18:54:11,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:11,510 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707057449] [2020-10-19 18:54:11,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:54:11,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:54:11,541 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707057449] [2020-10-19 18:54:11,541 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:54:11,541 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 18:54:11,542 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163614808] [2020-10-19 18:54:11,542 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 18:54:11,543 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:54:11,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 18:54:11,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 18:54:11,543 INFO L87 Difference]: Start difference. First operand 150 states and 238 transitions. cyclomatic complexity: 92 Second operand 3 states. [2020-10-19 18:54:11,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:54:11,565 INFO L93 Difference]: Finished difference Result 294 states and 462 transitions. [2020-10-19 18:54:11,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 18:54:11,566 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 294 states and 462 transitions. [2020-10-19 18:54:11,569 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 292 [2020-10-19 18:54:11,573 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 294 states to 294 states and 462 transitions. [2020-10-19 18:54:11,573 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 294 [2020-10-19 18:54:11,574 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 294 [2020-10-19 18:54:11,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 294 states and 462 transitions. [2020-10-19 18:54:11,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:54:11,576 INFO L691 BuchiCegarLoop]: Abstraction has 294 states and 462 transitions. [2020-10-19 18:54:11,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states and 462 transitions. [2020-10-19 18:54:11,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2020-10-19 18:54:11,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2020-10-19 18:54:11,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 462 transitions. [2020-10-19 18:54:11,597 INFO L714 BuchiCegarLoop]: Abstraction has 294 states and 462 transitions. [2020-10-19 18:54:11,597 INFO L594 BuchiCegarLoop]: Abstraction has 294 states and 462 transitions. [2020-10-19 18:54:11,597 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-19 18:54:11,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 294 states and 462 transitions. [2020-10-19 18:54:11,600 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 292 [2020-10-19 18:54:11,600 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:54:11,600 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:54:11,601 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:54:11,601 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:54:11,602 INFO L794 eck$LassoCheckResult]: Stem: 873#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 842#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;havoc main_~cond~0; 843#L183-1 [2020-10-19 18:54:11,602 INFO L796 eck$LassoCheckResult]: Loop: 843#L183-1 assume !false;main_~cond~0 := main_#t~nondet19;havoc main_#t~nondet19; 1074#L49 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0; 1073#L78 assume !(0 != main_~p1~0); 1072#L78-2 assume !(0 != main_~p2~0); 1071#L82-1 assume !(0 != main_~p3~0); 1069#L86-1 assume !(0 != main_~p4~0); 1068#L90-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 1067#L94-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1066#L98-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1065#L102-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1064#L106-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1063#L110-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1018#L114-1 assume !(0 != main_~p11~0); 1016#L118-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 1017#L122-1 assume !(0 != main_~p1~0); 1043#L128-1 assume !(0 != main_~p2~0); 1031#L133-1 assume !(0 != main_~p3~0); 1028#L138-1 assume !(0 != main_~p4~0); 876#L143-1 assume !(0 != main_~p5~0); 836#L148-1 assume !(0 != main_~p6~0); 838#L153-1 assume !(0 != main_~p7~0); 852#L158-1 assume !(0 != main_~p8~0); 1082#L163-1 assume !(0 != main_~p9~0); 1080#L168-1 assume !(0 != main_~p10~0); 1077#L173-1 assume !(0 != main_~p11~0); 1076#L178-1 assume !(0 != main_~p12~0); 843#L183-1 [2020-10-19 18:54:11,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:11,603 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2020-10-19 18:54:11,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:11,603 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562250725] [2020-10-19 18:54:11,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:11,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:11,623 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:11,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:11,640 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:11,648 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:54:11,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:11,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1959017738, now seen corresponding path program 1 times [2020-10-19 18:54:11,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:11,652 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932768362] [2020-10-19 18:54:11,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:11,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:54:11,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-10-19 18:54:11,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932768362] [2020-10-19 18:54:11,711 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:54:11,711 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 18:54:11,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874718612] [2020-10-19 18:54:11,712 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 18:54:11,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:54:11,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 18:54:11,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 18:54:11,713 INFO L87 Difference]: Start difference. First operand 294 states and 462 transitions. cyclomatic complexity: 176 Second operand 3 states. [2020-10-19 18:54:11,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:54:11,737 INFO L93 Difference]: Finished difference Result 578 states and 898 transitions. [2020-10-19 18:54:11,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 18:54:11,738 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 578 states and 898 transitions. [2020-10-19 18:54:11,744 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 576 [2020-10-19 18:54:11,750 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 578 states to 578 states and 898 transitions. [2020-10-19 18:54:11,750 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 578 [2020-10-19 18:54:11,751 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 578 [2020-10-19 18:54:11,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 578 states and 898 transitions. [2020-10-19 18:54:11,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:54:11,755 INFO L691 BuchiCegarLoop]: Abstraction has 578 states and 898 transitions. [2020-10-19 18:54:11,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states and 898 transitions. [2020-10-19 18:54:11,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2020-10-19 18:54:11,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2020-10-19 18:54:11,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 898 transitions. [2020-10-19 18:54:11,782 INFO L714 BuchiCegarLoop]: Abstraction has 578 states and 898 transitions. [2020-10-19 18:54:11,782 INFO L594 BuchiCegarLoop]: Abstraction has 578 states and 898 transitions. [2020-10-19 18:54:11,782 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-19 18:54:11,782 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 578 states and 898 transitions. [2020-10-19 18:54:11,787 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 576 [2020-10-19 18:54:11,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:54:11,787 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:54:11,788 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:54:11,788 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:54:11,789 INFO L794 eck$LassoCheckResult]: Stem: 1750#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1721#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;havoc main_~cond~0; 1722#L183-1 [2020-10-19 18:54:11,789 INFO L796 eck$LassoCheckResult]: Loop: 1722#L183-1 assume !false;main_~cond~0 := main_#t~nondet19;havoc main_#t~nondet19; 1795#L49 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0; 1790#L78 assume !(0 != main_~p1~0); 1784#L78-2 assume !(0 != main_~p2~0); 1785#L82-1 assume !(0 != main_~p3~0); 1774#L86-1 assume !(0 != main_~p4~0); 1776#L90-1 assume !(0 != main_~p5~0); 1893#L94-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1891#L98-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1889#L102-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1887#L106-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1885#L110-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1883#L114-1 assume !(0 != main_~p11~0); 1881#L118-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 1878#L122-1 assume !(0 != main_~p1~0); 1873#L128-1 assume !(0 != main_~p2~0); 1872#L133-1 assume !(0 != main_~p3~0); 1869#L138-1 assume !(0 != main_~p4~0); 1867#L143-1 assume !(0 != main_~p5~0); 1866#L148-1 assume !(0 != main_~p6~0); 1863#L153-1 assume !(0 != main_~p7~0); 1859#L158-1 assume !(0 != main_~p8~0); 1852#L163-1 assume !(0 != main_~p9~0); 1846#L168-1 assume !(0 != main_~p10~0); 1839#L173-1 assume !(0 != main_~p11~0); 1808#L178-1 assume !(0 != main_~p12~0); 1722#L183-1 [2020-10-19 18:54:11,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:11,790 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2020-10-19 18:54:11,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:11,790 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526256287] [2020-10-19 18:54:11,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:11,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:11,800 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:11,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:11,807 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:11,812 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:54:11,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:11,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1141369288, now seen corresponding path program 1 times [2020-10-19 18:54:11,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:11,814 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8789366] [2020-10-19 18:54:11,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:11,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:54:11,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:54:11,857 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8789366] [2020-10-19 18:54:11,857 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:54:11,857 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 18:54:11,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165822974] [2020-10-19 18:54:11,861 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 18:54:11,861 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:54:11,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 18:54:11,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 18:54:11,862 INFO L87 Difference]: Start difference. First operand 578 states and 898 transitions. cyclomatic complexity: 336 Second operand 3 states. [2020-10-19 18:54:11,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:54:11,886 INFO L93 Difference]: Finished difference Result 1138 states and 1746 transitions. [2020-10-19 18:54:11,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 18:54:11,887 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1138 states and 1746 transitions. [2020-10-19 18:54:11,901 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1136 [2020-10-19 18:54:11,911 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1138 states to 1138 states and 1746 transitions. [2020-10-19 18:54:11,911 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1138 [2020-10-19 18:54:11,913 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1138 [2020-10-19 18:54:11,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1138 states and 1746 transitions. [2020-10-19 18:54:11,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:54:11,916 INFO L691 BuchiCegarLoop]: Abstraction has 1138 states and 1746 transitions. [2020-10-19 18:54:11,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states and 1746 transitions. [2020-10-19 18:54:11,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1138. [2020-10-19 18:54:11,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1138 states. [2020-10-19 18:54:11,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1746 transitions. [2020-10-19 18:54:11,945 INFO L714 BuchiCegarLoop]: Abstraction has 1138 states and 1746 transitions. [2020-10-19 18:54:11,945 INFO L594 BuchiCegarLoop]: Abstraction has 1138 states and 1746 transitions. [2020-10-19 18:54:11,946 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-19 18:54:11,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1138 states and 1746 transitions. [2020-10-19 18:54:11,953 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1136 [2020-10-19 18:54:11,953 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:54:11,954 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:54:11,954 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:54:11,955 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:54:11,955 INFO L794 eck$LassoCheckResult]: Stem: 3474#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 3442#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;havoc main_~cond~0; 3443#L183-1 [2020-10-19 18:54:11,955 INFO L796 eck$LassoCheckResult]: Loop: 3443#L183-1 assume !false;main_~cond~0 := main_#t~nondet19;havoc main_#t~nondet19; 3540#L49 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0; 3538#L78 assume !(0 != main_~p1~0); 3534#L78-2 assume !(0 != main_~p2~0); 3532#L82-1 assume !(0 != main_~p3~0); 3528#L86-1 assume !(0 != main_~p4~0); 3524#L90-1 assume !(0 != main_~p5~0); 3520#L94-1 assume !(0 != main_~p6~0); 3518#L98-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 3516#L102-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 3514#L106-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 3512#L110-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 3510#L114-1 assume !(0 != main_~p11~0); 3508#L118-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 3505#L122-1 assume !(0 != main_~p1~0); 3506#L128-1 assume !(0 != main_~p2~0); 3580#L133-1 assume !(0 != main_~p3~0); 3575#L138-1 assume !(0 != main_~p4~0); 3571#L143-1 assume !(0 != main_~p5~0); 3567#L148-1 assume !(0 != main_~p6~0); 3564#L153-1 assume !(0 != main_~p7~0); 3560#L158-1 assume !(0 != main_~p8~0); 3556#L163-1 assume !(0 != main_~p9~0); 3552#L168-1 assume !(0 != main_~p10~0); 3547#L173-1 assume !(0 != main_~p11~0); 3544#L178-1 assume !(0 != main_~p12~0); 3443#L183-1 [2020-10-19 18:54:11,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:11,956 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2020-10-19 18:54:11,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:11,957 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502168959] [2020-10-19 18:54:11,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:11,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:11,965 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:11,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:11,972 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:11,977 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:54:11,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:11,978 INFO L82 PathProgramCache]: Analyzing trace with hash -547574454, now seen corresponding path program 1 times [2020-10-19 18:54:11,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:11,978 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564260340] [2020-10-19 18:54:11,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:11,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:54:12,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:54:12,021 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564260340] [2020-10-19 18:54:12,021 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:54:12,022 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 18:54:12,022 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317122140] [2020-10-19 18:54:12,022 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 18:54:12,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:54:12,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 18:54:12,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 18:54:12,024 INFO L87 Difference]: Start difference. First operand 1138 states and 1746 transitions. cyclomatic complexity: 640 Second operand 3 states. [2020-10-19 18:54:12,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:54:12,048 INFO L93 Difference]: Finished difference Result 2242 states and 3394 transitions. [2020-10-19 18:54:12,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 18:54:12,049 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2242 states and 3394 transitions. [2020-10-19 18:54:12,071 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2240 [2020-10-19 18:54:12,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2242 states to 2242 states and 3394 transitions. [2020-10-19 18:54:12,088 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2242 [2020-10-19 18:54:12,090 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2242 [2020-10-19 18:54:12,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2242 states and 3394 transitions. [2020-10-19 18:54:12,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:54:12,095 INFO L691 BuchiCegarLoop]: Abstraction has 2242 states and 3394 transitions. [2020-10-19 18:54:12,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2242 states and 3394 transitions. [2020-10-19 18:54:12,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2242 to 2242. [2020-10-19 18:54:12,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2242 states. [2020-10-19 18:54:12,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 3394 transitions. [2020-10-19 18:54:12,142 INFO L714 BuchiCegarLoop]: Abstraction has 2242 states and 3394 transitions. [2020-10-19 18:54:12,143 INFO L594 BuchiCegarLoop]: Abstraction has 2242 states and 3394 transitions. [2020-10-19 18:54:12,143 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-19 18:54:12,143 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2242 states and 3394 transitions. [2020-10-19 18:54:12,157 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2240 [2020-10-19 18:54:12,157 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:54:12,158 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:54:12,158 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:54:12,159 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:54:12,159 INFO L794 eck$LassoCheckResult]: Stem: 6858#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 6827#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;havoc main_~cond~0; 6828#L183-1 [2020-10-19 18:54:12,159 INFO L796 eck$LassoCheckResult]: Loop: 6828#L183-1 assume !false;main_~cond~0 := main_#t~nondet19;havoc main_#t~nondet19; 6950#L49 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0; 6946#L78 assume !(0 != main_~p1~0); 6939#L78-2 assume !(0 != main_~p2~0); 6934#L82-1 assume !(0 != main_~p3~0); 6927#L86-1 assume !(0 != main_~p4~0); 6919#L90-1 assume !(0 != main_~p5~0); 6911#L94-1 assume !(0 != main_~p6~0); 6904#L98-1 assume !(0 != main_~p7~0); 6905#L102-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 7036#L106-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 7035#L110-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 7034#L114-1 assume !(0 != main_~p11~0); 7033#L118-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 7032#L122-1 assume !(0 != main_~p1~0); 7030#L128-1 assume !(0 != main_~p2~0); 7029#L133-1 assume !(0 != main_~p3~0); 7022#L138-1 assume !(0 != main_~p4~0); 7017#L143-1 assume !(0 != main_~p5~0); 7013#L148-1 assume !(0 != main_~p6~0); 7011#L153-1 assume !(0 != main_~p7~0); 7010#L158-1 assume !(0 != main_~p8~0); 7008#L163-1 assume !(0 != main_~p9~0); 6983#L168-1 assume !(0 != main_~p10~0); 6976#L173-1 assume !(0 != main_~p11~0); 6959#L178-1 assume !(0 != main_~p12~0); 6828#L183-1 [2020-10-19 18:54:12,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:12,160 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2020-10-19 18:54:12,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:12,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690193905] [2020-10-19 18:54:12,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:12,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:12,168 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:12,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:12,175 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:12,179 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:54:12,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:12,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1753248136, now seen corresponding path program 1 times [2020-10-19 18:54:12,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:12,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261431627] [2020-10-19 18:54:12,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:54:12,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:54:12,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261431627] [2020-10-19 18:54:12,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:54:12,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 18:54:12,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562901944] [2020-10-19 18:54:12,201 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 18:54:12,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:54:12,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 18:54:12,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 18:54:12,202 INFO L87 Difference]: Start difference. First operand 2242 states and 3394 transitions. cyclomatic complexity: 1216 Second operand 3 states. [2020-10-19 18:54:12,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:54:12,235 INFO L93 Difference]: Finished difference Result 4418 states and 6594 transitions. [2020-10-19 18:54:12,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 18:54:12,236 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4418 states and 6594 transitions. [2020-10-19 18:54:12,273 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4416 [2020-10-19 18:54:12,304 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4418 states to 4418 states and 6594 transitions. [2020-10-19 18:54:12,304 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4418 [2020-10-19 18:54:12,309 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4418 [2020-10-19 18:54:12,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4418 states and 6594 transitions. [2020-10-19 18:54:12,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:54:12,318 INFO L691 BuchiCegarLoop]: Abstraction has 4418 states and 6594 transitions. [2020-10-19 18:54:12,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4418 states and 6594 transitions. [2020-10-19 18:54:12,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4418 to 4418. [2020-10-19 18:54:12,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4418 states. [2020-10-19 18:54:12,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4418 states to 4418 states and 6594 transitions. [2020-10-19 18:54:12,420 INFO L714 BuchiCegarLoop]: Abstraction has 4418 states and 6594 transitions. [2020-10-19 18:54:12,420 INFO L594 BuchiCegarLoop]: Abstraction has 4418 states and 6594 transitions. [2020-10-19 18:54:12,420 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-19 18:54:12,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4418 states and 6594 transitions. [2020-10-19 18:54:12,445 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4416 [2020-10-19 18:54:12,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:54:12,445 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:54:12,446 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:54:12,446 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:54:12,447 INFO L794 eck$LassoCheckResult]: Stem: 13523#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 13493#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;havoc main_~cond~0; 13494#L183-1 [2020-10-19 18:54:12,447 INFO L796 eck$LassoCheckResult]: Loop: 13494#L183-1 assume !false;main_~cond~0 := main_#t~nondet19;havoc main_#t~nondet19; 13742#L49 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0; 13740#L78 assume !(0 != main_~p1~0); 13738#L78-2 assume !(0 != main_~p2~0); 13737#L82-1 assume !(0 != main_~p3~0); 13735#L86-1 assume !(0 != main_~p4~0); 13733#L90-1 assume !(0 != main_~p5~0); 13730#L94-1 assume !(0 != main_~p6~0); 13718#L98-1 assume !(0 != main_~p7~0); 13720#L102-1 assume !(0 != main_~p8~0); 13700#L106-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 13701#L110-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 13653#L114-1 assume !(0 != main_~p11~0); 13654#L118-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 13641#L122-1 assume !(0 != main_~p1~0); 13642#L128-1 assume !(0 != main_~p2~0); 13634#L133-1 assume !(0 != main_~p3~0); 13633#L138-1 assume !(0 != main_~p4~0); 13620#L143-1 assume !(0 != main_~p5~0); 13622#L148-1 assume !(0 != main_~p6~0); 13753#L153-1 assume !(0 != main_~p7~0); 13751#L158-1 assume !(0 != main_~p8~0); 13750#L163-1 assume !(0 != main_~p9~0); 13748#L168-1 assume !(0 != main_~p10~0); 13745#L173-1 assume !(0 != main_~p11~0); 13744#L178-1 assume !(0 != main_~p12~0); 13494#L183-1 [2020-10-19 18:54:12,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:12,448 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2020-10-19 18:54:12,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:12,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2527304] [2020-10-19 18:54:12,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:12,461 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:12,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:12,476 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:12,490 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:54:12,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:12,497 INFO L82 PathProgramCache]: Analyzing trace with hash 164900234, now seen corresponding path program 1 times [2020-10-19 18:54:12,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:12,499 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597827439] [2020-10-19 18:54:12,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:12,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:54:12,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:54:12,539 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597827439] [2020-10-19 18:54:12,539 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:54:12,539 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 18:54:12,539 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588554984] [2020-10-19 18:54:12,540 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 18:54:12,540 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:54:12,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 18:54:12,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 18:54:12,541 INFO L87 Difference]: Start difference. First operand 4418 states and 6594 transitions. cyclomatic complexity: 2304 Second operand 3 states. [2020-10-19 18:54:12,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:54:12,613 INFO L93 Difference]: Finished difference Result 8706 states and 12802 transitions. [2020-10-19 18:54:12,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 18:54:12,613 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8706 states and 12802 transitions. [2020-10-19 18:54:12,683 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 8704 [2020-10-19 18:54:12,756 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8706 states to 8706 states and 12802 transitions. [2020-10-19 18:54:12,756 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8706 [2020-10-19 18:54:12,765 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8706 [2020-10-19 18:54:12,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8706 states and 12802 transitions. [2020-10-19 18:54:12,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:54:12,783 INFO L691 BuchiCegarLoop]: Abstraction has 8706 states and 12802 transitions. [2020-10-19 18:54:12,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8706 states and 12802 transitions. [2020-10-19 18:54:12,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8706 to 8706. [2020-10-19 18:54:12,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8706 states. [2020-10-19 18:54:13,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8706 states to 8706 states and 12802 transitions. [2020-10-19 18:54:13,054 INFO L714 BuchiCegarLoop]: Abstraction has 8706 states and 12802 transitions. [2020-10-19 18:54:13,054 INFO L594 BuchiCegarLoop]: Abstraction has 8706 states and 12802 transitions. [2020-10-19 18:54:13,055 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-19 18:54:13,055 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8706 states and 12802 transitions. [2020-10-19 18:54:13,088 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 8704 [2020-10-19 18:54:13,089 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:54:13,089 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:54:13,092 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:54:13,092 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:54:13,093 INFO L794 eck$LassoCheckResult]: Stem: 26662#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 26624#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;havoc main_~cond~0; 26625#L183-1 [2020-10-19 18:54:13,093 INFO L796 eck$LassoCheckResult]: Loop: 26625#L183-1 assume !false;main_~cond~0 := main_#t~nondet19;havoc main_#t~nondet19; 26912#L49 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0; 26910#L78 assume !(0 != main_~p1~0); 26908#L78-2 assume !(0 != main_~p2~0); 26907#L82-1 assume !(0 != main_~p3~0); 26904#L86-1 assume !(0 != main_~p4~0); 26900#L90-1 assume !(0 != main_~p5~0); 26896#L94-1 assume !(0 != main_~p6~0); 26893#L98-1 assume !(0 != main_~p7~0); 26884#L102-1 assume !(0 != main_~p8~0); 26886#L106-1 assume !(0 != main_~p9~0); 26866#L110-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 26867#L114-1 assume !(0 != main_~p11~0); 26848#L118-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 26849#L122-1 assume !(0 != main_~p1~0); 26843#L128-1 assume !(0 != main_~p2~0); 26844#L133-1 assume !(0 != main_~p3~0); 26821#L138-1 assume !(0 != main_~p4~0); 26822#L143-1 assume !(0 != main_~p5~0); 26799#L148-1 assume !(0 != main_~p6~0); 26801#L153-1 assume !(0 != main_~p7~0); 26921#L158-1 assume !(0 != main_~p8~0); 26919#L163-1 assume !(0 != main_~p9~0); 26918#L168-1 assume !(0 != main_~p10~0); 26915#L173-1 assume !(0 != main_~p11~0); 26914#L178-1 assume !(0 != main_~p12~0); 26625#L183-1 [2020-10-19 18:54:13,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:13,094 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2020-10-19 18:54:13,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:13,095 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326840806] [2020-10-19 18:54:13,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:13,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:13,103 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:13,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:13,114 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:13,121 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:54:13,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:13,122 INFO L82 PathProgramCache]: Analyzing trace with hash -856168120, now seen corresponding path program 1 times [2020-10-19 18:54:13,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:13,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536222879] [2020-10-19 18:54:13,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:13,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:54:13,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:54:13,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536222879] [2020-10-19 18:54:13,176 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:54:13,177 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 18:54:13,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128552951] [2020-10-19 18:54:13,178 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 18:54:13,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:54:13,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 18:54:13,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 18:54:13,180 INFO L87 Difference]: Start difference. First operand 8706 states and 12802 transitions. cyclomatic complexity: 4352 Second operand 3 states. [2020-10-19 18:54:13,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:54:13,287 INFO L93 Difference]: Finished difference Result 17154 states and 24834 transitions. [2020-10-19 18:54:13,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 18:54:13,288 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17154 states and 24834 transitions. [2020-10-19 18:54:13,400 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 17152 [2020-10-19 18:54:13,477 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17154 states to 17154 states and 24834 transitions. [2020-10-19 18:54:13,478 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17154 [2020-10-19 18:54:13,494 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17154 [2020-10-19 18:54:13,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17154 states and 24834 transitions. [2020-10-19 18:54:13,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:54:13,525 INFO L691 BuchiCegarLoop]: Abstraction has 17154 states and 24834 transitions. [2020-10-19 18:54:13,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17154 states and 24834 transitions. [2020-10-19 18:54:13,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17154 to 17154. [2020-10-19 18:54:13,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17154 states. [2020-10-19 18:54:13,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17154 states to 17154 states and 24834 transitions. [2020-10-19 18:54:13,772 INFO L714 BuchiCegarLoop]: Abstraction has 17154 states and 24834 transitions. [2020-10-19 18:54:13,772 INFO L594 BuchiCegarLoop]: Abstraction has 17154 states and 24834 transitions. [2020-10-19 18:54:13,772 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-19 18:54:13,773 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17154 states and 24834 transitions. [2020-10-19 18:54:13,837 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 17152 [2020-10-19 18:54:13,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:54:13,838 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:54:13,839 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:54:13,839 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:54:13,839 INFO L794 eck$LassoCheckResult]: Stem: 52528#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 52488#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;havoc main_~cond~0; 52489#L183-1 [2020-10-19 18:54:13,840 INFO L796 eck$LassoCheckResult]: Loop: 52489#L183-1 assume !false;main_~cond~0 := main_#t~nondet19;havoc main_#t~nondet19; 52958#L49 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0; 52959#L78 assume !(0 != main_~p1~0); 52961#L78-2 assume !(0 != main_~p2~0); 52956#L82-1 assume !(0 != main_~p3~0); 52957#L86-1 assume !(0 != main_~p4~0); 53036#L90-1 assume !(0 != main_~p5~0); 53029#L94-1 assume !(0 != main_~p6~0); 53022#L98-1 assume !(0 != main_~p7~0); 53019#L102-1 assume !(0 != main_~p8~0); 53017#L106-1 assume !(0 != main_~p9~0); 52875#L110-1 assume !(0 != main_~p10~0); 52877#L114-1 assume !(0 != main_~p11~0); 52867#L118-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 52868#L122-1 assume !(0 != main_~p1~0); 52821#L128-1 assume !(0 != main_~p2~0); 52822#L133-1 assume !(0 != main_~p3~0); 52764#L138-1 assume !(0 != main_~p4~0); 52765#L143-1 assume !(0 != main_~p5~0); 53051#L148-1 assume !(0 != main_~p6~0); 52730#L153-1 assume !(0 != main_~p7~0); 52731#L158-1 assume !(0 != main_~p8~0); 53057#L163-1 assume !(0 != main_~p9~0); 53055#L168-1 assume !(0 != main_~p10~0); 53032#L173-1 assume !(0 != main_~p11~0); 53027#L178-1 assume !(0 != main_~p12~0); 52489#L183-1 [2020-10-19 18:54:13,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:13,840 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2020-10-19 18:54:13,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:13,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13278099] [2020-10-19 18:54:13,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:13,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:13,847 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:13,851 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:13,854 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:54:13,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:13,855 INFO L82 PathProgramCache]: Analyzing trace with hash -2136031798, now seen corresponding path program 1 times [2020-10-19 18:54:13,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:13,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350388799] [2020-10-19 18:54:13,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:13,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:54:13,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:54:13,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350388799] [2020-10-19 18:54:13,871 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:54:13,871 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-19 18:54:13,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855897656] [2020-10-19 18:54:13,872 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 18:54:13,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:54:13,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 18:54:13,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 18:54:13,873 INFO L87 Difference]: Start difference. First operand 17154 states and 24834 transitions. cyclomatic complexity: 8192 Second operand 3 states. [2020-10-19 18:54:13,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:54:13,960 INFO L93 Difference]: Finished difference Result 33794 states and 48130 transitions. [2020-10-19 18:54:13,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 18:54:13,961 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33794 states and 48130 transitions. [2020-10-19 18:54:14,115 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 33792 [2020-10-19 18:54:14,235 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33794 states to 33794 states and 48130 transitions. [2020-10-19 18:54:14,235 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33794 [2020-10-19 18:54:14,259 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33794 [2020-10-19 18:54:14,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33794 states and 48130 transitions. [2020-10-19 18:54:14,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:54:14,312 INFO L691 BuchiCegarLoop]: Abstraction has 33794 states and 48130 transitions. [2020-10-19 18:54:14,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33794 states and 48130 transitions. [2020-10-19 18:54:14,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33794 to 33794. [2020-10-19 18:54:14,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33794 states. [2020-10-19 18:54:14,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33794 states to 33794 states and 48130 transitions. [2020-10-19 18:54:14,935 INFO L714 BuchiCegarLoop]: Abstraction has 33794 states and 48130 transitions. [2020-10-19 18:54:14,935 INFO L594 BuchiCegarLoop]: Abstraction has 33794 states and 48130 transitions. [2020-10-19 18:54:14,935 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-19 18:54:14,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33794 states and 48130 transitions. [2020-10-19 18:54:15,029 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 33792 [2020-10-19 18:54:15,030 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:54:15,030 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:54:15,031 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:54:15,031 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:54:15,031 INFO L794 eck$LassoCheckResult]: Stem: 103477#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 103442#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;havoc main_~cond~0; 103443#L183-1 [2020-10-19 18:54:15,032 INFO L796 eck$LassoCheckResult]: Loop: 103443#L183-1 assume !false;main_~cond~0 := main_#t~nondet19;havoc main_#t~nondet19; 103594#L49 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0; 103590#L78 assume !(0 != main_~p1~0); 103588#L78-2 assume !(0 != main_~p2~0); 103586#L82-1 assume !(0 != main_~p3~0); 103582#L86-1 assume !(0 != main_~p4~0); 103578#L90-1 assume !(0 != main_~p5~0); 103574#L94-1 assume !(0 != main_~p6~0); 103570#L98-1 assume !(0 != main_~p7~0); 103566#L102-1 assume !(0 != main_~p8~0); 103562#L106-1 assume !(0 != main_~p9~0); 103558#L110-1 assume !(0 != main_~p10~0); 103556#L114-1 assume !(0 != main_~p11~0); 103552#L118-1 assume !(0 != main_~p12~0); 103548#L122-1 assume !(0 != main_~p1~0); 103546#L128-1 assume !(0 != main_~p2~0); 103540#L133-1 assume !(0 != main_~p3~0); 103539#L138-1 assume !(0 != main_~p4~0); 103625#L143-1 assume !(0 != main_~p5~0); 103621#L148-1 assume !(0 != main_~p6~0); 103617#L153-1 assume !(0 != main_~p7~0); 103613#L158-1 assume !(0 != main_~p8~0); 103609#L163-1 assume !(0 != main_~p9~0); 103605#L168-1 assume !(0 != main_~p10~0); 103601#L173-1 assume !(0 != main_~p11~0); 103597#L178-1 assume !(0 != main_~p12~0); 103443#L183-1 [2020-10-19 18:54:15,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:15,032 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2020-10-19 18:54:15,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:15,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36888833] [2020-10-19 18:54:15,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:15,038 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:15,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:15,043 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:15,045 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:54:15,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:15,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1572129484, now seen corresponding path program 1 times [2020-10-19 18:54:15,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:15,046 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4195159] [2020-10-19 18:54:15,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:15,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:15,050 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:15,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:15,053 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:15,058 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:54:15,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:15,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1068122098, now seen corresponding path program 1 times [2020-10-19 18:54:15,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:15,059 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108410652] [2020-10-19 18:54:15,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:15,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:15,066 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:15,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:15,072 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:15,078 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:54:15,471 WARN L193 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2020-10-19 18:54:15,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.10 06:54:15 BoogieIcfgContainer [2020-10-19 18:54:15,592 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-19 18:54:15,593 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-19 18:54:15,593 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-19 18:54:15,593 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-19 18:54:15,594 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:54:10" (3/4) ... [2020-10-19 18:54:15,597 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-19 18:54:15,657 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-19 18:54:15,658 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-19 18:54:15,659 INFO L168 Benchmark]: Toolchain (without parser) took 5832.59 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 343.4 MB). Free memory was 960.0 MB in the beginning and 999.4 MB in the end (delta: -39.5 MB). Peak memory consumption was 303.9 MB. Max. memory is 11.5 GB. [2020-10-19 18:54:15,660 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 18:54:15,661 INFO L168 Benchmark]: CACSL2BoogieTranslator took 337.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 960.0 MB in the beginning and 1.1 GB in the end (delta: -173.4 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2020-10-19 18:54:15,661 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 18:54:15,661 INFO L168 Benchmark]: Boogie Preprocessor took 24.35 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 18:54:15,662 INFO L168 Benchmark]: RCFGBuilder took 382.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2020-10-19 18:54:15,665 INFO L168 Benchmark]: BuchiAutomizer took 4969.22 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 199.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 92.7 MB). Peak memory consumption was 292.4 MB. Max. memory is 11.5 GB. [2020-10-19 18:54:15,666 INFO L168 Benchmark]: Witness Printer took 64.98 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 999.4 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2020-10-19 18:54:15,669 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 337.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 960.0 MB in the beginning and 1.1 GB in the end (delta: -173.4 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.35 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 382.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4969.22 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 199.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 92.7 MB). Peak memory consumption was 292.4 MB. Max. memory is 11.5 GB. * Witness Printer took 64.98 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 999.4 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (10 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.10 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 33794 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.8s and 11 iterations. TraceHistogramMax:1. Analysis of lassos took 1.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 0. Minimization of det autom 10. Minimization of nondet autom 0. Automata minimization 1.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.7s Buchi closure took 0.0s. Biggest automaton had 33794 states and ocurred in iteration 10. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 957 SDtfs, 496 SDslu, 595 SDs, 0 SdLazy, 50 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI10 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 47]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=12237} State at position 1 is {NULL=12240, NULL=0, p1=0, \result=0, p3=0, p2=0, p5=0, NULL=12237, p4=0, p10=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@780eff6=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@718cc4e9=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1b31af99=0, lk12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@760f8b49=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@76f03521=0, lk10=0, p11=0, lk11=0, p12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@bcfac9a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@45c4ba7c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7da5f17b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@41338d16=10, cond=10, NULL=12239, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@61cc0c9a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@77972a5d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7d48b225=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@a66c990=0, NULL=0, NULL=0, NULL=0, NULL=12238, lk3=0, lk4=0, lk5=0, lk6=0, NULL=0, lk1=0, lk2=0, lk7=0, lk8=0, lk9=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 47]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L45] int cond; Loop: [L47] COND TRUE 1 [L48] cond = __VERIFIER_nondet_int() [L49] COND FALSE !(cond == 0) [L52] lk1 = 0 [L54] lk2 = 0 [L56] lk3 = 0 [L58] lk4 = 0 [L60] lk5 = 0 [L62] lk6 = 0 [L64] lk7 = 0 [L66] lk8 = 0 [L68] lk9 = 0 [L70] lk10 = 0 [L72] lk11 = 0 [L74] lk12 = 0 [L78] COND FALSE !(p1 != 0) [L82] COND FALSE !(p2 != 0) [L86] COND FALSE !(p3 != 0) [L90] COND FALSE !(p4 != 0) [L94] COND FALSE !(p5 != 0) [L98] COND FALSE !(p6 != 0) [L102] COND FALSE !(p7 != 0) [L106] COND FALSE !(p8 != 0) [L110] COND FALSE !(p9 != 0) [L114] COND FALSE !(p10 != 0) [L118] COND FALSE !(p11 != 0) [L122] COND FALSE !(p12 != 0) [L128] COND FALSE !(p1 != 0) [L133] COND FALSE !(p2 != 0) [L138] COND FALSE !(p3 != 0) [L143] COND FALSE !(p4 != 0) [L148] COND FALSE !(p5 != 0) [L153] COND FALSE !(p6 != 0) [L158] COND FALSE !(p7 != 0) [L163] COND FALSE !(p8 != 0) [L168] COND FALSE !(p9 != 0) [L173] COND FALSE !(p10 != 0) [L178] COND FALSE !(p11 != 0) [L183] COND FALSE !(p12 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...