./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_15-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 906a4fb5 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/locks/test_locks_15-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 87d55100d8515cc1c8c9aa61ce99443e0eafb474 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.25-906a4fb [2020-10-19 18:54:13,210 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-19 18:54:13,212 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-19 18:54:13,236 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-19 18:54:13,236 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-19 18:54:13,237 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-19 18:54:13,239 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-19 18:54:13,241 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-19 18:54:13,243 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-19 18:54:13,244 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-19 18:54:13,245 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-19 18:54:13,246 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-19 18:54:13,246 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-19 18:54:13,247 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-19 18:54:13,249 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-19 18:54:13,250 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-19 18:54:13,251 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-19 18:54:13,252 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-19 18:54:13,254 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-19 18:54:13,255 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-19 18:54:13,257 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-19 18:54:13,258 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-19 18:54:13,259 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-19 18:54:13,260 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-19 18:54:13,263 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-19 18:54:13,263 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-19 18:54:13,263 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-19 18:54:13,264 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-19 18:54:13,265 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-19 18:54:13,266 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-19 18:54:13,266 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-19 18:54:13,267 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-19 18:54:13,268 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-19 18:54:13,268 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-19 18:54:13,269 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-19 18:54:13,270 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-19 18:54:13,270 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-19 18:54:13,271 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-19 18:54:13,271 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-19 18:54:13,272 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-19 18:54:13,273 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-19 18:54:13,273 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-19 18:54:13,299 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-19 18:54:13,299 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-19 18:54:13,301 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-19 18:54:13,301 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-19 18:54:13,301 INFO L138 SettingsManager]: * Use SBE=true [2020-10-19 18:54:13,301 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-19 18:54:13,302 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-19 18:54:13,302 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-19 18:54:13,302 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-19 18:54:13,302 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-19 18:54:13,302 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-19 18:54:13,303 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-19 18:54:13,303 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-19 18:54:13,303 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-19 18:54:13,303 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-19 18:54:13,304 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-19 18:54:13,304 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-19 18:54:13,304 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-19 18:54:13,304 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-19 18:54:13,304 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-19 18:54:13,305 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-19 18:54:13,305 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-19 18:54:13,305 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-19 18:54:13,305 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-19 18:54:13,305 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-19 18:54:13,306 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-19 18:54:13,306 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-19 18:54:13,306 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-19 18:54:13,306 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-19 18:54:13,307 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-19 18:54:13,307 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-19 18:54:13,307 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-19 18:54:13,308 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-19 18:54:13,308 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 -> 87d55100d8515cc1c8c9aa61ce99443e0eafb474 [2020-10-19 18:54:13,663 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-19 18:54:13,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-19 18:54:13,689 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-19 18:54:13,691 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-19 18:54:13,691 INFO L275 PluginConnector]: CDTParser initialized [2020-10-19 18:54:13,692 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_15-2.c [2020-10-19 18:54:13,750 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8ee07cd0/ab4f0b8f7f8f488894522eee0b18c812/FLAGbe510a9cc [2020-10-19 18:54:14,232 INFO L306 CDTParser]: Found 1 translation units. [2020-10-19 18:54:14,233 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-2.c [2020-10-19 18:54:14,242 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8ee07cd0/ab4f0b8f7f8f488894522eee0b18c812/FLAGbe510a9cc [2020-10-19 18:54:14,597 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8ee07cd0/ab4f0b8f7f8f488894522eee0b18c812 [2020-10-19 18:54:14,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-19 18:54:14,608 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-19 18:54:14,610 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-19 18:54:14,610 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-19 18:54:14,614 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-19 18:54:14,615 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 06:54:14" (1/1) ... [2020-10-19 18:54:14,618 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@435a68c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:54:14, skipping insertion in model container [2020-10-19 18:54:14,619 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 06:54:14" (1/1) ... [2020-10-19 18:54:14,627 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-19 18:54:14,671 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-19 18:54:14,877 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 18:54:14,892 INFO L203 MainTranslator]: Completed pre-run [2020-10-19 18:54:14,924 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 18:54:15,011 INFO L208 MainTranslator]: Completed translation [2020-10-19 18:54:15,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:54:15 WrapperNode [2020-10-19 18:54:15,015 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-19 18:54:15,016 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-19 18:54:15,017 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-19 18:54:15,017 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-19 18:54:15,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:54:15" (1/1) ... [2020-10-19 18:54:15,037 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:54:15" (1/1) ... [2020-10-19 18:54:15,066 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-19 18:54:15,067 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-19 18:54:15,067 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-19 18:54:15,067 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-19 18:54:15,077 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:54:15" (1/1) ... [2020-10-19 18:54:15,078 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:54:15" (1/1) ... [2020-10-19 18:54:15,080 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:54:15" (1/1) ... [2020-10-19 18:54:15,081 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:54:15" (1/1) ... [2020-10-19 18:54:15,086 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:54:15" (1/1) ... [2020-10-19 18:54:15,093 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:54:15" (1/1) ... [2020-10-19 18:54:15,095 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:54:15" (1/1) ... [2020-10-19 18:54:15,099 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-19 18:54:15,099 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-19 18:54:15,100 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-19 18:54:15,100 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-19 18:54:15,101 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:54:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:54:15,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-19 18:54:15,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-19 18:54:15,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-19 18:54:15,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-19 18:54:15,621 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-19 18:54:15,621 INFO L298 CfgBuilder]: Removed 7 assume(true) statements. [2020-10-19 18:54:15,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:54:15 BoogieIcfgContainer [2020-10-19 18:54:15,623 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-19 18:54:15,624 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-19 18:54:15,624 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-19 18:54:15,628 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-19 18:54:15,629 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:54:15,629 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.10 06:54:14" (1/3) ... [2020-10-19 18:54:15,630 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@544bace2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 06:54:15, skipping insertion in model container [2020-10-19 18:54:15,631 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:54:15,631 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:54:15" (2/3) ... [2020-10-19 18:54:15,631 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@544bace2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 06:54:15, skipping insertion in model container [2020-10-19 18:54:15,631 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:54:15,631 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:54:15" (3/3) ... [2020-10-19 18:54:15,633 INFO L373 chiAutomizerObserver]: Analyzing ICFG test_locks_15-2.c [2020-10-19 18:54:15,681 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-19 18:54:15,682 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-19 18:54:15,682 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-19 18:54:15,682 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-19 18:54:15,682 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-19 18:54:15,683 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-19 18:54:15,683 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-19 18:54:15,683 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-19 18:54:15,698 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states. [2020-10-19 18:54:15,723 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2020-10-19 18:54:15,724 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:54:15,724 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:54:15,730 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:54:15,731 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-19 18:54:15,731 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-19 18:54:15,731 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states. [2020-10-19 18:54:15,736 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2020-10-19 18:54:15,736 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:54:15,736 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:54:15,737 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:54:15,738 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-19 18:54:15,744 INFO L794 eck$LassoCheckResult]: Stem: 26#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_#t~nondet22, 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_~p15~0, main_~lk15~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;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 52#L225-1true [2020-10-19 18:54:15,746 INFO L796 eck$LassoCheckResult]: Loop: 52#L225-1true assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 3#L58true 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;main_~lk15~0 := 0; 36#L93true assume 0 != main_~p1~0;main_~lk1~0 := 1; 33#L93-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 53#L97-1true assume !(0 != main_~p3~0); 56#L101-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 48#L105-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 14#L109-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 5#L113-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 8#L117-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 29#L121-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 22#L125-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 41#L129-1true assume !(0 != main_~p11~0); 44#L133-1true assume 0 != main_~p12~0;main_~lk12~0 := 1; 38#L137-1true assume 0 != main_~p13~0;main_~lk13~0 := 1; 54#L141-1true assume 0 != main_~p14~0;main_~lk14~0 := 1; 45#L145-1true assume 0 != main_~p15~0;main_~lk15~0 := 1; 50#L149-1true assume !(0 != main_~p1~0); 32#L155-1true assume !(0 != main_~p2~0); 10#L160-1true assume !(0 != main_~p3~0); 31#L165-1true assume !(0 != main_~p4~0); 39#L170-1true assume !(0 != main_~p5~0); 19#L175-1true assume !(0 != main_~p6~0); 24#L180-1true assume !(0 != main_~p7~0); 55#L185-1true assume !(0 != main_~p8~0); 6#L190-1true assume !(0 != main_~p9~0); 42#L195-1true assume !(0 != main_~p10~0); 47#L200-1true assume !(0 != main_~p11~0); 28#L205-1true assume !(0 != main_~p12~0); 35#L210-1true assume !(0 != main_~p13~0); 12#L215-1true assume !(0 != main_~p14~0); 21#L220-1true assume !(0 != main_~p15~0); 52#L225-1true [2020-10-19 18:54:15,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:15,752 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-19 18:54:15,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:15,763 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778896227] [2020-10-19 18:54:15,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:15,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:15,871 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:15,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:15,892 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:15,916 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:54:15,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:15,918 INFO L82 PathProgramCache]: Analyzing trace with hash 2064553094, now seen corresponding path program 1 times [2020-10-19 18:54:15,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:15,918 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960065582] [2020-10-19 18:54:15,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:15,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:54:16,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:54:16,017 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960065582] [2020-10-19 18:54:16,018 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:54:16,018 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 18:54:16,019 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016871085] [2020-10-19 18:54:16,025 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 18:54:16,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:54:16,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 18:54:16,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 18:54:16,042 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 3 states. [2020-10-19 18:54:16,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:54:16,121 INFO L93 Difference]: Finished difference Result 105 states and 190 transitions. [2020-10-19 18:54:16,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 18:54:16,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 190 transitions. [2020-10-19 18:54:16,131 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2020-10-19 18:54:16,137 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 95 states and 153 transitions. [2020-10-19 18:54:16,138 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2020-10-19 18:54:16,139 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2020-10-19 18:54:16,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 153 transitions. [2020-10-19 18:54:16,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:54:16,141 INFO L691 BuchiCegarLoop]: Abstraction has 95 states and 153 transitions. [2020-10-19 18:54:16,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 153 transitions. [2020-10-19 18:54:16,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2020-10-19 18:54:16,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-10-19 18:54:16,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 153 transitions. [2020-10-19 18:54:16,180 INFO L714 BuchiCegarLoop]: Abstraction has 95 states and 153 transitions. [2020-10-19 18:54:16,181 INFO L594 BuchiCegarLoop]: Abstraction has 95 states and 153 transitions. [2020-10-19 18:54:16,181 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-19 18:54:16,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 153 transitions. [2020-10-19 18:54:16,183 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2020-10-19 18:54:16,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:54:16,184 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:54:16,184 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:54:16,185 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-19 18:54:16,185 INFO L794 eck$LassoCheckResult]: Stem: 201#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); 181#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_#t~nondet22, 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_~p15~0, main_~lk15~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;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 182#L225-1 [2020-10-19 18:54:16,185 INFO L796 eck$LassoCheckResult]: Loop: 182#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 171#L58 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;main_~lk15~0 := 0; 172#L93 assume !(0 != main_~p1~0); 226#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 224#L97-1 assume !(0 != main_~p3~0); 225#L101-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 222#L105-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 191#L109-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 173#L113-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 174#L117-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 180#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 199#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 200#L129-1 assume !(0 != main_~p11~0); 214#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 211#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 212#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 218#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 219#L149-1 assume !(0 != main_~p1~0); 207#L155-1 assume !(0 != main_~p2~0); 183#L160-1 assume !(0 != main_~p3~0); 185#L165-1 assume !(0 != main_~p4~0); 187#L170-1 assume !(0 != main_~p5~0); 194#L175-1 assume !(0 != main_~p6~0); 196#L180-1 assume !(0 != main_~p7~0); 170#L185-1 assume !(0 != main_~p8~0); 175#L190-1 assume !(0 != main_~p9~0); 177#L195-1 assume !(0 != main_~p10~0); 247#L200-1 assume !(0 != main_~p11~0); 203#L205-1 assume !(0 != main_~p12~0); 205#L210-1 assume !(0 != main_~p13~0); 188#L215-1 assume !(0 != main_~p14~0); 189#L220-1 assume !(0 != main_~p15~0); 182#L225-1 [2020-10-19 18:54:16,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:16,186 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-10-19 18:54:16,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:16,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606134140] [2020-10-19 18:54:16,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:16,203 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:16,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:16,216 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:16,222 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:54:16,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:16,223 INFO L82 PathProgramCache]: Analyzing trace with hash 2087185348, now seen corresponding path program 1 times [2020-10-19 18:54:16,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:16,224 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896033789] [2020-10-19 18:54:16,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:16,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:54:16,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:54:16,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896033789] [2020-10-19 18:54:16,266 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:54:16,266 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 18:54:16,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332001915] [2020-10-19 18:54:16,267 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 18:54:16,268 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:54:16,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 18:54:16,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 18:54:16,268 INFO L87 Difference]: Start difference. First operand 95 states and 153 transitions. cyclomatic complexity: 60 Second operand 3 states. [2020-10-19 18:54:16,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:54:16,306 INFO L93 Difference]: Finished difference Result 186 states and 298 transitions. [2020-10-19 18:54:16,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 18:54:16,307 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 298 transitions. [2020-10-19 18:54:16,311 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2020-10-19 18:54:16,313 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 186 states and 298 transitions. [2020-10-19 18:54:16,314 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 186 [2020-10-19 18:54:16,314 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 186 [2020-10-19 18:54:16,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 186 states and 298 transitions. [2020-10-19 18:54:16,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:54:16,316 INFO L691 BuchiCegarLoop]: Abstraction has 186 states and 298 transitions. [2020-10-19 18:54:16,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states and 298 transitions. [2020-10-19 18:54:16,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2020-10-19 18:54:16,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-10-19 18:54:16,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 298 transitions. [2020-10-19 18:54:16,331 INFO L714 BuchiCegarLoop]: Abstraction has 186 states and 298 transitions. [2020-10-19 18:54:16,331 INFO L594 BuchiCegarLoop]: Abstraction has 186 states and 298 transitions. [2020-10-19 18:54:16,332 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-19 18:54:16,332 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 186 states and 298 transitions. [2020-10-19 18:54:16,335 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2020-10-19 18:54:16,335 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:54:16,335 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:54:16,336 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:54:16,336 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-19 18:54:16,336 INFO L794 eck$LassoCheckResult]: Stem: 487#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); 468#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_#t~nondet22, 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_~p15~0, main_~lk15~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;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 469#L225-1 [2020-10-19 18:54:16,336 INFO L796 eck$LassoCheckResult]: Loop: 469#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 517#L58 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;main_~lk15~0 := 0; 514#L93 assume !(0 != main_~p1~0); 515#L93-2 assume !(0 != main_~p2~0); 588#L97-1 assume !(0 != main_~p3~0); 587#L101-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 586#L105-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 585#L109-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 584#L113-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 583#L117-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 582#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 581#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 580#L129-1 assume !(0 != main_~p11~0); 579#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 578#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 577#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 576#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 574#L149-1 assume !(0 != main_~p1~0); 572#L155-1 assume !(0 != main_~p2~0); 570#L160-1 assume !(0 != main_~p3~0); 566#L165-1 assume !(0 != main_~p4~0); 561#L170-1 assume !(0 != main_~p5~0); 558#L175-1 assume !(0 != main_~p6~0); 554#L180-1 assume !(0 != main_~p7~0); 549#L185-1 assume !(0 != main_~p8~0); 546#L190-1 assume !(0 != main_~p9~0); 542#L195-1 assume !(0 != main_~p10~0); 538#L200-1 assume !(0 != main_~p11~0); 534#L205-1 assume !(0 != main_~p12~0); 530#L210-1 assume !(0 != main_~p13~0); 526#L215-1 assume !(0 != main_~p14~0); 522#L220-1 assume !(0 != main_~p15~0); 469#L225-1 [2020-10-19 18:54:16,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:16,337 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2020-10-19 18:54:16,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:16,337 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306070376] [2020-10-19 18:54:16,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:16,351 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:16,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:16,372 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:16,380 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:54:16,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:16,381 INFO L82 PathProgramCache]: Analyzing trace with hash -821578554, now seen corresponding path program 1 times [2020-10-19 18:54:16,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:16,381 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121032099] [2020-10-19 18:54:16,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:54:16,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:54:16,418 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121032099] [2020-10-19 18:54:16,419 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:54:16,419 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 18:54:16,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744718898] [2020-10-19 18:54:16,420 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 18:54:16,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:54:16,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 18:54:16,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 18:54:16,421 INFO L87 Difference]: Start difference. First operand 186 states and 298 transitions. cyclomatic complexity: 116 Second operand 3 states. [2020-10-19 18:54:16,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:54:16,464 INFO L93 Difference]: Finished difference Result 366 states and 582 transitions. [2020-10-19 18:54:16,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 18:54:16,472 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 366 states and 582 transitions. [2020-10-19 18:54:16,478 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2020-10-19 18:54:16,482 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 366 states to 366 states and 582 transitions. [2020-10-19 18:54:16,482 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 366 [2020-10-19 18:54:16,483 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 366 [2020-10-19 18:54:16,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 366 states and 582 transitions. [2020-10-19 18:54:16,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:54:16,487 INFO L691 BuchiCegarLoop]: Abstraction has 366 states and 582 transitions. [2020-10-19 18:54:16,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states and 582 transitions. [2020-10-19 18:54:16,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2020-10-19 18:54:16,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2020-10-19 18:54:16,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 582 transitions. [2020-10-19 18:54:16,510 INFO L714 BuchiCegarLoop]: Abstraction has 366 states and 582 transitions. [2020-10-19 18:54:16,510 INFO L594 BuchiCegarLoop]: Abstraction has 366 states and 582 transitions. [2020-10-19 18:54:16,510 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-19 18:54:16,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 366 states and 582 transitions. [2020-10-19 18:54:16,513 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2020-10-19 18:54:16,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:54:16,514 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:54:16,514 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:54:16,515 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-19 18:54:16,515 INFO L794 eck$LassoCheckResult]: Stem: 1046#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); 1026#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_#t~nondet22, 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_~p15~0, main_~lk15~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;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 1027#L225-1 [2020-10-19 18:54:16,515 INFO L796 eck$LassoCheckResult]: Loop: 1027#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 1080#L58 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;main_~lk15~0 := 0; 1081#L93 assume !(0 != main_~p1~0); 1226#L93-2 assume !(0 != main_~p2~0); 1223#L97-1 assume !(0 != main_~p3~0); 1219#L101-1 assume !(0 != main_~p4~0); 1215#L105-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 1211#L109-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1207#L113-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1203#L117-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1199#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1195#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1191#L129-1 assume !(0 != main_~p11~0); 1187#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 1183#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 1179#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 1175#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 1172#L149-1 assume !(0 != main_~p1~0); 1170#L155-1 assume !(0 != main_~p2~0); 1167#L160-1 assume !(0 != main_~p3~0); 1164#L165-1 assume !(0 != main_~p4~0); 1143#L170-1 assume !(0 != main_~p5~0); 1144#L175-1 assume !(0 != main_~p6~0); 1133#L180-1 assume !(0 != main_~p7~0); 1132#L185-1 assume !(0 != main_~p8~0); 1121#L190-1 assume !(0 != main_~p9~0); 1120#L195-1 assume !(0 != main_~p10~0); 1250#L200-1 assume !(0 != main_~p11~0); 1104#L205-1 assume !(0 != main_~p12~0); 1103#L210-1 assume !(0 != main_~p13~0); 1236#L215-1 assume !(0 != main_~p14~0); 1088#L220-1 assume !(0 != main_~p15~0); 1027#L225-1 [2020-10-19 18:54:16,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:16,516 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2020-10-19 18:54:16,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:16,516 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997249781] [2020-10-19 18:54:16,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:16,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:16,528 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:16,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:16,538 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:16,543 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:54:16,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:16,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1101649480, now seen corresponding path program 1 times [2020-10-19 18:54:16,544 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:16,545 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256701209] [2020-10-19 18:54:16,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:16,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:54:16,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:54:16,581 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256701209] [2020-10-19 18:54:16,582 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:54:16,582 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 18:54:16,582 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871905114] [2020-10-19 18:54:16,583 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 18:54:16,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:54:16,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 18:54:16,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 18:54:16,584 INFO L87 Difference]: Start difference. First operand 366 states and 582 transitions. cyclomatic complexity: 224 Second operand 3 states. [2020-10-19 18:54:16,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:54:16,611 INFO L93 Difference]: Finished difference Result 722 states and 1138 transitions. [2020-10-19 18:54:16,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 18:54:16,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 722 states and 1138 transitions. [2020-10-19 18:54:16,621 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2020-10-19 18:54:16,627 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 722 states to 722 states and 1138 transitions. [2020-10-19 18:54:16,628 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 722 [2020-10-19 18:54:16,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 722 [2020-10-19 18:54:16,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 722 states and 1138 transitions. [2020-10-19 18:54:16,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:54:16,631 INFO L691 BuchiCegarLoop]: Abstraction has 722 states and 1138 transitions. [2020-10-19 18:54:16,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states and 1138 transitions. [2020-10-19 18:54:16,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 722. [2020-10-19 18:54:16,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2020-10-19 18:54:16,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1138 transitions. [2020-10-19 18:54:16,674 INFO L714 BuchiCegarLoop]: Abstraction has 722 states and 1138 transitions. [2020-10-19 18:54:16,675 INFO L594 BuchiCegarLoop]: Abstraction has 722 states and 1138 transitions. [2020-10-19 18:54:16,675 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-19 18:54:16,675 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 722 states and 1138 transitions. [2020-10-19 18:54:16,681 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2020-10-19 18:54:16,681 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:54:16,681 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:54:16,682 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:54:16,682 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-19 18:54:16,682 INFO L794 eck$LassoCheckResult]: Stem: 2140#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); 2120#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_#t~nondet22, 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_~p15~0, main_~lk15~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;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 2121#L225-1 [2020-10-19 18:54:16,683 INFO L796 eck$LassoCheckResult]: Loop: 2121#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 2372#L58 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;main_~lk15~0 := 0; 2369#L93 assume !(0 != main_~p1~0); 2370#L93-2 assume !(0 != main_~p2~0); 2351#L97-1 assume !(0 != main_~p3~0); 2352#L101-1 assume !(0 != main_~p4~0); 2335#L105-1 assume !(0 != main_~p5~0); 2337#L109-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 2319#L113-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2320#L117-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2303#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 2304#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 2287#L129-1 assume !(0 != main_~p11~0); 2288#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 2271#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 2272#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 2243#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 2244#L149-1 assume !(0 != main_~p1~0); 2420#L155-1 assume !(0 != main_~p2~0); 2419#L160-1 assume !(0 != main_~p3~0); 2416#L165-1 assume !(0 != main_~p4~0); 2414#L170-1 assume !(0 != main_~p5~0); 2411#L175-1 assume !(0 != main_~p6~0); 2407#L180-1 assume !(0 != main_~p7~0); 2402#L185-1 assume !(0 != main_~p8~0); 2399#L190-1 assume !(0 != main_~p9~0); 2395#L195-1 assume !(0 != main_~p10~0); 2391#L200-1 assume !(0 != main_~p11~0); 2387#L205-1 assume !(0 != main_~p12~0); 2383#L210-1 assume !(0 != main_~p13~0); 2379#L215-1 assume !(0 != main_~p14~0); 2377#L220-1 assume !(0 != main_~p15~0); 2121#L225-1 [2020-10-19 18:54:16,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:16,683 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2020-10-19 18:54:16,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:16,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472920798] [2020-10-19 18:54:16,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:16,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:16,694 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:16,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:16,703 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:16,708 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:54:16,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:16,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1163689094, now seen corresponding path program 1 times [2020-10-19 18:54:16,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:16,709 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217320245] [2020-10-19 18:54:16,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:16,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:54:16,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:54:16,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217320245] [2020-10-19 18:54:16,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:54:16,752 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 18:54:16,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100050322] [2020-10-19 18:54:16,752 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 18:54:16,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:54:16,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 18:54:16,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 18:54:16,753 INFO L87 Difference]: Start difference. First operand 722 states and 1138 transitions. cyclomatic complexity: 432 Second operand 3 states. [2020-10-19 18:54:16,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:54:16,776 INFO L93 Difference]: Finished difference Result 1426 states and 2226 transitions. [2020-10-19 18:54:16,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 18:54:16,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1426 states and 2226 transitions. [2020-10-19 18:54:16,793 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2020-10-19 18:54:16,804 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1426 states to 1426 states and 2226 transitions. [2020-10-19 18:54:16,805 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1426 [2020-10-19 18:54:16,807 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1426 [2020-10-19 18:54:16,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1426 states and 2226 transitions. [2020-10-19 18:54:16,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:54:16,810 INFO L691 BuchiCegarLoop]: Abstraction has 1426 states and 2226 transitions. [2020-10-19 18:54:16,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states and 2226 transitions. [2020-10-19 18:54:16,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1426. [2020-10-19 18:54:16,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1426 states. [2020-10-19 18:54:16,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 2226 transitions. [2020-10-19 18:54:16,845 INFO L714 BuchiCegarLoop]: Abstraction has 1426 states and 2226 transitions. [2020-10-19 18:54:16,845 INFO L594 BuchiCegarLoop]: Abstraction has 1426 states and 2226 transitions. [2020-10-19 18:54:16,845 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-19 18:54:16,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1426 states and 2226 transitions. [2020-10-19 18:54:16,856 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2020-10-19 18:54:16,856 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:54:16,856 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:54:16,857 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:54:16,857 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-19 18:54:16,857 INFO L794 eck$LassoCheckResult]: Stem: 4294#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); 4274#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_#t~nondet22, 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_~p15~0, main_~lk15~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;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 4275#L225-1 [2020-10-19 18:54:16,858 INFO L796 eck$LassoCheckResult]: Loop: 4275#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 4467#L58 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;main_~lk15~0 := 0; 4464#L93 assume !(0 != main_~p1~0); 4461#L93-2 assume !(0 != main_~p2~0); 4458#L97-1 assume !(0 != main_~p3~0); 4414#L101-1 assume !(0 != main_~p4~0); 4378#L105-1 assume !(0 != main_~p5~0); 4379#L109-1 assume !(0 != main_~p6~0); 4598#L113-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 4596#L117-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 4594#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 4592#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 4589#L129-1 assume !(0 != main_~p11~0); 4586#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 4583#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 4580#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 4578#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 4577#L149-1 assume !(0 != main_~p1~0); 4573#L155-1 assume !(0 != main_~p2~0); 4570#L160-1 assume !(0 != main_~p3~0); 4565#L165-1 assume !(0 != main_~p4~0); 4561#L170-1 assume !(0 != main_~p5~0); 4557#L175-1 assume !(0 != main_~p6~0); 4554#L180-1 assume !(0 != main_~p7~0); 4551#L185-1 assume !(0 != main_~p8~0); 4550#L190-1 assume !(0 != main_~p9~0); 4548#L195-1 assume !(0 != main_~p10~0); 4546#L200-1 assume !(0 != main_~p11~0); 4542#L205-1 assume !(0 != main_~p12~0); 4538#L210-1 assume !(0 != main_~p13~0); 4476#L215-1 assume !(0 != main_~p14~0); 4472#L220-1 assume !(0 != main_~p15~0); 4275#L225-1 [2020-10-19 18:54:16,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:16,858 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2020-10-19 18:54:16,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:16,859 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601146837] [2020-10-19 18:54:16,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:16,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:16,869 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:16,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:16,877 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:16,881 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:54:16,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:16,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1304237704, now seen corresponding path program 1 times [2020-10-19 18:54:16,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:16,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788075101] [2020-10-19 18:54:16,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:16,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:54:16,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:54:16,907 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788075101] [2020-10-19 18:54:16,908 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:54:16,908 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 18:54:16,908 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822792579] [2020-10-19 18:54:16,909 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 18:54:16,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:54:16,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 18:54:16,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 18:54:16,910 INFO L87 Difference]: Start difference. First operand 1426 states and 2226 transitions. cyclomatic complexity: 832 Second operand 3 states. [2020-10-19 18:54:16,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:54:16,940 INFO L93 Difference]: Finished difference Result 2818 states and 4354 transitions. [2020-10-19 18:54:16,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 18:54:16,941 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2818 states and 4354 transitions. [2020-10-19 18:54:16,970 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2020-10-19 18:54:16,996 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2818 states to 2818 states and 4354 transitions. [2020-10-19 18:54:16,996 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2818 [2020-10-19 18:54:17,000 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2818 [2020-10-19 18:54:17,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2818 states and 4354 transitions. [2020-10-19 18:54:17,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:54:17,006 INFO L691 BuchiCegarLoop]: Abstraction has 2818 states and 4354 transitions. [2020-10-19 18:54:17,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states and 4354 transitions. [2020-10-19 18:54:17,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2818. [2020-10-19 18:54:17,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2818 states. [2020-10-19 18:54:17,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 4354 transitions. [2020-10-19 18:54:17,077 INFO L714 BuchiCegarLoop]: Abstraction has 2818 states and 4354 transitions. [2020-10-19 18:54:17,077 INFO L594 BuchiCegarLoop]: Abstraction has 2818 states and 4354 transitions. [2020-10-19 18:54:17,077 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-19 18:54:17,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2818 states and 4354 transitions. [2020-10-19 18:54:17,097 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2020-10-19 18:54:17,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:54:17,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:54:17,098 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:54:17,098 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-19 18:54:17,099 INFO L794 eck$LassoCheckResult]: Stem: 8543#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); 8524#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_#t~nondet22, 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_~p15~0, main_~lk15~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;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 8525#L225-1 [2020-10-19 18:54:17,099 INFO L796 eck$LassoCheckResult]: Loop: 8525#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 8659#L58 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;main_~lk15~0 := 0; 8657#L93 assume !(0 != main_~p1~0); 8655#L93-2 assume !(0 != main_~p2~0); 8654#L97-1 assume !(0 != main_~p3~0); 8652#L101-1 assume !(0 != main_~p4~0); 8650#L105-1 assume !(0 != main_~p5~0); 8651#L109-1 assume !(0 != main_~p6~0); 8725#L113-1 assume !(0 != main_~p7~0); 8722#L117-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 8719#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 8716#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 8713#L129-1 assume !(0 != main_~p11~0); 8710#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 8709#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 8706#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 8704#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 8701#L149-1 assume !(0 != main_~p1~0); 8697#L155-1 assume !(0 != main_~p2~0); 8694#L160-1 assume !(0 != main_~p3~0); 8690#L165-1 assume !(0 != main_~p4~0); 8686#L170-1 assume !(0 != main_~p5~0); 8684#L175-1 assume !(0 != main_~p6~0); 8682#L180-1 assume !(0 != main_~p7~0); 8679#L185-1 assume !(0 != main_~p8~0); 8676#L190-1 assume !(0 != main_~p9~0); 8673#L195-1 assume !(0 != main_~p10~0); 8669#L200-1 assume !(0 != main_~p11~0); 8667#L205-1 assume !(0 != main_~p12~0); 8665#L210-1 assume !(0 != main_~p13~0); 8663#L215-1 assume !(0 != main_~p14~0); 8661#L220-1 assume !(0 != main_~p15~0); 8525#L225-1 [2020-10-19 18:54:17,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:17,100 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2020-10-19 18:54:17,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:17,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094044728] [2020-10-19 18:54:17,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:17,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:17,110 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:17,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:17,116 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:17,121 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:54:17,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:17,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1170224198, now seen corresponding path program 1 times [2020-10-19 18:54:17,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:17,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199485890] [2020-10-19 18:54:17,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:17,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:54:17,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:54:17,157 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199485890] [2020-10-19 18:54:17,157 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:54:17,158 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 18:54:17,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785303210] [2020-10-19 18:54:17,158 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 18:54:17,159 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:54:17,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 18:54:17,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 18:54:17,159 INFO L87 Difference]: Start difference. First operand 2818 states and 4354 transitions. cyclomatic complexity: 1600 Second operand 3 states. [2020-10-19 18:54:17,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:54:17,211 INFO L93 Difference]: Finished difference Result 5570 states and 8514 transitions. [2020-10-19 18:54:17,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 18:54:17,212 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5570 states and 8514 transitions. [2020-10-19 18:54:17,272 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2020-10-19 18:54:17,322 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5570 states to 5570 states and 8514 transitions. [2020-10-19 18:54:17,323 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5570 [2020-10-19 18:54:17,331 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5570 [2020-10-19 18:54:17,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5570 states and 8514 transitions. [2020-10-19 18:54:17,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:54:17,355 INFO L691 BuchiCegarLoop]: Abstraction has 5570 states and 8514 transitions. [2020-10-19 18:54:17,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5570 states and 8514 transitions. [2020-10-19 18:54:17,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5570 to 5570. [2020-10-19 18:54:17,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5570 states. [2020-10-19 18:54:17,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5570 states to 5570 states and 8514 transitions. [2020-10-19 18:54:17,505 INFO L714 BuchiCegarLoop]: Abstraction has 5570 states and 8514 transitions. [2020-10-19 18:54:17,505 INFO L594 BuchiCegarLoop]: Abstraction has 5570 states and 8514 transitions. [2020-10-19 18:54:17,505 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-19 18:54:17,506 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5570 states and 8514 transitions. [2020-10-19 18:54:17,539 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2020-10-19 18:54:17,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:54:17,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:54:17,540 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:54:17,540 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-19 18:54:17,541 INFO L794 eck$LassoCheckResult]: Stem: 16939#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); 16919#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_#t~nondet22, 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_~p15~0, main_~lk15~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;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 16920#L225-1 [2020-10-19 18:54:17,541 INFO L796 eck$LassoCheckResult]: Loop: 16920#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 17240#L58 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;main_~lk15~0 := 0; 17237#L93 assume !(0 != main_~p1~0); 17238#L93-2 assume !(0 != main_~p2~0); 17222#L97-1 assume !(0 != main_~p3~0); 17223#L101-1 assume !(0 != main_~p4~0); 17202#L105-1 assume !(0 != main_~p5~0); 17204#L109-1 assume !(0 != main_~p6~0); 17182#L113-1 assume !(0 != main_~p7~0); 17184#L117-1 assume !(0 != main_~p8~0); 17162#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 17163#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 17146#L129-1 assume !(0 != main_~p11~0); 17147#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 17130#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 17131#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 17114#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 17115#L149-1 assume !(0 != main_~p1~0); 17286#L155-1 assume !(0 != main_~p2~0); 17285#L160-1 assume !(0 != main_~p3~0); 17282#L165-1 assume !(0 != main_~p4~0); 17280#L170-1 assume !(0 != main_~p5~0); 17278#L175-1 assume !(0 != main_~p6~0); 17276#L180-1 assume !(0 != main_~p7~0); 17272#L185-1 assume !(0 != main_~p8~0); 17269#L190-1 assume !(0 != main_~p9~0); 17265#L195-1 assume !(0 != main_~p10~0); 17261#L200-1 assume !(0 != main_~p11~0); 17257#L205-1 assume !(0 != main_~p12~0); 17253#L210-1 assume !(0 != main_~p13~0); 17249#L215-1 assume !(0 != main_~p14~0); 17245#L220-1 assume !(0 != main_~p15~0); 16920#L225-1 [2020-10-19 18:54:17,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:17,542 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2020-10-19 18:54:17,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:17,542 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324055937] [2020-10-19 18:54:17,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:17,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:17,550 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:17,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:17,557 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:17,561 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:54:17,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:17,562 INFO L82 PathProgramCache]: Analyzing trace with hash -635214136, now seen corresponding path program 1 times [2020-10-19 18:54:17,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:17,562 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748741292] [2020-10-19 18:54:17,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:17,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:54:17,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:54:17,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748741292] [2020-10-19 18:54:17,591 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:54:17,591 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 18:54:17,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333339359] [2020-10-19 18:54:17,593 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 18:54:17,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:54:17,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 18:54:17,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 18:54:17,595 INFO L87 Difference]: Start difference. First operand 5570 states and 8514 transitions. cyclomatic complexity: 3072 Second operand 3 states. [2020-10-19 18:54:17,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:54:17,642 INFO L93 Difference]: Finished difference Result 11010 states and 16642 transitions. [2020-10-19 18:54:17,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 18:54:17,644 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11010 states and 16642 transitions. [2020-10-19 18:54:17,728 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2020-10-19 18:54:17,824 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11010 states to 11010 states and 16642 transitions. [2020-10-19 18:54:17,825 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11010 [2020-10-19 18:54:17,837 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11010 [2020-10-19 18:54:17,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11010 states and 16642 transitions. [2020-10-19 18:54:17,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:54:17,860 INFO L691 BuchiCegarLoop]: Abstraction has 11010 states and 16642 transitions. [2020-10-19 18:54:17,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11010 states and 16642 transitions. [2020-10-19 18:54:18,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11010 to 11010. [2020-10-19 18:54:18,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11010 states. [2020-10-19 18:54:18,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11010 states to 11010 states and 16642 transitions. [2020-10-19 18:54:18,161 INFO L714 BuchiCegarLoop]: Abstraction has 11010 states and 16642 transitions. [2020-10-19 18:54:18,161 INFO L594 BuchiCegarLoop]: Abstraction has 11010 states and 16642 transitions. [2020-10-19 18:54:18,161 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-19 18:54:18,162 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11010 states and 16642 transitions. [2020-10-19 18:54:18,218 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2020-10-19 18:54:18,220 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:54:18,220 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:54:18,221 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:54:18,221 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-19 18:54:18,221 INFO L794 eck$LassoCheckResult]: Stem: 33525#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); 33503#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_#t~nondet22, 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_~p15~0, main_~lk15~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;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 33504#L225-1 [2020-10-19 18:54:18,222 INFO L796 eck$LassoCheckResult]: Loop: 33504#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 33836#L58 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;main_~lk15~0 := 0; 33833#L93 assume !(0 != main_~p1~0); 33834#L93-2 assume !(0 != main_~p2~0); 33822#L97-1 assume !(0 != main_~p3~0); 33823#L101-1 assume !(0 != main_~p4~0); 33802#L105-1 assume !(0 != main_~p5~0); 33804#L109-1 assume !(0 != main_~p6~0); 33782#L113-1 assume !(0 != main_~p7~0); 33784#L117-1 assume !(0 != main_~p8~0); 33758#L121-1 assume !(0 != main_~p9~0); 33760#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 33742#L129-1 assume !(0 != main_~p11~0); 33743#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 33726#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 33727#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 33710#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 33711#L149-1 assume !(0 != main_~p1~0); 33882#L155-1 assume !(0 != main_~p2~0); 33881#L160-1 assume !(0 != main_~p3~0); 33878#L165-1 assume !(0 != main_~p4~0); 33876#L170-1 assume !(0 != main_~p5~0); 33874#L175-1 assume !(0 != main_~p6~0); 33872#L180-1 assume !(0 != main_~p7~0); 33868#L185-1 assume !(0 != main_~p8~0); 33864#L190-1 assume !(0 != main_~p9~0); 33861#L195-1 assume !(0 != main_~p10~0); 33857#L200-1 assume !(0 != main_~p11~0); 33853#L205-1 assume !(0 != main_~p12~0); 33849#L210-1 assume !(0 != main_~p13~0); 33845#L215-1 assume !(0 != main_~p14~0); 33841#L220-1 assume !(0 != main_~p15~0); 33504#L225-1 [2020-10-19 18:54:18,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:18,223 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2020-10-19 18:54:18,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:18,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841739965] [2020-10-19 18:54:18,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:18,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:18,239 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:18,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:18,263 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:18,271 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:54:18,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:18,279 INFO L82 PathProgramCache]: Analyzing trace with hash -416359418, now seen corresponding path program 1 times [2020-10-19 18:54:18,280 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:18,280 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889649193] [2020-10-19 18:54:18,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:18,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:54:18,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:54:18,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889649193] [2020-10-19 18:54:18,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:54:18,325 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 18:54:18,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156719672] [2020-10-19 18:54:18,326 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 18:54:18,326 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:54:18,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 18:54:18,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 18:54:18,326 INFO L87 Difference]: Start difference. First operand 11010 states and 16642 transitions. cyclomatic complexity: 5888 Second operand 3 states. [2020-10-19 18:54:18,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:54:18,418 INFO L93 Difference]: Finished difference Result 21762 states and 32514 transitions. [2020-10-19 18:54:18,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 18:54:18,419 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21762 states and 32514 transitions. [2020-10-19 18:54:18,558 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2020-10-19 18:54:18,653 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21762 states to 21762 states and 32514 transitions. [2020-10-19 18:54:18,653 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21762 [2020-10-19 18:54:18,674 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21762 [2020-10-19 18:54:18,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21762 states and 32514 transitions. [2020-10-19 18:54:18,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:54:18,705 INFO L691 BuchiCegarLoop]: Abstraction has 21762 states and 32514 transitions. [2020-10-19 18:54:18,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21762 states and 32514 transitions. [2020-10-19 18:54:18,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21762 to 21762. [2020-10-19 18:54:18,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21762 states. [2020-10-19 18:54:19,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21762 states to 21762 states and 32514 transitions. [2020-10-19 18:54:19,008 INFO L714 BuchiCegarLoop]: Abstraction has 21762 states and 32514 transitions. [2020-10-19 18:54:19,008 INFO L594 BuchiCegarLoop]: Abstraction has 21762 states and 32514 transitions. [2020-10-19 18:54:19,008 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-19 18:54:19,009 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21762 states and 32514 transitions. [2020-10-19 18:54:19,076 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2020-10-19 18:54:19,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:54:19,079 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:54:19,080 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:54:19,080 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-19 18:54:19,083 INFO L794 eck$LassoCheckResult]: Stem: 66304#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); 66281#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_#t~nondet22, 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_~p15~0, main_~lk15~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;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 66282#L225-1 [2020-10-19 18:54:19,083 INFO L796 eck$LassoCheckResult]: Loop: 66282#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 66433#L58 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;main_~lk15~0 := 0; 66431#L93 assume !(0 != main_~p1~0); 66427#L93-2 assume !(0 != main_~p2~0); 66425#L97-1 assume !(0 != main_~p3~0); 66421#L101-1 assume !(0 != main_~p4~0); 66417#L105-1 assume !(0 != main_~p5~0); 66413#L109-1 assume !(0 != main_~p6~0); 66409#L113-1 assume !(0 != main_~p7~0); 66405#L117-1 assume !(0 != main_~p8~0); 66401#L121-1 assume !(0 != main_~p9~0); 66397#L125-1 assume !(0 != main_~p10~0); 66395#L129-1 assume !(0 != main_~p11~0); 66393#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 66391#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 66389#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 66387#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 66384#L149-1 assume !(0 != main_~p1~0); 66385#L155-1 assume !(0 != main_~p2~0); 66485#L160-1 assume !(0 != main_~p3~0); 66480#L165-1 assume !(0 != main_~p4~0); 66476#L170-1 assume !(0 != main_~p5~0); 66472#L175-1 assume !(0 != main_~p6~0); 66468#L180-1 assume !(0 != main_~p7~0); 66464#L185-1 assume !(0 != main_~p8~0); 66460#L190-1 assume !(0 != main_~p9~0); 66456#L195-1 assume !(0 != main_~p10~0); 66453#L200-1 assume !(0 != main_~p11~0); 66449#L205-1 assume !(0 != main_~p12~0); 66445#L210-1 assume !(0 != main_~p13~0); 66441#L215-1 assume !(0 != main_~p14~0); 66437#L220-1 assume !(0 != main_~p15~0); 66282#L225-1 [2020-10-19 18:54:19,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:19,084 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2020-10-19 18:54:19,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:19,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128477668] [2020-10-19 18:54:19,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:19,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:19,102 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:19,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:19,111 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:19,121 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:54:19,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:19,123 INFO L82 PathProgramCache]: Analyzing trace with hash 6342408, now seen corresponding path program 1 times [2020-10-19 18:54:19,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:19,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103530941] [2020-10-19 18:54:19,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:19,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:54:19,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:54:19,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103530941] [2020-10-19 18:54:19,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:54:19,150 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 18:54:19,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319871654] [2020-10-19 18:54:19,151 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 18:54:19,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:54:19,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 18:54:19,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 18:54:19,151 INFO L87 Difference]: Start difference. First operand 21762 states and 32514 transitions. cyclomatic complexity: 11264 Second operand 3 states. [2020-10-19 18:54:19,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:54:19,299 INFO L93 Difference]: Finished difference Result 43010 states and 63490 transitions. [2020-10-19 18:54:19,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 18:54:19,300 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43010 states and 63490 transitions. [2020-10-19 18:54:19,526 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2020-10-19 18:54:19,921 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43010 states to 43010 states and 63490 transitions. [2020-10-19 18:54:19,921 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43010 [2020-10-19 18:54:19,952 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43010 [2020-10-19 18:54:19,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43010 states and 63490 transitions. [2020-10-19 18:54:19,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:54:19,985 INFO L691 BuchiCegarLoop]: Abstraction has 43010 states and 63490 transitions. [2020-10-19 18:54:20,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43010 states and 63490 transitions. [2020-10-19 18:54:20,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43010 to 43010. [2020-10-19 18:54:20,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43010 states. [2020-10-19 18:54:20,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43010 states to 43010 states and 63490 transitions. [2020-10-19 18:54:20,610 INFO L714 BuchiCegarLoop]: Abstraction has 43010 states and 63490 transitions. [2020-10-19 18:54:20,610 INFO L594 BuchiCegarLoop]: Abstraction has 43010 states and 63490 transitions. [2020-10-19 18:54:20,611 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-19 18:54:20,611 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43010 states and 63490 transitions. [2020-10-19 18:54:20,734 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2020-10-19 18:54:20,734 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:54:20,734 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:54:20,736 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:54:20,736 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-19 18:54:20,736 INFO L794 eck$LassoCheckResult]: Stem: 131080#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); 131060#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_#t~nondet22, 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_~p15~0, main_~lk15~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;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 131061#L225-1 [2020-10-19 18:54:20,737 INFO L796 eck$LassoCheckResult]: Loop: 131061#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 131486#L58 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;main_~lk15~0 := 0; 131397#L93 assume !(0 != main_~p1~0); 131395#L93-2 assume !(0 != main_~p2~0); 131393#L97-1 assume !(0 != main_~p3~0); 131389#L101-1 assume !(0 != main_~p4~0); 131380#L105-1 assume !(0 != main_~p5~0); 131375#L109-1 assume !(0 != main_~p6~0); 131370#L113-1 assume !(0 != main_~p7~0); 131250#L117-1 assume !(0 != main_~p8~0); 131246#L121-1 assume !(0 != main_~p9~0); 131193#L125-1 assume !(0 != main_~p10~0); 131182#L129-1 assume !(0 != main_~p11~0); 131183#L133-1 assume !(0 != main_~p12~0); 131475#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 131473#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 131468#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 131466#L149-1 assume !(0 != main_~p1~0); 131460#L155-1 assume !(0 != main_~p2~0); 131455#L160-1 assume !(0 != main_~p3~0); 131448#L165-1 assume !(0 != main_~p4~0); 131442#L170-1 assume !(0 != main_~p5~0); 131436#L175-1 assume !(0 != main_~p6~0); 131415#L180-1 assume !(0 != main_~p7~0); 131416#L185-1 assume !(0 != main_~p8~0); 131400#L190-1 assume !(0 != main_~p9~0); 131402#L195-1 assume !(0 != main_~p10~0); 131414#L200-1 assume !(0 != main_~p11~0); 131413#L205-1 assume !(0 != main_~p12~0); 131499#L210-1 assume !(0 != main_~p13~0); 131495#L215-1 assume !(0 != main_~p14~0); 131491#L220-1 assume !(0 != main_~p15~0); 131061#L225-1 [2020-10-19 18:54:20,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:20,737 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2020-10-19 18:54:20,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:20,738 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652793779] [2020-10-19 18:54:20,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:20,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:20,749 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:20,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:20,757 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:20,762 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:54:20,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:20,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1682601334, now seen corresponding path program 1 times [2020-10-19 18:54:20,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:20,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781766025] [2020-10-19 18:54:20,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:54:20,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:54:20,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781766025] [2020-10-19 18:54:20,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:54:20,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 18:54:20,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571316610] [2020-10-19 18:54:20,796 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 18:54:20,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:54:20,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 18:54:20,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 18:54:20,797 INFO L87 Difference]: Start difference. First operand 43010 states and 63490 transitions. cyclomatic complexity: 21504 Second operand 3 states. [2020-10-19 18:54:21,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:54:21,025 INFO L93 Difference]: Finished difference Result 84994 states and 123906 transitions. [2020-10-19 18:54:21,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 18:54:21,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84994 states and 123906 transitions. [2020-10-19 18:54:21,934 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2020-10-19 18:54:22,206 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84994 states to 84994 states and 123906 transitions. [2020-10-19 18:54:22,207 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84994 [2020-10-19 18:54:22,259 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84994 [2020-10-19 18:54:22,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84994 states and 123906 transitions. [2020-10-19 18:54:22,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:54:22,335 INFO L691 BuchiCegarLoop]: Abstraction has 84994 states and 123906 transitions. [2020-10-19 18:54:22,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84994 states and 123906 transitions. [2020-10-19 18:54:23,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84994 to 84994. [2020-10-19 18:54:23,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84994 states. [2020-10-19 18:54:23,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84994 states to 84994 states and 123906 transitions. [2020-10-19 18:54:23,623 INFO L714 BuchiCegarLoop]: Abstraction has 84994 states and 123906 transitions. [2020-10-19 18:54:23,623 INFO L594 BuchiCegarLoop]: Abstraction has 84994 states and 123906 transitions. [2020-10-19 18:54:23,623 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-19 18:54:23,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84994 states and 123906 transitions. [2020-10-19 18:54:23,817 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2020-10-19 18:54:23,817 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:54:23,817 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:54:23,819 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:54:23,819 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-19 18:54:23,819 INFO L794 eck$LassoCheckResult]: Stem: 259089#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); 259069#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_#t~nondet22, 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_~p15~0, main_~lk15~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;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 259070#L225-1 [2020-10-19 18:54:23,819 INFO L796 eck$LassoCheckResult]: Loop: 259070#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 259324#L58 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;main_~lk15~0 := 0; 259321#L93 assume !(0 != main_~p1~0); 259317#L93-2 assume !(0 != main_~p2~0); 259314#L97-1 assume !(0 != main_~p3~0); 259311#L101-1 assume !(0 != main_~p4~0); 259307#L105-1 assume !(0 != main_~p5~0); 259303#L109-1 assume !(0 != main_~p6~0); 259299#L113-1 assume !(0 != main_~p7~0); 259295#L117-1 assume !(0 != main_~p8~0); 259291#L121-1 assume !(0 != main_~p9~0); 259285#L125-1 assume !(0 != main_~p10~0); 259278#L129-1 assume !(0 != main_~p11~0); 259279#L133-1 assume !(0 != main_~p12~0); 259399#L137-1 assume !(0 != main_~p13~0); 259396#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 259393#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 259387#L149-1 assume !(0 != main_~p1~0); 259381#L155-1 assume !(0 != main_~p2~0); 259376#L160-1 assume !(0 != main_~p3~0); 259369#L165-1 assume !(0 != main_~p4~0); 259363#L170-1 assume !(0 != main_~p5~0); 259357#L175-1 assume !(0 != main_~p6~0); 259351#L180-1 assume !(0 != main_~p7~0); 259286#L185-1 assume !(0 != main_~p8~0); 259287#L190-1 assume !(0 != main_~p9~0); 259275#L195-1 assume !(0 != main_~p10~0); 259277#L200-1 assume !(0 != main_~p11~0); 259263#L205-1 assume !(0 != main_~p12~0); 259265#L210-1 assume !(0 != main_~p13~0); 259333#L215-1 assume !(0 != main_~p14~0); 259329#L220-1 assume !(0 != main_~p15~0); 259070#L225-1 [2020-10-19 18:54:23,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:23,820 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 12 times [2020-10-19 18:54:23,820 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:23,820 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815036033] [2020-10-19 18:54:23,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:23,826 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:23,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:23,831 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:23,834 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:54:23,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:23,835 INFO L82 PathProgramCache]: Analyzing trace with hash 618221256, now seen corresponding path program 1 times [2020-10-19 18:54:23,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:23,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060239156] [2020-10-19 18:54:23,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:23,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:54:23,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:54:23,859 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060239156] [2020-10-19 18:54:23,859 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:54:23,860 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 18:54:23,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351234516] [2020-10-19 18:54:23,860 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 18:54:23,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:54:23,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 18:54:23,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 18:54:23,861 INFO L87 Difference]: Start difference. First operand 84994 states and 123906 transitions. cyclomatic complexity: 40960 Second operand 3 states. [2020-10-19 18:54:24,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:54:24,208 INFO L93 Difference]: Finished difference Result 167938 states and 241666 transitions. [2020-10-19 18:54:24,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 18:54:24,210 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167938 states and 241666 transitions. [2020-10-19 18:54:24,778 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 167936 [2020-10-19 18:54:25,160 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167938 states to 167938 states and 241666 transitions. [2020-10-19 18:54:25,160 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167938 [2020-10-19 18:54:25,259 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167938 [2020-10-19 18:54:25,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167938 states and 241666 transitions. [2020-10-19 18:54:26,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:54:26,559 INFO L691 BuchiCegarLoop]: Abstraction has 167938 states and 241666 transitions. [2020-10-19 18:54:26,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167938 states and 241666 transitions. [2020-10-19 18:54:27,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167938 to 167938. [2020-10-19 18:54:27,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167938 states. [2020-10-19 18:54:29,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167938 states to 167938 states and 241666 transitions. [2020-10-19 18:54:29,023 INFO L714 BuchiCegarLoop]: Abstraction has 167938 states and 241666 transitions. [2020-10-19 18:54:29,023 INFO L594 BuchiCegarLoop]: Abstraction has 167938 states and 241666 transitions. [2020-10-19 18:54:29,023 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-10-19 18:54:29,024 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167938 states and 241666 transitions. [2020-10-19 18:54:29,397 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 167936 [2020-10-19 18:54:29,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:54:29,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:54:29,400 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:54:29,400 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-19 18:54:29,400 INFO L794 eck$LassoCheckResult]: Stem: 512029#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); 512008#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_#t~nondet22, 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_~p15~0, main_~lk15~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;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 512009#L225-1 [2020-10-19 18:54:29,400 INFO L796 eck$LassoCheckResult]: Loop: 512009#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 512405#L58 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;main_~lk15~0 := 0; 512401#L93 assume !(0 != main_~p1~0); 512399#L93-2 assume !(0 != main_~p2~0); 512398#L97-1 assume !(0 != main_~p3~0); 512396#L101-1 assume !(0 != main_~p4~0); 512394#L105-1 assume !(0 != main_~p5~0); 512392#L109-1 assume !(0 != main_~p6~0); 512390#L113-1 assume !(0 != main_~p7~0); 512388#L117-1 assume !(0 != main_~p8~0); 512386#L121-1 assume !(0 != main_~p9~0); 512384#L125-1 assume !(0 != main_~p10~0); 512383#L129-1 assume !(0 != main_~p11~0); 512380#L133-1 assume !(0 != main_~p12~0); 512376#L137-1 assume !(0 != main_~p13~0); 512373#L141-1 assume !(0 != main_~p14~0); 512374#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 512331#L149-1 assume !(0 != main_~p1~0); 512332#L155-1 assume !(0 != main_~p2~0); 512722#L160-1 assume !(0 != main_~p3~0); 512717#L165-1 assume !(0 != main_~p4~0); 512713#L170-1 assume !(0 != main_~p5~0); 512709#L175-1 assume !(0 != main_~p6~0); 512705#L180-1 assume !(0 != main_~p7~0); 512701#L185-1 assume !(0 != main_~p8~0); 512697#L190-1 assume !(0 != main_~p9~0); 512695#L195-1 assume !(0 != main_~p10~0); 512209#L200-1 assume !(0 != main_~p11~0); 512208#L205-1 assume !(0 != main_~p12~0); 512195#L210-1 assume !(0 != main_~p13~0); 512197#L215-1 assume !(0 != main_~p14~0); 512410#L220-1 assume !(0 != main_~p15~0); 512009#L225-1 [2020-10-19 18:54:29,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:29,400 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 13 times [2020-10-19 18:54:29,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:29,401 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133617702] [2020-10-19 18:54:29,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:29,407 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:29,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:29,411 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:29,413 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:54:29,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:29,414 INFO L82 PathProgramCache]: Analyzing trace with hash -970126646, now seen corresponding path program 1 times [2020-10-19 18:54:29,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:29,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131889431] [2020-10-19 18:54:29,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:29,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:54:29,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:54:29,436 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131889431] [2020-10-19 18:54:29,437 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:54:29,437 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-19 18:54:29,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018195549] [2020-10-19 18:54:29,437 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 18:54:29,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:54:29,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 18:54:29,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 18:54:29,438 INFO L87 Difference]: Start difference. First operand 167938 states and 241666 transitions. cyclomatic complexity: 77824 Second operand 3 states. [2020-10-19 18:54:30,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:54:30,236 INFO L93 Difference]: Finished difference Result 331778 states and 471042 transitions. [2020-10-19 18:54:30,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 18:54:30,237 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 331778 states and 471042 transitions. [2020-10-19 18:54:31,364 INFO L131 ngComponentsAnalysis]: Automaton has 8192 accepting balls. 331776 [2020-10-19 18:54:32,095 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 331778 states to 331778 states and 471042 transitions. [2020-10-19 18:54:32,095 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 331778 [2020-10-19 18:54:32,273 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 331778 [2020-10-19 18:54:32,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 331778 states and 471042 transitions. [2020-10-19 18:54:40,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:54:40,503 INFO L691 BuchiCegarLoop]: Abstraction has 331778 states and 471042 transitions. [2020-10-19 18:54:40,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331778 states and 471042 transitions. [2020-10-19 18:54:43,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331778 to 331778. [2020-10-19 18:54:43,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331778 states. [2020-10-19 18:54:43,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331778 states to 331778 states and 471042 transitions. [2020-10-19 18:54:43,557 INFO L714 BuchiCegarLoop]: Abstraction has 331778 states and 471042 transitions. [2020-10-19 18:54:43,557 INFO L594 BuchiCegarLoop]: Abstraction has 331778 states and 471042 transitions. [2020-10-19 18:54:43,557 INFO L427 BuchiCegarLoop]: ======== Iteration 14============ [2020-10-19 18:54:43,557 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 331778 states and 471042 transitions. [2020-10-19 18:54:44,311 INFO L131 ngComponentsAnalysis]: Automaton has 8192 accepting balls. 331776 [2020-10-19 18:54:44,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:54:44,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:54:44,314 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:54:44,314 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-19 18:54:44,315 INFO L794 eck$LassoCheckResult]: Stem: 1011748#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); 1011729#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_#t~nondet22, 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_~p15~0, main_~lk15~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;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 1011730#L225-1 [2020-10-19 18:54:44,319 INFO L796 eck$LassoCheckResult]: Loop: 1011730#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 1012127#L58 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;main_~lk15~0 := 0; 1012125#L93 assume !(0 != main_~p1~0); 1012121#L93-2 assume !(0 != main_~p2~0); 1012119#L97-1 assume !(0 != main_~p3~0); 1012115#L101-1 assume !(0 != main_~p4~0); 1012111#L105-1 assume !(0 != main_~p5~0); 1012107#L109-1 assume !(0 != main_~p6~0); 1012103#L113-1 assume !(0 != main_~p7~0); 1012099#L117-1 assume !(0 != main_~p8~0); 1012095#L121-1 assume !(0 != main_~p9~0); 1012091#L125-1 assume !(0 != main_~p10~0); 1012089#L129-1 assume !(0 != main_~p11~0); 1012085#L133-1 assume !(0 != main_~p12~0); 1012081#L137-1 assume !(0 != main_~p13~0); 1012077#L141-1 assume !(0 != main_~p14~0); 1012074#L145-1 assume !(0 != main_~p15~0); 1012075#L149-1 assume !(0 != main_~p1~0); 1012176#L155-1 assume !(0 != main_~p2~0); 1012173#L160-1 assume !(0 != main_~p3~0); 1012168#L165-1 assume !(0 != main_~p4~0); 1012164#L170-1 assume !(0 != main_~p5~0); 1012160#L175-1 assume !(0 != main_~p6~0); 1012156#L180-1 assume !(0 != main_~p7~0); 1012152#L185-1 assume !(0 != main_~p8~0); 1012148#L190-1 assume !(0 != main_~p9~0); 1012144#L195-1 assume !(0 != main_~p10~0); 1012141#L200-1 assume !(0 != main_~p11~0); 1012136#L205-1 assume !(0 != main_~p12~0); 1012132#L210-1 assume !(0 != main_~p13~0); 1012129#L215-1 assume !(0 != main_~p14~0); 1012128#L220-1 assume !(0 != main_~p15~0); 1011730#L225-1 [2020-10-19 18:54:44,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:44,320 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 14 times [2020-10-19 18:54:44,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:44,320 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982391550] [2020-10-19 18:54:44,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:44,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:44,326 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:44,330 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:44,333 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:54:44,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:44,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1991195000, now seen corresponding path program 1 times [2020-10-19 18:54:44,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:44,334 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106421920] [2020-10-19 18:54:44,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:44,338 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:44,341 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:44,345 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:54:44,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:44,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1845576266, now seen corresponding path program 1 times [2020-10-19 18:54:44,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:44,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993793544] [2020-10-19 18:54:44,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:44,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:44,353 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:44,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:44,359 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:44,366 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:54:44,477 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-10-19 18:54:44,861 WARN L193 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 96 [2020-10-19 18:54:45,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.10 06:54:45 BoogieIcfgContainer [2020-10-19 18:54:45,056 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-19 18:54:45,057 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-19 18:54:45,059 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-19 18:54:45,059 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-19 18:54:45,060 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:54:15" (3/4) ... [2020-10-19 18:54:45,066 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-19 18:54:45,179 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-19 18:54:45,181 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-19 18:54:45,183 INFO L168 Benchmark]: Toolchain (without parser) took 30580.78 ms. Allocated memory was 1.0 GB in the beginning and 4.7 GB in the end (delta: 3.7 GB). Free memory was 961.3 MB in the beginning and 2.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2020-10-19 18:54:45,184 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 18:54:45,184 INFO L168 Benchmark]: CACSL2BoogieTranslator took 405.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 961.3 MB in the beginning and 1.1 GB in the end (delta: -166.5 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2020-10-19 18:54:45,185 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 18:54:45,185 INFO L168 Benchmark]: Boogie Preprocessor took 32.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 18:54:45,185 INFO L168 Benchmark]: RCFGBuilder took 524.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.3 MB). Peak memory consumption was 38.3 MB. Max. memory is 11.5 GB. [2020-10-19 18:54:45,186 INFO L168 Benchmark]: BuchiAutomizer took 29431.94 ms. Allocated memory was 1.2 GB in the beginning and 4.7 GB in the end (delta: 3.5 GB). Free memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2020-10-19 18:54:45,186 INFO L168 Benchmark]: Witness Printer took 124.18 ms. Allocated memory is still 4.7 GB. Free memory is still 2.6 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 18:54:45,188 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 405.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 961.3 MB in the beginning and 1.1 GB in the end (delta: -166.5 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 524.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.3 MB). Peak memory consumption was 38.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 29431.94 ms. Allocated memory was 1.2 GB in the beginning and 4.7 GB in the end (delta: 3.5 GB). Free memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. * Witness Printer took 124.18 ms. Allocated memory is still 4.7 GB. Free memory is still 2.6 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (13 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.13 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 331778 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 29.3s and 14 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.2s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 0. Minimization of det autom 13. Minimization of nondet autom 0. Automata minimization 8.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 5.2s Buchi closure took 0.4s. Biggest automaton had 331778 states and ocurred in iteration 13. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1530 SDtfs, 799 SDslu, 967 SDs, 0 SdLazy, 65 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI13 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: 56]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=15329} State at position 1 is {NULL=0, p1=0, p3=0, p5=0, NULL=15329, p10=0, p7=0, p9=0, lk12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@68fd688a=0, lk14=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1463ce0b=0, p14=0, lk10=0, p12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@63f30f78=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@108c3392=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@34aff456=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@564097cb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@255e762f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3c69ecb8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3fd36a87=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@35cae8e0=0, NULL=0, NULL=0, lk3=0, lk5=0, NULL=0, lk1=0, lk7=0, lk9=0, NULL=15331, \result=0, p2=0, p4=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3b68e147=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@533c461e=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4faad08c=0, lk13=0, p15=0, lk15=0, p13=0, p11=0, lk11=0, cond=11, NULL=15332, NULL=0, NULL=15330, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2db3dab4=0, lk4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5c526c33=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@17143eab=11, lk6=0, lk2=0, lk8=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 56]: 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; [L50] int p15 = __VERIFIER_nondet_int(); [L51] int lk15; [L54] int cond; Loop: [L56] COND TRUE 1 [L57] cond = __VERIFIER_nondet_int() [L58] COND FALSE !(cond == 0) [L61] lk1 = 0 [L63] lk2 = 0 [L65] lk3 = 0 [L67] lk4 = 0 [L69] lk5 = 0 [L71] lk6 = 0 [L73] lk7 = 0 [L75] lk8 = 0 [L77] lk9 = 0 [L79] lk10 = 0 [L81] lk11 = 0 [L83] lk12 = 0 [L85] lk13 = 0 [L87] lk14 = 0 [L89] lk15 = 0 [L93] COND FALSE !(p1 != 0) [L97] COND FALSE !(p2 != 0) [L101] COND FALSE !(p3 != 0) [L105] COND FALSE !(p4 != 0) [L109] COND FALSE !(p5 != 0) [L113] COND FALSE !(p6 != 0) [L117] COND FALSE !(p7 != 0) [L121] COND FALSE !(p8 != 0) [L125] COND FALSE !(p9 != 0) [L129] COND FALSE !(p10 != 0) [L133] COND FALSE !(p11 != 0) [L137] COND FALSE !(p12 != 0) [L141] COND FALSE !(p13 != 0) [L145] COND FALSE !(p14 != 0) [L149] COND FALSE !(p15 != 0) [L155] COND FALSE !(p1 != 0) [L160] COND FALSE !(p2 != 0) [L165] COND FALSE !(p3 != 0) [L170] COND FALSE !(p4 != 0) [L175] COND FALSE !(p5 != 0) [L180] COND FALSE !(p6 != 0) [L185] COND FALSE !(p7 != 0) [L190] COND FALSE !(p8 != 0) [L195] COND FALSE !(p9 != 0) [L200] COND FALSE !(p10 != 0) [L205] COND FALSE !(p11 != 0) [L210] COND FALSE !(p12 != 0) [L215] COND FALSE !(p13 != 0) [L220] COND FALSE !(p14 != 0) [L225] COND FALSE !(p15 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...