./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_9.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_9.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 20a70402cc893fb2c7adec21ca8a267adc3c5cbb ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 06:47:18,039 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 06:47:18,042 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 06:47:18,080 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 06:47:18,081 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 06:47:18,090 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 06:47:18,092 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 06:47:18,096 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 06:47:18,099 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 06:47:18,104 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 06:47:18,105 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 06:47:18,106 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 06:47:18,106 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 06:47:18,107 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 06:47:18,108 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 06:47:18,109 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 06:47:18,117 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 06:47:18,120 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 06:47:18,122 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 06:47:18,127 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 06:47:18,129 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 06:47:18,132 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 06:47:18,134 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 06:47:18,135 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 06:47:18,139 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 06:47:18,147 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 06:47:18,147 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 06:47:18,148 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 06:47:18,149 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 06:47:18,150 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 06:47:18,153 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 06:47:18,154 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 06:47:18,155 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 06:47:18,156 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 06:47:18,157 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 06:47:18,159 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 06:47:18,163 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 06:47:18,163 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 06:47:18,163 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 06:47:18,164 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 06:47:18,165 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 06:47:18,166 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-20 06:47:18,210 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 06:47:18,211 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 06:47:18,215 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 06:47:18,215 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 06:47:18,215 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 06:47:18,216 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 06:47:18,216 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 06:47:18,216 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 06:47:18,216 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 06:47:18,216 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 06:47:18,217 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 06:47:18,218 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 06:47:18,218 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 06:47:18,218 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 06:47:18,219 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 06:47:18,219 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 06:47:18,219 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 06:47:18,219 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 06:47:18,219 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 06:47:18,220 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 06:47:18,220 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 06:47:18,220 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 06:47:18,220 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 06:47:18,221 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 06:47:18,221 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 06:47:18,221 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 06:47:18,221 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 06:47:18,221 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 06:47:18,222 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 06:47:18,222 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 06:47:18,222 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 06:47:18,222 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 06:47:18,224 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 06:47:18,224 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 -> 20a70402cc893fb2c7adec21ca8a267adc3c5cbb [2020-10-20 06:47:18,433 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 06:47:18,446 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 06:47:18,449 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 06:47:18,458 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 06:47:18,459 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 06:47:18,460 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_9.c [2020-10-20 06:47:18,540 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff5d9d753/0df379494a694c65a036b7ed4c6c655e/FLAG2ae332e8d [2020-10-20 06:47:19,099 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 06:47:19,100 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_9.c [2020-10-20 06:47:19,108 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff5d9d753/0df379494a694c65a036b7ed4c6c655e/FLAG2ae332e8d [2020-10-20 06:47:19,475 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff5d9d753/0df379494a694c65a036b7ed4c6c655e [2020-10-20 06:47:19,479 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 06:47:19,486 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 06:47:19,490 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 06:47:19,490 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 06:47:19,493 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 06:47:19,494 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:47:19" (1/1) ... [2020-10-20 06:47:19,498 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f55670c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:19, skipping insertion in model container [2020-10-20 06:47:19,498 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:47:19" (1/1) ... [2020-10-20 06:47:19,508 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 06:47:19,531 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 06:47:19,759 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:47:19,774 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 06:47:19,812 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:47:19,827 INFO L208 MainTranslator]: Completed translation [2020-10-20 06:47:19,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:19 WrapperNode [2020-10-20 06:47:19,828 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 06:47:19,829 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 06:47:19,829 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 06:47:19,829 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 06:47:19,836 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:19" (1/1) ... [2020-10-20 06:47:19,843 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:19" (1/1) ... [2020-10-20 06:47:19,863 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 06:47:19,864 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 06:47:19,864 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 06:47:19,864 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 06:47:19,872 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:19" (1/1) ... [2020-10-20 06:47:19,873 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:19" (1/1) ... [2020-10-20 06:47:19,876 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:19" (1/1) ... [2020-10-20 06:47:19,876 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:19" (1/1) ... [2020-10-20 06:47:19,884 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:19" (1/1) ... [2020-10-20 06:47:19,892 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:19" (1/1) ... [2020-10-20 06:47:19,894 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:19" (1/1) ... [2020-10-20 06:47:19,897 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 06:47:19,898 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 06:47:19,898 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 06:47:19,898 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 06:47:19,899 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:19" (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:19,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 06:47:19,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 06:47:19,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 06:47:19,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 06:47:20,289 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 06:47:20,290 INFO L298 CfgBuilder]: Removed 7 assume(true) statements. [2020-10-20 06:47:20,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:47:20 BoogieIcfgContainer [2020-10-20 06:47:20,293 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 06:47:20,294 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 06:47:20,294 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 06:47:20,299 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 06:47:20,300 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:47:20,300 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 06:47:19" (1/3) ... [2020-10-20 06:47:20,302 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b87cf60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:47:20, skipping insertion in model container [2020-10-20 06:47:20,302 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:47:20,303 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:19" (2/3) ... [2020-10-20 06:47:20,303 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b87cf60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:47:20, skipping insertion in model container [2020-10-20 06:47:20,303 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:47:20,304 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:47:20" (3/3) ... [2020-10-20 06:47:20,306 INFO L373 chiAutomizerObserver]: Analyzing ICFG test_locks_9.c [2020-10-20 06:47:20,379 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 06:47:20,379 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 06:47:20,380 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 06:47:20,380 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 06:47:20,380 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 06:47:20,381 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 06:47:20,381 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 06:47:20,381 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 06:47:20,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states. [2020-10-20 06:47:20,421 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2020-10-20 06:47:20,421 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:20,421 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:20,427 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:20,427 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] [2020-10-20 06:47:20,427 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 06:47:20,428 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states. [2020-10-20 06:47:20,431 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2020-10-20 06:47:20,431 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:20,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:20,432 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:20,432 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] [2020-10-20 06:47:20,441 INFO L794 eck$LassoCheckResult]: Stem: 33#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(15);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_~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_~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;havoc main_~cond~0; 35#L141-1true [2020-10-20 06:47:20,442 INFO L796 eck$LassoCheckResult]: Loop: 35#L141-1true assume !false;main_~cond~0 := main_#t~nondet16;havoc main_#t~nondet16; 8#L40true 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; 13#L63true assume 0 != main_~p1~0;main_~lk1~0 := 1; 28#L63-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 18#L67-1true assume !(0 != main_~p3~0); 5#L71-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 31#L75-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 37#L79-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 27#L83-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 16#L87-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 3#L91-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 9#L95-1true assume !(0 != main_~p1~0); 38#L101-1true assume !(0 != main_~p2~0); 10#L106-1true assume !(0 != main_~p3~0); 23#L111-1true assume !(0 != main_~p4~0); 30#L116-1true assume !(0 != main_~p5~0); 36#L121-1true assume !(0 != main_~p6~0); 7#L126-1true assume !(0 != main_~p7~0); 19#L131-1true assume !(0 != main_~p8~0); 26#L136-1true assume !(0 != main_~p9~0); 35#L141-1true [2020-10-20 06:47:20,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:20,448 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-20 06:47:20,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:20,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517077788] [2020-10-20 06:47:20,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:20,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:20,569 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:20,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:20,588 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:20,613 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:20,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:20,615 INFO L82 PathProgramCache]: Analyzing trace with hash 694706197, now seen corresponding path program 1 times [2020-10-20 06:47:20,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:20,616 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666070393] [2020-10-20 06:47:20,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:20,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:20,690 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:20,690 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666070393] [2020-10-20 06:47:20,697 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:20,698 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:20,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772858916] [2020-10-20 06:47:20,708 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:20,710 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:20,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:20,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:20,731 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2020-10-20 06:47:20,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:20,807 INFO L93 Difference]: Finished difference Result 69 states and 118 transitions. [2020-10-20 06:47:20,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:20,810 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 118 transitions. [2020-10-20 06:47:20,814 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2020-10-20 06:47:20,820 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 59 states and 93 transitions. [2020-10-20 06:47:20,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2020-10-20 06:47:20,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2020-10-20 06:47:20,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 93 transitions. [2020-10-20 06:47:20,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:20,824 INFO L691 BuchiCegarLoop]: Abstraction has 59 states and 93 transitions. [2020-10-20 06:47:20,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 93 transitions. [2020-10-20 06:47:20,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-10-20 06:47:20,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-20 06:47:20,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 93 transitions. [2020-10-20 06:47:20,856 INFO L714 BuchiCegarLoop]: Abstraction has 59 states and 93 transitions. [2020-10-20 06:47:20,856 INFO L594 BuchiCegarLoop]: Abstraction has 59 states and 93 transitions. [2020-10-20 06:47:20,857 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 06:47:20,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 93 transitions. [2020-10-20 06:47:20,859 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2020-10-20 06:47:20,859 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:20,859 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:20,860 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:20,860 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] [2020-10-20 06:47:20,860 INFO L794 eck$LassoCheckResult]: Stem: 147#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 133#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_~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_~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;havoc main_~cond~0; 134#L141-1 [2020-10-20 06:47:20,861 INFO L796 eck$LassoCheckResult]: Loop: 134#L141-1 assume !false;main_~cond~0 := main_#t~nondet16;havoc main_#t~nondet16; 151#L40 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; 150#L63 assume !(0 != main_~p1~0); 145#L63-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 140#L67-1 assume !(0 != main_~p3~0); 119#L71-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 120#L75-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 146#L79-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 144#L83-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 138#L87-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 139#L91-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 167#L95-1 assume !(0 != main_~p1~0); 149#L101-1 assume !(0 != main_~p2~0); 128#L106-1 assume !(0 != main_~p3~0); 129#L111-1 assume !(0 != main_~p4~0); 141#L116-1 assume !(0 != main_~p5~0); 118#L121-1 assume !(0 != main_~p6~0); 123#L126-1 assume !(0 != main_~p7~0); 124#L131-1 assume !(0 != main_~p8~0); 132#L136-1 assume !(0 != main_~p9~0); 134#L141-1 [2020-10-20 06:47:20,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:20,861 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-10-20 06:47:20,861 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:20,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220956027] [2020-10-20 06:47:20,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:20,885 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:20,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:20,898 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:20,903 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:20,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:20,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1299438509, now seen corresponding path program 1 times [2020-10-20 06:47:20,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:20,904 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251092820] [2020-10-20 06:47:20,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:20,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:20,933 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:20,933 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251092820] [2020-10-20 06:47:20,934 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:20,934 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:20,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675473952] [2020-10-20 06:47:20,935 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:20,935 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:20,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:20,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:20,935 INFO L87 Difference]: Start difference. First operand 59 states and 93 transitions. cyclomatic complexity: 36 Second operand 3 states. [2020-10-20 06:47:20,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:20,958 INFO L93 Difference]: Finished difference Result 114 states and 178 transitions. [2020-10-20 06:47:20,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:20,959 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 178 transitions. [2020-10-20 06:47:20,963 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 112 [2020-10-20 06:47:20,966 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 114 states and 178 transitions. [2020-10-20 06:47:20,966 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 114 [2020-10-20 06:47:20,967 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 114 [2020-10-20 06:47:20,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 178 transitions. [2020-10-20 06:47:20,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:20,968 INFO L691 BuchiCegarLoop]: Abstraction has 114 states and 178 transitions. [2020-10-20 06:47:20,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 178 transitions. [2020-10-20 06:47:20,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2020-10-20 06:47:20,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-10-20 06:47:20,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 178 transitions. [2020-10-20 06:47:20,995 INFO L714 BuchiCegarLoop]: Abstraction has 114 states and 178 transitions. [2020-10-20 06:47:20,996 INFO L594 BuchiCegarLoop]: Abstraction has 114 states and 178 transitions. [2020-10-20 06:47:20,996 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 06:47:20,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states and 178 transitions. [2020-10-20 06:47:20,999 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 112 [2020-10-20 06:47:21,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:21,000 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:21,001 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:21,001 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] [2020-10-20 06:47:21,001 INFO L794 eck$LassoCheckResult]: Stem: 330#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 317#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_~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_~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;havoc main_~cond~0; 318#L141-1 [2020-10-20 06:47:21,002 INFO L796 eck$LassoCheckResult]: Loop: 318#L141-1 assume !false;main_~cond~0 := main_#t~nondet16;havoc main_#t~nondet16; 337#L40 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; 365#L63 assume !(0 != main_~p1~0); 366#L63-2 assume !(0 != main_~p2~0); 403#L67-1 assume !(0 != main_~p3~0); 407#L71-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 406#L75-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 405#L79-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 390#L83-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 389#L87-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 387#L91-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 384#L95-1 assume !(0 != main_~p1~0); 383#L101-1 assume !(0 != main_~p2~0); 310#L106-1 assume !(0 != main_~p3~0); 311#L111-1 assume !(0 != main_~p4~0); 325#L116-1 assume !(0 != main_~p5~0); 297#L121-1 assume !(0 != main_~p6~0); 314#L126-1 assume !(0 != main_~p7~0); 374#L131-1 assume !(0 != main_~p8~0); 372#L136-1 assume !(0 != main_~p9~0); 318#L141-1 [2020-10-20 06:47:21,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:21,002 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2020-10-20 06:47:21,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:21,003 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888711740] [2020-10-20 06:47:21,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:21,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:21,015 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:21,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:21,026 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:21,032 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:21,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:21,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1407180885, now seen corresponding path program 1 times [2020-10-20 06:47:21,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:21,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891204625] [2020-10-20 06:47:21,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:21,060 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:21,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891204625] [2020-10-20 06:47:21,061 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:21,061 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:21,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13206564] [2020-10-20 06:47:21,062 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:21,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:21,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:21,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:21,063 INFO L87 Difference]: Start difference. First operand 114 states and 178 transitions. cyclomatic complexity: 68 Second operand 3 states. [2020-10-20 06:47:21,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:21,101 INFO L93 Difference]: Finished difference Result 222 states and 342 transitions. [2020-10-20 06:47:21,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:21,102 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 222 states and 342 transitions. [2020-10-20 06:47:21,107 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 220 [2020-10-20 06:47:21,114 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 222 states to 222 states and 342 transitions. [2020-10-20 06:47:21,114 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 222 [2020-10-20 06:47:21,115 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 222 [2020-10-20 06:47:21,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 222 states and 342 transitions. [2020-10-20 06:47:21,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:21,117 INFO L691 BuchiCegarLoop]: Abstraction has 222 states and 342 transitions. [2020-10-20 06:47:21,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states and 342 transitions. [2020-10-20 06:47:21,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2020-10-20 06:47:21,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2020-10-20 06:47:21,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 342 transitions. [2020-10-20 06:47:21,135 INFO L714 BuchiCegarLoop]: Abstraction has 222 states and 342 transitions. [2020-10-20 06:47:21,135 INFO L594 BuchiCegarLoop]: Abstraction has 222 states and 342 transitions. [2020-10-20 06:47:21,135 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 06:47:21,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 222 states and 342 transitions. [2020-10-20 06:47:21,138 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 220 [2020-10-20 06:47:21,138 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:21,138 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:21,139 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:21,139 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] [2020-10-20 06:47:21,139 INFO L794 eck$LassoCheckResult]: Stem: 674#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 657#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_~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_~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;havoc main_~cond~0; 658#L141-1 [2020-10-20 06:47:21,139 INFO L796 eck$LassoCheckResult]: Loop: 658#L141-1 assume !false;main_~cond~0 := main_#t~nondet16;havoc main_#t~nondet16; 817#L40 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; 816#L63 assume !(0 != main_~p1~0); 815#L63-2 assume !(0 != main_~p2~0); 662#L67-1 assume !(0 != main_~p3~0); 663#L71-1 assume !(0 != main_~p4~0); 776#L75-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 777#L79-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 767#L83-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 768#L87-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 758#L91-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 759#L95-1 assume !(0 != main_~p1~0); 786#L101-1 assume !(0 != main_~p2~0); 651#L106-1 assume !(0 != main_~p3~0); 652#L111-1 assume !(0 != main_~p4~0); 803#L116-1 assume !(0 != main_~p5~0); 825#L121-1 assume !(0 != main_~p6~0); 797#L126-1 assume !(0 != main_~p7~0); 795#L131-1 assume !(0 != main_~p8~0); 793#L136-1 assume !(0 != main_~p9~0); 658#L141-1 [2020-10-20 06:47:21,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:21,140 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2020-10-20 06:47:21,140 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:21,140 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370924990] [2020-10-20 06:47:21,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:21,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:21,152 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:21,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:21,171 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:21,177 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:21,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:21,181 INFO L82 PathProgramCache]: Analyzing trace with hash 127317207, now seen corresponding path program 1 times [2020-10-20 06:47:21,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:21,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931367825] [2020-10-20 06:47:21,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:21,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:21,222 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:21,222 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931367825] [2020-10-20 06:47:21,222 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:21,222 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:21,223 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742102434] [2020-10-20 06:47:21,223 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:21,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:21,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:21,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:21,224 INFO L87 Difference]: Start difference. First operand 222 states and 342 transitions. cyclomatic complexity: 128 Second operand 3 states. [2020-10-20 06:47:21,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:21,248 INFO L93 Difference]: Finished difference Result 434 states and 658 transitions. [2020-10-20 06:47:21,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:21,249 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 434 states and 658 transitions. [2020-10-20 06:47:21,253 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 432 [2020-10-20 06:47:21,257 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 434 states to 434 states and 658 transitions. [2020-10-20 06:47:21,258 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 434 [2020-10-20 06:47:21,259 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 434 [2020-10-20 06:47:21,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 434 states and 658 transitions. [2020-10-20 06:47:21,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:21,263 INFO L691 BuchiCegarLoop]: Abstraction has 434 states and 658 transitions. [2020-10-20 06:47:21,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states and 658 transitions. [2020-10-20 06:47:21,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2020-10-20 06:47:21,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2020-10-20 06:47:21,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 658 transitions. [2020-10-20 06:47:21,288 INFO L714 BuchiCegarLoop]: Abstraction has 434 states and 658 transitions. [2020-10-20 06:47:21,288 INFO L594 BuchiCegarLoop]: Abstraction has 434 states and 658 transitions. [2020-10-20 06:47:21,288 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 06:47:21,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 434 states and 658 transitions. [2020-10-20 06:47:21,292 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 432 [2020-10-20 06:47:21,292 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:21,292 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:21,293 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:21,293 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] [2020-10-20 06:47:21,294 INFO L794 eck$LassoCheckResult]: Stem: 1338#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1319#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_~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_~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;havoc main_~cond~0; 1320#L141-1 [2020-10-20 06:47:21,294 INFO L796 eck$LassoCheckResult]: Loop: 1320#L141-1 assume !false;main_~cond~0 := main_#t~nondet16;havoc main_#t~nondet16; 1501#L40 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; 1499#L63 assume !(0 != main_~p1~0); 1497#L63-2 assume !(0 != main_~p2~0); 1494#L67-1 assume !(0 != main_~p3~0); 1491#L71-1 assume !(0 != main_~p4~0); 1492#L75-1 assume !(0 != main_~p5~0); 1474#L79-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1475#L83-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1458#L87-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1459#L91-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1438#L95-1 assume !(0 != main_~p1~0); 1439#L101-1 assume !(0 != main_~p2~0); 1424#L106-1 assume !(0 != main_~p3~0); 1423#L111-1 assume !(0 != main_~p4~0); 1514#L116-1 assume !(0 != main_~p5~0); 1513#L121-1 assume !(0 != main_~p6~0); 1510#L126-1 assume !(0 != main_~p7~0); 1507#L131-1 assume !(0 != main_~p8~0); 1504#L136-1 assume !(0 != main_~p9~0); 1320#L141-1 [2020-10-20 06:47:21,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:21,295 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2020-10-20 06:47:21,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:21,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708774632] [2020-10-20 06:47:21,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:21,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:21,314 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:21,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:21,323 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:21,328 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:21,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:21,329 INFO L82 PathProgramCache]: Analyzing trace with hash -883800043, now seen corresponding path program 1 times [2020-10-20 06:47:21,329 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:21,330 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290349320] [2020-10-20 06:47:21,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:21,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:21,355 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:21,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290349320] [2020-10-20 06:47:21,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:21,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:21,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557794476] [2020-10-20 06:47:21,357 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:21,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:21,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:21,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:21,358 INFO L87 Difference]: Start difference. First operand 434 states and 658 transitions. cyclomatic complexity: 240 Second operand 3 states. [2020-10-20 06:47:21,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:21,387 INFO L93 Difference]: Finished difference Result 850 states and 1266 transitions. [2020-10-20 06:47:21,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:21,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 850 states and 1266 transitions. [2020-10-20 06:47:21,396 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 848 [2020-10-20 06:47:21,403 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 850 states to 850 states and 1266 transitions. [2020-10-20 06:47:21,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 850 [2020-10-20 06:47:21,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 850 [2020-10-20 06:47:21,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 850 states and 1266 transitions. [2020-10-20 06:47:21,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:21,407 INFO L691 BuchiCegarLoop]: Abstraction has 850 states and 1266 transitions. [2020-10-20 06:47:21,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states and 1266 transitions. [2020-10-20 06:47:21,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 850. [2020-10-20 06:47:21,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2020-10-20 06:47:21,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1266 transitions. [2020-10-20 06:47:21,434 INFO L714 BuchiCegarLoop]: Abstraction has 850 states and 1266 transitions. [2020-10-20 06:47:21,434 INFO L594 BuchiCegarLoop]: Abstraction has 850 states and 1266 transitions. [2020-10-20 06:47:21,434 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 06:47:21,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 850 states and 1266 transitions. [2020-10-20 06:47:21,440 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 848 [2020-10-20 06:47:21,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:21,441 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:21,441 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:21,442 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] [2020-10-20 06:47:21,453 INFO L794 eck$LassoCheckResult]: Stem: 2627#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 2611#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_~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_~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;havoc main_~cond~0; 2612#L141-1 [2020-10-20 06:47:21,454 INFO L796 eck$LassoCheckResult]: Loop: 2612#L141-1 assume !false;main_~cond~0 := main_#t~nondet16;havoc main_#t~nondet16; 2649#L40 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; 2650#L63 assume !(0 != main_~p1~0); 2766#L63-2 assume !(0 != main_~p2~0); 2760#L67-1 assume !(0 != main_~p3~0); 2752#L71-1 assume !(0 != main_~p4~0); 2745#L75-1 assume !(0 != main_~p5~0); 2746#L79-1 assume !(0 != main_~p6~0); 2734#L83-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2729#L87-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2722#L91-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 2723#L95-1 assume !(0 != main_~p1~0); 2834#L101-1 assume !(0 != main_~p2~0); 2836#L106-1 assume !(0 != main_~p3~0); 2843#L111-1 assume !(0 != main_~p4~0); 2841#L116-1 assume !(0 != main_~p5~0); 2842#L121-1 assume !(0 != main_~p6~0); 2893#L126-1 assume !(0 != main_~p7~0); 2659#L131-1 assume !(0 != main_~p8~0); 2655#L136-1 assume !(0 != main_~p9~0); 2612#L141-1 [2020-10-20 06:47:21,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:21,455 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2020-10-20 06:47:21,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:21,455 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482299623] [2020-10-20 06:47:21,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:21,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:21,465 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:21,473 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:21,477 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:21,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:21,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1470606057, now seen corresponding path program 1 times [2020-10-20 06:47:21,479 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:21,479 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135570729] [2020-10-20 06:47:21,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:21,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:21,499 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:21,499 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135570729] [2020-10-20 06:47:21,499 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:21,500 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:21,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630728553] [2020-10-20 06:47:21,501 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:21,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:21,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:21,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:21,501 INFO L87 Difference]: Start difference. First operand 850 states and 1266 transitions. cyclomatic complexity: 448 Second operand 3 states. [2020-10-20 06:47:21,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:21,526 INFO L93 Difference]: Finished difference Result 1666 states and 2434 transitions. [2020-10-20 06:47:21,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:21,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1666 states and 2434 transitions. [2020-10-20 06:47:21,548 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1664 [2020-10-20 06:47:21,561 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1666 states to 1666 states and 2434 transitions. [2020-10-20 06:47:21,562 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1666 [2020-10-20 06:47:21,564 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1666 [2020-10-20 06:47:21,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1666 states and 2434 transitions. [2020-10-20 06:47:21,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:21,569 INFO L691 BuchiCegarLoop]: Abstraction has 1666 states and 2434 transitions. [2020-10-20 06:47:21,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states and 2434 transitions. [2020-10-20 06:47:21,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1666. [2020-10-20 06:47:21,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1666 states. [2020-10-20 06:47:21,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 1666 states and 2434 transitions. [2020-10-20 06:47:21,624 INFO L714 BuchiCegarLoop]: Abstraction has 1666 states and 2434 transitions. [2020-10-20 06:47:21,624 INFO L594 BuchiCegarLoop]: Abstraction has 1666 states and 2434 transitions. [2020-10-20 06:47:21,624 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 06:47:21,624 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1666 states and 2434 transitions. [2020-10-20 06:47:21,636 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1664 [2020-10-20 06:47:21,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:21,636 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:21,637 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:21,637 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] [2020-10-20 06:47:21,638 INFO L794 eck$LassoCheckResult]: Stem: 5153#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 5133#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_~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_~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;havoc main_~cond~0; 5134#L141-1 [2020-10-20 06:47:21,638 INFO L796 eck$LassoCheckResult]: Loop: 5134#L141-1 assume !false;main_~cond~0 := main_#t~nondet16;havoc main_#t~nondet16; 5490#L40 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; 5486#L63 assume !(0 != main_~p1~0); 5487#L63-2 assume !(0 != main_~p2~0); 5489#L67-1 assume !(0 != main_~p3~0); 5484#L71-1 assume !(0 != main_~p4~0); 5478#L75-1 assume !(0 != main_~p5~0); 5479#L79-1 assume !(0 != main_~p6~0); 5453#L83-1 assume !(0 != main_~p7~0); 5455#L87-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 5444#L91-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 5445#L95-1 assume !(0 != main_~p1~0); 5450#L101-1 assume !(0 != main_~p2~0); 5452#L106-1 assume !(0 != main_~p3~0); 5429#L111-1 assume !(0 != main_~p4~0); 5430#L116-1 assume !(0 != main_~p5~0); 5506#L121-1 assume !(0 != main_~p6~0); 5502#L126-1 assume !(0 != main_~p7~0); 5499#L131-1 assume !(0 != main_~p8~0); 5495#L136-1 assume !(0 != main_~p9~0); 5134#L141-1 [2020-10-20 06:47:21,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:21,639 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2020-10-20 06:47:21,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:21,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848753548] [2020-10-20 06:47:21,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:21,664 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:21,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:21,681 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:21,692 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:21,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:21,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1212440619, now seen corresponding path program 1 times [2020-10-20 06:47:21,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:21,693 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597010379] [2020-10-20 06:47:21,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:21,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:21,738 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:21,738 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597010379] [2020-10-20 06:47:21,738 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:21,738 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:21,739 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621106478] [2020-10-20 06:47:21,743 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:21,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:21,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:21,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:21,744 INFO L87 Difference]: Start difference. First operand 1666 states and 2434 transitions. cyclomatic complexity: 832 Second operand 3 states. [2020-10-20 06:47:21,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:21,783 INFO L93 Difference]: Finished difference Result 3266 states and 4674 transitions. [2020-10-20 06:47:21,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:21,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3266 states and 4674 transitions. [2020-10-20 06:47:21,975 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3264 [2020-10-20 06:47:21,996 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3266 states to 3266 states and 4674 transitions. [2020-10-20 06:47:21,996 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3266 [2020-10-20 06:47:21,999 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3266 [2020-10-20 06:47:22,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3266 states and 4674 transitions. [2020-10-20 06:47:22,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:22,006 INFO L691 BuchiCegarLoop]: Abstraction has 3266 states and 4674 transitions. [2020-10-20 06:47:22,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states and 4674 transitions. [2020-10-20 06:47:22,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 3266. [2020-10-20 06:47:22,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3266 states. [2020-10-20 06:47:22,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3266 states to 3266 states and 4674 transitions. [2020-10-20 06:47:22,082 INFO L714 BuchiCegarLoop]: Abstraction has 3266 states and 4674 transitions. [2020-10-20 06:47:22,083 INFO L594 BuchiCegarLoop]: Abstraction has 3266 states and 4674 transitions. [2020-10-20 06:47:22,083 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 06:47:22,083 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3266 states and 4674 transitions. [2020-10-20 06:47:22,099 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3264 [2020-10-20 06:47:22,100 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:22,100 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:22,100 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:22,101 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] [2020-10-20 06:47:22,101 INFO L794 eck$LassoCheckResult]: Stem: 10084#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 10067#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_~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_~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;havoc main_~cond~0; 10068#L141-1 [2020-10-20 06:47:22,101 INFO L796 eck$LassoCheckResult]: Loop: 10068#L141-1 assume !false;main_~cond~0 := main_#t~nondet16;havoc main_#t~nondet16; 10247#L40 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; 10243#L63 assume !(0 != main_~p1~0); 10240#L63-2 assume !(0 != main_~p2~0); 10238#L67-1 assume !(0 != main_~p3~0); 10233#L71-1 assume !(0 != main_~p4~0); 10227#L75-1 assume !(0 != main_~p5~0); 10220#L79-1 assume !(0 != main_~p6~0); 10212#L83-1 assume !(0 != main_~p7~0); 10206#L87-1 assume !(0 != main_~p8~0); 10202#L91-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 10197#L95-1 assume !(0 != main_~p1~0); 10193#L101-1 assume !(0 != main_~p2~0); 10195#L106-1 assume !(0 != main_~p3~0); 10275#L111-1 assume !(0 != main_~p4~0); 10272#L116-1 assume !(0 != main_~p5~0); 10267#L121-1 assume !(0 != main_~p6~0); 10262#L126-1 assume !(0 != main_~p7~0); 10259#L131-1 assume !(0 != main_~p8~0); 10252#L136-1 assume !(0 != main_~p9~0); 10068#L141-1 [2020-10-20 06:47:22,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:22,102 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2020-10-20 06:47:22,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:22,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508415632] [2020-10-20 06:47:22,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:22,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:22,110 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:22,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:22,115 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:22,118 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:22,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:22,119 INFO L82 PathProgramCache]: Analyzing trace with hash -511376041, now seen corresponding path program 1 times [2020-10-20 06:47:22,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:22,120 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147936551] [2020-10-20 06:47:22,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:22,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:22,135 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:22,136 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147936551] [2020-10-20 06:47:22,136 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:22,136 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 06:47:22,136 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849231140] [2020-10-20 06:47:22,137 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:22,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:22,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:22,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:22,138 INFO L87 Difference]: Start difference. First operand 3266 states and 4674 transitions. cyclomatic complexity: 1536 Second operand 3 states. [2020-10-20 06:47:22,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:22,194 INFO L93 Difference]: Finished difference Result 6402 states and 8962 transitions. [2020-10-20 06:47:22,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:22,195 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6402 states and 8962 transitions. [2020-10-20 06:47:22,240 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 6400 [2020-10-20 06:47:22,342 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6402 states to 6402 states and 8962 transitions. [2020-10-20 06:47:22,342 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6402 [2020-10-20 06:47:22,351 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6402 [2020-10-20 06:47:22,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6402 states and 8962 transitions. [2020-10-20 06:47:22,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:22,368 INFO L691 BuchiCegarLoop]: Abstraction has 6402 states and 8962 transitions. [2020-10-20 06:47:22,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6402 states and 8962 transitions. [2020-10-20 06:47:22,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6402 to 6402. [2020-10-20 06:47:22,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6402 states. [2020-10-20 06:47:22,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6402 states to 6402 states and 8962 transitions. [2020-10-20 06:47:22,573 INFO L714 BuchiCegarLoop]: Abstraction has 6402 states and 8962 transitions. [2020-10-20 06:47:22,573 INFO L594 BuchiCegarLoop]: Abstraction has 6402 states and 8962 transitions. [2020-10-20 06:47:22,573 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-20 06:47:22,573 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6402 states and 8962 transitions. [2020-10-20 06:47:22,782 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 6400 [2020-10-20 06:47:22,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:22,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:22,786 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:22,786 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] [2020-10-20 06:47:22,786 INFO L794 eck$LassoCheckResult]: Stem: 19769#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 19744#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_~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_~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;havoc main_~cond~0; 19745#L141-1 [2020-10-20 06:47:22,786 INFO L796 eck$LassoCheckResult]: Loop: 19745#L141-1 assume !false;main_~cond~0 := main_#t~nondet16;havoc main_#t~nondet16; 19860#L40 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; 19856#L63 assume !(0 != main_~p1~0); 19854#L63-2 assume !(0 != main_~p2~0); 19852#L67-1 assume !(0 != main_~p3~0); 19848#L71-1 assume !(0 != main_~p4~0); 19844#L75-1 assume !(0 != main_~p5~0); 19840#L79-1 assume !(0 != main_~p6~0); 19836#L83-1 assume !(0 != main_~p7~0); 19832#L87-1 assume !(0 != main_~p8~0); 19828#L91-1 assume !(0 != main_~p9~0); 19824#L95-1 assume !(0 != main_~p1~0); 19822#L101-1 assume !(0 != main_~p2~0); 19818#L106-1 assume !(0 != main_~p3~0); 19817#L111-1 assume !(0 != main_~p4~0); 19879#L116-1 assume !(0 != main_~p5~0); 19875#L121-1 assume !(0 != main_~p6~0); 19871#L126-1 assume !(0 != main_~p7~0); 19867#L131-1 assume !(0 != main_~p8~0); 19863#L136-1 assume !(0 != main_~p9~0); 19745#L141-1 [2020-10-20 06:47:22,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:22,787 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2020-10-20 06:47:22,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:22,787 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496437442] [2020-10-20 06:47:22,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:22,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:22,798 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:22,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:22,809 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:22,820 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:22,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:22,822 INFO L82 PathProgramCache]: Analyzing trace with hash -904403051, now seen corresponding path program 1 times [2020-10-20 06:47:22,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:22,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038104915] [2020-10-20 06:47:22,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:22,834 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:22,838 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:22,846 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:22,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:22,847 INFO L82 PathProgramCache]: Analyzing trace with hash 551712343, now seen corresponding path program 1 times [2020-10-20 06:47:22,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:22,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944828289] [2020-10-20 06:47:22,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:22,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:22,855 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:22,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:22,861 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:22,867 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:23,253 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2020-10-20 06:47:23,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 06:47:23 BoogieIcfgContainer [2020-10-20 06:47:23,383 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 06:47:23,384 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 06:47:23,384 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 06:47:23,385 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 06:47:23,385 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:20" (3/4) ... [2020-10-20 06:47:23,388 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-20 06:47:23,445 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 06:47:23,445 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 06:47:23,447 INFO L168 Benchmark]: Toolchain (without parser) took 3966.52 ms. Allocated memory was 39.8 MB in the beginning and 96.5 MB in the end (delta: 56.6 MB). Free memory was 17.5 MB in the beginning and 53.3 MB in the end (delta: -35.9 MB). Peak memory consumption was 20.8 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:23,448 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 30.9 MB. Free memory was 17.0 MB in the beginning and 17.0 MB in the end (delta: 35.5 kB). Peak memory consumption was 35.5 kB. Max. memory is 14.3 GB. [2020-10-20 06:47:23,449 INFO L168 Benchmark]: CACSL2BoogieTranslator took 338.55 ms. Allocated memory was 39.8 MB in the beginning and 40.9 MB in the end (delta: 1.0 MB). Free memory was 16.7 MB in the beginning and 16.0 MB in the end (delta: 688.8 kB). Peak memory consumption was 7.1 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:23,449 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.01 ms. Allocated memory is still 40.9 MB. Free memory was 16.0 MB in the beginning and 14.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:23,450 INFO L168 Benchmark]: Boogie Preprocessor took 33.48 ms. Allocated memory is still 40.9 MB. Free memory was 14.2 MB in the beginning and 12.7 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:23,450 INFO L168 Benchmark]: RCFGBuilder took 395.53 ms. Allocated memory was 40.9 MB in the beginning and 42.5 MB in the end (delta: 1.6 MB). Free memory was 12.5 MB in the beginning and 23.3 MB in the end (delta: -10.7 MB). Peak memory consumption was 3.5 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:23,451 INFO L168 Benchmark]: BuchiAutomizer took 3089.76 ms. Allocated memory was 42.5 MB in the beginning and 96.5 MB in the end (delta: 54.0 MB). Free memory was 23.3 MB in the beginning and 56.4 MB in the end (delta: -33.1 MB). Peak memory consumption was 40.2 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:23,452 INFO L168 Benchmark]: Witness Printer took 61.63 ms. Allocated memory is still 96.5 MB. Free memory was 56.4 MB in the beginning and 53.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:23,455 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.30 ms. Allocated memory is still 30.9 MB. Free memory was 17.0 MB in the beginning and 17.0 MB in the end (delta: 35.5 kB). Peak memory consumption was 35.5 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 338.55 ms. Allocated memory was 39.8 MB in the beginning and 40.9 MB in the end (delta: 1.0 MB). Free memory was 16.7 MB in the beginning and 16.0 MB in the end (delta: 688.8 kB). Peak memory consumption was 7.1 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 35.01 ms. Allocated memory is still 40.9 MB. Free memory was 16.0 MB in the beginning and 14.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 33.48 ms. Allocated memory is still 40.9 MB. Free memory was 14.2 MB in the beginning and 12.7 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 14.3 GB. * RCFGBuilder took 395.53 ms. Allocated memory was 40.9 MB in the beginning and 42.5 MB in the end (delta: 1.6 MB). Free memory was 12.5 MB in the beginning and 23.3 MB in the end (delta: -10.7 MB). Peak memory consumption was 3.5 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 3089.76 ms. Allocated memory was 42.5 MB in the beginning and 96.5 MB in the end (delta: 54.0 MB). Free memory was 23.3 MB in the beginning and 56.4 MB in the end (delta: -33.1 MB). Peak memory consumption was 40.2 MB. Max. memory is 14.3 GB. * Witness Printer took 61.63 ms. Allocated memory is still 96.5 MB. Free memory was 56.4 MB in the beginning and 53.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 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 8 terminating modules (8 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.8 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 6402 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.9s and 9 iterations. TraceHistogramMax:1. Analysis of lassos took 1.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 8. Minimization of nondet autom 0. Automata minimization 0.4s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.4s Buchi closure took 0.0s. Biggest automaton had 6402 states and ocurred in iteration 8. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 583 SDtfs, 301 SDslu, 356 SDs, 0 SdLazy, 40 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI8 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: 38]: 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, p4=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5c49d73a=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@55a2d7=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2d7347ec=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@76f01897=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6412f174=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@57deba27=14, cond=14, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@49fcb43b=0, NULL=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7e87d6cf=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@8c54d28=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7b2f8415=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: 38]: 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; [L36] int cond; Loop: [L38] COND TRUE 1 [L39] cond = __VERIFIER_nondet_int() [L40] COND FALSE !(cond == 0) [L43] lk1 = 0 [L45] lk2 = 0 [L47] lk3 = 0 [L49] lk4 = 0 [L51] lk5 = 0 [L53] lk6 = 0 [L55] lk7 = 0 [L57] lk8 = 0 [L59] lk9 = 0 [L63] COND FALSE !(p1 != 0) [L67] COND FALSE !(p2 != 0) [L71] COND FALSE !(p3 != 0) [L75] COND FALSE !(p4 != 0) [L79] COND FALSE !(p5 != 0) [L83] COND FALSE !(p6 != 0) [L87] COND FALSE !(p7 != 0) [L91] COND FALSE !(p8 != 0) [L95] COND FALSE !(p9 != 0) [L101] COND FALSE !(p1 != 0) [L106] COND FALSE !(p2 != 0) [L111] COND FALSE !(p3 != 0) [L116] COND FALSE !(p4 != 0) [L121] COND FALSE !(p5 != 0) [L126] COND FALSE !(p6 != 0) [L131] COND FALSE !(p7 != 0) [L136] COND FALSE !(p8 != 0) [L141] COND FALSE !(p9 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...