./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3f4428a7-9390-4763-893e-d254a4f3b495/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3f4428a7-9390-4763-893e-d254a4f3b495/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3f4428a7-9390-4763-893e-d254a4f3b495/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3f4428a7-9390-4763-893e-d254a4f3b495/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_10.c -s /tmp/vcloud-vcloud-master/worker/run_dir_3f4428a7-9390-4763-893e-d254a4f3b495/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3f4428a7-9390-4763-893e-d254a4f3b495/bin/uautomizer --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 0f7b0b589689413087c164ce10eb80c902ee4046 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.24-678e011 [2019-11-19 23:18:37,616 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 23:18:37,625 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 23:18:37,634 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 23:18:37,635 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 23:18:37,636 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 23:18:37,637 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 23:18:37,640 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 23:18:37,642 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 23:18:37,643 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 23:18:37,644 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 23:18:37,645 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 23:18:37,646 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 23:18:37,647 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 23:18:37,648 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 23:18:37,649 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 23:18:37,650 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 23:18:37,651 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 23:18:37,653 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 23:18:37,655 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 23:18:37,657 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 23:18:37,659 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 23:18:37,666 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 23:18:37,669 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 23:18:37,672 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 23:18:37,678 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 23:18:37,678 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 23:18:37,679 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 23:18:37,680 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 23:18:37,681 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 23:18:37,681 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 23:18:37,682 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 23:18:37,682 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 23:18:37,683 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 23:18:37,684 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 23:18:37,684 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 23:18:37,685 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 23:18:37,685 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 23:18:37,685 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 23:18:37,686 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 23:18:37,686 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 23:18:37,687 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3f4428a7-9390-4763-893e-d254a4f3b495/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-19 23:18:37,703 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 23:18:37,703 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 23:18:37,704 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 23:18:37,704 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 23:18:37,704 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 23:18:37,705 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-19 23:18:37,705 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-19 23:18:37,705 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-19 23:18:37,705 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-19 23:18:37,706 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-19 23:18:37,706 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-19 23:18:37,706 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 23:18:37,706 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 23:18:37,706 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-19 23:18:37,707 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 23:18:37,707 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 23:18:37,707 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 23:18:37,707 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-19 23:18:37,708 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-19 23:18:37,708 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-19 23:18:37,708 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 23:18:37,708 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 23:18:37,708 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-19 23:18:37,709 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 23:18:37,709 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-19 23:18:37,709 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 23:18:37,709 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 23:18:37,710 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-19 23:18:37,710 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 23:18:37,710 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 23:18:37,710 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-19 23:18:37,711 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-19 23:18:37,711 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_3f4428a7-9390-4763-893e-d254a4f3b495/bin/uautomizer 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 -> 0f7b0b589689413087c164ce10eb80c902ee4046 [2019-11-19 23:18:37,861 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 23:18:37,874 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 23:18:37,878 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 23:18:37,885 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 23:18:37,886 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 23:18:37,887 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3f4428a7-9390-4763-893e-d254a4f3b495/bin/uautomizer/../../sv-benchmarks/c/locks/test_locks_10.c [2019-11-19 23:18:37,951 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3f4428a7-9390-4763-893e-d254a4f3b495/bin/uautomizer/data/0310202f2/1d9a0e3825c347408499d75bc7582f65/FLAGc65657049 [2019-11-19 23:18:38,318 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 23:18:38,319 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3f4428a7-9390-4763-893e-d254a4f3b495/sv-benchmarks/c/locks/test_locks_10.c [2019-11-19 23:18:38,326 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3f4428a7-9390-4763-893e-d254a4f3b495/bin/uautomizer/data/0310202f2/1d9a0e3825c347408499d75bc7582f65/FLAGc65657049 [2019-11-19 23:18:38,342 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3f4428a7-9390-4763-893e-d254a4f3b495/bin/uautomizer/data/0310202f2/1d9a0e3825c347408499d75bc7582f65 [2019-11-19 23:18:38,345 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 23:18:38,346 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 23:18:38,350 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 23:18:38,350 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 23:18:38,354 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 23:18:38,354 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:18:38" (1/1) ... [2019-11-19 23:18:38,357 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b3e04a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:18:38, skipping insertion in model container [2019-11-19 23:18:38,357 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:18:38" (1/1) ... [2019-11-19 23:18:38,364 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 23:18:38,393 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 23:18:38,658 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:18:38,672 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 23:18:38,712 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:18:38,725 INFO L192 MainTranslator]: Completed translation [2019-11-19 23:18:38,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:18:38 WrapperNode [2019-11-19 23:18:38,725 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 23:18:38,726 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 23:18:38,726 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 23:18:38,726 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 23:18:38,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:18:38" (1/1) ... [2019-11-19 23:18:38,740 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:18:38" (1/1) ... [2019-11-19 23:18:38,757 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 23:18:38,757 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 23:18:38,758 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 23:18:38,758 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 23:18:38,764 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:18:38" (1/1) ... [2019-11-19 23:18:38,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:18:38" (1/1) ... [2019-11-19 23:18:38,766 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:18:38" (1/1) ... [2019-11-19 23:18:38,766 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:18:38" (1/1) ... [2019-11-19 23:18:38,769 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:18:38" (1/1) ... [2019-11-19 23:18:38,775 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:18:38" (1/1) ... [2019-11-19 23:18:38,777 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:18:38" (1/1) ... [2019-11-19 23:18:38,779 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 23:18:38,780 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 23:18:38,780 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 23:18:38,780 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 23:18:38,785 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:18:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f4428a7-9390-4763-893e-d254a4f3b495/bin/uautomizer/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 [2019-11-19 23:18:38,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 23:18:38,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 23:18:39,134 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 23:18:39,134 INFO L285 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-19 23:18:39,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:18:39 BoogieIcfgContainer [2019-11-19 23:18:39,136 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 23:18:39,136 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-19 23:18:39,137 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-19 23:18:39,140 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-19 23:18:39,141 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 23:18:39,141 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 11:18:38" (1/3) ... [2019-11-19 23:18:39,142 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@169c6701 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 11:18:39, skipping insertion in model container [2019-11-19 23:18:39,143 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 23:18:39,143 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:18:38" (2/3) ... [2019-11-19 23:18:39,143 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@169c6701 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 11:18:39, skipping insertion in model container [2019-11-19 23:18:39,143 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 23:18:39,144 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:18:39" (3/3) ... [2019-11-19 23:18:39,145 INFO L371 chiAutomizerObserver]: Analyzing ICFG test_locks_10.c [2019-11-19 23:18:39,194 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-19 23:18:39,194 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-19 23:18:39,195 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-19 23:18:39,196 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 23:18:39,196 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 23:18:39,196 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-19 23:18:39,196 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 23:18:39,196 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-19 23:18:39,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states. [2019-11-19 23:18:39,231 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2019-11-19 23:18:39,232 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 23:18:39,232 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 23:18:39,237 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-19 23:18:39,238 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:18:39,238 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-19 23:18:39,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states. [2019-11-19 23:18:39,241 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2019-11-19 23:18:39,242 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 23:18:39,242 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 23:18:39,243 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-19 23:18:39,243 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:18:39,249 INFO L794 eck$LassoCheckResult]: Stem: 32#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 17#L153-1true [2019-11-19 23:18:39,250 INFO L796 eck$LassoCheckResult]: Loop: 17#L153-1true assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 26#L41true assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 37#L66true assume 0 != main_~p1~0;main_~lk1~0 := 1; 33#L66-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 22#L70-1true assume !(0 != main_~p3~0); 27#L74-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 15#L78-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 6#L82-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 31#L86-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 39#L90-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 25#L94-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 11#L98-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 3#L102-1true assume !(0 != main_~p1~0); 34#L108-1true assume !(0 != main_~p2~0); 4#L113-1true assume !(0 != main_~p3~0); 9#L118-1true assume !(0 != main_~p4~0); 20#L123-1true assume !(0 != main_~p5~0); 30#L128-1true assume !(0 != main_~p6~0); 19#L133-1true assume !(0 != main_~p7~0); 28#L138-1true assume !(0 != main_~p8~0); 38#L143-1true assume !(0 != main_~p9~0); 8#L148-1true assume !(0 != main_~p10~0); 17#L153-1true [2019-11-19 23:18:39,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:18:39,256 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-11-19 23:18:39,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:18:39,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956472439] [2019-11-19 23:18:39,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:18:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:18:39,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:18:39,365 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:18:39,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:18:39,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1844487545, now seen corresponding path program 1 times [2019-11-19 23:18:39,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:18:39,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830454377] [2019-11-19 23:18:39,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:18:39,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:18:39,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:18:39,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830454377] [2019-11-19 23:18:39,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:18:39,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:18:39,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762313782] [2019-11-19 23:18:39,470 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-19 23:18:39,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:18:39,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:18:39,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:18:39,490 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2019-11-19 23:18:39,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:18:39,565 INFO L93 Difference]: Finished difference Result 74 states and 129 transitions. [2019-11-19 23:18:39,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:18:39,568 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 129 transitions. [2019-11-19 23:18:39,573 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 63 [2019-11-19 23:18:39,584 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 64 states and 102 transitions. [2019-11-19 23:18:39,588 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2019-11-19 23:18:39,589 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2019-11-19 23:18:39,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 102 transitions. [2019-11-19 23:18:39,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 23:18:39,591 INFO L688 BuchiCegarLoop]: Abstraction has 64 states and 102 transitions. [2019-11-19 23:18:39,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 102 transitions. [2019-11-19 23:18:39,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-11-19 23:18:39,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-19 23:18:39,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 102 transitions. [2019-11-19 23:18:39,630 INFO L711 BuchiCegarLoop]: Abstraction has 64 states and 102 transitions. [2019-11-19 23:18:39,630 INFO L591 BuchiCegarLoop]: Abstraction has 64 states and 102 transitions. [2019-11-19 23:18:39,630 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-19 23:18:39,630 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 102 transitions. [2019-11-19 23:18:39,633 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 63 [2019-11-19 23:18:39,633 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 23:18:39,633 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 23:18:39,634 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-19 23:18:39,634 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:18:39,635 INFO L794 eck$LassoCheckResult]: Stem: 154#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 155#L153-1 [2019-11-19 23:18:39,635 INFO L796 eck$LassoCheckResult]: Loop: 155#L153-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 161#L41 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 160#L66 assume !(0 != main_~p1~0); 156#L66-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 147#L70-1 assume !(0 != main_~p3~0); 148#L74-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 140#L78-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 128#L82-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 129#L86-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 153#L90-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 151#L94-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 136#L98-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 137#L102-1 assume !(0 != main_~p1~0); 159#L108-1 assume !(0 != main_~p2~0); 183#L113-1 assume !(0 != main_~p3~0); 181#L118-1 assume !(0 != main_~p4~0); 146#L123-1 assume !(0 != main_~p5~0); 139#L128-1 assume !(0 != main_~p6~0); 143#L133-1 assume !(0 != main_~p7~0); 145#L138-1 assume !(0 != main_~p8~0); 127#L143-1 assume !(0 != main_~p9~0); 163#L148-1 assume !(0 != main_~p10~0); 155#L153-1 [2019-11-19 23:18:39,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:18:39,635 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-11-19 23:18:39,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:18:39,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932643574] [2019-11-19 23:18:39,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:18:39,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:18:39,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:18:39,650 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:18:39,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:18:39,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1026839095, now seen corresponding path program 1 times [2019-11-19 23:18:39,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:18:39,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230990399] [2019-11-19 23:18:39,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:18:39,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:18:39,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:18:39,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230990399] [2019-11-19 23:18:39,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:18:39,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:18:39,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492569872] [2019-11-19 23:18:39,693 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-19 23:18:39,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:18:39,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:18:39,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:18:39,694 INFO L87 Difference]: Start difference. First operand 64 states and 102 transitions. cyclomatic complexity: 40 Second operand 3 states. [2019-11-19 23:18:39,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:18:39,743 INFO L93 Difference]: Finished difference Result 125 states and 197 transitions. [2019-11-19 23:18:39,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:18:39,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 197 transitions. [2019-11-19 23:18:39,749 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 124 [2019-11-19 23:18:39,751 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 125 states and 197 transitions. [2019-11-19 23:18:39,752 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2019-11-19 23:18:39,752 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2019-11-19 23:18:39,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 197 transitions. [2019-11-19 23:18:39,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 23:18:39,754 INFO L688 BuchiCegarLoop]: Abstraction has 125 states and 197 transitions. [2019-11-19 23:18:39,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 197 transitions. [2019-11-19 23:18:39,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-11-19 23:18:39,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-19 23:18:39,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 197 transitions. [2019-11-19 23:18:39,780 INFO L711 BuchiCegarLoop]: Abstraction has 125 states and 197 transitions. [2019-11-19 23:18:39,780 INFO L591 BuchiCegarLoop]: Abstraction has 125 states and 197 transitions. [2019-11-19 23:18:39,780 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-19 23:18:39,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 197 transitions. [2019-11-19 23:18:39,783 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 124 [2019-11-19 23:18:39,783 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 23:18:39,783 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 23:18:39,784 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-19 23:18:39,784 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:18:39,784 INFO L794 eck$LassoCheckResult]: Stem: 351#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 352#L153-1 [2019-11-19 23:18:39,784 INFO L796 eck$LassoCheckResult]: Loop: 352#L153-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 371#L41 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 370#L66 assume !(0 != main_~p1~0); 369#L66-2 assume !(0 != main_~p2~0); 366#L70-1 assume !(0 != main_~p3~0); 365#L74-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 364#L78-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 363#L82-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 362#L86-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 361#L90-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 360#L94-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 358#L98-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 359#L102-1 assume !(0 != main_~p1~0); 388#L108-1 assume !(0 != main_~p2~0); 387#L113-1 assume !(0 != main_~p3~0); 385#L118-1 assume !(0 != main_~p4~0); 382#L123-1 assume !(0 != main_~p5~0); 381#L128-1 assume !(0 != main_~p6~0); 379#L133-1 assume !(0 != main_~p7~0); 377#L138-1 assume !(0 != main_~p8~0); 375#L143-1 assume !(0 != main_~p9~0); 373#L148-1 assume !(0 != main_~p10~0); 352#L153-1 [2019-11-19 23:18:39,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:18:39,785 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2019-11-19 23:18:39,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:18:39,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321763947] [2019-11-19 23:18:39,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:18:39,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:18:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:18:39,804 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:18:39,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:18:39,806 INFO L82 PathProgramCache]: Analyzing trace with hash -662104647, now seen corresponding path program 1 times [2019-11-19 23:18:39,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:18:39,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642470276] [2019-11-19 23:18:39,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:18:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:18:39,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:18:39,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642470276] [2019-11-19 23:18:39,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:18:39,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:18:39,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639906909] [2019-11-19 23:18:39,841 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-19 23:18:39,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:18:39,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:18:39,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:18:39,842 INFO L87 Difference]: Start difference. First operand 125 states and 197 transitions. cyclomatic complexity: 76 Second operand 3 states. [2019-11-19 23:18:39,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:18:39,863 INFO L93 Difference]: Finished difference Result 245 states and 381 transitions. [2019-11-19 23:18:39,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:18:39,864 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 245 states and 381 transitions. [2019-11-19 23:18:39,868 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 244 [2019-11-19 23:18:39,871 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 245 states to 245 states and 381 transitions. [2019-11-19 23:18:39,872 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 245 [2019-11-19 23:18:39,872 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 245 [2019-11-19 23:18:39,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 245 states and 381 transitions. [2019-11-19 23:18:39,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 23:18:39,875 INFO L688 BuchiCegarLoop]: Abstraction has 245 states and 381 transitions. [2019-11-19 23:18:39,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states and 381 transitions. [2019-11-19 23:18:39,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2019-11-19 23:18:39,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-11-19 23:18:39,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 381 transitions. [2019-11-19 23:18:39,894 INFO L711 BuchiCegarLoop]: Abstraction has 245 states and 381 transitions. [2019-11-19 23:18:39,894 INFO L591 BuchiCegarLoop]: Abstraction has 245 states and 381 transitions. [2019-11-19 23:18:39,894 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-19 23:18:39,894 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 245 states and 381 transitions. [2019-11-19 23:18:39,897 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 244 [2019-11-19 23:18:39,897 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 23:18:39,897 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 23:18:39,898 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-19 23:18:39,898 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:18:39,898 INFO L794 eck$LassoCheckResult]: Stem: 727#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 728#L153-1 [2019-11-19 23:18:39,899 INFO L796 eck$LassoCheckResult]: Loop: 728#L153-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 765#L41 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 760#L66 assume !(0 != main_~p1~0); 753#L66-2 assume !(0 != main_~p2~0); 754#L70-1 assume !(0 != main_~p3~0); 854#L74-1 assume !(0 != main_~p4~0); 853#L78-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 851#L82-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 849#L86-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 847#L90-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 845#L94-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 843#L98-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 838#L102-1 assume !(0 != main_~p1~0); 834#L108-1 assume !(0 != main_~p2~0); 831#L113-1 assume !(0 != main_~p3~0); 822#L118-1 assume !(0 != main_~p4~0); 819#L123-1 assume !(0 != main_~p5~0); 816#L128-1 assume !(0 != main_~p6~0); 812#L133-1 assume !(0 != main_~p7~0); 808#L138-1 assume !(0 != main_~p8~0); 804#L143-1 assume !(0 != main_~p9~0); 800#L148-1 assume !(0 != main_~p10~0); 728#L153-1 [2019-11-19 23:18:39,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:18:39,899 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2019-11-19 23:18:39,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:18:39,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485574553] [2019-11-19 23:18:39,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:18:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:18:39,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:18:39,910 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:18:39,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:18:39,911 INFO L82 PathProgramCache]: Analyzing trace with hash 2044514747, now seen corresponding path program 1 times [2019-11-19 23:18:39,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:18:39,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425046698] [2019-11-19 23:18:39,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:18:39,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:18:39,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:18:39,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425046698] [2019-11-19 23:18:39,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:18:39,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:18:39,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351278480] [2019-11-19 23:18:39,936 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-19 23:18:39,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:18:39,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:18:39,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:18:39,936 INFO L87 Difference]: Start difference. First operand 245 states and 381 transitions. cyclomatic complexity: 144 Second operand 3 states. [2019-11-19 23:18:39,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:18:39,962 INFO L93 Difference]: Finished difference Result 481 states and 737 transitions. [2019-11-19 23:18:39,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:18:39,962 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 481 states and 737 transitions. [2019-11-19 23:18:39,968 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 480 [2019-11-19 23:18:39,975 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 481 states to 481 states and 737 transitions. [2019-11-19 23:18:39,976 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 481 [2019-11-19 23:18:39,977 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 481 [2019-11-19 23:18:39,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 481 states and 737 transitions. [2019-11-19 23:18:39,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 23:18:39,980 INFO L688 BuchiCegarLoop]: Abstraction has 481 states and 737 transitions. [2019-11-19 23:18:39,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states and 737 transitions. [2019-11-19 23:18:40,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 481. [2019-11-19 23:18:40,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-11-19 23:18:40,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 737 transitions. [2019-11-19 23:18:40,011 INFO L711 BuchiCegarLoop]: Abstraction has 481 states and 737 transitions. [2019-11-19 23:18:40,011 INFO L591 BuchiCegarLoop]: Abstraction has 481 states and 737 transitions. [2019-11-19 23:18:40,012 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-19 23:18:40,012 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 481 states and 737 transitions. [2019-11-19 23:18:40,015 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 480 [2019-11-19 23:18:40,016 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 23:18:40,016 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 23:18:40,016 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-19 23:18:40,016 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:18:40,017 INFO L794 eck$LassoCheckResult]: Stem: 1461#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 1462#L153-1 [2019-11-19 23:18:40,017 INFO L796 eck$LassoCheckResult]: Loop: 1462#L153-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 1635#L41 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 1631#L66 assume !(0 != main_~p1~0); 1577#L66-2 assume !(0 != main_~p2~0); 1491#L70-1 assume !(0 != main_~p3~0); 1492#L74-1 assume !(0 != main_~p4~0); 1566#L78-1 assume !(0 != main_~p5~0); 1567#L82-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1560#L86-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1561#L90-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1554#L94-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1555#L98-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1546#L102-1 assume !(0 != main_~p1~0); 1547#L108-1 assume !(0 != main_~p2~0); 1537#L113-1 assume !(0 != main_~p3~0); 1536#L118-1 assume !(0 != main_~p4~0); 1609#L123-1 assume !(0 != main_~p5~0); 1683#L128-1 assume !(0 != main_~p6~0); 1680#L133-1 assume !(0 != main_~p7~0); 1677#L138-1 assume !(0 != main_~p8~0); 1673#L143-1 assume !(0 != main_~p9~0); 1647#L148-1 assume !(0 != main_~p10~0); 1462#L153-1 [2019-11-19 23:18:40,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:18:40,017 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2019-11-19 23:18:40,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:18:40,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791621154] [2019-11-19 23:18:40,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:18:40,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:18:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:18:40,038 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:18:40,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:18:40,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1023446393, now seen corresponding path program 1 times [2019-11-19 23:18:40,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:18:40,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776538378] [2019-11-19 23:18:40,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:18:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:18:40,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:18:40,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776538378] [2019-11-19 23:18:40,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:18:40,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:18:40,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683336798] [2019-11-19 23:18:40,086 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-19 23:18:40,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:18:40,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:18:40,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:18:40,087 INFO L87 Difference]: Start difference. First operand 481 states and 737 transitions. cyclomatic complexity: 272 Second operand 3 states. [2019-11-19 23:18:40,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:18:40,126 INFO L93 Difference]: Finished difference Result 945 states and 1425 transitions. [2019-11-19 23:18:40,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:18:40,127 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 945 states and 1425 transitions. [2019-11-19 23:18:40,138 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 944 [2019-11-19 23:18:40,148 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 945 states to 945 states and 1425 transitions. [2019-11-19 23:18:40,149 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 945 [2019-11-19 23:18:40,150 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 945 [2019-11-19 23:18:40,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 945 states and 1425 transitions. [2019-11-19 23:18:40,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 23:18:40,153 INFO L688 BuchiCegarLoop]: Abstraction has 945 states and 1425 transitions. [2019-11-19 23:18:40,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states and 1425 transitions. [2019-11-19 23:18:40,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 945. [2019-11-19 23:18:40,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2019-11-19 23:18:40,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1425 transitions. [2019-11-19 23:18:40,187 INFO L711 BuchiCegarLoop]: Abstraction has 945 states and 1425 transitions. [2019-11-19 23:18:40,187 INFO L591 BuchiCegarLoop]: Abstraction has 945 states and 1425 transitions. [2019-11-19 23:18:40,188 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-19 23:18:40,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 945 states and 1425 transitions. [2019-11-19 23:18:40,195 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 944 [2019-11-19 23:18:40,195 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 23:18:40,196 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 23:18:40,197 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-19 23:18:40,197 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:18:40,197 INFO L794 eck$LassoCheckResult]: Stem: 2900#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 2901#L153-1 [2019-11-19 23:18:40,197 INFO L796 eck$LassoCheckResult]: Loop: 2901#L153-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 3094#L41 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 3092#L66 assume !(0 != main_~p1~0); 3090#L66-2 assume !(0 != main_~p2~0); 3089#L70-1 assume !(0 != main_~p3~0); 3087#L74-1 assume !(0 != main_~p4~0); 3085#L78-1 assume !(0 != main_~p5~0); 3082#L82-1 assume !(0 != main_~p6~0); 3073#L86-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 3074#L90-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 3059#L94-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 3060#L98-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 3043#L102-1 assume !(0 != main_~p1~0); 3044#L108-1 assume !(0 != main_~p2~0); 3026#L113-1 assume !(0 != main_~p3~0); 3025#L118-1 assume !(0 != main_~p4~0); 3003#L123-1 assume !(0 != main_~p5~0); 3004#L128-1 assume !(0 != main_~p6~0); 3102#L133-1 assume !(0 != main_~p7~0); 3100#L138-1 assume !(0 != main_~p8~0); 3098#L143-1 assume !(0 != main_~p9~0); 3096#L148-1 assume !(0 != main_~p10~0); 2901#L153-1 [2019-11-19 23:18:40,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:18:40,198 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 6 times [2019-11-19 23:18:40,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:18:40,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469285216] [2019-11-19 23:18:40,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:18:40,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:18:40,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:18:40,224 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:18:40,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:18:40,228 INFO L82 PathProgramCache]: Analyzing trace with hash -256417285, now seen corresponding path program 1 times [2019-11-19 23:18:40,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:18:40,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484643638] [2019-11-19 23:18:40,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:18:40,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:18:40,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:18:40,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484643638] [2019-11-19 23:18:40,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:18:40,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:18:40,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934854262] [2019-11-19 23:18:40,259 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-19 23:18:40,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:18:40,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:18:40,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:18:40,260 INFO L87 Difference]: Start difference. First operand 945 states and 1425 transitions. cyclomatic complexity: 512 Second operand 3 states. [2019-11-19 23:18:40,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:18:40,287 INFO L93 Difference]: Finished difference Result 1857 states and 2753 transitions. [2019-11-19 23:18:40,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:18:40,287 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1857 states and 2753 transitions. [2019-11-19 23:18:40,318 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1856 [2019-11-19 23:18:40,338 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1857 states to 1857 states and 2753 transitions. [2019-11-19 23:18:40,338 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1857 [2019-11-19 23:18:40,341 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1857 [2019-11-19 23:18:40,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1857 states and 2753 transitions. [2019-11-19 23:18:40,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 23:18:40,345 INFO L688 BuchiCegarLoop]: Abstraction has 1857 states and 2753 transitions. [2019-11-19 23:18:40,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1857 states and 2753 transitions. [2019-11-19 23:18:40,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1857 to 1857. [2019-11-19 23:18:40,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1857 states. [2019-11-19 23:18:40,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1857 states to 1857 states and 2753 transitions. [2019-11-19 23:18:40,396 INFO L711 BuchiCegarLoop]: Abstraction has 1857 states and 2753 transitions. [2019-11-19 23:18:40,396 INFO L591 BuchiCegarLoop]: Abstraction has 1857 states and 2753 transitions. [2019-11-19 23:18:40,396 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-19 23:18:40,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1857 states and 2753 transitions. [2019-11-19 23:18:40,414 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1856 [2019-11-19 23:18:40,414 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 23:18:40,414 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 23:18:40,415 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-19 23:18:40,415 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:18:40,415 INFO L794 eck$LassoCheckResult]: Stem: 5707#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 5708#L153-1 [2019-11-19 23:18:40,416 INFO L796 eck$LassoCheckResult]: Loop: 5708#L153-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 5792#L41 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 5789#L66 assume !(0 != main_~p1~0); 5787#L66-2 assume !(0 != main_~p2~0); 5784#L70-1 assume !(0 != main_~p3~0); 5780#L74-1 assume !(0 != main_~p4~0); 5776#L78-1 assume !(0 != main_~p5~0); 5772#L82-1 assume !(0 != main_~p6~0); 5769#L86-1 assume !(0 != main_~p7~0); 5767#L90-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 5765#L94-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 5762#L98-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 5759#L102-1 assume !(0 != main_~p1~0); 5756#L108-1 assume !(0 != main_~p2~0); 5752#L113-1 assume !(0 != main_~p3~0); 5751#L118-1 assume !(0 != main_~p4~0); 5815#L123-1 assume !(0 != main_~p5~0); 5811#L128-1 assume !(0 != main_~p6~0); 5807#L133-1 assume !(0 != main_~p7~0); 5804#L138-1 assume !(0 != main_~p8~0); 5800#L143-1 assume !(0 != main_~p9~0); 5797#L148-1 assume !(0 != main_~p10~0); 5708#L153-1 [2019-11-19 23:18:40,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:18:40,416 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 7 times [2019-11-19 23:18:40,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:18:40,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951748655] [2019-11-19 23:18:40,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:18:40,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:18:40,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:18:40,435 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:18:40,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:18:40,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1267534535, now seen corresponding path program 1 times [2019-11-19 23:18:40,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:18:40,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737490865] [2019-11-19 23:18:40,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:18:40,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:18:40,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:18:40,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737490865] [2019-11-19 23:18:40,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:18:40,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:18:40,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997299847] [2019-11-19 23:18:40,488 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-19 23:18:40,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:18:40,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:18:40,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:18:40,489 INFO L87 Difference]: Start difference. First operand 1857 states and 2753 transitions. cyclomatic complexity: 960 Second operand 3 states. [2019-11-19 23:18:40,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:18:40,536 INFO L93 Difference]: Finished difference Result 3649 states and 5313 transitions. [2019-11-19 23:18:40,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:18:40,538 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3649 states and 5313 transitions. [2019-11-19 23:18:40,578 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3648 [2019-11-19 23:18:40,610 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3649 states to 3649 states and 5313 transitions. [2019-11-19 23:18:40,611 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3649 [2019-11-19 23:18:40,615 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3649 [2019-11-19 23:18:40,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3649 states and 5313 transitions. [2019-11-19 23:18:40,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 23:18:40,622 INFO L688 BuchiCegarLoop]: Abstraction has 3649 states and 5313 transitions. [2019-11-19 23:18:40,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3649 states and 5313 transitions. [2019-11-19 23:18:40,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3649 to 3649. [2019-11-19 23:18:40,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3649 states. [2019-11-19 23:18:40,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3649 states to 3649 states and 5313 transitions. [2019-11-19 23:18:40,721 INFO L711 BuchiCegarLoop]: Abstraction has 3649 states and 5313 transitions. [2019-11-19 23:18:40,722 INFO L591 BuchiCegarLoop]: Abstraction has 3649 states and 5313 transitions. [2019-11-19 23:18:40,722 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-19 23:18:40,723 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3649 states and 5313 transitions. [2019-11-19 23:18:40,745 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3648 [2019-11-19 23:18:40,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 23:18:40,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 23:18:40,750 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-19 23:18:40,751 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:18:40,751 INFO L794 eck$LassoCheckResult]: Stem: 11215#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 11216#L153-1 [2019-11-19 23:18:40,755 INFO L796 eck$LassoCheckResult]: Loop: 11216#L153-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 11415#L41 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 11362#L66 assume !(0 != main_~p1~0); 11364#L66-2 assume !(0 != main_~p2~0); 11381#L70-1 assume !(0 != main_~p3~0); 11382#L74-1 assume !(0 != main_~p4~0); 11490#L78-1 assume !(0 != main_~p5~0); 11483#L82-1 assume !(0 != main_~p6~0); 11485#L86-1 assume !(0 != main_~p7~0); 11476#L90-1 assume !(0 != main_~p8~0); 11478#L94-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 11470#L98-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 11471#L102-1 assume !(0 != main_~p1~0); 11519#L108-1 assume !(0 != main_~p2~0); 11517#L113-1 assume !(0 != main_~p3~0); 11512#L118-1 assume !(0 != main_~p4~0); 11513#L123-1 assume !(0 != main_~p5~0); 11532#L128-1 assume !(0 != main_~p6~0); 11530#L133-1 assume !(0 != main_~p7~0); 11529#L138-1 assume !(0 != main_~p8~0); 11426#L143-1 assume !(0 != main_~p9~0); 11425#L148-1 assume !(0 != main_~p10~0); 11216#L153-1 [2019-11-19 23:18:40,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:18:40,757 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 8 times [2019-11-19 23:18:40,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:18:40,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918678615] [2019-11-19 23:18:40,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:18:40,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:18:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:18:40,774 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:18:40,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:18:40,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1854340549, now seen corresponding path program 1 times [2019-11-19 23:18:40,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:18:40,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413132640] [2019-11-19 23:18:40,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:18:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:18:40,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:18:40,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413132640] [2019-11-19 23:18:40,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:18:40,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:18:40,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089604898] [2019-11-19 23:18:40,808 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-19 23:18:40,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:18:40,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:18:40,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:18:40,809 INFO L87 Difference]: Start difference. First operand 3649 states and 5313 transitions. cyclomatic complexity: 1792 Second operand 3 states. [2019-11-19 23:18:40,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:18:40,865 INFO L93 Difference]: Finished difference Result 7169 states and 10241 transitions. [2019-11-19 23:18:40,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:18:40,866 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7169 states and 10241 transitions. [2019-11-19 23:18:40,935 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7168 [2019-11-19 23:18:41,001 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7169 states to 7169 states and 10241 transitions. [2019-11-19 23:18:41,001 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7169 [2019-11-19 23:18:41,009 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7169 [2019-11-19 23:18:41,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7169 states and 10241 transitions. [2019-11-19 23:18:41,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 23:18:41,023 INFO L688 BuchiCegarLoop]: Abstraction has 7169 states and 10241 transitions. [2019-11-19 23:18:41,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7169 states and 10241 transitions. [2019-11-19 23:18:41,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7169 to 7169. [2019-11-19 23:18:41,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7169 states. [2019-11-19 23:18:41,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7169 states to 7169 states and 10241 transitions. [2019-11-19 23:18:41,222 INFO L711 BuchiCegarLoop]: Abstraction has 7169 states and 10241 transitions. [2019-11-19 23:18:41,222 INFO L591 BuchiCegarLoop]: Abstraction has 7169 states and 10241 transitions. [2019-11-19 23:18:41,222 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-19 23:18:41,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7169 states and 10241 transitions. [2019-11-19 23:18:41,253 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7168 [2019-11-19 23:18:41,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 23:18:41,253 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 23:18:41,253 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-19 23:18:41,254 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:18:41,254 INFO L794 eck$LassoCheckResult]: Stem: 22045#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 22046#L153-1 [2019-11-19 23:18:41,255 INFO L796 eck$LassoCheckResult]: Loop: 22046#L153-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 22320#L41 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 22315#L66 assume !(0 != main_~p1~0); 22316#L66-2 assume !(0 != main_~p2~0); 22303#L70-1 assume !(0 != main_~p3~0); 22304#L74-1 assume !(0 != main_~p4~0); 22412#L78-1 assume !(0 != main_~p5~0); 22408#L82-1 assume !(0 != main_~p6~0); 22404#L86-1 assume !(0 != main_~p7~0); 22398#L90-1 assume !(0 != main_~p8~0); 22392#L94-1 assume !(0 != main_~p9~0); 22389#L98-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 22384#L102-1 assume !(0 != main_~p1~0); 22378#L108-1 assume !(0 != main_~p2~0); 22373#L113-1 assume !(0 != main_~p3~0); 22365#L118-1 assume !(0 != main_~p4~0); 22361#L123-1 assume !(0 != main_~p5~0); 22358#L128-1 assume !(0 != main_~p6~0); 22354#L133-1 assume !(0 != main_~p7~0); 22348#L138-1 assume !(0 != main_~p8~0); 22342#L143-1 assume !(0 != main_~p9~0); 22331#L148-1 assume !(0 != main_~p10~0); 22046#L153-1 [2019-11-19 23:18:41,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:18:41,255 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 9 times [2019-11-19 23:18:41,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:18:41,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355106659] [2019-11-19 23:18:41,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:18:41,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:18:41,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:18:41,273 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:18:41,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:18:41,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1596175111, now seen corresponding path program 1 times [2019-11-19 23:18:41,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:18:41,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685705723] [2019-11-19 23:18:41,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:18:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:18:41,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:18:41,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685705723] [2019-11-19 23:18:41,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:18:41,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:18:41,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446673876] [2019-11-19 23:18:41,304 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-19 23:18:41,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:18:41,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:18:41,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:18:41,305 INFO L87 Difference]: Start difference. First operand 7169 states and 10241 transitions. cyclomatic complexity: 3328 Second operand 3 states. [2019-11-19 23:18:41,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:18:41,402 INFO L93 Difference]: Finished difference Result 14081 states and 19713 transitions. [2019-11-19 23:18:41,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:18:41,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14081 states and 19713 transitions. [2019-11-19 23:18:41,494 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 14080 [2019-11-19 23:18:41,599 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14081 states to 14081 states and 19713 transitions. [2019-11-19 23:18:41,600 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14081 [2019-11-19 23:18:41,699 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14081 [2019-11-19 23:18:41,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14081 states and 19713 transitions. [2019-11-19 23:18:41,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 23:18:41,719 INFO L688 BuchiCegarLoop]: Abstraction has 14081 states and 19713 transitions. [2019-11-19 23:18:41,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14081 states and 19713 transitions. [2019-11-19 23:18:41,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14081 to 14081. [2019-11-19 23:18:41,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14081 states. [2019-11-19 23:18:41,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14081 states to 14081 states and 19713 transitions. [2019-11-19 23:18:41,937 INFO L711 BuchiCegarLoop]: Abstraction has 14081 states and 19713 transitions. [2019-11-19 23:18:41,938 INFO L591 BuchiCegarLoop]: Abstraction has 14081 states and 19713 transitions. [2019-11-19 23:18:41,938 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-19 23:18:41,938 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14081 states and 19713 transitions. [2019-11-19 23:18:41,991 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 14080 [2019-11-19 23:18:41,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 23:18:41,991 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 23:18:41,992 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-19 23:18:41,992 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:18:41,992 INFO L794 eck$LassoCheckResult]: Stem: 43300#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 43301#L153-1 [2019-11-19 23:18:41,993 INFO L796 eck$LassoCheckResult]: Loop: 43301#L153-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 43624#L41 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 43621#L66 assume !(0 != main_~p1~0); 43617#L66-2 assume !(0 != main_~p2~0); 43614#L70-1 assume !(0 != main_~p3~0); 43611#L74-1 assume !(0 != main_~p4~0); 43607#L78-1 assume !(0 != main_~p5~0); 43604#L82-1 assume !(0 != main_~p6~0); 43600#L86-1 assume !(0 != main_~p7~0); 43601#L90-1 assume !(0 != main_~p8~0); 43649#L94-1 assume !(0 != main_~p9~0); 43748#L98-1 assume !(0 != main_~p10~0); 43750#L102-1 assume !(0 != main_~p1~0); 43657#L108-1 assume !(0 != main_~p2~0); 43654#L113-1 assume !(0 != main_~p3~0); 43650#L118-1 assume !(0 != main_~p4~0); 43645#L123-1 assume !(0 != main_~p5~0); 43460#L128-1 assume !(0 != main_~p6~0); 43462#L133-1 assume !(0 != main_~p7~0); 43634#L138-1 assume !(0 != main_~p8~0); 43630#L143-1 assume !(0 != main_~p9~0); 43627#L148-1 assume !(0 != main_~p10~0); 43301#L153-1 [2019-11-19 23:18:41,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:18:41,993 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 10 times [2019-11-19 23:18:41,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:18:41,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316082792] [2019-11-19 23:18:41,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:18:41,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:18:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:18:42,003 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:18:42,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:18:42,004 INFO L82 PathProgramCache]: Analyzing trace with hash -895110533, now seen corresponding path program 1 times [2019-11-19 23:18:42,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:18:42,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628571297] [2019-11-19 23:18:42,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:18:42,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:18:42,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:18:42,030 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:18:42,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:18:42,031 INFO L82 PathProgramCache]: Analyzing trace with hash -962117286, now seen corresponding path program 1 times [2019-11-19 23:18:42,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:18:42,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027885977] [2019-11-19 23:18:42,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:18:42,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:18:42,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:18:42,061 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:18:42,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 11:18:42 BoogieIcfgContainer [2019-11-19 23:18:42,288 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-19 23:18:42,289 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 23:18:42,289 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 23:18:42,289 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 23:18:42,290 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:18:39" (3/4) ... [2019-11-19 23:18:42,294 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-19 23:18:42,375 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3f4428a7-9390-4763-893e-d254a4f3b495/bin/uautomizer/witness.graphml [2019-11-19 23:18:42,375 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 23:18:42,377 INFO L168 Benchmark]: Toolchain (without parser) took 4029.84 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 287.3 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -154.1 MB). Peak memory consumption was 133.2 MB. Max. memory is 11.5 GB. [2019-11-19 23:18:42,377 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:18:42,380 INFO L168 Benchmark]: CACSL2BoogieTranslator took 375.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -186.5 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-11-19 23:18:42,380 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:18:42,386 INFO L168 Benchmark]: Boogie Preprocessor took 21.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:18:42,389 INFO L168 Benchmark]: RCFGBuilder took 356.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.1 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. [2019-11-19 23:18:42,389 INFO L168 Benchmark]: BuchiAutomizer took 3151.99 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 142.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -743.5 kB). Peak memory consumption was 141.3 MB. Max. memory is 11.5 GB. [2019-11-19 23:18:42,389 INFO L168 Benchmark]: Witness Printer took 86.09 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 11.5 GB. [2019-11-19 23:18:42,392 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 375.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -186.5 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 356.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.1 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3151.99 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 142.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -743.5 kB). Peak memory consumption was 141.3 MB. Max. memory is 11.5 GB. * Witness Printer took 86.09 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (9 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.9 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 14081 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.0s and 10 iterations. TraceHistogramMax:1. Analysis of lassos took 0.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 0. Minimization of det autom 9. Minimization of nondet autom 0. Automata minimization 0.6s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.5s Buchi closure took 0.1s. Biggest automaton had 14081 states and ocurred in iteration 9. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 713 SDtfs, 374 SDslu, 436 SDs, 0 SdLazy, 45 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI9 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 39]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {p1=0, \result=0, p3=0, p2=0, p5=0, p10=0, p4=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4b2b42f5=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@10ec5e34=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@18a00e99=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2c49e66e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@501161ad=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@25779475=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@21753636=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2832ab0b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6213c6ec=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6f13c0d1=0, lk10=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@ef0f7c4=0, cond=1, lk3=0, lk4=0, lk5=0, lk6=0, lk1=0, lk2=0, lk7=0, lk8=0, lk9=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 39]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int p1 = __VERIFIER_nondet_int(); [L7] int lk1; [L9] int p2 = __VERIFIER_nondet_int(); [L10] int lk2; [L12] int p3 = __VERIFIER_nondet_int(); [L13] int lk3; [L15] int p4 = __VERIFIER_nondet_int(); [L16] int lk4; [L18] int p5 = __VERIFIER_nondet_int(); [L19] int lk5; [L21] int p6 = __VERIFIER_nondet_int(); [L22] int lk6; [L24] int p7 = __VERIFIER_nondet_int(); [L25] int lk7; [L27] int p8 = __VERIFIER_nondet_int(); [L28] int lk8; [L30] int p9 = __VERIFIER_nondet_int(); [L31] int lk9; [L33] int p10 = __VERIFIER_nondet_int(); [L34] int lk10; [L37] int cond; Loop: [L39] COND TRUE 1 [L40] cond = __VERIFIER_nondet_int() [L41] COND FALSE !(cond == 0) [L44] lk1 = 0 [L46] lk2 = 0 [L48] lk3 = 0 [L50] lk4 = 0 [L52] lk5 = 0 [L54] lk6 = 0 [L56] lk7 = 0 [L58] lk8 = 0 [L60] lk9 = 0 [L62] lk10 = 0 [L66] COND FALSE !(p1 != 0) [L70] COND FALSE !(p2 != 0) [L74] COND FALSE !(p3 != 0) [L78] COND FALSE !(p4 != 0) [L82] COND FALSE !(p5 != 0) [L86] COND FALSE !(p6 != 0) [L90] COND FALSE !(p7 != 0) [L94] COND FALSE !(p8 != 0) [L98] COND FALSE !(p9 != 0) [L102] COND FALSE !(p10 != 0) [L108] COND FALSE !(p1 != 0) [L113] COND FALSE !(p2 != 0) [L118] COND FALSE !(p3 != 0) [L123] COND FALSE !(p4 != 0) [L128] COND FALSE !(p5 != 0) [L133] COND FALSE !(p6 != 0) [L138] COND FALSE !(p7 != 0) [L143] COND FALSE !(p8 != 0) [L148] COND FALSE !(p9 != 0) [L153] COND FALSE !(p10 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...