./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_14-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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_14-2.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 7dd19b8066311da8c1eb1c6a0e6567bb02c0b787 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-9a8b2e8 [2020-10-20 06:47:10,472 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 06:47:10,475 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 06:47:10,518 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 06:47:10,519 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 06:47:10,530 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 06:47:10,531 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 06:47:10,535 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 06:47:10,537 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 06:47:10,546 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 06:47:10,547 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 06:47:10,548 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 06:47:10,548 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 06:47:10,549 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 06:47:10,550 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 06:47:10,551 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 06:47:10,552 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 06:47:10,552 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 06:47:10,555 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 06:47:10,560 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 06:47:10,563 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 06:47:10,564 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 06:47:10,566 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 06:47:10,568 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 06:47:10,570 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 06:47:10,573 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 06:47:10,573 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 06:47:10,574 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 06:47:10,575 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 06:47:10,576 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 06:47:10,577 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 06:47:10,577 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 06:47:10,578 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 06:47:10,579 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 06:47:10,580 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 06:47:10,580 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 06:47:10,581 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 06:47:10,581 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 06:47:10,582 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 06:47:10,582 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 06:47:10,584 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 06:47:10,584 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-20 06:47:10,629 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 06:47:10,630 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 06:47:10,631 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 06:47:10,632 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 06:47:10,632 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 06:47:10,632 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 06:47:10,633 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 06:47:10,633 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 06:47:10,633 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 06:47:10,633 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 06:47:10,634 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 06:47:10,635 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 06:47:10,635 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 06:47:10,635 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 06:47:10,636 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 06:47:10,636 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 06:47:10,636 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 06:47:10,636 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 06:47:10,637 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 06:47:10,637 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 06:47:10,637 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 06:47:10,637 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 06:47:10,638 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 06:47:10,638 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 06:47:10,638 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 06:47:10,638 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 06:47:10,639 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 06:47:10,639 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 06:47:10,639 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 06:47:10,639 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 06:47:10,640 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 06:47:10,640 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 06:47:10,642 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 06:47:10,642 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 -> 7dd19b8066311da8c1eb1c6a0e6567bb02c0b787 [2020-10-20 06:47:10,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 06:47:10,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 06:47:10,871 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 06:47:10,873 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 06:47:10,873 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 06:47:10,874 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_14-2.c [2020-10-20 06:47:10,925 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8468de7c0/207318e244c847d4aa96365db30b766e/FLAG18df23ae2 [2020-10-20 06:47:11,512 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 06:47:11,512 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-2.c [2020-10-20 06:47:11,528 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8468de7c0/207318e244c847d4aa96365db30b766e/FLAG18df23ae2 [2020-10-20 06:47:11,883 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8468de7c0/207318e244c847d4aa96365db30b766e [2020-10-20 06:47:11,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 06:47:11,891 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 06:47:11,892 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 06:47:11,893 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 06:47:11,896 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 06:47:11,898 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:47:11" (1/1) ... [2020-10-20 06:47:11,901 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79a2f24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:11, skipping insertion in model container [2020-10-20 06:47:11,901 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:47:11" (1/1) ... [2020-10-20 06:47:11,910 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 06:47:11,941 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 06:47:12,144 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:47:12,156 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 06:47:12,188 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:47:12,210 INFO L208 MainTranslator]: Completed translation [2020-10-20 06:47:12,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:12 WrapperNode [2020-10-20 06:47:12,211 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 06:47:12,212 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 06:47:12,212 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 06:47:12,212 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 06:47:12,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:12" (1/1) ... [2020-10-20 06:47:12,226 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:12" (1/1) ... [2020-10-20 06:47:12,254 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 06:47:12,255 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 06:47:12,255 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 06:47:12,255 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 06:47:12,263 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:12" (1/1) ... [2020-10-20 06:47:12,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:12" (1/1) ... [2020-10-20 06:47:12,265 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:12" (1/1) ... [2020-10-20 06:47:12,265 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:12" (1/1) ... [2020-10-20 06:47:12,271 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:12" (1/1) ... [2020-10-20 06:47:12,277 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:12" (1/1) ... [2020-10-20 06:47:12,279 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:12" (1/1) ... [2020-10-20 06:47:12,289 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 06:47:12,289 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 06:47:12,290 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 06:47:12,290 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 06:47:12,291 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:12" (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-20 06:47:12,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 06:47:12,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 06:47:12,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 06:47:12,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 06:47:12,736 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 06:47:12,737 INFO L298 CfgBuilder]: Removed 7 assume(true) statements. [2020-10-20 06:47:12,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:47:12 BoogieIcfgContainer [2020-10-20 06:47:12,740 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 06:47:12,741 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 06:47:12,741 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 06:47:12,745 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 06:47:12,747 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:47:12,747 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 06:47:11" (1/3) ... [2020-10-20 06:47:12,748 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1fadaeeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:47:12, skipping insertion in model container [2020-10-20 06:47:12,749 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:47:12,749 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:12" (2/3) ... [2020-10-20 06:47:12,749 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1fadaeeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:47:12, skipping insertion in model container [2020-10-20 06:47:12,749 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:47:12,750 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:47:12" (3/3) ... [2020-10-20 06:47:12,752 INFO L373 chiAutomizerObserver]: Analyzing ICFG test_locks_14-2.c [2020-10-20 06:47:12,813 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 06:47:12,814 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 06:47:12,814 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 06:47:12,814 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 06:47:12,814 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 06:47:12,814 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 06:47:12,815 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 06:47:12,815 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 06:47:12,856 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states. [2020-10-20 06:47:12,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2020-10-20 06:47:12,882 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:12,883 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:12,899 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:12,899 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, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:12,899 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 06:47:12,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states. [2020-10-20 06:47:12,910 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2020-10-20 06:47:12,910 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:12,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:12,912 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:12,912 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, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:12,918 INFO L794 eck$LassoCheckResult]: Stem: 25#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 9#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_#t~nondet20, main_#t~nondet21, 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_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~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;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 48#L211true [2020-10-20 06:47:12,920 INFO L796 eck$LassoCheckResult]: Loop: 48#L211true assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 29#L55true 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;main_~lk13~0 := 0;main_~lk14~0 := 0; 30#L88true assume 0 != main_~p1~0;main_~lk1~0 := 1; 27#L88-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 18#L92-1true assume !(0 != main_~p3~0); 36#L96-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 42#L100-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 34#L104-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 51#L108-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 44#L112-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 49#L116-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 13#L120-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 4#L124-1true assume !(0 != main_~p11~0); 24#L128-1true assume 0 != main_~p12~0;main_~lk12~0 := 1; 31#L132-1true assume 0 != main_~p13~0;main_~lk13~0 := 1; 21#L136-1true assume 0 != main_~p14~0;main_~lk14~0 := 1; 38#L140-1true assume !(0 != main_~p1~0); 5#L146-1true assume 0 != main_~p2~0; 53#L152true assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 39#L151true assume !(0 != main_~p3~0); 46#L156-1true assume !(0 != main_~p4~0); 26#L161-1true assume !(0 != main_~p5~0); 32#L166-1true assume !(0 != main_~p6~0); 10#L171-1true assume !(0 != main_~p7~0); 17#L176-1true assume !(0 != main_~p8~0); 35#L181-1true assume !(0 != main_~p9~0); 16#L186-1true assume !(0 != main_~p10~0); 23#L191-1true assume !(0 != main_~p11~0); 54#L196-1true assume !(0 != main_~p12~0); 7#L201-1true assume !(0 != main_~p13~0); 41#L206-1true assume 0 != main_~p14~0; 8#L212true assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 48#L211true [2020-10-20 06:47:12,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:12,926 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-20 06:47:12,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:12,935 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005579108] [2020-10-20 06:47:12,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:13,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:13,040 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:13,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:13,060 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:13,085 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:13,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:13,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1237702727, now seen corresponding path program 1 times [2020-10-20 06:47:13,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:13,087 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912802096] [2020-10-20 06:47:13,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:13,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:13,185 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-20 06:47:13,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912802096] [2020-10-20 06:47:13,188 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:13,191 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:13,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142097069] [2020-10-20 06:47:13,200 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:13,203 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:13,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:13,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:13,221 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 3 states. [2020-10-20 06:47:13,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:13,282 INFO L93 Difference]: Finished difference Result 99 states and 178 transitions. [2020-10-20 06:47:13,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:13,285 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 178 transitions. [2020-10-20 06:47:13,290 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2020-10-20 06:47:13,300 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 89 states and 139 transitions. [2020-10-20 06:47:13,301 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2020-10-20 06:47:13,302 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2020-10-20 06:47:13,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 139 transitions. [2020-10-20 06:47:13,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:13,304 INFO L691 BuchiCegarLoop]: Abstraction has 89 states and 139 transitions. [2020-10-20 06:47:13,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 139 transitions. [2020-10-20 06:47:13,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2020-10-20 06:47:13,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-10-20 06:47:13,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 139 transitions. [2020-10-20 06:47:13,339 INFO L714 BuchiCegarLoop]: Abstraction has 89 states and 139 transitions. [2020-10-20 06:47:13,339 INFO L594 BuchiCegarLoop]: Abstraction has 89 states and 139 transitions. [2020-10-20 06:47:13,339 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 06:47:13,340 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 139 transitions. [2020-10-20 06:47:13,342 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2020-10-20 06:47:13,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:13,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:13,343 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:13,343 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, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:13,344 INFO L794 eck$LassoCheckResult]: Stem: 205#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 183#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_#t~nondet20, main_#t~nondet21, 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_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~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;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 184#L211 [2020-10-20 06:47:13,344 INFO L796 eck$LassoCheckResult]: Loop: 184#L211 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 208#L55 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;main_~lk13~0 := 0;main_~lk14~0 := 0; 209#L88 assume !(0 != main_~p1~0); 211#L88-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 248#L92-1 assume !(0 != main_~p3~0); 247#L96-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 246#L100-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 245#L104-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 244#L108-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 197#L112-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 198#L116-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 243#L120-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 242#L124-1 assume !(0 != main_~p11~0); 241#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 240#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 239#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 238#L140-1 assume !(0 != main_~p1~0); 237#L146-1 assume 0 != main_~p2~0; 236#L152 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 235#L151 assume !(0 != main_~p3~0); 233#L156-1 assume !(0 != main_~p4~0); 231#L161-1 assume !(0 != main_~p5~0); 229#L166-1 assume !(0 != main_~p6~0); 226#L171-1 assume !(0 != main_~p7~0); 225#L176-1 assume !(0 != main_~p8~0); 223#L181-1 assume !(0 != main_~p9~0); 220#L186-1 assume !(0 != main_~p10~0); 219#L191-1 assume !(0 != main_~p11~0); 217#L196-1 assume !(0 != main_~p12~0); 215#L201-1 assume !(0 != main_~p13~0); 213#L206-1 assume 0 != main_~p14~0; 212#L212 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 184#L211 [2020-10-20 06:47:13,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:13,344 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-10-20 06:47:13,345 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:13,345 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548984649] [2020-10-20 06:47:13,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:13,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:13,360 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:13,373 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:13,378 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:13,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:13,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1215070473, now seen corresponding path program 1 times [2020-10-20 06:47:13,379 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:13,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733616606] [2020-10-20 06:47:13,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:13,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:13,432 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-20 06:47:13,433 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733616606] [2020-10-20 06:47:13,433 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:13,434 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:13,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96881062] [2020-10-20 06:47:13,434 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:13,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:13,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:13,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:13,436 INFO L87 Difference]: Start difference. First operand 89 states and 139 transitions. cyclomatic complexity: 52 Second operand 3 states. [2020-10-20 06:47:13,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:13,490 INFO L93 Difference]: Finished difference Result 174 states and 270 transitions. [2020-10-20 06:47:13,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:13,491 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 270 transitions. [2020-10-20 06:47:13,496 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 172 [2020-10-20 06:47:13,498 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 174 states and 270 transitions. [2020-10-20 06:47:13,499 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 174 [2020-10-20 06:47:13,499 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2020-10-20 06:47:13,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 270 transitions. [2020-10-20 06:47:13,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:13,501 INFO L691 BuchiCegarLoop]: Abstraction has 174 states and 270 transitions. [2020-10-20 06:47:13,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 270 transitions. [2020-10-20 06:47:13,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2020-10-20 06:47:13,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2020-10-20 06:47:13,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 270 transitions. [2020-10-20 06:47:13,531 INFO L714 BuchiCegarLoop]: Abstraction has 174 states and 270 transitions. [2020-10-20 06:47:13,531 INFO L594 BuchiCegarLoop]: Abstraction has 174 states and 270 transitions. [2020-10-20 06:47:13,531 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 06:47:13,532 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 174 states and 270 transitions. [2020-10-20 06:47:13,535 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 172 [2020-10-20 06:47:13,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:13,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:13,536 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:13,536 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, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:13,537 INFO L794 eck$LassoCheckResult]: Stem: 477#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 452#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_#t~nondet20, main_#t~nondet21, 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_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~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;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 453#L211 [2020-10-20 06:47:13,537 INFO L796 eck$LassoCheckResult]: Loop: 453#L211 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 479#L55 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;main_~lk13~0 := 0;main_~lk14~0 := 0; 480#L88 assume !(0 != main_~p1~0); 520#L88-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 517#L92-1 assume !(0 != main_~p3~0); 518#L96-1 assume !(0 != main_~p4~0); 568#L100-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 580#L104-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 577#L108-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 521#L112-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 519#L116-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 516#L120-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 513#L124-1 assume !(0 != main_~p11~0); 510#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 507#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 503#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 504#L140-1 assume !(0 != main_~p1~0); 553#L146-1 assume 0 != main_~p2~0; 602#L152 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 600#L151 assume !(0 != main_~p3~0); 597#L156-1 assume !(0 != main_~p4~0); 595#L161-1 assume !(0 != main_~p5~0); 592#L166-1 assume !(0 != main_~p6~0); 511#L171-1 assume !(0 != main_~p7~0); 509#L176-1 assume !(0 != main_~p8~0); 506#L181-1 assume !(0 != main_~p9~0); 499#L186-1 assume !(0 != main_~p10~0); 500#L191-1 assume !(0 != main_~p11~0); 495#L196-1 assume !(0 != main_~p12~0); 493#L201-1 assume !(0 != main_~p13~0); 492#L206-1 assume 0 != main_~p14~0; 488#L212 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 453#L211 [2020-10-20 06:47:13,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:13,538 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2020-10-20 06:47:13,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:13,538 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837348302] [2020-10-20 06:47:13,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:13,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:13,551 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:13,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:13,565 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:13,570 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:13,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:13,571 INFO L82 PathProgramCache]: Analyzing trace with hash 708157561, now seen corresponding path program 1 times [2020-10-20 06:47:13,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:13,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992615171] [2020-10-20 06:47:13,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:13,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:13,626 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-20 06:47:13,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992615171] [2020-10-20 06:47:13,627 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:13,627 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:13,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710880268] [2020-10-20 06:47:13,628 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:13,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:13,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:13,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:13,629 INFO L87 Difference]: Start difference. First operand 174 states and 270 transitions. cyclomatic complexity: 100 Second operand 3 states. [2020-10-20 06:47:13,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:13,653 INFO L93 Difference]: Finished difference Result 342 states and 526 transitions. [2020-10-20 06:47:13,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:13,654 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 342 states and 526 transitions. [2020-10-20 06:47:13,658 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 340 [2020-10-20 06:47:13,661 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 342 states to 342 states and 526 transitions. [2020-10-20 06:47:13,662 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 342 [2020-10-20 06:47:13,663 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 342 [2020-10-20 06:47:13,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 342 states and 526 transitions. [2020-10-20 06:47:13,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:13,665 INFO L691 BuchiCegarLoop]: Abstraction has 342 states and 526 transitions. [2020-10-20 06:47:13,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states and 526 transitions. [2020-10-20 06:47:13,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2020-10-20 06:47:13,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2020-10-20 06:47:13,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 526 transitions. [2020-10-20 06:47:13,690 INFO L714 BuchiCegarLoop]: Abstraction has 342 states and 526 transitions. [2020-10-20 06:47:13,690 INFO L594 BuchiCegarLoop]: Abstraction has 342 states and 526 transitions. [2020-10-20 06:47:13,690 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 06:47:13,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 342 states and 526 transitions. [2020-10-20 06:47:13,695 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 340 [2020-10-20 06:47:13,695 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:13,695 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:13,696 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:13,696 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, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:13,696 INFO L794 eck$LassoCheckResult]: Stem: 1003#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 974#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_#t~nondet20, main_#t~nondet21, 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_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~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;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 975#L211 [2020-10-20 06:47:13,697 INFO L796 eck$LassoCheckResult]: Loop: 975#L211 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 1101#L55 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;main_~lk13~0 := 0;main_~lk14~0 := 0; 1098#L88 assume !(0 != main_~p1~0); 1096#L88-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 1094#L92-1 assume !(0 != main_~p3~0); 1092#L96-1 assume !(0 != main_~p4~0); 1088#L100-1 assume !(0 != main_~p5~0); 1086#L104-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1084#L108-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1082#L112-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1080#L116-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1078#L120-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1076#L124-1 assume !(0 != main_~p11~0); 1074#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 1072#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 1070#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 1067#L140-1 assume !(0 != main_~p1~0); 1065#L146-1 assume 0 != main_~p2~0; 1063#L152 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 1060#L151 assume !(0 != main_~p3~0); 1056#L156-1 assume !(0 != main_~p4~0); 1057#L161-1 assume !(0 != main_~p5~0); 1137#L166-1 assume !(0 != main_~p6~0); 1132#L171-1 assume !(0 != main_~p7~0); 1129#L176-1 assume !(0 != main_~p8~0); 1125#L181-1 assume !(0 != main_~p9~0); 1120#L186-1 assume !(0 != main_~p10~0); 1117#L191-1 assume !(0 != main_~p11~0); 1113#L196-1 assume !(0 != main_~p12~0); 1109#L201-1 assume !(0 != main_~p13~0); 1106#L206-1 assume 0 != main_~p14~0; 1104#L212 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 975#L211 [2020-10-20 06:47:13,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:13,697 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2020-10-20 06:47:13,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:13,698 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764934778] [2020-10-20 06:47:13,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:13,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:13,722 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:13,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:13,742 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:13,761 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:13,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:13,764 INFO L82 PathProgramCache]: Analyzing trace with hash 770197175, now seen corresponding path program 1 times [2020-10-20 06:47:13,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:13,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134492541] [2020-10-20 06:47:13,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:13,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:13,815 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-20 06:47:13,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134492541] [2020-10-20 06:47:13,816 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:13,816 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:13,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500254116] [2020-10-20 06:47:13,817 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:13,817 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:13,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:13,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:13,818 INFO L87 Difference]: Start difference. First operand 342 states and 526 transitions. cyclomatic complexity: 192 Second operand 3 states. [2020-10-20 06:47:13,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:13,848 INFO L93 Difference]: Finished difference Result 674 states and 1026 transitions. [2020-10-20 06:47:13,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:13,849 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 674 states and 1026 transitions. [2020-10-20 06:47:13,858 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 672 [2020-10-20 06:47:13,866 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 674 states to 674 states and 1026 transitions. [2020-10-20 06:47:13,866 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 674 [2020-10-20 06:47:13,868 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 674 [2020-10-20 06:47:13,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 674 states and 1026 transitions. [2020-10-20 06:47:13,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:13,876 INFO L691 BuchiCegarLoop]: Abstraction has 674 states and 1026 transitions. [2020-10-20 06:47:13,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states and 1026 transitions. [2020-10-20 06:47:13,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2020-10-20 06:47:13,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2020-10-20 06:47:13,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1026 transitions. [2020-10-20 06:47:13,920 INFO L714 BuchiCegarLoop]: Abstraction has 674 states and 1026 transitions. [2020-10-20 06:47:13,920 INFO L594 BuchiCegarLoop]: Abstraction has 674 states and 1026 transitions. [2020-10-20 06:47:13,920 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 06:47:13,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 674 states and 1026 transitions. [2020-10-20 06:47:13,925 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 672 [2020-10-20 06:47:13,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:13,925 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:13,926 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:13,926 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, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:13,926 INFO L794 eck$LassoCheckResult]: Stem: 2031#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1995#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_#t~nondet20, main_#t~nondet21, 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_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~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;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 1996#L211 [2020-10-20 06:47:13,927 INFO L796 eck$LassoCheckResult]: Loop: 1996#L211 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 2281#L55 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;main_~lk13~0 := 0;main_~lk14~0 := 0; 2279#L88 assume !(0 != main_~p1~0); 2277#L88-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 2063#L92-1 assume !(0 != main_~p3~0); 2064#L96-1 assume !(0 != main_~p4~0); 2263#L100-1 assume !(0 != main_~p5~0); 2264#L104-1 assume !(0 != main_~p6~0); 2381#L108-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2379#L112-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2378#L116-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 2311#L120-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 2310#L124-1 assume !(0 != main_~p11~0); 2304#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 2300#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 2295#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 2290#L140-1 assume !(0 != main_~p1~0); 2286#L146-1 assume 0 != main_~p2~0; 2283#L152 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 2215#L151 assume !(0 != main_~p3~0); 2214#L156-1 assume !(0 != main_~p4~0); 2219#L161-1 assume !(0 != main_~p5~0); 2334#L166-1 assume !(0 != main_~p6~0); 2330#L171-1 assume !(0 != main_~p7~0); 2327#L176-1 assume !(0 != main_~p8~0); 2323#L181-1 assume !(0 != main_~p9~0); 2316#L186-1 assume !(0 != main_~p10~0); 2308#L191-1 assume !(0 != main_~p11~0); 2303#L196-1 assume !(0 != main_~p12~0); 2298#L201-1 assume !(0 != main_~p13~0); 2293#L206-1 assume 0 != main_~p14~0; 2288#L212 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 1996#L211 [2020-10-20 06:47:13,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:13,927 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2020-10-20 06:47:13,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:13,928 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004779289] [2020-10-20 06:47:13,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:13,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:13,937 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:13,945 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:13,949 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:13,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:13,949 INFO L82 PathProgramCache]: Analyzing trace with hash 910745785, now seen corresponding path program 1 times [2020-10-20 06:47:13,964 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:13,964 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766859763] [2020-10-20 06:47:13,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:13,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:13,994 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-20 06:47:13,995 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766859763] [2020-10-20 06:47:13,995 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:13,995 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:13,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779034228] [2020-10-20 06:47:13,996 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:13,996 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:13,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:13,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:13,997 INFO L87 Difference]: Start difference. First operand 674 states and 1026 transitions. cyclomatic complexity: 368 Second operand 3 states. [2020-10-20 06:47:14,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:14,019 INFO L93 Difference]: Finished difference Result 1330 states and 2002 transitions. [2020-10-20 06:47:14,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:14,020 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1330 states and 2002 transitions. [2020-10-20 06:47:14,035 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1328 [2020-10-20 06:47:14,045 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1330 states to 1330 states and 2002 transitions. [2020-10-20 06:47:14,046 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1330 [2020-10-20 06:47:14,048 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1330 [2020-10-20 06:47:14,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1330 states and 2002 transitions. [2020-10-20 06:47:14,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:14,051 INFO L691 BuchiCegarLoop]: Abstraction has 1330 states and 2002 transitions. [2020-10-20 06:47:14,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states and 2002 transitions. [2020-10-20 06:47:14,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1330. [2020-10-20 06:47:14,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1330 states. [2020-10-20 06:47:14,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 2002 transitions. [2020-10-20 06:47:14,082 INFO L714 BuchiCegarLoop]: Abstraction has 1330 states and 2002 transitions. [2020-10-20 06:47:14,082 INFO L594 BuchiCegarLoop]: Abstraction has 1330 states and 2002 transitions. [2020-10-20 06:47:14,098 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 06:47:14,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1330 states and 2002 transitions. [2020-10-20 06:47:14,107 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1328 [2020-10-20 06:47:14,107 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:14,107 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:14,110 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:14,111 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, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:14,111 INFO L794 eck$LassoCheckResult]: Stem: 4036#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 4005#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_#t~nondet20, main_#t~nondet21, 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_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~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;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 4006#L211 [2020-10-20 06:47:14,111 INFO L796 eck$LassoCheckResult]: Loop: 4006#L211 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 4524#L55 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;main_~lk13~0 := 0;main_~lk14~0 := 0; 4522#L88 assume !(0 != main_~p1~0); 4520#L88-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 4517#L92-1 assume !(0 != main_~p3~0); 4514#L96-1 assume !(0 != main_~p4~0); 4512#L100-1 assume !(0 != main_~p5~0); 4510#L104-1 assume !(0 != main_~p6~0); 4487#L108-1 assume !(0 != main_~p7~0); 4482#L112-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 4483#L116-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 4466#L120-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 4467#L124-1 assume !(0 != main_~p11~0); 4446#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 4438#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 4418#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 4419#L140-1 assume !(0 != main_~p1~0); 4608#L146-1 assume 0 != main_~p2~0; 4603#L152 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 4599#L151 assume !(0 != main_~p3~0); 4592#L156-1 assume !(0 != main_~p4~0); 4587#L161-1 assume !(0 != main_~p5~0); 4577#L166-1 assume !(0 != main_~p6~0); 4576#L171-1 assume !(0 != main_~p7~0); 4565#L176-1 assume !(0 != main_~p8~0); 4560#L181-1 assume !(0 != main_~p9~0); 4554#L186-1 assume !(0 != main_~p10~0); 4551#L191-1 assume !(0 != main_~p11~0); 4547#L196-1 assume !(0 != main_~p12~0); 4541#L201-1 assume !(0 != main_~p13~0); 4536#L206-1 assume 0 != main_~p14~0; 4532#L212 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 4006#L211 [2020-10-20 06:47:14,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:14,112 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2020-10-20 06:47:14,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:14,112 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359081164] [2020-10-20 06:47:14,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:14,136 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:14,144 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:14,148 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:14,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:14,149 INFO L82 PathProgramCache]: Analyzing trace with hash 776732279, now seen corresponding path program 1 times [2020-10-20 06:47:14,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:14,150 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647710794] [2020-10-20 06:47:14,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:14,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:14,175 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-20 06:47:14,175 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647710794] [2020-10-20 06:47:14,176 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:14,176 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:14,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001060809] [2020-10-20 06:47:14,176 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:14,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:14,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:14,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:14,178 INFO L87 Difference]: Start difference. First operand 1330 states and 2002 transitions. cyclomatic complexity: 704 Second operand 3 states. [2020-10-20 06:47:14,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:14,205 INFO L93 Difference]: Finished difference Result 2626 states and 3906 transitions. [2020-10-20 06:47:14,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:14,206 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2626 states and 3906 transitions. [2020-10-20 06:47:14,232 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2624 [2020-10-20 06:47:14,283 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2626 states to 2626 states and 3906 transitions. [2020-10-20 06:47:14,284 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2626 [2020-10-20 06:47:14,287 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2626 [2020-10-20 06:47:14,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2626 states and 3906 transitions. [2020-10-20 06:47:14,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:14,293 INFO L691 BuchiCegarLoop]: Abstraction has 2626 states and 3906 transitions. [2020-10-20 06:47:14,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2626 states and 3906 transitions. [2020-10-20 06:47:14,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2626 to 2626. [2020-10-20 06:47:14,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2626 states. [2020-10-20 06:47:14,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 3906 transitions. [2020-10-20 06:47:14,347 INFO L714 BuchiCegarLoop]: Abstraction has 2626 states and 3906 transitions. [2020-10-20 06:47:14,347 INFO L594 BuchiCegarLoop]: Abstraction has 2626 states and 3906 transitions. [2020-10-20 06:47:14,347 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 06:47:14,348 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2626 states and 3906 transitions. [2020-10-20 06:47:14,364 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2624 [2020-10-20 06:47:14,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:14,390 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:14,391 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:14,391 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, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:14,391 INFO L794 eck$LassoCheckResult]: Stem: 8001#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 7967#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_#t~nondet20, main_#t~nondet21, 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_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~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;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 7968#L211 [2020-10-20 06:47:14,391 INFO L796 eck$LassoCheckResult]: Loop: 7968#L211 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 8349#L55 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;main_~lk13~0 := 0;main_~lk14~0 := 0; 8346#L88 assume !(0 != main_~p1~0); 8343#L88-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 8341#L92-1 assume !(0 != main_~p3~0); 8338#L96-1 assume !(0 != main_~p4~0); 8335#L100-1 assume !(0 != main_~p5~0); 8284#L104-1 assume !(0 != main_~p6~0); 8279#L108-1 assume !(0 != main_~p7~0); 8277#L112-1 assume !(0 != main_~p8~0); 8275#L116-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 8273#L120-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 8271#L124-1 assume !(0 != main_~p11~0); 8268#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 8266#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 8264#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 8259#L140-1 assume !(0 != main_~p1~0); 8257#L146-1 assume 0 != main_~p2~0; 8255#L152 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 8201#L151 assume !(0 != main_~p3~0); 8190#L156-1 assume !(0 != main_~p4~0); 8192#L161-1 assume !(0 != main_~p5~0); 8377#L166-1 assume !(0 != main_~p6~0); 8376#L171-1 assume !(0 != main_~p7~0); 8374#L176-1 assume !(0 != main_~p8~0); 8373#L181-1 assume !(0 != main_~p9~0); 8369#L186-1 assume !(0 != main_~p10~0); 8366#L191-1 assume !(0 != main_~p11~0); 8362#L196-1 assume !(0 != main_~p12~0); 8358#L201-1 assume !(0 != main_~p13~0); 8354#L206-1 assume 0 != main_~p14~0; 8352#L212 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 7968#L211 [2020-10-20 06:47:14,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:14,392 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2020-10-20 06:47:14,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:14,392 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158987647] [2020-10-20 06:47:14,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:14,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:14,410 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:14,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:14,426 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:14,434 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:14,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:14,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1028706055, now seen corresponding path program 1 times [2020-10-20 06:47:14,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:14,435 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086933320] [2020-10-20 06:47:14,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:14,491 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-20 06:47:14,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086933320] [2020-10-20 06:47:14,491 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:14,491 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:14,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971559945] [2020-10-20 06:47:14,492 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:14,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:14,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:14,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:14,494 INFO L87 Difference]: Start difference. First operand 2626 states and 3906 transitions. cyclomatic complexity: 1344 Second operand 3 states. [2020-10-20 06:47:14,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:14,531 INFO L93 Difference]: Finished difference Result 5186 states and 7618 transitions. [2020-10-20 06:47:14,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:14,532 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5186 states and 7618 transitions. [2020-10-20 06:47:14,781 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5184 [2020-10-20 06:47:14,821 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5186 states to 5186 states and 7618 transitions. [2020-10-20 06:47:14,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5186 [2020-10-20 06:47:14,828 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5186 [2020-10-20 06:47:14,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5186 states and 7618 transitions. [2020-10-20 06:47:14,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:14,841 INFO L691 BuchiCegarLoop]: Abstraction has 5186 states and 7618 transitions. [2020-10-20 06:47:14,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5186 states and 7618 transitions. [2020-10-20 06:47:14,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5186 to 5186. [2020-10-20 06:47:14,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5186 states. [2020-10-20 06:47:14,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5186 states to 5186 states and 7618 transitions. [2020-10-20 06:47:14,992 INFO L714 BuchiCegarLoop]: Abstraction has 5186 states and 7618 transitions. [2020-10-20 06:47:14,992 INFO L594 BuchiCegarLoop]: Abstraction has 5186 states and 7618 transitions. [2020-10-20 06:47:14,992 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 06:47:14,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5186 states and 7618 transitions. [2020-10-20 06:47:15,052 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5184 [2020-10-20 06:47:15,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:15,053 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:15,053 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:15,054 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, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:15,054 INFO L794 eck$LassoCheckResult]: Stem: 15816#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 15784#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_#t~nondet20, main_#t~nondet21, 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_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~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;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 15785#L211 [2020-10-20 06:47:15,055 INFO L796 eck$LassoCheckResult]: Loop: 15785#L211 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 16140#L55 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;main_~lk13~0 := 0;main_~lk14~0 := 0; 16137#L88 assume !(0 != main_~p1~0); 16132#L88-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 16128#L92-1 assume !(0 != main_~p3~0); 16121#L96-1 assume !(0 != main_~p4~0); 16114#L100-1 assume !(0 != main_~p5~0); 16115#L104-1 assume !(0 != main_~p6~0); 16092#L108-1 assume !(0 != main_~p7~0); 16089#L112-1 assume !(0 != main_~p8~0); 16087#L116-1 assume !(0 != main_~p9~0); 16085#L120-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 16082#L124-1 assume !(0 != main_~p11~0); 16078#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 16074#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 16069#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 16036#L140-1 assume !(0 != main_~p1~0); 16030#L146-1 assume 0 != main_~p2~0; 16024#L152 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 16020#L151 assume !(0 != main_~p3~0); 16013#L156-1 assume !(0 != main_~p4~0); 16015#L161-1 assume !(0 != main_~p5~0); 16168#L166-1 assume !(0 != main_~p6~0); 16164#L171-1 assume !(0 != main_~p7~0); 16160#L176-1 assume !(0 != main_~p8~0); 16158#L181-1 assume !(0 != main_~p9~0); 16156#L186-1 assume !(0 != main_~p10~0); 16154#L191-1 assume !(0 != main_~p11~0); 16152#L196-1 assume !(0 != main_~p12~0); 16149#L201-1 assume !(0 != main_~p13~0); 16145#L206-1 assume 0 != main_~p14~0; 16143#L212 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 15785#L211 [2020-10-20 06:47:15,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:15,055 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2020-10-20 06:47:15,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:15,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964889230] [2020-10-20 06:47:15,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:15,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:15,080 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:15,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:15,089 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:15,099 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:15,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:15,100 INFO L82 PathProgramCache]: Analyzing trace with hash -809851337, now seen corresponding path program 1 times [2020-10-20 06:47:15,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:15,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295059612] [2020-10-20 06:47:15,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:15,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:15,136 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-20 06:47:15,136 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295059612] [2020-10-20 06:47:15,136 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:15,136 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:15,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174704692] [2020-10-20 06:47:15,137 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:15,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:15,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:15,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:15,139 INFO L87 Difference]: Start difference. First operand 5186 states and 7618 transitions. cyclomatic complexity: 2560 Second operand 3 states. [2020-10-20 06:47:15,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:15,178 INFO L93 Difference]: Finished difference Result 10242 states and 14850 transitions. [2020-10-20 06:47:15,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:15,179 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10242 states and 14850 transitions. [2020-10-20 06:47:15,500 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 10240 [2020-10-20 06:47:15,568 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10242 states to 10242 states and 14850 transitions. [2020-10-20 06:47:15,569 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10242 [2020-10-20 06:47:15,641 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10242 [2020-10-20 06:47:15,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10242 states and 14850 transitions. [2020-10-20 06:47:15,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:15,658 INFO L691 BuchiCegarLoop]: Abstraction has 10242 states and 14850 transitions. [2020-10-20 06:47:15,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10242 states and 14850 transitions. [2020-10-20 06:47:15,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10242 to 10242. [2020-10-20 06:47:15,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10242 states. [2020-10-20 06:47:15,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10242 states to 10242 states and 14850 transitions. [2020-10-20 06:47:15,927 INFO L714 BuchiCegarLoop]: Abstraction has 10242 states and 14850 transitions. [2020-10-20 06:47:15,927 INFO L594 BuchiCegarLoop]: Abstraction has 10242 states and 14850 transitions. [2020-10-20 06:47:15,927 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-20 06:47:15,927 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10242 states and 14850 transitions. [2020-10-20 06:47:15,971 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 10240 [2020-10-20 06:47:15,972 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:15,972 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:15,972 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:15,973 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, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:15,973 INFO L794 eck$LassoCheckResult]: Stem: 31249#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 31218#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_#t~nondet20, main_#t~nondet21, 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_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~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;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 31219#L211 [2020-10-20 06:47:15,975 INFO L796 eck$LassoCheckResult]: Loop: 31219#L211 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 31797#L55 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;main_~lk13~0 := 0;main_~lk14~0 := 0; 31793#L88 assume !(0 != main_~p1~0); 31791#L88-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 31789#L92-1 assume !(0 != main_~p3~0); 31785#L96-1 assume !(0 != main_~p4~0); 31783#L100-1 assume !(0 != main_~p5~0); 31780#L104-1 assume !(0 != main_~p6~0); 31774#L108-1 assume !(0 != main_~p7~0); 31768#L112-1 assume !(0 != main_~p8~0); 31764#L116-1 assume !(0 != main_~p9~0); 31761#L120-1 assume !(0 != main_~p10~0); 31757#L124-1 assume !(0 != main_~p11~0); 31754#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 31751#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 31748#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 31743#L140-1 assume !(0 != main_~p1~0); 31739#L146-1 assume 0 != main_~p2~0; 31736#L152 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 31730#L151 assume !(0 != main_~p3~0); 31381#L156-1 assume !(0 != main_~p4~0); 31383#L161-1 assume !(0 != main_~p5~0); 31708#L166-1 assume !(0 != main_~p6~0); 31709#L171-1 assume !(0 != main_~p7~0); 31690#L176-1 assume !(0 != main_~p8~0); 31692#L181-1 assume !(0 != main_~p9~0); 31816#L186-1 assume !(0 != main_~p10~0); 31813#L191-1 assume !(0 != main_~p11~0); 31809#L196-1 assume !(0 != main_~p12~0); 31805#L201-1 assume !(0 != main_~p13~0); 31802#L206-1 assume 0 != main_~p14~0; 31800#L212 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 31219#L211 [2020-10-20 06:47:15,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:15,975 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2020-10-20 06:47:15,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:15,976 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330431257] [2020-10-20 06:47:15,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:15,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:15,988 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:15,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:15,996 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:16,003 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:16,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:16,004 INFO L82 PathProgramCache]: Analyzing trace with hash -387149511, now seen corresponding path program 1 times [2020-10-20 06:47:16,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:16,005 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147332496] [2020-10-20 06:47:16,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:16,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:16,042 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-20 06:47:16,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147332496] [2020-10-20 06:47:16,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:16,044 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:16,044 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777946039] [2020-10-20 06:47:16,044 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:16,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:16,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:16,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:16,046 INFO L87 Difference]: Start difference. First operand 10242 states and 14850 transitions. cyclomatic complexity: 4864 Second operand 3 states. [2020-10-20 06:47:16,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:16,369 INFO L93 Difference]: Finished difference Result 20226 states and 28930 transitions. [2020-10-20 06:47:16,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:16,370 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20226 states and 28930 transitions. [2020-10-20 06:47:16,541 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 20224 [2020-10-20 06:47:16,692 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20226 states to 20226 states and 28930 transitions. [2020-10-20 06:47:16,693 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20226 [2020-10-20 06:47:16,709 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20226 [2020-10-20 06:47:16,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20226 states and 28930 transitions. [2020-10-20 06:47:16,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:16,742 INFO L691 BuchiCegarLoop]: Abstraction has 20226 states and 28930 transitions. [2020-10-20 06:47:16,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20226 states and 28930 transitions. [2020-10-20 06:47:17,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20226 to 20226. [2020-10-20 06:47:17,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20226 states. [2020-10-20 06:47:17,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20226 states to 20226 states and 28930 transitions. [2020-10-20 06:47:17,699 INFO L714 BuchiCegarLoop]: Abstraction has 20226 states and 28930 transitions. [2020-10-20 06:47:17,699 INFO L594 BuchiCegarLoop]: Abstraction has 20226 states and 28930 transitions. [2020-10-20 06:47:17,699 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-20 06:47:17,699 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20226 states and 28930 transitions. [2020-10-20 06:47:17,816 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 20224 [2020-10-20 06:47:17,820 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:17,820 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:17,820 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:17,821 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, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:17,821 INFO L794 eck$LassoCheckResult]: Stem: 61730#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 61692#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_#t~nondet20, main_#t~nondet21, 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_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~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;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 61693#L211 [2020-10-20 06:47:17,821 INFO L796 eck$LassoCheckResult]: Loop: 61693#L211 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 61869#L55 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;main_~lk13~0 := 0;main_~lk14~0 := 0; 61865#L88 assume !(0 != main_~p1~0); 61861#L88-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 61857#L92-1 assume !(0 != main_~p3~0); 61850#L96-1 assume !(0 != main_~p4~0); 61842#L100-1 assume !(0 != main_~p5~0); 61834#L104-1 assume !(0 != main_~p6~0); 61826#L108-1 assume !(0 != main_~p7~0); 61818#L112-1 assume !(0 != main_~p8~0); 61810#L116-1 assume !(0 != main_~p9~0); 61802#L120-1 assume !(0 != main_~p10~0); 61797#L124-1 assume !(0 != main_~p11~0); 61792#L128-1 assume !(0 != main_~p12~0); 61786#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 61787#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 61779#L140-1 assume !(0 != main_~p1~0); 61780#L146-1 assume 0 != main_~p2~0; 61967#L152 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 61955#L151 assume !(0 != main_~p3~0); 61947#L156-1 assume !(0 != main_~p4~0); 61939#L161-1 assume !(0 != main_~p5~0); 61931#L166-1 assume !(0 != main_~p6~0); 61923#L171-1 assume !(0 != main_~p7~0); 61917#L176-1 assume !(0 != main_~p8~0); 61911#L181-1 assume !(0 != main_~p9~0); 61909#L186-1 assume !(0 != main_~p10~0); 61900#L191-1 assume !(0 != main_~p11~0); 61895#L196-1 assume !(0 != main_~p12~0); 61886#L201-1 assume !(0 != main_~p13~0); 61880#L206-1 assume 0 != main_~p14~0; 61876#L212 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 61693#L211 [2020-10-20 06:47:17,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:17,821 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2020-10-20 06:47:17,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:17,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924414168] [2020-10-20 06:47:17,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:17,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:17,832 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:17,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:17,842 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:17,855 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:17,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:17,858 INFO L82 PathProgramCache]: Analyzing trace with hash -2076093253, now seen corresponding path program 1 times [2020-10-20 06:47:17,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:17,859 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938673889] [2020-10-20 06:47:17,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:17,887 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-20 06:47:17,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938673889] [2020-10-20 06:47:17,888 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:17,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:17,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694935522] [2020-10-20 06:47:17,890 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:17,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:17,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:17,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:17,890 INFO L87 Difference]: Start difference. First operand 20226 states and 28930 transitions. cyclomatic complexity: 9216 Second operand 3 states. [2020-10-20 06:47:18,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:18,393 INFO L93 Difference]: Finished difference Result 39938 states and 56322 transitions. [2020-10-20 06:47:18,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:18,394 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39938 states and 56322 transitions. [2020-10-20 06:47:18,620 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 39936 [2020-10-20 06:47:18,838 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39938 states to 39938 states and 56322 transitions. [2020-10-20 06:47:18,838 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39938 [2020-10-20 06:47:18,865 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39938 [2020-10-20 06:47:18,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39938 states and 56322 transitions. [2020-10-20 06:47:18,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:18,974 INFO L691 BuchiCegarLoop]: Abstraction has 39938 states and 56322 transitions. [2020-10-20 06:47:18,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39938 states and 56322 transitions. [2020-10-20 06:47:20,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39938 to 39938. [2020-10-20 06:47:20,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39938 states. [2020-10-20 06:47:21,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39938 states to 39938 states and 56322 transitions. [2020-10-20 06:47:21,015 INFO L714 BuchiCegarLoop]: Abstraction has 39938 states and 56322 transitions. [2020-10-20 06:47:21,016 INFO L594 BuchiCegarLoop]: Abstraction has 39938 states and 56322 transitions. [2020-10-20 06:47:21,016 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-20 06:47:21,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39938 states and 56322 transitions. [2020-10-20 06:47:21,285 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 39936 [2020-10-20 06:47:21,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:21,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:21,289 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:21,290 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, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:21,290 INFO L794 eck$LassoCheckResult]: Stem: 121892#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 121861#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_#t~nondet20, main_#t~nondet21, 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_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~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;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 121862#L211 [2020-10-20 06:47:21,291 INFO L796 eck$LassoCheckResult]: Loop: 121862#L211 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 122137#L55 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;main_~lk13~0 := 0;main_~lk14~0 := 0; 122133#L88 assume !(0 != main_~p1~0); 122130#L88-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 122125#L92-1 assume !(0 != main_~p3~0); 122118#L96-1 assume !(0 != main_~p4~0); 122111#L100-1 assume !(0 != main_~p5~0); 122104#L104-1 assume !(0 != main_~p6~0); 122098#L108-1 assume !(0 != main_~p7~0); 122090#L112-1 assume !(0 != main_~p8~0); 122081#L116-1 assume !(0 != main_~p9~0); 122073#L120-1 assume !(0 != main_~p10~0); 121964#L124-1 assume !(0 != main_~p11~0); 121960#L128-1 assume !(0 != main_~p12~0); 121949#L132-1 assume !(0 != main_~p13~0); 121950#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 121941#L140-1 assume !(0 != main_~p1~0); 121942#L146-1 assume 0 != main_~p2~0; 121934#L152 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 121935#L151 assume !(0 != main_~p3~0); 121925#L156-1 assume !(0 != main_~p4~0); 121927#L161-1 assume !(0 != main_~p5~0); 122319#L166-1 assume !(0 != main_~p6~0); 122315#L171-1 assume !(0 != main_~p7~0); 122311#L176-1 assume !(0 != main_~p8~0); 122307#L181-1 assume !(0 != main_~p9~0); 122303#L186-1 assume !(0 != main_~p10~0); 122175#L191-1 assume !(0 != main_~p11~0); 122158#L196-1 assume !(0 != main_~p12~0); 122154#L201-1 assume !(0 != main_~p13~0); 122149#L206-1 assume 0 != main_~p14~0; 122145#L212 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 121862#L211 [2020-10-20 06:47:21,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:21,291 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2020-10-20 06:47:21,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:21,292 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723048932] [2020-10-20 06:47:21,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:21,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:21,305 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:21,318 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:21,330 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:21,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:21,332 INFO L82 PathProgramCache]: Analyzing trace with hash 224729337, now seen corresponding path program 1 times [2020-10-20 06:47:21,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:21,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524895529] [2020-10-20 06:47:21,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:21,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:21,344 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:21,348 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:21,355 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:21,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:21,356 INFO L82 PathProgramCache]: Analyzing trace with hash -233466693, now seen corresponding path program 1 times [2020-10-20 06:47:21,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:21,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753812134] [2020-10-20 06:47:21,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:21,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:21,368 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:21,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:21,375 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:21,386 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:21,508 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-10-20 06:47:21,700 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-10-20 06:47:22,066 WARN L193 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 93 [2020-10-20 06:47:22,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 06:47:22 BoogieIcfgContainer [2020-10-20 06:47:22,239 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 06:47:22,239 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 06:47:22,239 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 06:47:22,240 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 06:47:22,240 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:47:12" (3/4) ... [2020-10-20 06:47:22,389 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-20 06:47:22,513 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 06:47:22,513 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 06:47:22,515 INFO L168 Benchmark]: Toolchain (without parser) took 10628.04 ms. Allocated memory was 38.8 MB in the beginning and 325.1 MB in the end (delta: 286.3 MB). Free memory was 15.2 MB in the beginning and 118.3 MB in the end (delta: -103.1 MB). Peak memory consumption was 235.3 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:22,516 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 29.9 MB. Free memory is still 15.6 MB. There was no memory consumed. Max. memory is 14.3 GB. [2020-10-20 06:47:22,517 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.75 ms. Allocated memory was 38.8 MB in the beginning and 39.3 MB in the end (delta: 524.3 kB). Free memory was 14.3 MB in the beginning and 12.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 5.9 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:22,522 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.99 ms. Allocated memory is still 39.3 MB. Free memory was 12.4 MB in the beginning and 10.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:22,523 INFO L168 Benchmark]: Boogie Preprocessor took 34.33 ms. Allocated memory was 39.3 MB in the beginning and 41.4 MB in the end (delta: 2.1 MB). Free memory was 10.5 MB in the beginning and 24.6 MB in the end (delta: -14.1 MB). Peak memory consumption was 1.6 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:22,524 INFO L168 Benchmark]: RCFGBuilder took 450.77 ms. Allocated memory is still 41.4 MB. Free memory was 24.6 MB in the beginning and 15.3 MB in the end (delta: 9.2 MB). Peak memory consumption was 15.6 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:22,524 INFO L168 Benchmark]: BuchiAutomizer took 9497.81 ms. Allocated memory was 41.4 MB in the beginning and 319.3 MB in the end (delta: 277.9 MB). Free memory was 15.3 MB in the beginning and 60.4 MB in the end (delta: -45.1 MB). Peak memory consumption was 232.8 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:22,525 INFO L168 Benchmark]: Witness Printer took 274.27 ms. Allocated memory was 319.3 MB in the beginning and 325.1 MB in the end (delta: 5.8 MB). Free memory was 60.4 MB in the beginning and 118.3 MB in the end (delta: -57.9 MB). Peak memory consumption was 8.2 kB. Max. memory is 14.3 GB. [2020-10-20 06:47:22,529 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.27 ms. Allocated memory is still 29.9 MB. Free memory is still 15.6 MB. There was no memory consumed. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 318.75 ms. Allocated memory was 38.8 MB in the beginning and 39.3 MB in the end (delta: 524.3 kB). Free memory was 14.3 MB in the beginning and 12.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 5.9 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 42.99 ms. Allocated memory is still 39.3 MB. Free memory was 12.4 MB in the beginning and 10.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 34.33 ms. Allocated memory was 39.3 MB in the beginning and 41.4 MB in the end (delta: 2.1 MB). Free memory was 10.5 MB in the beginning and 24.6 MB in the end (delta: -14.1 MB). Peak memory consumption was 1.6 MB. Max. memory is 14.3 GB. * RCFGBuilder took 450.77 ms. Allocated memory is still 41.4 MB. Free memory was 24.6 MB in the beginning and 15.3 MB in the end (delta: 9.2 MB). Peak memory consumption was 15.6 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 9497.81 ms. Allocated memory was 41.4 MB in the beginning and 319.3 MB in the end (delta: 277.9 MB). Free memory was 15.3 MB in the beginning and 60.4 MB in the end (delta: -45.1 MB). Peak memory consumption was 232.8 MB. Max. memory is 14.3 GB. * Witness Printer took 274.27 ms. Allocated memory was 319.3 MB in the beginning and 325.1 MB in the end (delta: 5.8 MB). Free memory was 60.4 MB in the beginning and 118.3 MB in the end (delta: -57.9 MB). Peak memory consumption was 8.2 kB. Max. memory is 14.3 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 39938 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.3s and 11 iterations. TraceHistogramMax:1. Analysis of lassos took 1.9s. Construction of modules took 0.3s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 0. Minimization of det autom 10. Minimization of nondet autom 0. Automata minimization 3.6s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 1.5s Buchi closure took 0.1s. Biggest automaton had 39938 states and ocurred in iteration 10. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1083 SDtfs, 551 SDslu, 679 SDs, 0 SdLazy, 50 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s 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: 53]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=3153} State at position 1 is {NULL=0, p1=0, p3=0, p5=0, NULL=3153, p10=0, p7=0, p9=0, lk12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2c8b756c=0, lk14=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@109c1bc3=0, p14=13, lk10=0, p12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7bfa3fa9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4454cf99=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@35f422eb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@26411e2b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@44a09bf8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3ca06621=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4b7754cc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3b450c62=0, NULL=0, NULL=0, lk3=0, lk5=0, NULL=0, lk1=0, lk7=0, lk9=0, NULL=3155, \result=0, p2=11, p4=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7d28206e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@273e6ad2=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6c129d50=0, lk13=0, p13=0, p11=0, lk11=0, cond=14, NULL=3156, NULL=0, NULL=3154, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@cec7a3d=0, lk4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6e26543e=14, lk6=0, lk2=0, lk8=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 53]: 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; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L51] int cond; Loop: [L53] COND TRUE 1 [L54] cond = __VERIFIER_nondet_int() [L55] COND FALSE !(cond == 0) [L58] lk1 = 0 [L60] lk2 = 0 [L62] lk3 = 0 [L64] lk4 = 0 [L66] lk5 = 0 [L68] lk6 = 0 [L70] lk7 = 0 [L72] lk8 = 0 [L74] lk9 = 0 [L76] lk10 = 0 [L78] lk11 = 0 [L80] lk12 = 0 [L82] lk13 = 0 [L84] lk14 = 0 [L88] COND FALSE !(p1 != 0) [L92] COND TRUE p2 != 0 [L93] lk2 = 1 [L96] COND FALSE !(p3 != 0) [L100] COND FALSE !(p4 != 0) [L104] COND FALSE !(p5 != 0) [L108] COND FALSE !(p6 != 0) [L112] COND FALSE !(p7 != 0) [L116] COND FALSE !(p8 != 0) [L120] COND FALSE !(p9 != 0) [L124] COND FALSE !(p10 != 0) [L128] COND FALSE !(p11 != 0) [L132] COND FALSE !(p12 != 0) [L136] COND FALSE !(p13 != 0) [L140] COND TRUE p14 != 0 [L141] lk14 = 1 [L146] COND FALSE !(p1 != 0) [L151] COND TRUE p2 != 0 [L152] COND FALSE !(lk2 != 1) [L153] lk2 = 0 [L156] COND FALSE !(p3 != 0) [L161] COND FALSE !(p4 != 0) [L166] COND FALSE !(p5 != 0) [L171] COND FALSE !(p6 != 0) [L176] COND FALSE !(p7 != 0) [L181] COND FALSE !(p8 != 0) [L186] COND FALSE !(p9 != 0) [L191] COND FALSE !(p10 != 0) [L196] COND FALSE !(p11 != 0) [L201] COND FALSE !(p12 != 0) [L206] COND FALSE !(p13 != 0) [L211] COND TRUE p14 != 0 [L212] COND FALSE !(lk14 != 1) [L213] lk14 = 0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...