./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/locks/test_locks_10.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 6423b7e5fbcc52c08e52aff49c79db620dd407c4 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 06:46:59,032 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 06:46:59,035 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 06:46:59,065 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 06:46:59,066 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 06:46:59,067 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 06:46:59,069 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 06:46:59,071 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 06:46:59,073 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 06:46:59,074 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 06:46:59,082 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 06:46:59,084 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 06:46:59,085 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 06:46:59,088 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 06:46:59,092 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 06:46:59,093 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 06:46:59,096 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 06:46:59,099 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 06:46:59,101 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 06:46:59,107 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 06:46:59,110 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 06:46:59,112 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 06:46:59,114 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 06:46:59,116 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 06:46:59,119 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 06:46:59,121 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 06:46:59,122 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 06:46:59,124 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 06:46:59,125 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 06:46:59,126 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 06:46:59,126 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 06:46:59,127 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 06:46:59,128 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 06:46:59,129 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 06:46:59,138 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 06:46:59,140 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 06:46:59,141 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 06:46:59,141 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 06:46:59,142 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 06:46:59,143 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 06:46:59,144 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 06:46:59,145 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-20 06:46:59,190 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 06:46:59,191 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 06:46:59,193 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 06:46:59,194 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 06:46:59,194 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 06:46:59,194 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 06:46:59,195 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 06:46:59,195 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 06:46:59,195 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 06:46:59,195 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 06:46:59,197 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 06:46:59,197 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 06:46:59,197 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 06:46:59,198 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 06:46:59,198 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 06:46:59,198 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 06:46:59,198 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 06:46:59,199 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 06:46:59,199 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 06:46:59,201 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 06:46:59,201 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 06:46:59,203 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 06:46:59,203 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 06:46:59,204 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 06:46:59,204 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 06:46:59,205 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 06:46:59,205 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 06:46:59,205 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 06:46:59,205 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 06:46:59,206 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 06:46:59,206 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 06:46:59,206 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 06:46:59,208 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 06:46:59,208 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 -> 6423b7e5fbcc52c08e52aff49c79db620dd407c4 [2020-10-20 06:46:59,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 06:46:59,482 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 06:46:59,487 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 06:46:59,489 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 06:46:59,489 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 06:46:59,490 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_10.c [2020-10-20 06:46:59,566 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f6944e40/253db9945c364b72bf8fbafb4849a8b4/FLAGa541d5d67 [2020-10-20 06:47:00,100 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 06:47:00,101 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_10.c [2020-10-20 06:47:00,110 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f6944e40/253db9945c364b72bf8fbafb4849a8b4/FLAGa541d5d67 [2020-10-20 06:47:00,466 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f6944e40/253db9945c364b72bf8fbafb4849a8b4 [2020-10-20 06:47:00,469 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 06:47:00,476 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 06:47:00,477 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 06:47:00,478 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 06:47:00,481 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 06:47:00,482 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:47:00" (1/1) ... [2020-10-20 06:47:00,485 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34f5471c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:00, skipping insertion in model container [2020-10-20 06:47:00,486 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:47:00" (1/1) ... [2020-10-20 06:47:00,494 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 06:47:00,535 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 06:47:00,801 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:47:00,818 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 06:47:00,877 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:47:00,908 INFO L208 MainTranslator]: Completed translation [2020-10-20 06:47:00,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:00 WrapperNode [2020-10-20 06:47:00,909 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 06:47:00,910 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 06:47:00,910 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 06:47:00,910 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 06:47:00,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:00" (1/1) ... [2020-10-20 06:47:00,928 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:00" (1/1) ... [2020-10-20 06:47:00,956 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 06:47:00,957 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 06:47:00,957 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 06:47:00,957 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 06:47:00,974 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:00" (1/1) ... [2020-10-20 06:47:00,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:00" (1/1) ... [2020-10-20 06:47:00,977 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:00" (1/1) ... [2020-10-20 06:47:00,977 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:00" (1/1) ... [2020-10-20 06:47:00,982 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:00" (1/1) ... [2020-10-20 06:47:00,989 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:00" (1/1) ... [2020-10-20 06:47:00,991 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:00" (1/1) ... [2020-10-20 06:47:00,994 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 06:47:00,995 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 06:47:00,995 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 06:47:00,995 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 06:47:00,996 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:47:01,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 06:47:01,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 06:47:01,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 06:47:01,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 06:47:01,470 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 06:47:01,470 INFO L298 CfgBuilder]: Removed 7 assume(true) statements. [2020-10-20 06:47:01,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:47:01 BoogieIcfgContainer [2020-10-20 06:47:01,472 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 06:47:01,473 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 06:47:01,473 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 06:47:01,477 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 06:47:01,478 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:47:01,478 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 06:47:00" (1/3) ... [2020-10-20 06:47:01,479 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b3d8eb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:47:01, skipping insertion in model container [2020-10-20 06:47:01,479 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:47:01,479 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:00" (2/3) ... [2020-10-20 06:47:01,480 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b3d8eb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:47:01, skipping insertion in model container [2020-10-20 06:47:01,480 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:47:01,480 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:47:01" (3/3) ... [2020-10-20 06:47:01,482 INFO L373 chiAutomizerObserver]: Analyzing ICFG test_locks_10.c [2020-10-20 06:47:01,526 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 06:47:01,526 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 06:47:01,526 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 06:47:01,526 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 06:47:01,526 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 06:47:01,527 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 06:47:01,527 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 06:47:01,527 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 06:47:01,543 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states. [2020-10-20 06:47:01,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2020-10-20 06:47:01,573 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:01,573 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:01,580 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:01,580 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] [2020-10-20 06:47:01,580 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 06:47:01,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states. [2020-10-20 06:47:01,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2020-10-20 06:47:01,584 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:01,584 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:01,585 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:01,586 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] [2020-10-20 06:47:01,592 INFO L794 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 12#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_~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_~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;havoc main_~cond~0; 5#L155-1true [2020-10-20 06:47:01,593 INFO L796 eck$LassoCheckResult]: Loop: 5#L155-1true assume !false;main_~cond~0 := main_#t~nondet17;havoc main_#t~nondet17; 14#L43true 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; 42#L68true assume 0 != main_~p1~0;main_~lk1~0 := 1; 38#L68-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 30#L72-1true assume !(0 != main_~p3~0); 15#L76-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 3#L80-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 10#L84-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 37#L88-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 26#L92-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 13#L96-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 21#L100-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 7#L104-1true assume !(0 != main_~p1~0); 39#L110-1true assume !(0 != main_~p2~0); 8#L115-1true assume !(0 != main_~p3~0); 18#L120-1true assume !(0 != main_~p4~0); 28#L125-1true assume !(0 != main_~p5~0); 36#L130-1true assume !(0 != main_~p6~0); 6#L135-1true assume !(0 != main_~p7~0); 16#L140-1true assume !(0 != main_~p8~0); 25#L145-1true assume !(0 != main_~p9~0); 33#L150-1true assume !(0 != main_~p10~0); 5#L155-1true [2020-10-20 06:47:01,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:01,599 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-20 06:47:01,607 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:01,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122393889] [2020-10-20 06:47:01,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:01,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:01,721 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:01,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:01,740 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:01,765 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:01,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:01,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1693159719, now seen corresponding path program 1 times [2020-10-20 06:47:01,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:01,767 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480414953] [2020-10-20 06:47:01,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:01,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:01,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:47:01,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480414953] [2020-10-20 06:47:01,847 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:01,847 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:01,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758125908] [2020-10-20 06:47:01,854 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:01,856 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:01,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:01,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:01,887 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2020-10-20 06:47:01,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:01,930 INFO L93 Difference]: Finished difference Result 75 states and 130 transitions. [2020-10-20 06:47:01,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:01,933 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 130 transitions. [2020-10-20 06:47:01,938 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 63 [2020-10-20 06:47:01,944 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 65 states and 103 transitions. [2020-10-20 06:47:01,946 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2020-10-20 06:47:01,946 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2020-10-20 06:47:01,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 103 transitions. [2020-10-20 06:47:01,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:01,948 INFO L691 BuchiCegarLoop]: Abstraction has 65 states and 103 transitions. [2020-10-20 06:47:01,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 103 transitions. [2020-10-20 06:47:01,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-10-20 06:47:01,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-10-20 06:47:01,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 103 transitions. [2020-10-20 06:47:01,978 INFO L714 BuchiCegarLoop]: Abstraction has 65 states and 103 transitions. [2020-10-20 06:47:01,978 INFO L594 BuchiCegarLoop]: Abstraction has 65 states and 103 transitions. [2020-10-20 06:47:01,978 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 06:47:01,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 103 transitions. [2020-10-20 06:47:01,981 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 63 [2020-10-20 06:47:01,981 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:01,981 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:01,982 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:01,982 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] [2020-10-20 06:47:01,983 INFO L794 eck$LassoCheckResult]: Stem: 160#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 142#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_~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_~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;havoc main_~cond~0; 128#L155-1 [2020-10-20 06:47:01,983 INFO L796 eck$LassoCheckResult]: Loop: 128#L155-1 assume !false;main_~cond~0 := main_#t~nondet17;havoc main_#t~nondet17; 129#L43 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; 145#L68 assume !(0 != main_~p1~0); 174#L68-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 173#L72-1 assume !(0 != main_~p3~0); 172#L76-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 171#L80-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 170#L84-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 169#L88-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 168#L92-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 167#L96-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 166#L100-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 164#L104-1 assume !(0 != main_~p1~0); 165#L110-1 assume !(0 != main_~p2~0); 187#L115-1 assume !(0 != main_~p3~0); 185#L120-1 assume !(0 != main_~p4~0); 152#L125-1 assume !(0 != main_~p5~0); 150#L130-1 assume !(0 != main_~p6~0); 130#L135-1 assume !(0 != main_~p7~0); 132#L140-1 assume !(0 != main_~p8~0); 138#L145-1 assume !(0 != main_~p9~0); 148#L150-1 assume !(0 != main_~p10~0); 128#L155-1 [2020-10-20 06:47:01,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:01,983 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-10-20 06:47:01,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:01,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834436176] [2020-10-20 06:47:01,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:01,998 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:02,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:02,010 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:02,016 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:02,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:02,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1784159127, now seen corresponding path program 1 times [2020-10-20 06:47:02,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:02,017 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531106559] [2020-10-20 06:47:02,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:02,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:02,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:47:02,054 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531106559] [2020-10-20 06:47:02,055 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:02,055 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:02,055 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728262256] [2020-10-20 06:47:02,056 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:02,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:02,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:02,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:02,056 INFO L87 Difference]: Start difference. First operand 65 states and 103 transitions. cyclomatic complexity: 40 Second operand 3 states. [2020-10-20 06:47:02,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:02,118 INFO L93 Difference]: Finished difference Result 126 states and 198 transitions. [2020-10-20 06:47:02,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:02,120 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 198 transitions. [2020-10-20 06:47:02,123 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 124 [2020-10-20 06:47:02,126 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 126 states and 198 transitions. [2020-10-20 06:47:02,126 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2020-10-20 06:47:02,127 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2020-10-20 06:47:02,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 198 transitions. [2020-10-20 06:47:02,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:02,129 INFO L691 BuchiCegarLoop]: Abstraction has 126 states and 198 transitions. [2020-10-20 06:47:02,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 198 transitions. [2020-10-20 06:47:02,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2020-10-20 06:47:02,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-10-20 06:47:02,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 198 transitions. [2020-10-20 06:47:02,143 INFO L714 BuchiCegarLoop]: Abstraction has 126 states and 198 transitions. [2020-10-20 06:47:02,143 INFO L594 BuchiCegarLoop]: Abstraction has 126 states and 198 transitions. [2020-10-20 06:47:02,143 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 06:47:02,144 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 198 transitions. [2020-10-20 06:47:02,146 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 124 [2020-10-20 06:47:02,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:02,147 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:02,147 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:02,147 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] [2020-10-20 06:47:02,148 INFO L794 eck$LassoCheckResult]: Stem: 366#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 340#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_~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_~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;havoc main_~cond~0; 341#L155-1 [2020-10-20 06:47:02,148 INFO L796 eck$LassoCheckResult]: Loop: 341#L155-1 assume !false;main_~cond~0 := main_#t~nondet17;havoc main_#t~nondet17; 377#L43 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; 378#L68 assume !(0 != main_~p1~0); 413#L68-2 assume !(0 != main_~p2~0); 412#L72-1 assume !(0 != main_~p3~0); 411#L76-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 410#L80-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 409#L84-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 408#L88-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 407#L92-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 406#L96-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 405#L100-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 403#L104-1 assume !(0 != main_~p1~0); 401#L110-1 assume !(0 != main_~p2~0); 400#L115-1 assume !(0 != main_~p3~0); 399#L120-1 assume !(0 != main_~p4~0); 357#L125-1 assume !(0 != main_~p5~0); 353#L130-1 assume !(0 != main_~p6~0); 363#L135-1 assume !(0 != main_~p7~0); 388#L140-1 assume !(0 != main_~p8~0); 387#L145-1 assume !(0 != main_~p9~0); 382#L150-1 assume !(0 != main_~p10~0); 341#L155-1 [2020-10-20 06:47:02,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:02,149 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2020-10-20 06:47:02,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:02,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330347451] [2020-10-20 06:47:02,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:02,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:02,162 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:02,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:02,173 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:02,180 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:02,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:02,181 INFO L82 PathProgramCache]: Analyzing trace with hash 95215385, now seen corresponding path program 1 times [2020-10-20 06:47:02,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:02,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162159773] [2020-10-20 06:47:02,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:02,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:02,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:47:02,212 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162159773] [2020-10-20 06:47:02,212 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:02,212 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:02,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515065224] [2020-10-20 06:47:02,213 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:02,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:02,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:02,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:02,214 INFO L87 Difference]: Start difference. First operand 126 states and 198 transitions. cyclomatic complexity: 76 Second operand 3 states. [2020-10-20 06:47:02,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:02,236 INFO L93 Difference]: Finished difference Result 246 states and 382 transitions. [2020-10-20 06:47:02,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:02,237 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 246 states and 382 transitions. [2020-10-20 06:47:02,242 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 244 [2020-10-20 06:47:02,246 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 246 states to 246 states and 382 transitions. [2020-10-20 06:47:02,246 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 246 [2020-10-20 06:47:02,247 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 246 [2020-10-20 06:47:02,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 246 states and 382 transitions. [2020-10-20 06:47:02,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:02,250 INFO L691 BuchiCegarLoop]: Abstraction has 246 states and 382 transitions. [2020-10-20 06:47:02,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states and 382 transitions. [2020-10-20 06:47:02,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2020-10-20 06:47:02,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2020-10-20 06:47:02,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 382 transitions. [2020-10-20 06:47:02,282 INFO L714 BuchiCegarLoop]: Abstraction has 246 states and 382 transitions. [2020-10-20 06:47:02,283 INFO L594 BuchiCegarLoop]: Abstraction has 246 states and 382 transitions. [2020-10-20 06:47:02,283 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 06:47:02,283 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 246 states and 382 transitions. [2020-10-20 06:47:02,291 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 244 [2020-10-20 06:47:02,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:02,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:02,292 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:02,292 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] [2020-10-20 06:47:02,292 INFO L794 eck$LassoCheckResult]: Stem: 738#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 717#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_~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_~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;havoc main_~cond~0; 718#L155-1 [2020-10-20 06:47:02,293 INFO L796 eck$LassoCheckResult]: Loop: 718#L155-1 assume !false;main_~cond~0 := main_#t~nondet17;havoc main_#t~nondet17; 818#L43 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; 816#L68 assume !(0 != main_~p1~0); 810#L68-2 assume !(0 != main_~p2~0); 812#L72-1 assume !(0 != main_~p3~0); 800#L76-1 assume !(0 != main_~p4~0); 802#L80-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 792#L84-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 793#L88-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 784#L92-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 785#L96-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 776#L100-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 777#L104-1 assume !(0 != main_~p1~0); 849#L110-1 assume !(0 != main_~p2~0); 848#L115-1 assume !(0 != main_~p3~0); 845#L120-1 assume !(0 != main_~p4~0); 843#L125-1 assume !(0 != main_~p5~0); 839#L130-1 assume !(0 != main_~p6~0); 835#L135-1 assume !(0 != main_~p7~0); 831#L140-1 assume !(0 != main_~p8~0); 827#L145-1 assume !(0 != main_~p9~0); 823#L150-1 assume !(0 != main_~p10~0); 718#L155-1 [2020-10-20 06:47:02,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:02,295 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2020-10-20 06:47:02,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:02,296 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433345022] [2020-10-20 06:47:02,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:02,329 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:02,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:02,353 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:02,361 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:02,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:02,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1493132517, now seen corresponding path program 1 times [2020-10-20 06:47:02,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:02,366 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578776584] [2020-10-20 06:47:02,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:02,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:02,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:47:02,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578776584] [2020-10-20 06:47:02,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:02,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:02,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020933522] [2020-10-20 06:47:02,416 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:02,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:02,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:02,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:02,417 INFO L87 Difference]: Start difference. First operand 246 states and 382 transitions. cyclomatic complexity: 144 Second operand 3 states. [2020-10-20 06:47:02,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:02,441 INFO L93 Difference]: Finished difference Result 482 states and 738 transitions. [2020-10-20 06:47:02,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:02,442 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 482 states and 738 transitions. [2020-10-20 06:47:02,448 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 480 [2020-10-20 06:47:02,454 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 482 states to 482 states and 738 transitions. [2020-10-20 06:47:02,454 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 482 [2020-10-20 06:47:02,456 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 482 [2020-10-20 06:47:02,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 482 states and 738 transitions. [2020-10-20 06:47:02,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:02,459 INFO L691 BuchiCegarLoop]: Abstraction has 482 states and 738 transitions. [2020-10-20 06:47:02,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states and 738 transitions. [2020-10-20 06:47:02,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2020-10-20 06:47:02,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2020-10-20 06:47:02,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 738 transitions. [2020-10-20 06:47:02,487 INFO L714 BuchiCegarLoop]: Abstraction has 482 states and 738 transitions. [2020-10-20 06:47:02,487 INFO L594 BuchiCegarLoop]: Abstraction has 482 states and 738 transitions. [2020-10-20 06:47:02,487 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 06:47:02,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 482 states and 738 transitions. [2020-10-20 06:47:02,491 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 480 [2020-10-20 06:47:02,491 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:02,491 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:02,492 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:02,492 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] [2020-10-20 06:47:02,492 INFO L794 eck$LassoCheckResult]: Stem: 1476#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1455#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_~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_~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;havoc main_~cond~0; 1456#L155-1 [2020-10-20 06:47:02,493 INFO L796 eck$LassoCheckResult]: Loop: 1456#L155-1 assume !false;main_~cond~0 := main_#t~nondet17;havoc main_#t~nondet17; 1530#L43 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; 1528#L68 assume !(0 != main_~p1~0); 1524#L68-2 assume !(0 != main_~p2~0); 1522#L72-1 assume !(0 != main_~p3~0); 1518#L76-1 assume !(0 != main_~p4~0); 1514#L80-1 assume !(0 != main_~p5~0); 1512#L84-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1510#L88-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1508#L92-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1506#L96-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1504#L100-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1501#L104-1 assume !(0 != main_~p1~0); 1502#L110-1 assume !(0 != main_~p2~0); 1562#L115-1 assume !(0 != main_~p3~0); 1557#L120-1 assume !(0 != main_~p4~0); 1553#L125-1 assume !(0 != main_~p5~0); 1550#L130-1 assume !(0 != main_~p6~0); 1546#L135-1 assume !(0 != main_~p7~0); 1542#L140-1 assume !(0 != main_~p8~0); 1538#L145-1 assume !(0 != main_~p9~0); 1534#L150-1 assume !(0 != main_~p10~0); 1456#L155-1 [2020-10-20 06:47:02,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:02,493 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2020-10-20 06:47:02,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:02,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984835425] [2020-10-20 06:47:02,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:02,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:02,509 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:02,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:02,521 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:02,537 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:02,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:02,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1780766425, now seen corresponding path program 1 times [2020-10-20 06:47:02,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:02,538 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034932295] [2020-10-20 06:47:02,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:02,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:02,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:47:02,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034932295] [2020-10-20 06:47:02,560 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:02,560 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:02,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976804049] [2020-10-20 06:47:02,561 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:02,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:02,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:02,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:02,562 INFO L87 Difference]: Start difference. First operand 482 states and 738 transitions. cyclomatic complexity: 272 Second operand 3 states. [2020-10-20 06:47:02,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:02,582 INFO L93 Difference]: Finished difference Result 946 states and 1426 transitions. [2020-10-20 06:47:02,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:02,583 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 946 states and 1426 transitions. [2020-10-20 06:47:02,592 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 944 [2020-10-20 06:47:02,599 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 946 states to 946 states and 1426 transitions. [2020-10-20 06:47:02,600 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 946 [2020-10-20 06:47:02,601 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 946 [2020-10-20 06:47:02,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 946 states and 1426 transitions. [2020-10-20 06:47:02,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:02,604 INFO L691 BuchiCegarLoop]: Abstraction has 946 states and 1426 transitions. [2020-10-20 06:47:02,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states and 1426 transitions. [2020-10-20 06:47:02,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 946. [2020-10-20 06:47:02,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 946 states. [2020-10-20 06:47:02,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1426 transitions. [2020-10-20 06:47:02,627 INFO L714 BuchiCegarLoop]: Abstraction has 946 states and 1426 transitions. [2020-10-20 06:47:02,627 INFO L594 BuchiCegarLoop]: Abstraction has 946 states and 1426 transitions. [2020-10-20 06:47:02,627 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 06:47:02,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 946 states and 1426 transitions. [2020-10-20 06:47:02,634 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 944 [2020-10-20 06:47:02,634 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:02,634 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:02,635 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:02,635 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] [2020-10-20 06:47:02,635 INFO L794 eck$LassoCheckResult]: Stem: 2909#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 2887#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_~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_~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;havoc main_~cond~0; 2888#L155-1 [2020-10-20 06:47:02,635 INFO L796 eck$LassoCheckResult]: Loop: 2888#L155-1 assume !false;main_~cond~0 := main_#t~nondet17;havoc main_#t~nondet17; 2992#L43 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; 2988#L68 assume !(0 != main_~p1~0); 2981#L68-2 assume !(0 != main_~p2~0); 2976#L72-1 assume !(0 != main_~p3~0); 2969#L76-1 assume !(0 != main_~p4~0); 2961#L80-1 assume !(0 != main_~p5~0); 2955#L84-1 assume !(0 != main_~p6~0); 2949#L88-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2950#L92-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2941#L96-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 2942#L100-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 2935#L104-1 assume !(0 != main_~p1~0); 2936#L110-1 assume !(0 != main_~p2~0); 3053#L115-1 assume !(0 != main_~p3~0); 3044#L120-1 assume !(0 != main_~p4~0); 3040#L125-1 assume !(0 != main_~p5~0); 3032#L130-1 assume !(0 != main_~p6~0); 3029#L135-1 assume !(0 != main_~p7~0); 3009#L140-1 assume !(0 != main_~p8~0); 3005#L145-1 assume !(0 != main_~p9~0); 3001#L150-1 assume !(0 != main_~p10~0); 2888#L155-1 [2020-10-20 06:47:02,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:02,636 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2020-10-20 06:47:02,636 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:02,648 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614198840] [2020-10-20 06:47:02,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:02,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:02,656 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:02,663 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:02,667 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:02,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:02,667 INFO L82 PathProgramCache]: Analyzing trace with hash 500902747, now seen corresponding path program 1 times [2020-10-20 06:47:02,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:02,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832705394] [2020-10-20 06:47:02,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:02,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:47:02,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832705394] [2020-10-20 06:47:02,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:02,688 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:02,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952086484] [2020-10-20 06:47:02,689 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:02,689 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:02,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:02,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:02,690 INFO L87 Difference]: Start difference. First operand 946 states and 1426 transitions. cyclomatic complexity: 512 Second operand 3 states. [2020-10-20 06:47:02,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:02,716 INFO L93 Difference]: Finished difference Result 1858 states and 2754 transitions. [2020-10-20 06:47:02,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:02,717 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1858 states and 2754 transitions. [2020-10-20 06:47:02,738 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1856 [2020-10-20 06:47:02,753 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1858 states to 1858 states and 2754 transitions. [2020-10-20 06:47:02,753 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1858 [2020-10-20 06:47:02,755 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1858 [2020-10-20 06:47:02,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1858 states and 2754 transitions. [2020-10-20 06:47:02,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:02,759 INFO L691 BuchiCegarLoop]: Abstraction has 1858 states and 2754 transitions. [2020-10-20 06:47:02,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states and 2754 transitions. [2020-10-20 06:47:02,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1858. [2020-10-20 06:47:02,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1858 states. [2020-10-20 06:47:02,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2754 transitions. [2020-10-20 06:47:02,821 INFO L714 BuchiCegarLoop]: Abstraction has 1858 states and 2754 transitions. [2020-10-20 06:47:02,821 INFO L594 BuchiCegarLoop]: Abstraction has 1858 states and 2754 transitions. [2020-10-20 06:47:02,821 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 06:47:02,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1858 states and 2754 transitions. [2020-10-20 06:47:02,837 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1856 [2020-10-20 06:47:02,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:02,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:02,838 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:02,838 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] [2020-10-20 06:47:02,838 INFO L794 eck$LassoCheckResult]: Stem: 5718#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 5696#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_~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_~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;havoc main_~cond~0; 5697#L155-1 [2020-10-20 06:47:02,839 INFO L796 eck$LassoCheckResult]: Loop: 5697#L155-1 assume !false;main_~cond~0 := main_#t~nondet17;havoc main_#t~nondet17; 5855#L43 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; 5853#L68 assume !(0 != main_~p1~0); 5851#L68-2 assume !(0 != main_~p2~0); 5850#L72-1 assume !(0 != main_~p3~0); 5848#L76-1 assume !(0 != main_~p4~0); 5845#L80-1 assume !(0 != main_~p5~0); 5841#L84-1 assume !(0 != main_~p6~0); 5838#L88-1 assume !(0 != main_~p7~0); 5835#L92-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 5836#L96-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 5827#L100-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 5828#L104-1 assume !(0 != main_~p1~0); 5815#L110-1 assume !(0 != main_~p2~0); 5816#L115-1 assume !(0 != main_~p3~0); 5803#L120-1 assume !(0 != main_~p4~0); 5805#L125-1 assume !(0 != main_~p5~0); 5793#L130-1 assume !(0 != main_~p6~0); 5794#L135-1 assume !(0 != main_~p7~0); 5861#L140-1 assume !(0 != main_~p8~0); 5859#L145-1 assume !(0 != main_~p9~0); 5857#L150-1 assume !(0 != main_~p10~0); 5697#L155-1 [2020-10-20 06:47:02,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:02,839 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2020-10-20 06:47:02,839 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:02,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387652951] [2020-10-20 06:47:02,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:02,848 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:02,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:02,854 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:02,858 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:02,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:02,859 INFO L82 PathProgramCache]: Analyzing trace with hash -510214503, now seen corresponding path program 1 times [2020-10-20 06:47:02,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:02,860 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121902077] [2020-10-20 06:47:02,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:02,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:02,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:47:02,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121902077] [2020-10-20 06:47:02,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:02,883 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:02,883 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921118664] [2020-10-20 06:47:02,883 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:02,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:02,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:02,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:02,884 INFO L87 Difference]: Start difference. First operand 1858 states and 2754 transitions. cyclomatic complexity: 960 Second operand 3 states. [2020-10-20 06:47:02,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:02,955 INFO L93 Difference]: Finished difference Result 3650 states and 5314 transitions. [2020-10-20 06:47:02,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:02,956 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3650 states and 5314 transitions. [2020-10-20 06:47:02,988 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3648 [2020-10-20 06:47:03,013 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3650 states to 3650 states and 5314 transitions. [2020-10-20 06:47:03,014 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3650 [2020-10-20 06:47:03,017 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3650 [2020-10-20 06:47:03,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3650 states and 5314 transitions. [2020-10-20 06:47:03,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:03,024 INFO L691 BuchiCegarLoop]: Abstraction has 3650 states and 5314 transitions. [2020-10-20 06:47:03,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3650 states and 5314 transitions. [2020-10-20 06:47:03,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3650 to 3650. [2020-10-20 06:47:03,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3650 states. [2020-10-20 06:47:03,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3650 states to 3650 states and 5314 transitions. [2020-10-20 06:47:03,307 INFO L714 BuchiCegarLoop]: Abstraction has 3650 states and 5314 transitions. [2020-10-20 06:47:03,307 INFO L594 BuchiCegarLoop]: Abstraction has 3650 states and 5314 transitions. [2020-10-20 06:47:03,307 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 06:47:03,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3650 states and 5314 transitions. [2020-10-20 06:47:03,331 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3648 [2020-10-20 06:47:03,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:03,332 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:03,332 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:03,333 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] [2020-10-20 06:47:03,333 INFO L794 eck$LassoCheckResult]: Stem: 11239#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 11209#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_~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_~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;havoc main_~cond~0; 11210#L155-1 [2020-10-20 06:47:03,333 INFO L796 eck$LassoCheckResult]: Loop: 11210#L155-1 assume !false;main_~cond~0 := main_#t~nondet17;havoc main_#t~nondet17; 11460#L43 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; 11458#L68 assume !(0 != main_~p1~0); 11456#L68-2 assume !(0 != main_~p2~0); 11455#L72-1 assume !(0 != main_~p3~0); 11453#L76-1 assume !(0 != main_~p4~0); 11451#L80-1 assume !(0 != main_~p5~0); 11449#L84-1 assume !(0 != main_~p6~0); 11445#L88-1 assume !(0 != main_~p7~0); 11442#L92-1 assume !(0 != main_~p8~0); 11433#L96-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 11434#L100-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 11411#L104-1 assume !(0 != main_~p1~0); 11412#L110-1 assume !(0 != main_~p2~0); 11393#L115-1 assume !(0 != main_~p3~0); 11392#L120-1 assume !(0 != main_~p4~0); 11372#L125-1 assume !(0 != main_~p5~0); 11373#L130-1 assume !(0 != main_~p6~0); 11351#L135-1 assume !(0 != main_~p7~0); 11352#L140-1 assume !(0 != main_~p8~0); 11464#L145-1 assume !(0 != main_~p9~0); 11462#L150-1 assume !(0 != main_~p10~0); 11210#L155-1 [2020-10-20 06:47:03,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:03,333 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2020-10-20 06:47:03,334 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:03,334 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953070043] [2020-10-20 06:47:03,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:03,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:03,341 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:03,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:03,346 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:03,350 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:03,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:03,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1097020517, now seen corresponding path program 1 times [2020-10-20 06:47:03,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:03,351 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796272442] [2020-10-20 06:47:03,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:03,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:47:03,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796272442] [2020-10-20 06:47:03,369 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:03,369 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:03,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131291950] [2020-10-20 06:47:03,369 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:03,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:03,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:03,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:03,370 INFO L87 Difference]: Start difference. First operand 3650 states and 5314 transitions. cyclomatic complexity: 1792 Second operand 3 states. [2020-10-20 06:47:03,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:03,442 INFO L93 Difference]: Finished difference Result 7170 states and 10242 transitions. [2020-10-20 06:47:03,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:03,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7170 states and 10242 transitions. [2020-10-20 06:47:03,493 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7168 [2020-10-20 06:47:03,579 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7170 states to 7170 states and 10242 transitions. [2020-10-20 06:47:03,579 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7170 [2020-10-20 06:47:03,587 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7170 [2020-10-20 06:47:03,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7170 states and 10242 transitions. [2020-10-20 06:47:03,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:03,601 INFO L691 BuchiCegarLoop]: Abstraction has 7170 states and 10242 transitions. [2020-10-20 06:47:03,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7170 states and 10242 transitions. [2020-10-20 06:47:04,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7170 to 7170. [2020-10-20 06:47:04,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7170 states. [2020-10-20 06:47:04,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7170 states to 7170 states and 10242 transitions. [2020-10-20 06:47:04,047 INFO L714 BuchiCegarLoop]: Abstraction has 7170 states and 10242 transitions. [2020-10-20 06:47:04,047 INFO L594 BuchiCegarLoop]: Abstraction has 7170 states and 10242 transitions. [2020-10-20 06:47:04,047 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-20 06:47:04,047 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7170 states and 10242 transitions. [2020-10-20 06:47:04,078 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7168 [2020-10-20 06:47:04,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:04,079 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:04,079 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:04,079 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] [2020-10-20 06:47:04,080 INFO L794 eck$LassoCheckResult]: Stem: 22061#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 22037#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_~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_~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;havoc main_~cond~0; 22038#L155-1 [2020-10-20 06:47:04,080 INFO L796 eck$LassoCheckResult]: Loop: 22038#L155-1 assume !false;main_~cond~0 := main_#t~nondet17;havoc main_#t~nondet17; 22428#L43 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; 22426#L68 assume !(0 != main_~p1~0); 22424#L68-2 assume !(0 != main_~p2~0); 22423#L72-1 assume !(0 != main_~p3~0); 22422#L76-1 assume !(0 != main_~p4~0); 22420#L80-1 assume !(0 != main_~p5~0); 22418#L84-1 assume !(0 != main_~p6~0); 22415#L88-1 assume !(0 != main_~p7~0); 22411#L92-1 assume !(0 != main_~p8~0); 22407#L96-1 assume !(0 != main_~p9~0); 22308#L100-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 22309#L104-1 assume !(0 != main_~p1~0); 22399#L110-1 assume !(0 != main_~p2~0); 22398#L115-1 assume !(0 != main_~p3~0); 22247#L120-1 assume !(0 != main_~p4~0); 22249#L125-1 assume !(0 != main_~p5~0); 22238#L130-1 assume !(0 != main_~p6~0); 22240#L135-1 assume !(0 != main_~p7~0); 22230#L140-1 assume !(0 != main_~p8~0); 22231#L145-1 assume !(0 != main_~p9~0); 22390#L150-1 assume !(0 != main_~p10~0); 22038#L155-1 [2020-10-20 06:47:04,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:04,080 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2020-10-20 06:47:04,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:04,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700695962] [2020-10-20 06:47:04,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:04,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:04,087 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:04,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:04,092 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:04,095 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:04,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:04,096 INFO L82 PathProgramCache]: Analyzing trace with hash -838855079, now seen corresponding path program 1 times [2020-10-20 06:47:04,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:04,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38514497] [2020-10-20 06:47:04,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:04,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:47:04,113 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38514497] [2020-10-20 06:47:04,113 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:04,113 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 06:47:04,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974741203] [2020-10-20 06:47:04,114 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:04,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:04,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:04,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:04,114 INFO L87 Difference]: Start difference. First operand 7170 states and 10242 transitions. cyclomatic complexity: 3328 Second operand 3 states. [2020-10-20 06:47:04,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:04,206 INFO L93 Difference]: Finished difference Result 14082 states and 19714 transitions. [2020-10-20 06:47:04,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:04,207 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14082 states and 19714 transitions. [2020-10-20 06:47:04,336 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 14080 [2020-10-20 06:47:04,717 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14082 states to 14082 states and 19714 transitions. [2020-10-20 06:47:04,718 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14082 [2020-10-20 06:47:04,730 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14082 [2020-10-20 06:47:04,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14082 states and 19714 transitions. [2020-10-20 06:47:04,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:04,755 INFO L691 BuchiCegarLoop]: Abstraction has 14082 states and 19714 transitions. [2020-10-20 06:47:04,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14082 states and 19714 transitions. [2020-10-20 06:47:05,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14082 to 14082. [2020-10-20 06:47:05,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14082 states. [2020-10-20 06:47:05,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14082 states to 14082 states and 19714 transitions. [2020-10-20 06:47:05,383 INFO L714 BuchiCegarLoop]: Abstraction has 14082 states and 19714 transitions. [2020-10-20 06:47:05,384 INFO L594 BuchiCegarLoop]: Abstraction has 14082 states and 19714 transitions. [2020-10-20 06:47:05,384 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-20 06:47:05,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14082 states and 19714 transitions. [2020-10-20 06:47:05,427 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 14080 [2020-10-20 06:47:05,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:05,431 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:05,433 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:05,433 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] [2020-10-20 06:47:05,434 INFO L794 eck$LassoCheckResult]: Stem: 43316#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 43295#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_~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_~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;havoc main_~cond~0; 43296#L155-1 [2020-10-20 06:47:05,434 INFO L796 eck$LassoCheckResult]: Loop: 43296#L155-1 assume !false;main_~cond~0 := main_#t~nondet17;havoc main_#t~nondet17; 43573#L43 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; 43565#L68 assume !(0 != main_~p1~0); 43557#L68-2 assume !(0 != main_~p2~0); 43548#L72-1 assume !(0 != main_~p3~0); 43539#L76-1 assume !(0 != main_~p4~0); 43531#L80-1 assume !(0 != main_~p5~0); 43491#L84-1 assume !(0 != main_~p6~0); 43489#L88-1 assume !(0 != main_~p7~0); 43488#L92-1 assume !(0 != main_~p8~0); 43486#L96-1 assume !(0 != main_~p9~0); 43484#L100-1 assume !(0 != main_~p10~0); 43485#L104-1 assume !(0 != main_~p1~0); 43663#L110-1 assume !(0 != main_~p2~0); 43783#L115-1 assume !(0 != main_~p3~0); 43778#L120-1 assume !(0 != main_~p4~0); 43775#L125-1 assume !(0 != main_~p5~0); 43772#L130-1 assume !(0 != main_~p6~0); 43670#L135-1 assume !(0 != main_~p7~0); 43424#L140-1 assume !(0 != main_~p8~0); 43425#L145-1 assume !(0 != main_~p9~0); 43448#L150-1 assume !(0 != main_~p10~0); 43296#L155-1 [2020-10-20 06:47:05,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:05,435 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2020-10-20 06:47:05,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:05,435 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988668435] [2020-10-20 06:47:05,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:05,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:05,447 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:05,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:05,452 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:05,455 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:05,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:05,456 INFO L82 PathProgramCache]: Analyzing trace with hash -137790501, now seen corresponding path program 1 times [2020-10-20 06:47:05,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:05,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665043467] [2020-10-20 06:47:05,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:05,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:05,462 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:05,469 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:05,474 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:05,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:05,475 INFO L82 PathProgramCache]: Analyzing trace with hash -970235363, now seen corresponding path program 1 times [2020-10-20 06:47:05,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:05,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273522625] [2020-10-20 06:47:05,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:05,483 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:05,490 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:05,496 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:05,790 WARN L193 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2020-10-20 06:47:06,130 WARN L193 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 81 [2020-10-20 06:47:06,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 06:47:06 BoogieIcfgContainer [2020-10-20 06:47:06,298 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 06:47:06,298 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 06:47:06,298 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 06:47:06,299 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 06:47:06,299 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:47:01" (3/4) ... [2020-10-20 06:47:06,304 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-20 06:47:06,436 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 06:47:06,437 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 06:47:06,440 INFO L168 Benchmark]: Toolchain (without parser) took 5968.69 ms. Allocated memory was 39.3 MB in the beginning and 142.1 MB in the end (delta: 102.8 MB). Free memory was 16.0 MB in the beginning and 73.9 MB in the end (delta: -57.9 MB). Peak memory consumption was 44.8 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:06,443 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 30.4 MB. Free memory was 15.6 MB in the beginning and 15.6 MB in the end (delta: 39.9 kB). Peak memory consumption was 39.9 kB. Max. memory is 14.3 GB. [2020-10-20 06:47:06,450 INFO L168 Benchmark]: CACSL2BoogieTranslator took 431.83 ms. Allocated memory was 39.3 MB in the beginning and 39.8 MB in the end (delta: 524.3 kB). Free memory was 15.0 MB in the beginning and 12.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 5.8 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:06,454 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.64 ms. Allocated memory is still 39.8 MB. Free memory was 12.0 MB in the beginning and 10.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:06,455 INFO L168 Benchmark]: Boogie Preprocessor took 37.75 ms. Allocated memory was 39.8 MB in the beginning and 41.4 MB in the end (delta: 1.6 MB). Free memory was 10.2 MB in the beginning and 22.9 MB in the end (delta: -12.8 MB). Peak memory consumption was 386.8 kB. Max. memory is 14.3 GB. [2020-10-20 06:47:06,459 INFO L168 Benchmark]: RCFGBuilder took 477.41 ms. Allocated memory is still 41.4 MB. Free memory was 22.9 MB in the beginning and 16.0 MB in the end (delta: 7.0 MB). Peak memory consumption was 13.1 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:06,460 INFO L168 Benchmark]: BuchiAutomizer took 4825.29 ms. Allocated memory was 41.4 MB in the beginning and 142.1 MB in the end (delta: 100.7 MB). Free memory was 15.7 MB in the beginning and 76.7 MB in the end (delta: -61.0 MB). Peak memory consumption was 103.9 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:06,460 INFO L168 Benchmark]: Witness Printer took 138.70 ms. Allocated memory is still 142.1 MB. Free memory was 76.7 MB in the beginning and 73.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:06,469 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.34 ms. Allocated memory is still 30.4 MB. Free memory was 15.6 MB in the beginning and 15.6 MB in the end (delta: 39.9 kB). Peak memory consumption was 39.9 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 431.83 ms. Allocated memory was 39.3 MB in the beginning and 39.8 MB in the end (delta: 524.3 kB). Free memory was 15.0 MB in the beginning and 12.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 5.8 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 46.64 ms. Allocated memory is still 39.8 MB. Free memory was 12.0 MB in the beginning and 10.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 37.75 ms. Allocated memory was 39.8 MB in the beginning and 41.4 MB in the end (delta: 1.6 MB). Free memory was 10.2 MB in the beginning and 22.9 MB in the end (delta: -12.8 MB). Peak memory consumption was 386.8 kB. Max. memory is 14.3 GB. * RCFGBuilder took 477.41 ms. Allocated memory is still 41.4 MB. Free memory was 22.9 MB in the beginning and 16.0 MB in the end (delta: 7.0 MB). Peak memory consumption was 13.1 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 4825.29 ms. Allocated memory was 41.4 MB in the beginning and 142.1 MB in the end (delta: 100.7 MB). Free memory was 15.7 MB in the beginning and 76.7 MB in the end (delta: -61.0 MB). Peak memory consumption was 103.9 MB. Max. memory is 14.3 GB. * Witness Printer took 138.70 ms. Allocated memory is still 142.1 MB. Free memory was 76.7 MB in the beginning and 73.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (9 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.9 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 14082 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.7s and 10 iterations. TraceHistogramMax:1. Analysis of lassos took 1.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 9. Minimization of nondet autom 0. Automata minimization 1.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.7s Buchi closure took 0.0s. Biggest automaton had 14082 states and ocurred in iteration 9. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 722 SDtfs, 374 SDslu, 445 SDs, 0 SdLazy, 45 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI9 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: 41]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {NULL=2, NULL=0, p1=0, \result=0, p3=0, p2=0, p5=0, NULL=1, p10=0, p4=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5fe7c5e0=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6f64eaf5=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1dfdb529=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@28d2e917=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@497bf128=0, lk10=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5dade0ca=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@ddb5dbb=14, cond=14, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@18099b0=0, NULL=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@71a43054=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4e01f526=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@58e5bf7f=0, NULL=0, NULL=0, NULL=0, NULL=4, lk3=0, lk4=0, lk5=0, lk6=0, NULL=0, lk1=0, lk2=0, lk7=0, lk8=0, lk9=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 41]: 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; [L39] int cond; Loop: [L41] COND TRUE 1 [L42] cond = __VERIFIER_nondet_int() [L43] COND FALSE !(cond == 0) [L46] lk1 = 0 [L48] lk2 = 0 [L50] lk3 = 0 [L52] lk4 = 0 [L54] lk5 = 0 [L56] lk6 = 0 [L58] lk7 = 0 [L60] lk8 = 0 [L62] lk9 = 0 [L64] lk10 = 0 [L68] COND FALSE !(p1 != 0) [L72] COND FALSE !(p2 != 0) [L76] COND FALSE !(p3 != 0) [L80] COND FALSE !(p4 != 0) [L84] COND FALSE !(p5 != 0) [L88] COND FALSE !(p6 != 0) [L92] COND FALSE !(p7 != 0) [L96] COND FALSE !(p8 != 0) [L100] COND FALSE !(p9 != 0) [L104] COND FALSE !(p10 != 0) [L110] COND FALSE !(p1 != 0) [L115] COND FALSE !(p2 != 0) [L120] COND FALSE !(p3 != 0) [L125] COND FALSE !(p4 != 0) [L130] COND FALSE !(p5 != 0) [L135] COND FALSE !(p6 != 0) [L140] COND FALSE !(p7 != 0) [L145] COND FALSE !(p8 != 0) [L150] COND FALSE !(p9 != 0) [L155] COND FALSE !(p10 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...