./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_8.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_8.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 37d0ed05d77a0379c9ed98058bf2f327252773ce ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:17,625 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 06:47:17,627 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 06:47:17,651 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 06:47:17,651 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 06:47:17,652 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 06:47:17,654 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 06:47:17,656 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 06:47:17,657 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 06:47:17,658 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 06:47:17,659 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 06:47:17,660 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 06:47:17,661 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 06:47:17,662 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 06:47:17,663 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 06:47:17,664 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 06:47:17,665 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 06:47:17,666 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 06:47:17,667 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 06:47:17,669 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 06:47:17,671 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 06:47:17,672 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 06:47:17,673 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 06:47:17,673 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 06:47:17,676 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 06:47:17,676 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 06:47:17,677 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 06:47:17,678 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 06:47:17,678 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 06:47:17,679 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 06:47:17,679 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 06:47:17,680 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 06:47:17,681 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 06:47:17,682 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 06:47:17,683 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 06:47:17,683 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 06:47:17,684 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 06:47:17,684 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 06:47:17,684 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 06:47:17,685 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 06:47:17,686 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 06:47:17,687 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:17,722 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 06:47:17,722 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 06:47:17,723 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 06:47:17,724 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 06:47:17,724 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 06:47:17,724 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 06:47:17,725 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 06:47:17,725 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 06:47:17,725 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 06:47:17,725 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 06:47:17,726 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 06:47:17,726 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 06:47:17,726 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 06:47:17,726 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 06:47:17,727 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 06:47:17,727 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 06:47:17,727 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 06:47:17,727 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 06:47:17,728 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 06:47:17,728 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 06:47:17,728 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 06:47:17,728 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 06:47:17,729 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 06:47:17,729 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 06:47:17,729 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 06:47:17,729 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 06:47:17,730 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 06:47:17,730 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 06:47:17,730 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 06:47:17,730 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 06:47:17,731 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 06:47:17,731 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 06:47:17,732 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 06:47:17,732 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 -> 37d0ed05d77a0379c9ed98058bf2f327252773ce [2020-10-20 06:47:17,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 06:47:17,950 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 06:47:17,957 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 06:47:17,959 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 06:47:17,960 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 06:47:17,961 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_8.c [2020-10-20 06:47:18,022 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7031d2af7/b3c39b4ffe534e4998a9c180c398e782/FLAG83d362346 [2020-10-20 06:47:18,578 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 06:47:18,579 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_8.c [2020-10-20 06:47:18,587 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7031d2af7/b3c39b4ffe534e4998a9c180c398e782/FLAG83d362346 [2020-10-20 06:47:18,843 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7031d2af7/b3c39b4ffe534e4998a9c180c398e782 [2020-10-20 06:47:18,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 06:47:18,854 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 06:47:18,855 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 06:47:18,855 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 06:47:18,859 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 06:47:18,860 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:47:18" (1/1) ... [2020-10-20 06:47:18,863 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78ddc13f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:18, skipping insertion in model container [2020-10-20 06:47:18,863 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:47:18" (1/1) ... [2020-10-20 06:47:18,871 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 06:47:18,893 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 06:47:19,113 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:47:19,128 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 06:47:19,185 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:47:19,201 INFO L208 MainTranslator]: Completed translation [2020-10-20 06:47:19,201 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,202 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 06:47:19,203 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 06:47:19,203 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 06:47:19,203 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 06:47:19,211 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,220 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,241 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 06:47:19,242 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 06:47:19,242 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 06:47:19,242 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 06:47:19,252 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,252 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,254 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,254 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,258 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,263 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,265 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,267 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 06:47:19,268 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 06:47:19,268 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 06:47:19,268 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 06:47:19,269 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,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 06:47:19,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 06:47:19,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 06:47:19,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 06:47:19,629 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 06:47:19,630 INFO L298 CfgBuilder]: Removed 7 assume(true) statements. [2020-10-20 06:47:19,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:47:19 BoogieIcfgContainer [2020-10-20 06:47:19,633 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 06:47:19,635 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 06:47:19,635 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 06:47:19,639 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 06:47:19,641 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:47:19,642 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 06:47:18" (1/3) ... [2020-10-20 06:47:19,643 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ab21950 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:47:19, skipping insertion in model container [2020-10-20 06:47:19,644 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:47:19,644 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:19,644 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ab21950 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:47:19, skipping insertion in model container [2020-10-20 06:47:19,644 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:47:19,645 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:47:19" (3/3) ... [2020-10-20 06:47:19,648 INFO L373 chiAutomizerObserver]: Analyzing ICFG test_locks_8.c [2020-10-20 06:47:19,709 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 06:47:19,709 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 06:47:19,710 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 06:47:19,710 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 06:47:19,710 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 06:47:19,710 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 06:47:19,711 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 06:47:19,711 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 06:47:19,731 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states. [2020-10-20 06:47:19,759 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2020-10-20 06:47:19,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:19,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:19,769 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:19,769 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:19,770 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 06:47:19,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states. [2020-10-20 06:47:19,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2020-10-20 06:47:19,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:19,775 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:19,776 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:19,776 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:19,785 INFO L794 eck$LassoCheckResult]: Stem: 32#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); 11#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~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_~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;havoc main_~cond~0; 28#L127-1true [2020-10-20 06:47:19,786 INFO L796 eck$LassoCheckResult]: Loop: 28#L127-1true assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 22#L37true 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; 3#L58true assume 0 != main_~p1~0;main_~lk1~0 := 1; 17#L58-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 8#L62-1true assume !(0 != main_~p3~0); 35#L66-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 23#L70-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 29#L74-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 16#L78-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 6#L82-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 31#L86-1true assume !(0 != main_~p1~0); 24#L92-1true assume !(0 != main_~p2~0); 33#L97-1true assume !(0 != main_~p3~0); 5#L102-1true assume !(0 != main_~p4~0); 12#L107-1true assume !(0 != main_~p5~0); 21#L112-1true assume !(0 != main_~p6~0); 10#L117-1true assume !(0 != main_~p7~0); 20#L122-1true assume !(0 != main_~p8~0); 28#L127-1true [2020-10-20 06:47:19,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:19,794 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-20 06:47:19,804 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:19,805 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678789379] [2020-10-20 06:47:19,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:19,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:19,924 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:19,946 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:19,973 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:19,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:19,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1098697512, now seen corresponding path program 1 times [2020-10-20 06:47:19,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:19,976 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553062524] [2020-10-20 06:47:19,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:19,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:20,055 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,056 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553062524] [2020-10-20 06:47:20,058 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:20,059 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:20,059 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990312902] [2020-10-20 06:47:20,070 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:20,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:20,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:20,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:20,091 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. [2020-10-20 06:47:20,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:20,143 INFO L93 Difference]: Finished difference Result 63 states and 106 transitions. [2020-10-20 06:47:20,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:20,146 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 106 transitions. [2020-10-20 06:47:20,150 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2020-10-20 06:47:20,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 53 states and 83 transitions. [2020-10-20 06:47:20,158 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2020-10-20 06:47:20,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2020-10-20 06:47:20,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 83 transitions. [2020-10-20 06:47:20,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:20,161 INFO L691 BuchiCegarLoop]: Abstraction has 53 states and 83 transitions. [2020-10-20 06:47:20,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 83 transitions. [2020-10-20 06:47:20,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-10-20 06:47:20,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-10-20 06:47:20,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 83 transitions. [2020-10-20 06:47:20,206 INFO L714 BuchiCegarLoop]: Abstraction has 53 states and 83 transitions. [2020-10-20 06:47:20,207 INFO L594 BuchiCegarLoop]: Abstraction has 53 states and 83 transitions. [2020-10-20 06:47:20,207 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 06:47:20,207 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 83 transitions. [2020-10-20 06:47:20,210 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2020-10-20 06:47:20,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:20,214 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:20,215 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:20,216 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:20,216 INFO L794 eck$LassoCheckResult]: Stem: 141#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); 122#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_~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_~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;havoc main_~cond~0; 123#L127-1 [2020-10-20 06:47:20,217 INFO L796 eck$LassoCheckResult]: Loop: 123#L127-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 148#L37 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; 147#L58 assume !(0 != main_~p1~0); 129#L58-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 115#L62-1 assume !(0 != main_~p3~0); 116#L66-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 134#L70-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 135#L74-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 128#L78-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 111#L82-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 112#L86-1 assume !(0 != main_~p1~0); 142#L92-1 assume !(0 != main_~p2~0); 156#L97-1 assume !(0 != main_~p3~0); 155#L102-1 assume !(0 != main_~p4~0); 153#L107-1 assume !(0 != main_~p5~0); 132#L112-1 assume !(0 != main_~p6~0); 125#L117-1 assume !(0 != main_~p7~0); 130#L122-1 assume !(0 != main_~p8~0); 123#L127-1 [2020-10-20 06:47:20,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:20,218 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-10-20 06:47:20,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:20,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659067603] [2020-10-20 06:47:20,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:20,243 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:20,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:20,255 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:20,260 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:20,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:20,261 INFO L82 PathProgramCache]: Analyzing trace with hash 77629158, now seen corresponding path program 1 times [2020-10-20 06:47:20,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:20,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395669131] [2020-10-20 06:47:20,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:20,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:20,303 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,304 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395669131] [2020-10-20 06:47:20,304 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:20,304 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:20,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208681721] [2020-10-20 06:47:20,305 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:20,306 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:20,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:20,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:20,306 INFO L87 Difference]: Start difference. First operand 53 states and 83 transitions. cyclomatic complexity: 32 Second operand 3 states. [2020-10-20 06:47:20,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:20,339 INFO L93 Difference]: Finished difference Result 102 states and 158 transitions. [2020-10-20 06:47:20,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:20,341 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 158 transitions. [2020-10-20 06:47:20,345 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 100 [2020-10-20 06:47:20,347 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 102 states and 158 transitions. [2020-10-20 06:47:20,347 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2020-10-20 06:47:20,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 102 [2020-10-20 06:47:20,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 158 transitions. [2020-10-20 06:47:20,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:20,349 INFO L691 BuchiCegarLoop]: Abstraction has 102 states and 158 transitions. [2020-10-20 06:47:20,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 158 transitions. [2020-10-20 06:47:20,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2020-10-20 06:47:20,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-10-20 06:47:20,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 158 transitions. [2020-10-20 06:47:20,361 INFO L714 BuchiCegarLoop]: Abstraction has 102 states and 158 transitions. [2020-10-20 06:47:20,361 INFO L594 BuchiCegarLoop]: Abstraction has 102 states and 158 transitions. [2020-10-20 06:47:20,362 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 06:47:20,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 158 transitions. [2020-10-20 06:47:20,364 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 100 [2020-10-20 06:47:20,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:20,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:20,365 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:20,365 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:20,366 INFO L794 eck$LassoCheckResult]: Stem: 305#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); 283#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_~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_~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;havoc main_~cond~0; 284#L127-1 [2020-10-20 06:47:20,366 INFO L796 eck$LassoCheckResult]: Loop: 284#L127-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 324#L37 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; 323#L58 assume !(0 != main_~p1~0); 322#L58-2 assume !(0 != main_~p2~0); 276#L62-1 assume !(0 != main_~p3~0); 277#L66-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 296#L70-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 297#L74-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 289#L78-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 290#L82-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 309#L86-1 assume !(0 != main_~p1~0); 310#L92-1 assume !(0 != main_~p2~0); 306#L97-1 assume !(0 != main_~p3~0); 269#L102-1 assume !(0 != main_~p4~0); 271#L107-1 assume !(0 != main_~p5~0); 275#L112-1 assume !(0 != main_~p6~0); 286#L117-1 assume !(0 != main_~p7~0); 360#L122-1 assume !(0 != main_~p8~0); 284#L127-1 [2020-10-20 06:47:20,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:20,367 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2020-10-20 06:47:20,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:20,367 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058029334] [2020-10-20 06:47:20,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:20,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:20,380 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:20,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:20,401 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:20,408 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:20,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:20,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1202234520, now seen corresponding path program 1 times [2020-10-20 06:47:20,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:20,413 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001189208] [2020-10-20 06:47:20,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:20,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:20,460 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,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001189208] [2020-10-20 06:47:20,461 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:20,461 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:20,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99639793] [2020-10-20 06:47:20,462 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:20,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:20,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:20,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:20,463 INFO L87 Difference]: Start difference. First operand 102 states and 158 transitions. cyclomatic complexity: 60 Second operand 3 states. [2020-10-20 06:47:20,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:20,506 INFO L93 Difference]: Finished difference Result 198 states and 302 transitions. [2020-10-20 06:47:20,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:20,507 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 198 states and 302 transitions. [2020-10-20 06:47:20,511 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 196 [2020-10-20 06:47:20,514 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 198 states to 198 states and 302 transitions. [2020-10-20 06:47:20,514 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 198 [2020-10-20 06:47:20,515 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 198 [2020-10-20 06:47:20,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 198 states and 302 transitions. [2020-10-20 06:47:20,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:20,517 INFO L691 BuchiCegarLoop]: Abstraction has 198 states and 302 transitions. [2020-10-20 06:47:20,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states and 302 transitions. [2020-10-20 06:47:20,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2020-10-20 06:47:20,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2020-10-20 06:47:20,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 302 transitions. [2020-10-20 06:47:20,535 INFO L714 BuchiCegarLoop]: Abstraction has 198 states and 302 transitions. [2020-10-20 06:47:20,535 INFO L594 BuchiCegarLoop]: Abstraction has 198 states and 302 transitions. [2020-10-20 06:47:20,535 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 06:47:20,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 198 states and 302 transitions. [2020-10-20 06:47:20,538 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 196 [2020-10-20 06:47:20,538 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:20,538 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:20,539 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:20,539 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:20,539 INFO L794 eck$LassoCheckResult]: Stem: 609#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); 588#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_~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_~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;havoc main_~cond~0; 589#L127-1 [2020-10-20 06:47:20,540 INFO L796 eck$LassoCheckResult]: Loop: 589#L127-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 674#L37 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; 648#L58 assume !(0 != main_~p1~0); 633#L58-2 assume !(0 != main_~p2~0); 624#L62-1 assume !(0 != main_~p3~0); 625#L66-1 assume !(0 != main_~p4~0); 719#L70-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 746#L74-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 744#L78-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 742#L82-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 738#L86-1 assume !(0 != main_~p1~0); 739#L92-1 assume !(0 != main_~p2~0); 694#L97-1 assume !(0 != main_~p3~0); 691#L102-1 assume !(0 != main_~p4~0); 688#L107-1 assume !(0 != main_~p5~0); 685#L112-1 assume !(0 != main_~p6~0); 684#L117-1 assume !(0 != main_~p7~0); 680#L122-1 assume !(0 != main_~p8~0); 589#L127-1 [2020-10-20 06:47:20,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:20,540 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2020-10-20 06:47:20,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:20,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77732550] [2020-10-20 06:47:20,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:20,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:20,552 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:20,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:20,560 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:20,565 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:20,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:20,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1789040534, now seen corresponding path program 1 times [2020-10-20 06:47:20,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:20,567 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786939469] [2020-10-20 06:47:20,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:20,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:20,599 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,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786939469] [2020-10-20 06:47:20,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:20,600 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:20,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525783286] [2020-10-20 06:47:20,601 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:20,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:20,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:20,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:20,602 INFO L87 Difference]: Start difference. First operand 198 states and 302 transitions. cyclomatic complexity: 112 Second operand 3 states. [2020-10-20 06:47:20,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:20,626 INFO L93 Difference]: Finished difference Result 386 states and 578 transitions. [2020-10-20 06:47:20,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:20,627 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 386 states and 578 transitions. [2020-10-20 06:47:20,631 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 384 [2020-10-20 06:47:20,635 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 386 states to 386 states and 578 transitions. [2020-10-20 06:47:20,635 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 386 [2020-10-20 06:47:20,636 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 386 [2020-10-20 06:47:20,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 386 states and 578 transitions. [2020-10-20 06:47:20,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:20,639 INFO L691 BuchiCegarLoop]: Abstraction has 386 states and 578 transitions. [2020-10-20 06:47:20,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states and 578 transitions. [2020-10-20 06:47:20,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2020-10-20 06:47:20,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-10-20 06:47:20,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 578 transitions. [2020-10-20 06:47:20,664 INFO L714 BuchiCegarLoop]: Abstraction has 386 states and 578 transitions. [2020-10-20 06:47:20,664 INFO L594 BuchiCegarLoop]: Abstraction has 386 states and 578 transitions. [2020-10-20 06:47:20,664 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 06:47:20,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 386 states and 578 transitions. [2020-10-20 06:47:20,667 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 384 [2020-10-20 06:47:20,668 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:20,668 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:20,669 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:20,669 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:20,669 INFO L794 eck$LassoCheckResult]: Stem: 1199#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); 1178#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_~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_~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;havoc main_~cond~0; 1179#L127-1 [2020-10-20 06:47:20,669 INFO L796 eck$LassoCheckResult]: Loop: 1179#L127-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 1254#L37 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; 1249#L58 assume !(0 != main_~p1~0); 1250#L58-2 assume !(0 != main_~p2~0); 1309#L62-1 assume !(0 != main_~p3~0); 1306#L66-1 assume !(0 != main_~p4~0); 1301#L70-1 assume !(0 != main_~p5~0); 1296#L74-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1292#L78-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1288#L82-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1283#L86-1 assume !(0 != main_~p1~0); 1282#L92-1 assume !(0 != main_~p2~0); 1278#L97-1 assume !(0 != main_~p3~0); 1274#L102-1 assume !(0 != main_~p4~0); 1270#L107-1 assume !(0 != main_~p5~0); 1266#L112-1 assume !(0 != main_~p6~0); 1263#L117-1 assume !(0 != main_~p7~0); 1259#L122-1 assume !(0 != main_~p8~0); 1179#L127-1 [2020-10-20 06:47:20,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:20,670 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2020-10-20 06:47:20,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:20,671 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161138165] [2020-10-20 06:47:20,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:20,683 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:20,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:20,694 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:20,698 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:20,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:20,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1530875096, now seen corresponding path program 1 times [2020-10-20 06:47:20,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:20,699 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643462033] [2020-10-20 06:47:20,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:20,719 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,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643462033] [2020-10-20 06:47:20,720 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:20,720 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:20,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750575015] [2020-10-20 06:47:20,721 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:20,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:20,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:20,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:20,721 INFO L87 Difference]: Start difference. First operand 386 states and 578 transitions. cyclomatic complexity: 208 Second operand 3 states. [2020-10-20 06:47:20,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:20,749 INFO L93 Difference]: Finished difference Result 754 states and 1106 transitions. [2020-10-20 06:47:20,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:20,750 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 754 states and 1106 transitions. [2020-10-20 06:47:20,758 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 752 [2020-10-20 06:47:20,764 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 754 states to 754 states and 1106 transitions. [2020-10-20 06:47:20,765 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 754 [2020-10-20 06:47:20,766 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 754 [2020-10-20 06:47:20,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 754 states and 1106 transitions. [2020-10-20 06:47:20,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:20,769 INFO L691 BuchiCegarLoop]: Abstraction has 754 states and 1106 transitions. [2020-10-20 06:47:20,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states and 1106 transitions. [2020-10-20 06:47:20,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2020-10-20 06:47:20,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2020-10-20 06:47:20,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1106 transitions. [2020-10-20 06:47:20,827 INFO L714 BuchiCegarLoop]: Abstraction has 754 states and 1106 transitions. [2020-10-20 06:47:20,827 INFO L594 BuchiCegarLoop]: Abstraction has 754 states and 1106 transitions. [2020-10-20 06:47:20,827 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 06:47:20,827 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 754 states and 1106 transitions. [2020-10-20 06:47:20,832 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 752 [2020-10-20 06:47:20,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:20,833 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:20,833 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:20,833 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:20,834 INFO L794 eck$LassoCheckResult]: Stem: 2348#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); 2324#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_~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_~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;havoc main_~cond~0; 2325#L127-1 [2020-10-20 06:47:20,834 INFO L796 eck$LassoCheckResult]: Loop: 2325#L127-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 2718#L37 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; 2381#L58 assume !(0 != main_~p1~0); 2365#L58-2 assume !(0 != main_~p2~0); 2366#L62-1 assume !(0 != main_~p3~0); 2557#L66-1 assume !(0 != main_~p4~0); 2669#L70-1 assume !(0 != main_~p5~0); 2668#L74-1 assume !(0 != main_~p6~0); 2664#L78-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2663#L82-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2662#L86-1 assume !(0 != main_~p1~0); 2660#L92-1 assume !(0 != main_~p2~0); 2653#L97-1 assume !(0 != main_~p3~0); 2648#L102-1 assume !(0 != main_~p4~0); 2645#L107-1 assume !(0 != main_~p5~0); 2646#L112-1 assume !(0 != main_~p6~0); 2728#L117-1 assume !(0 != main_~p7~0); 2723#L122-1 assume !(0 != main_~p8~0); 2325#L127-1 [2020-10-20 06:47:20,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:20,834 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2020-10-20 06:47:20,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:20,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779456382] [2020-10-20 06:47:20,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:20,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:20,844 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:20,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:20,851 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:20,855 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:20,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:20,856 INFO L82 PathProgramCache]: Analyzing trace with hash -829810518, now seen corresponding path program 1 times [2020-10-20 06:47:20,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:20,857 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770813595] [2020-10-20 06:47:20,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:20,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:20,874 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,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770813595] [2020-10-20 06:47:20,875 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:20,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:20,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234081065] [2020-10-20 06:47:20,876 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:20,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:20,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:20,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:20,877 INFO L87 Difference]: Start difference. First operand 754 states and 1106 transitions. cyclomatic complexity: 384 Second operand 3 states. [2020-10-20 06:47:20,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:20,898 INFO L93 Difference]: Finished difference Result 1474 states and 2114 transitions. [2020-10-20 06:47:20,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:20,899 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1474 states and 2114 transitions. [2020-10-20 06:47:20,914 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1472 [2020-10-20 06:47:20,925 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1474 states to 1474 states and 2114 transitions. [2020-10-20 06:47:20,926 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1474 [2020-10-20 06:47:20,927 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1474 [2020-10-20 06:47:20,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1474 states and 2114 transitions. [2020-10-20 06:47:20,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:20,931 INFO L691 BuchiCegarLoop]: Abstraction has 1474 states and 2114 transitions. [2020-10-20 06:47:20,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states and 2114 transitions. [2020-10-20 06:47:20,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1474. [2020-10-20 06:47:20,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1474 states. [2020-10-20 06:47:20,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2114 transitions. [2020-10-20 06:47:20,977 INFO L714 BuchiCegarLoop]: Abstraction has 1474 states and 2114 transitions. [2020-10-20 06:47:20,978 INFO L594 BuchiCegarLoop]: Abstraction has 1474 states and 2114 transitions. [2020-10-20 06:47:20,978 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 06:47:20,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1474 states and 2114 transitions. [2020-10-20 06:47:20,987 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1472 [2020-10-20 06:47:20,988 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:20,988 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:20,989 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:20,989 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:20,989 INFO L794 eck$LassoCheckResult]: Stem: 4579#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); 4557#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_~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_~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;havoc main_~cond~0; 4558#L127-1 [2020-10-20 06:47:20,989 INFO L796 eck$LassoCheckResult]: Loop: 4558#L127-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 4645#L37 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; 4638#L58 assume !(0 != main_~p1~0); 4630#L58-2 assume !(0 != main_~p2~0); 4625#L62-1 assume !(0 != main_~p3~0); 4618#L66-1 assume !(0 != main_~p4~0); 4615#L70-1 assume !(0 != main_~p5~0); 4604#L74-1 assume !(0 != main_~p6~0); 4605#L78-1 assume !(0 != main_~p7~0); 4712#L82-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 4706#L86-1 assume !(0 != main_~p1~0); 4699#L92-1 assume !(0 != main_~p2~0); 4687#L97-1 assume !(0 != main_~p3~0); 4683#L102-1 assume !(0 != main_~p4~0); 4676#L107-1 assume !(0 != main_~p5~0); 4674#L112-1 assume !(0 != main_~p6~0); 4670#L117-1 assume !(0 != main_~p7~0); 4669#L122-1 assume !(0 != main_~p8~0); 4558#L127-1 [2020-10-20 06:47:20,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:20,990 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2020-10-20 06:47:20,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:20,991 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548605270] [2020-10-20 06:47:20,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:21,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:21,000 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:21,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:21,007 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:21,011 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:21,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:21,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1222837528, now seen corresponding path program 1 times [2020-10-20 06:47:21,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:21,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373228179] [2020-10-20 06:47:21,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:21,050 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,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373228179] [2020-10-20 06:47:21,050 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:21,051 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 06:47:21,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247008669] [2020-10-20 06:47:21,051 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:21,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:21,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:21,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:21,056 INFO L87 Difference]: Start difference. First operand 1474 states and 2114 transitions. cyclomatic complexity: 704 Second operand 3 states. [2020-10-20 06:47:21,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:21,089 INFO L93 Difference]: Finished difference Result 2882 states and 4034 transitions. [2020-10-20 06:47:21,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:21,090 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2882 states and 4034 transitions. [2020-10-20 06:47:21,138 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 2880 [2020-10-20 06:47:21,161 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2882 states to 2882 states and 4034 transitions. [2020-10-20 06:47:21,161 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2882 [2020-10-20 06:47:21,165 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2882 [2020-10-20 06:47:21,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2882 states and 4034 transitions. [2020-10-20 06:47:21,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:21,178 INFO L691 BuchiCegarLoop]: Abstraction has 2882 states and 4034 transitions. [2020-10-20 06:47:21,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states and 4034 transitions. [2020-10-20 06:47:21,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 2882. [2020-10-20 06:47:21,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2882 states. [2020-10-20 06:47:21,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2882 states to 2882 states and 4034 transitions. [2020-10-20 06:47:21,237 INFO L714 BuchiCegarLoop]: Abstraction has 2882 states and 4034 transitions. [2020-10-20 06:47:21,238 INFO L594 BuchiCegarLoop]: Abstraction has 2882 states and 4034 transitions. [2020-10-20 06:47:21,238 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 06:47:21,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2882 states and 4034 transitions. [2020-10-20 06:47:21,269 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 2880 [2020-10-20 06:47:21,270 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:21,270 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:21,271 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:21,271 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:21,271 INFO L794 eck$LassoCheckResult]: Stem: 8940#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); 8919#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_~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_~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;havoc main_~cond~0; 8920#L127-1 [2020-10-20 06:47:21,272 INFO L796 eck$LassoCheckResult]: Loop: 8920#L127-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 9016#L37 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; 9011#L58 assume !(0 != main_~p1~0); 9003#L58-2 assume !(0 != main_~p2~0); 8996#L62-1 assume !(0 != main_~p3~0); 8991#L66-1 assume !(0 != main_~p4~0); 8983#L70-1 assume !(0 != main_~p5~0); 8984#L74-1 assume !(0 != main_~p6~0); 9065#L78-1 assume !(0 != main_~p7~0); 9061#L82-1 assume !(0 != main_~p8~0); 9057#L86-1 assume !(0 != main_~p1~0); 9053#L92-1 assume !(0 != main_~p2~0); 9049#L97-1 assume !(0 != main_~p3~0); 9045#L102-1 assume !(0 != main_~p4~0); 9043#L107-1 assume !(0 != main_~p5~0); 9036#L112-1 assume !(0 != main_~p6~0); 9031#L117-1 assume !(0 != main_~p7~0); 9026#L122-1 assume !(0 != main_~p8~0); 8920#L127-1 [2020-10-20 06:47:21,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:21,272 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2020-10-20 06:47:21,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:21,273 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463687578] [2020-10-20 06:47:21,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:21,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:21,292 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:21,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:21,306 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:21,321 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:21,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:21,325 INFO L82 PathProgramCache]: Analyzing trace with hash -542779158, now seen corresponding path program 1 times [2020-10-20 06:47:21,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:21,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183864025] [2020-10-20 06:47:21,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:21,334 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:21,342 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:21,352 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:21,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:21,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1175900116, now seen corresponding path program 1 times [2020-10-20 06:47:21,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:21,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982770469] [2020-10-20 06:47:21,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:21,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:21,379 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:21,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:21,393 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:21,402 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:21,760 WARN L193 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 75 [2020-10-20 06:47:21,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 06:47:21 BoogieIcfgContainer [2020-10-20 06:47:21,902 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 06:47:21,902 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 06:47:21,902 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 06:47:21,903 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 06:47:21,903 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:19" (3/4) ... [2020-10-20 06:47:21,906 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-20 06:47:21,966 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 06:47:21,967 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 06:47:21,969 INFO L168 Benchmark]: Toolchain (without parser) took 3120.20 ms. Allocated memory was 42.5 MB in the beginning and 60.8 MB in the end (delta: 18.4 MB). Free memory was 23.4 MB in the beginning and 26.8 MB in the end (delta: -3.4 MB). Peak memory consumption was 14.9 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:21,972 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 32.0 MB. Free memory was 10.7 MB in the beginning and 10.7 MB in the end (delta: 47.5 kB). Peak memory consumption was 47.5 kB. Max. memory is 14.3 GB. [2020-10-20 06:47:21,975 INFO L168 Benchmark]: CACSL2BoogieTranslator took 347.08 ms. Allocated memory was 42.5 MB in the beginning and 43.0 MB in the end (delta: 524.3 kB). Free memory was 22.5 MB in the beginning and 24.2 MB in the end (delta: -1.7 MB). Peak memory consumption was 13.6 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:21,975 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.26 ms. Allocated memory is still 43.0 MB. Free memory was 24.2 MB in the beginning and 22.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:21,976 INFO L168 Benchmark]: Boogie Preprocessor took 25.38 ms. Allocated memory is still 43.0 MB. Free memory was 22.2 MB in the beginning and 20.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:21,980 INFO L168 Benchmark]: RCFGBuilder took 365.73 ms. Allocated memory was 43.0 MB in the beginning and 45.6 MB in the end (delta: 2.6 MB). Free memory was 20.8 MB in the beginning and 21.4 MB in the end (delta: -611.1 kB). Peak memory consumption was 11.5 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:21,982 INFO L168 Benchmark]: BuchiAutomizer took 2267.07 ms. Allocated memory was 45.6 MB in the beginning and 60.8 MB in the end (delta: 15.2 MB). Free memory was 21.1 MB in the beginning and 29.5 MB in the end (delta: -8.4 MB). Peak memory consumption was 27.0 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:21,983 INFO L168 Benchmark]: Witness Printer took 64.86 ms. Allocated memory is still 60.8 MB. Free memory was 29.5 MB in the beginning and 26.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:21,991 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 32.0 MB. Free memory was 10.7 MB in the beginning and 10.7 MB in the end (delta: 47.5 kB). Peak memory consumption was 47.5 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 347.08 ms. Allocated memory was 42.5 MB in the beginning and 43.0 MB in the end (delta: 524.3 kB). Free memory was 22.5 MB in the beginning and 24.2 MB in the end (delta: -1.7 MB). Peak memory consumption was 13.6 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 39.26 ms. Allocated memory is still 43.0 MB. Free memory was 24.2 MB in the beginning and 22.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 25.38 ms. Allocated memory is still 43.0 MB. Free memory was 22.2 MB in the beginning and 20.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 14.3 GB. * RCFGBuilder took 365.73 ms. Allocated memory was 43.0 MB in the beginning and 45.6 MB in the end (delta: 2.6 MB). Free memory was 20.8 MB in the beginning and 21.4 MB in the end (delta: -611.1 kB). Peak memory consumption was 11.5 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 2267.07 ms. Allocated memory was 45.6 MB in the beginning and 60.8 MB in the end (delta: 15.2 MB). Free memory was 21.1 MB in the beginning and 29.5 MB in the end (delta: -8.4 MB). Peak memory consumption was 27.0 MB. Max. memory is 14.3 GB. * Witness Printer took 64.86 ms. Allocated memory is still 60.8 MB. Free memory was 29.5 MB in the beginning and 26.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 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 7 terminating modules (7 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.7 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 2882 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.1s and 8 iterations. TraceHistogramMax:1. Analysis of lassos took 1.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 2882 states and ocurred in iteration 7. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 459 SDtfs, 236 SDslu, 277 SDs, 0 SdLazy, 35 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI7 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: 35]: 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=3, 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@68123b6a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2d65187a=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3217b89c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@f000b42=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@76b0a8a3=0, cond=11, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7313c8c7=0, NULL=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7c4f4d61=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@731a13b1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1c48c1=11, 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} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 35]: 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; [L33] int cond; Loop: [L35] COND TRUE 1 [L36] cond = __VERIFIER_nondet_int() [L37] COND FALSE !(cond == 0) [L40] lk1 = 0 [L42] lk2 = 0 [L44] lk3 = 0 [L46] lk4 = 0 [L48] lk5 = 0 [L50] lk6 = 0 [L52] lk7 = 0 [L54] lk8 = 0 [L58] COND FALSE !(p1 != 0) [L62] COND FALSE !(p2 != 0) [L66] COND FALSE !(p3 != 0) [L70] COND FALSE !(p4 != 0) [L74] COND FALSE !(p5 != 0) [L78] COND FALSE !(p6 != 0) [L82] COND FALSE !(p7 != 0) [L86] COND FALSE !(p8 != 0) [L92] COND FALSE !(p1 != 0) [L97] COND FALSE !(p2 != 0) [L102] COND FALSE !(p3 != 0) [L107] COND FALSE !(p4 != 0) [L112] COND FALSE !(p5 != 0) [L117] COND FALSE !(p6 != 0) [L122] COND FALSE !(p7 != 0) [L127] COND FALSE !(p8 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...