./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7131c4a5-a429-4d9a-80ba-c18737caf11b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7131c4a5-a429-4d9a-80ba-c18737caf11b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7131c4a5-a429-4d9a-80ba-c18737caf11b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7131c4a5-a429-4d9a-80ba-c18737caf11b/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_7131c4a5-a429-4d9a-80ba-c18737caf11b/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7131c4a5-a429-4d9a-80ba-c18737caf11b/bin-2019/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.23-5842f4b [2018-11-18 12:06:00,688 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 12:06:00,690 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 12:06:00,697 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 12:06:00,698 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 12:06:00,699 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 12:06:00,700 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 12:06:00,701 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 12:06:00,702 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 12:06:00,703 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 12:06:00,704 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 12:06:00,704 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 12:06:00,705 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 12:06:00,705 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 12:06:00,707 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 12:06:00,707 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 12:06:00,708 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 12:06:00,709 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 12:06:00,711 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 12:06:00,712 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 12:06:00,713 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 12:06:00,714 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 12:06:00,716 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 12:06:00,716 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 12:06:00,716 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 12:06:00,717 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 12:06:00,718 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 12:06:00,719 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 12:06:00,719 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 12:06:00,720 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 12:06:00,720 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 12:06:00,721 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 12:06:00,721 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 12:06:00,721 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 12:06:00,722 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 12:06:00,723 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 12:06:00,723 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7131c4a5-a429-4d9a-80ba-c18737caf11b/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 12:06:00,734 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 12:06:00,734 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 12:06:00,735 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 12:06:00,736 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 12:06:00,736 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 12:06:00,736 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 12:06:00,736 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 12:06:00,736 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 12:06:00,736 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 12:06:00,736 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 12:06:00,737 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 12:06:00,737 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 12:06:00,737 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 12:06:00,737 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 12:06:00,737 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 12:06:00,737 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 12:06:00,737 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 12:06:00,738 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 12:06:00,738 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 12:06:00,738 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 12:06:00,738 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 12:06:00,738 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 12:06:00,738 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 12:06:00,738 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 12:06:00,739 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 12:06:00,739 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 12:06:00,739 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 12:06:00,739 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 12:06:00,739 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 12:06:00,739 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 12:06:00,740 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 12:06:00,740 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 12:06:00,740 INFO L133 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/working_dir_7131c4a5-a429-4d9a-80ba-c18737caf11b/bin-2019/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 [2018-11-18 12:06:00,763 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 12:06:00,772 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 12:06:00,775 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 12:06:00,776 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 12:06:00,776 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 12:06:00,777 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7131c4a5-a429-4d9a-80ba-c18737caf11b/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 12:06:00,820 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7131c4a5-a429-4d9a-80ba-c18737caf11b/bin-2019/uautomizer/data/df8b3fddb/b6e8562057a7423fa0a8d85a179dffdc/FLAGe17eb22b0 [2018-11-18 12:06:01,151 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 12:06:01,152 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7131c4a5-a429-4d9a-80ba-c18737caf11b/sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 12:06:01,158 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7131c4a5-a429-4d9a-80ba-c18737caf11b/bin-2019/uautomizer/data/df8b3fddb/b6e8562057a7423fa0a8d85a179dffdc/FLAGe17eb22b0 [2018-11-18 12:06:01,578 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7131c4a5-a429-4d9a-80ba-c18737caf11b/bin-2019/uautomizer/data/df8b3fddb/b6e8562057a7423fa0a8d85a179dffdc [2018-11-18 12:06:01,581 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 12:06:01,582 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 12:06:01,582 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 12:06:01,582 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 12:06:01,585 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 12:06:01,585 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:06:01" (1/1) ... [2018-11-18 12:06:01,587 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7842460 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:06:01, skipping insertion in model container [2018-11-18 12:06:01,587 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:06:01" (1/1) ... [2018-11-18 12:06:01,593 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 12:06:01,604 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 12:06:01,706 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:06:01,708 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 12:06:01,723 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:06:01,732 INFO L195 MainTranslator]: Completed translation [2018-11-18 12:06:01,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:06:01 WrapperNode [2018-11-18 12:06:01,732 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 12:06:01,733 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 12:06:01,733 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 12:06:01,733 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 12:06:01,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:06:01" (1/1) ... [2018-11-18 12:06:01,745 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:06:01" (1/1) ... [2018-11-18 12:06:01,762 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 12:06:01,762 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 12:06:01,762 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 12:06:01,762 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 12:06:01,770 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:06:01" (1/1) ... [2018-11-18 12:06:01,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:06:01" (1/1) ... [2018-11-18 12:06:01,771 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:06:01" (1/1) ... [2018-11-18 12:06:01,771 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:06:01" (1/1) ... [2018-11-18 12:06:01,774 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:06:01" (1/1) ... [2018-11-18 12:06:01,820 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:06:01" (1/1) ... [2018-11-18 12:06:01,821 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:06:01" (1/1) ... [2018-11-18 12:06:01,822 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 12:06:01,823 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 12:06:01,823 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 12:06:01,823 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 12:06:01,824 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:06:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7131c4a5-a429-4d9a-80ba-c18737caf11b/bin-2019/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 [2018-11-18 12:06:01,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 12:06:01,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 12:06:02,020 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 12:06:02,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:06:02 BoogieIcfgContainer [2018-11-18 12:06:02,020 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 12:06:02,021 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 12:06:02,021 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 12:06:02,023 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 12:06:02,024 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:06:02,024 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 12:06:01" (1/3) ... [2018-11-18 12:06:02,025 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@52ca3d7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 12:06:02, skipping insertion in model container [2018-11-18 12:06:02,025 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:06:02,025 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:06:01" (2/3) ... [2018-11-18 12:06:02,026 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@52ca3d7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 12:06:02, skipping insertion in model container [2018-11-18 12:06:02,026 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:06:02,026 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:06:02" (3/3) ... [2018-11-18 12:06:02,027 INFO L375 chiAutomizerObserver]: Analyzing ICFG test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 12:06:02,080 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 12:06:02,081 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 12:06:02,081 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 12:06:02,081 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 12:06:02,081 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 12:06:02,081 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 12:06:02,081 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 12:06:02,082 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 12:06:02,082 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 12:06:02,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states. [2018-11-18 12:06:02,113 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2018-11-18 12:06:02,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:06:02,113 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:06:02,118 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 12:06:02,118 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:06:02,118 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 12:06:02,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states. [2018-11-18 12:06:02,120 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2018-11-18 12:06:02,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:06:02,121 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:06:02,121 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 12:06:02,121 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:06:02,126 INFO L794 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 18#L153-1true [2018-11-18 12:06:02,127 INFO L796 eck$LassoCheckResult]: Loop: 18#L153-1true assume true; 24#L39-1true assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 28#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; 39#L66true assume 0 != main_~p1~0;main_~lk1~0 := 1; 35#L66-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 23#L70-1true assume 0 != main_~p3~0;main_~lk3~0 := 1; 29#L74-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 16#L78-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 6#L82-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 33#L86-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 41#L90-1true assume !(0 != main_~p8~0); 27#L94-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 12#L98-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 3#L102-1true assume !(0 != main_~p1~0); 36#L108-1true assume !(0 != main_~p2~0); 4#L113-1true assume !(0 != main_~p3~0); 10#L118-1true assume !(0 != main_~p4~0); 21#L123-1true assume !(0 != main_~p5~0); 32#L128-1true assume !(0 != main_~p6~0); 20#L133-1true assume !(0 != main_~p7~0); 30#L138-1true assume !(0 != main_~p8~0); 40#L143-1true assume !(0 != main_~p9~0); 8#L148-1true assume !(0 != main_~p10~0); 18#L153-1true [2018-11-18 12:06:02,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:06:02,131 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 12:06:02,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:06:02,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:06:02,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:02,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:06:02,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:02,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:06:02,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:06:02,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:06:02,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1961619935, now seen corresponding path program 1 times [2018-11-18 12:06:02,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:06:02,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:06:02,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:02,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:06:02,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:02,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:06:02,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:06:02,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:06:02,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:06:02,253 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 12:06:02,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:06:02,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:06:02,268 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2018-11-18 12:06:02,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:06:02,304 INFO L93 Difference]: Finished difference Result 77 states and 132 transitions. [2018-11-18 12:06:02,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:06:02,305 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 132 transitions. [2018-11-18 12:06:02,308 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 65 [2018-11-18 12:06:02,312 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 67 states and 105 transitions. [2018-11-18 12:06:02,313 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2018-11-18 12:06:02,314 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2018-11-18 12:06:02,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 105 transitions. [2018-11-18 12:06:02,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 12:06:02,315 INFO L705 BuchiCegarLoop]: Abstraction has 67 states and 105 transitions. [2018-11-18 12:06:02,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 105 transitions. [2018-11-18 12:06:02,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-11-18 12:06:02,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-18 12:06:02,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 105 transitions. [2018-11-18 12:06:02,337 INFO L728 BuchiCegarLoop]: Abstraction has 67 states and 105 transitions. [2018-11-18 12:06:02,337 INFO L608 BuchiCegarLoop]: Abstraction has 67 states and 105 transitions. [2018-11-18 12:06:02,337 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 12:06:02,337 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 105 transitions. [2018-11-18 12:06:02,338 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 65 [2018-11-18 12:06:02,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:06:02,339 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:06:02,339 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 12:06:02,339 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:06:02,339 INFO L794 eck$LassoCheckResult]: Stem: 166#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 140#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 141#L153-1 [2018-11-18 12:06:02,340 INFO L796 eck$LassoCheckResult]: Loop: 141#L153-1 assume true; 148#L39-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 160#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; 161#L66 assume !(0 != main_~p1~0); 167#L66-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 152#L70-1 assume 0 != main_~p3~0;main_~lk3~0 := 1; 153#L74-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 177#L78-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 176#L82-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 164#L86-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 165#L90-1 assume !(0 != main_~p8~0); 175#L94-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 174#L98-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 173#L102-1 assume !(0 != main_~p1~0); 168#L108-1 assume !(0 != main_~p2~0); 128#L113-1 assume !(0 != main_~p3~0); 130#L118-1 assume !(0 != main_~p4~0); 136#L123-1 assume !(0 != main_~p5~0); 145#L128-1 assume !(0 != main_~p6~0); 149#L133-1 assume !(0 != main_~p7~0); 151#L138-1 assume !(0 != main_~p8~0); 132#L143-1 assume !(0 != main_~p9~0); 180#L148-1 assume !(0 != main_~p10~0); 141#L153-1 [2018-11-18 12:06:02,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:06:02,340 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-18 12:06:02,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:06:02,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:06:02,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:02,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:06:02,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:06:02,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:06:02,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:06:02,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1515698911, now seen corresponding path program 1 times [2018-11-18 12:06:02,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:06:02,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:06:02,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:02,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:06:02,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:02,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:06:02,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:06:02,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:06:02,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:06:02,376 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 12:06:02,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:06:02,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:06:02,377 INFO L87 Difference]: Start difference. First operand 67 states and 105 transitions. cyclomatic complexity: 40 Second operand 3 states. [2018-11-18 12:06:02,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:06:02,397 INFO L93 Difference]: Finished difference Result 130 states and 202 transitions. [2018-11-18 12:06:02,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:06:02,398 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 202 transitions. [2018-11-18 12:06:02,401 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 128 [2018-11-18 12:06:02,402 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 130 states and 202 transitions. [2018-11-18 12:06:02,402 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 130 [2018-11-18 12:06:02,402 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 130 [2018-11-18 12:06:02,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 130 states and 202 transitions. [2018-11-18 12:06:02,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 12:06:02,403 INFO L705 BuchiCegarLoop]: Abstraction has 130 states and 202 transitions. [2018-11-18 12:06:02,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states and 202 transitions. [2018-11-18 12:06:02,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-11-18 12:06:02,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-18 12:06:02,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 202 transitions. [2018-11-18 12:06:02,410 INFO L728 BuchiCegarLoop]: Abstraction has 130 states and 202 transitions. [2018-11-18 12:06:02,410 INFO L608 BuchiCegarLoop]: Abstraction has 130 states and 202 transitions. [2018-11-18 12:06:02,410 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 12:06:02,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 130 states and 202 transitions. [2018-11-18 12:06:02,411 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 128 [2018-11-18 12:06:02,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:06:02,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:06:02,412 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 12:06:02,412 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:06:02,412 INFO L794 eck$LassoCheckResult]: Stem: 367#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 343#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 344#L153-1 [2018-11-18 12:06:02,413 INFO L796 eck$LassoCheckResult]: Loop: 344#L153-1 assume true; 392#L39-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 390#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; 386#L66 assume !(0 != main_~p1~0); 387#L66-2 assume !(0 != main_~p2~0); 355#L70-1 assume 0 != main_~p3~0;main_~lk3~0 := 1; 356#L74-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 349#L78-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 336#L82-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 337#L86-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 377#L90-1 assume !(0 != main_~p8~0); 378#L94-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 373#L98-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 374#L102-1 assume !(0 != main_~p1~0); 426#L108-1 assume !(0 != main_~p2~0); 423#L113-1 assume !(0 != main_~p3~0); 419#L118-1 assume !(0 != main_~p4~0); 415#L123-1 assume !(0 != main_~p5~0); 411#L128-1 assume !(0 != main_~p6~0); 407#L133-1 assume !(0 != main_~p7~0); 403#L138-1 assume !(0 != main_~p8~0); 401#L143-1 assume !(0 != main_~p9~0); 396#L148-1 assume !(0 != main_~p10~0); 344#L153-1 [2018-11-18 12:06:02,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:06:02,413 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-18 12:06:02,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:06:02,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:06:02,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:02,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:06:02,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:02,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:06:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:06:02,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:06:02,418 INFO L82 PathProgramCache]: Analyzing trace with hash -173244831, now seen corresponding path program 1 times [2018-11-18 12:06:02,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:06:02,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:06:02,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:02,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:06:02,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:02,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:06:02,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:06:02,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:06:02,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:06:02,448 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 12:06:02,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:06:02,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:06:02,448 INFO L87 Difference]: Start difference. First operand 130 states and 202 transitions. cyclomatic complexity: 76 Second operand 3 states. [2018-11-18 12:06:02,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:06:02,470 INFO L93 Difference]: Finished difference Result 254 states and 390 transitions. [2018-11-18 12:06:02,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:06:02,471 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 254 states and 390 transitions. [2018-11-18 12:06:02,474 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 252 [2018-11-18 12:06:02,476 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 254 states to 254 states and 390 transitions. [2018-11-18 12:06:02,476 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 254 [2018-11-18 12:06:02,476 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 254 [2018-11-18 12:06:02,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 254 states and 390 transitions. [2018-11-18 12:06:02,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 12:06:02,478 INFO L705 BuchiCegarLoop]: Abstraction has 254 states and 390 transitions. [2018-11-18 12:06:02,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states and 390 transitions. [2018-11-18 12:06:02,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2018-11-18 12:06:02,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-11-18 12:06:02,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 390 transitions. [2018-11-18 12:06:02,490 INFO L728 BuchiCegarLoop]: Abstraction has 254 states and 390 transitions. [2018-11-18 12:06:02,491 INFO L608 BuchiCegarLoop]: Abstraction has 254 states and 390 transitions. [2018-11-18 12:06:02,491 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 12:06:02,491 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 254 states and 390 transitions. [2018-11-18 12:06:02,493 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 252 [2018-11-18 12:06:02,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:06:02,493 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:06:02,493 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 12:06:02,493 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:06:02,493 INFO L794 eck$LassoCheckResult]: Stem: 761#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 732#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 733#L153-1 [2018-11-18 12:06:02,494 INFO L796 eck$LassoCheckResult]: Loop: 733#L153-1 assume true; 891#L39-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 889#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; 887#L66 assume !(0 != main_~p1~0); 886#L66-2 assume !(0 != main_~p2~0); 885#L70-1 assume !(0 != main_~p3~0); 884#L74-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 852#L78-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 853#L82-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 846#L86-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 847#L90-1 assume !(0 != main_~p8~0); 838#L94-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 839#L98-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 831#L102-1 assume !(0 != main_~p1~0); 832#L108-1 assume !(0 != main_~p2~0); 883#L113-1 assume !(0 != main_~p3~0); 919#L118-1 assume !(0 != main_~p4~0); 915#L123-1 assume !(0 != main_~p5~0); 911#L128-1 assume !(0 != main_~p6~0); 907#L133-1 assume !(0 != main_~p7~0); 903#L138-1 assume !(0 != main_~p8~0); 899#L143-1 assume !(0 != main_~p9~0); 895#L148-1 assume !(0 != main_~p10~0); 733#L153-1 [2018-11-18 12:06:02,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:06:02,494 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-18 12:06:02,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:06:02,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:06:02,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:02,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:06:02,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:02,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:06:02,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:06:02,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:06:02,498 INFO L82 PathProgramCache]: Analyzing trace with hash 2127577759, now seen corresponding path program 1 times [2018-11-18 12:06:02,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:06:02,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:06:02,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:02,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:06:02,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:06:02,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:06:02,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:06:02,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:06:02,521 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 12:06:02,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:06:02,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:06:02,522 INFO L87 Difference]: Start difference. First operand 254 states and 390 transitions. cyclomatic complexity: 144 Second operand 3 states. [2018-11-18 12:06:02,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:06:02,534 INFO L93 Difference]: Finished difference Result 498 states and 754 transitions. [2018-11-18 12:06:02,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:06:02,535 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 498 states and 754 transitions. [2018-11-18 12:06:02,537 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 496 [2018-11-18 12:06:02,540 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 498 states to 498 states and 754 transitions. [2018-11-18 12:06:02,540 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 498 [2018-11-18 12:06:02,541 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 498 [2018-11-18 12:06:02,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 498 states and 754 transitions. [2018-11-18 12:06:02,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 12:06:02,543 INFO L705 BuchiCegarLoop]: Abstraction has 498 states and 754 transitions. [2018-11-18 12:06:02,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states and 754 transitions. [2018-11-18 12:06:02,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 498. [2018-11-18 12:06:02,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2018-11-18 12:06:02,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 754 transitions. [2018-11-18 12:06:02,560 INFO L728 BuchiCegarLoop]: Abstraction has 498 states and 754 transitions. [2018-11-18 12:06:02,560 INFO L608 BuchiCegarLoop]: Abstraction has 498 states and 754 transitions. [2018-11-18 12:06:02,561 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 12:06:02,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 498 states and 754 transitions. [2018-11-18 12:06:02,563 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 496 [2018-11-18 12:06:02,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:06:02,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:06:02,563 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 12:06:02,563 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:06:02,564 INFO L794 eck$LassoCheckResult]: Stem: 1520#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1490#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 1491#L153-1 [2018-11-18 12:06:02,564 INFO L796 eck$LassoCheckResult]: Loop: 1491#L153-1 assume true; 1567#L39-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 1563#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; 1558#L66 assume !(0 != main_~p1~0); 1552#L66-2 assume !(0 != main_~p2~0); 1544#L70-1 assume !(0 != main_~p3~0); 1546#L74-1 assume !(0 != main_~p4~0); 1648#L78-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 1645#L82-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1641#L86-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1637#L90-1 assume !(0 != main_~p8~0); 1633#L94-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1630#L98-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1626#L102-1 assume !(0 != main_~p1~0); 1621#L108-1 assume !(0 != main_~p2~0); 1617#L113-1 assume !(0 != main_~p3~0); 1615#L118-1 assume !(0 != main_~p4~0); 1614#L123-1 assume !(0 != main_~p5~0); 1612#L128-1 assume !(0 != main_~p6~0); 1610#L133-1 assume !(0 != main_~p7~0); 1608#L138-1 assume !(0 != main_~p8~0); 1606#L143-1 assume !(0 != main_~p9~0); 1578#L148-1 assume !(0 != main_~p10~0); 1491#L153-1 [2018-11-18 12:06:02,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:06:02,564 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-18 12:06:02,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:06:02,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:06:02,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:02,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:06:02,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:02,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:06:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:06:02,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:06:02,568 INFO L82 PathProgramCache]: Analyzing trace with hash 539229857, now seen corresponding path program 1 times [2018-11-18 12:06:02,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:06:02,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:06:02,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:02,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:06:02,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:06:02,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:06:02,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:06:02,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:06:02,589 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 12:06:02,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:06:02,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:06:02,590 INFO L87 Difference]: Start difference. First operand 498 states and 754 transitions. cyclomatic complexity: 272 Second operand 3 states. [2018-11-18 12:06:02,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:06:02,609 INFO L93 Difference]: Finished difference Result 978 states and 1458 transitions. [2018-11-18 12:06:02,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:06:02,609 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 978 states and 1458 transitions. [2018-11-18 12:06:02,615 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 976 [2018-11-18 12:06:02,620 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 978 states to 978 states and 1458 transitions. [2018-11-18 12:06:02,620 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 978 [2018-11-18 12:06:02,621 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 978 [2018-11-18 12:06:02,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 978 states and 1458 transitions. [2018-11-18 12:06:02,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 12:06:02,623 INFO L705 BuchiCegarLoop]: Abstraction has 978 states and 1458 transitions. [2018-11-18 12:06:02,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states and 1458 transitions. [2018-11-18 12:06:02,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 978. [2018-11-18 12:06:02,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 978 states. [2018-11-18 12:06:02,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1458 transitions. [2018-11-18 12:06:02,645 INFO L728 BuchiCegarLoop]: Abstraction has 978 states and 1458 transitions. [2018-11-18 12:06:02,645 INFO L608 BuchiCegarLoop]: Abstraction has 978 states and 1458 transitions. [2018-11-18 12:06:02,645 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 12:06:02,645 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 978 states and 1458 transitions. [2018-11-18 12:06:02,649 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 976 [2018-11-18 12:06:02,650 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:06:02,650 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:06:02,650 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 12:06:02,650 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:06:02,650 INFO L794 eck$LassoCheckResult]: Stem: 3000#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2972#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 2973#L153-1 [2018-11-18 12:06:02,651 INFO L796 eck$LassoCheckResult]: Loop: 2973#L153-1 assume true; 3184#L39-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 3182#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; 3178#L66 assume !(0 != main_~p1~0); 3174#L66-2 assume !(0 != main_~p2~0); 3171#L70-1 assume !(0 != main_~p3~0); 3172#L74-1 assume !(0 != main_~p4~0); 3231#L78-1 assume !(0 != main_~p5~0); 3229#L82-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 3227#L86-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 3225#L90-1 assume !(0 != main_~p8~0); 3223#L94-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 3221#L98-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 3217#L102-1 assume !(0 != main_~p1~0); 3214#L108-1 assume !(0 != main_~p2~0); 3213#L113-1 assume !(0 != main_~p3~0); 3211#L118-1 assume !(0 != main_~p4~0); 3207#L123-1 assume !(0 != main_~p5~0); 3204#L128-1 assume !(0 != main_~p6~0); 3200#L133-1 assume !(0 != main_~p7~0); 3196#L138-1 assume !(0 != main_~p8~0); 3192#L143-1 assume !(0 != main_~p9~0); 3188#L148-1 assume !(0 != main_~p10~0); 2973#L153-1 [2018-11-18 12:06:02,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:06:02,651 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-18 12:06:02,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:06:02,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:06:02,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:02,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:06:02,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:06:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:06:02,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:06:02,655 INFO L82 PathProgramCache]: Analyzing trace with hash -481838497, now seen corresponding path program 1 times [2018-11-18 12:06:02,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:06:02,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:06:02,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:02,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:06:02,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:06:02,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:06:02,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:06:02,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:06:02,681 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 12:06:02,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:06:02,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:06:02,681 INFO L87 Difference]: Start difference. First operand 978 states and 1458 transitions. cyclomatic complexity: 512 Second operand 3 states. [2018-11-18 12:06:02,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:06:02,710 INFO L93 Difference]: Finished difference Result 1922 states and 2818 transitions. [2018-11-18 12:06:02,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:06:02,711 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1922 states and 2818 transitions. [2018-11-18 12:06:02,726 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1920 [2018-11-18 12:06:02,734 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1922 states to 1922 states and 2818 transitions. [2018-11-18 12:06:02,734 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1922 [2018-11-18 12:06:02,736 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1922 [2018-11-18 12:06:02,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1922 states and 2818 transitions. [2018-11-18 12:06:02,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 12:06:02,739 INFO L705 BuchiCegarLoop]: Abstraction has 1922 states and 2818 transitions. [2018-11-18 12:06:02,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states and 2818 transitions. [2018-11-18 12:06:02,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 1922. [2018-11-18 12:06:02,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1922 states. [2018-11-18 12:06:02,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 2818 transitions. [2018-11-18 12:06:02,772 INFO L728 BuchiCegarLoop]: Abstraction has 1922 states and 2818 transitions. [2018-11-18 12:06:02,772 INFO L608 BuchiCegarLoop]: Abstraction has 1922 states and 2818 transitions. [2018-11-18 12:06:02,772 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 12:06:02,772 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1922 states and 2818 transitions. [2018-11-18 12:06:02,780 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1920 [2018-11-18 12:06:02,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:06:02,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:06:02,781 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 12:06:02,781 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:06:02,781 INFO L794 eck$LassoCheckResult]: Stem: 5909#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 5878#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 5879#L153-1 [2018-11-18 12:06:02,781 INFO L796 eck$LassoCheckResult]: Loop: 5879#L153-1 assume true; 6086#L39-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 6084#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; 6082#L66 assume !(0 != main_~p1~0); 6033#L66-2 assume !(0 != main_~p2~0); 6034#L70-1 assume !(0 != main_~p3~0); 6015#L74-1 assume !(0 != main_~p4~0); 6017#L78-1 assume !(0 != main_~p5~0); 5994#L82-1 assume !(0 != main_~p6~0); 5996#L86-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 6143#L90-1 assume !(0 != main_~p8~0); 6141#L94-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 5963#L98-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 5964#L102-1 assume !(0 != main_~p1~0); 6117#L108-1 assume !(0 != main_~p2~0); 6115#L113-1 assume !(0 != main_~p3~0); 6113#L118-1 assume !(0 != main_~p4~0); 6110#L123-1 assume !(0 != main_~p5~0); 6106#L128-1 assume !(0 != main_~p6~0); 6103#L133-1 assume !(0 != main_~p7~0); 6099#L138-1 assume !(0 != main_~p8~0); 6095#L143-1 assume !(0 != main_~p9~0); 6091#L148-1 assume !(0 != main_~p10~0); 5879#L153-1 [2018-11-18 12:06:02,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:06:02,781 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-18 12:06:02,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:06:02,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:06:02,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:02,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:06:02,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:02,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:06:02,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:06:02,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:06:02,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1761702175, now seen corresponding path program 1 times [2018-11-18 12:06:02,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:06:02,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:06:02,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:02,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:06:02,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:02,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:06:02,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:06:02,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:06:02,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:06:02,821 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 12:06:02,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:06:02,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:06:02,822 INFO L87 Difference]: Start difference. First operand 1922 states and 2818 transitions. cyclomatic complexity: 960 Second operand 3 states. [2018-11-18 12:06:02,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:06:02,858 INFO L93 Difference]: Finished difference Result 3778 states and 5442 transitions. [2018-11-18 12:06:02,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:06:02,859 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3778 states and 5442 transitions. [2018-11-18 12:06:02,878 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3776 [2018-11-18 12:06:02,894 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3778 states to 3778 states and 5442 transitions. [2018-11-18 12:06:02,894 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3778 [2018-11-18 12:06:02,897 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3778 [2018-11-18 12:06:02,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3778 states and 5442 transitions. [2018-11-18 12:06:02,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 12:06:02,903 INFO L705 BuchiCegarLoop]: Abstraction has 3778 states and 5442 transitions. [2018-11-18 12:06:02,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3778 states and 5442 transitions. [2018-11-18 12:06:02,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3778 to 3778. [2018-11-18 12:06:02,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3778 states. [2018-11-18 12:06:02,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3778 states to 3778 states and 5442 transitions. [2018-11-18 12:06:02,970 INFO L728 BuchiCegarLoop]: Abstraction has 3778 states and 5442 transitions. [2018-11-18 12:06:02,970 INFO L608 BuchiCegarLoop]: Abstraction has 3778 states and 5442 transitions. [2018-11-18 12:06:02,971 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 12:06:02,971 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3778 states and 5442 transitions. [2018-11-18 12:06:02,986 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3776 [2018-11-18 12:06:02,986 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:06:02,986 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:06:02,987 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 12:06:02,987 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:06:02,987 INFO L794 eck$LassoCheckResult]: Stem: 11615#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 11584#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 11585#L153-1 [2018-11-18 12:06:02,987 INFO L796 eck$LassoCheckResult]: Loop: 11585#L153-1 assume true; 11887#L39-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 11886#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; 11884#L66 assume !(0 != main_~p1~0); 11881#L66-2 assume !(0 != main_~p2~0); 11877#L70-1 assume !(0 != main_~p3~0); 11873#L74-1 assume !(0 != main_~p4~0); 11870#L78-1 assume !(0 != main_~p5~0); 11864#L82-1 assume !(0 != main_~p6~0); 11866#L86-1 assume !(0 != main_~p7~0); 11857#L90-1 assume !(0 != main_~p8~0); 11858#L94-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 11849#L98-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 11850#L102-1 assume !(0 != main_~p1~0); 11830#L108-1 assume !(0 != main_~p2~0); 11831#L113-1 assume !(0 != main_~p3~0); 11806#L118-1 assume !(0 != main_~p4~0); 11808#L123-1 assume !(0 != main_~p5~0); 11899#L128-1 assume !(0 != main_~p6~0); 11896#L133-1 assume !(0 != main_~p7~0); 11894#L138-1 assume !(0 != main_~p8~0); 11892#L143-1 assume !(0 != main_~p9~0); 11890#L148-1 assume !(0 != main_~p10~0); 11585#L153-1 [2018-11-18 12:06:02,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:06:02,987 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2018-11-18 12:06:02,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:06:02,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:06:02,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:02,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:06:02,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:06:02,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:06:02,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:06:02,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1522147871, now seen corresponding path program 1 times [2018-11-18 12:06:02,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:06:02,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:06:02,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:02,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:06:02,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:02,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:06:03,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:06:03,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:06:03,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:06:03,012 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 12:06:03,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:06:03,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:06:03,013 INFO L87 Difference]: Start difference. First operand 3778 states and 5442 transitions. cyclomatic complexity: 1792 Second operand 3 states. [2018-11-18 12:06:03,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:06:03,072 INFO L93 Difference]: Finished difference Result 7426 states and 10498 transitions. [2018-11-18 12:06:03,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:06:03,073 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7426 states and 10498 transitions. [2018-11-18 12:06:03,108 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7424 [2018-11-18 12:06:03,140 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7426 states to 7426 states and 10498 transitions. [2018-11-18 12:06:03,140 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7426 [2018-11-18 12:06:03,146 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7426 [2018-11-18 12:06:03,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7426 states and 10498 transitions. [2018-11-18 12:06:03,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 12:06:03,154 INFO L705 BuchiCegarLoop]: Abstraction has 7426 states and 10498 transitions. [2018-11-18 12:06:03,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7426 states and 10498 transitions. [2018-11-18 12:06:03,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7426 to 7426. [2018-11-18 12:06:03,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7426 states. [2018-11-18 12:06:03,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7426 states to 7426 states and 10498 transitions. [2018-11-18 12:06:03,277 INFO L728 BuchiCegarLoop]: Abstraction has 7426 states and 10498 transitions. [2018-11-18 12:06:03,277 INFO L608 BuchiCegarLoop]: Abstraction has 7426 states and 10498 transitions. [2018-11-18 12:06:03,277 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 12:06:03,277 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7426 states and 10498 transitions. [2018-11-18 12:06:03,297 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7424 [2018-11-18 12:06:03,297 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:06:03,297 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:06:03,298 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 12:06:03,298 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:06:03,298 INFO L794 eck$LassoCheckResult]: Stem: 22828#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 22794#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 22795#L153-1 [2018-11-18 12:06:03,298 INFO L796 eck$LassoCheckResult]: Loop: 22795#L153-1 assume true; 22993#L39-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 22991#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; 22986#L66 assume !(0 != main_~p1~0); 22980#L66-2 assume !(0 != main_~p2~0); 22974#L70-1 assume !(0 != main_~p3~0); 22968#L74-1 assume !(0 != main_~p4~0); 22960#L78-1 assume !(0 != main_~p5~0); 22958#L82-1 assume !(0 != main_~p6~0); 22959#L86-1 assume !(0 != main_~p7~0); 23039#L90-1 assume !(0 != main_~p8~0); 23036#L94-1 assume !(0 != main_~p9~0); 23034#L98-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 23031#L102-1 assume !(0 != main_~p1~0); 23028#L108-1 assume !(0 != main_~p2~0); 23023#L113-1 assume !(0 != main_~p3~0); 23017#L118-1 assume !(0 != main_~p4~0); 23013#L123-1 assume !(0 != main_~p5~0); 23007#L128-1 assume !(0 != main_~p6~0); 23004#L133-1 assume !(0 != main_~p7~0); 23002#L138-1 assume !(0 != main_~p8~0); 23000#L143-1 assume !(0 != main_~p9~0); 22997#L148-1 assume !(0 != main_~p10~0); 22795#L153-1 [2018-11-18 12:06:03,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:06:03,298 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2018-11-18 12:06:03,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:06:03,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:06:03,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:03,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:06:03,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:06:03,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:06:03,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:06:03,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1780313309, now seen corresponding path program 1 times [2018-11-18 12:06:03,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:06:03,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:06:03,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:03,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:06:03,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:03,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:06:03,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:06:03,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:06:03,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 12:06:03,316 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 12:06:03,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:06:03,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:06:03,317 INFO L87 Difference]: Start difference. First operand 7426 states and 10498 transitions. cyclomatic complexity: 3328 Second operand 3 states. [2018-11-18 12:06:03,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:06:03,357 INFO L93 Difference]: Finished difference Result 14594 states and 20226 transitions. [2018-11-18 12:06:03,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:06:03,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14594 states and 20226 transitions. [2018-11-18 12:06:03,417 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 14592 [2018-11-18 12:06:03,473 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14594 states to 14594 states and 20226 transitions. [2018-11-18 12:06:03,473 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14594 [2018-11-18 12:06:03,480 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14594 [2018-11-18 12:06:03,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14594 states and 20226 transitions. [2018-11-18 12:06:03,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 12:06:03,553 INFO L705 BuchiCegarLoop]: Abstraction has 14594 states and 20226 transitions. [2018-11-18 12:06:03,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14594 states and 20226 transitions. [2018-11-18 12:06:03,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14594 to 14594. [2018-11-18 12:06:03,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14594 states. [2018-11-18 12:06:03,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14594 states to 14594 states and 20226 transitions. [2018-11-18 12:06:03,707 INFO L728 BuchiCegarLoop]: Abstraction has 14594 states and 20226 transitions. [2018-11-18 12:06:03,707 INFO L608 BuchiCegarLoop]: Abstraction has 14594 states and 20226 transitions. [2018-11-18 12:06:03,707 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-18 12:06:03,707 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14594 states and 20226 transitions. [2018-11-18 12:06:03,743 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 14592 [2018-11-18 12:06:03,743 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:06:03,744 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:06:03,744 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 12:06:03,744 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:06:03,744 INFO L794 eck$LassoCheckResult]: Stem: 44853#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 44819#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 44820#L153-1 [2018-11-18 12:06:03,744 INFO L796 eck$LassoCheckResult]: Loop: 44820#L153-1 assume true; 45307#L39-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 45305#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; 45303#L66 assume !(0 != main_~p1~0); 45299#L66-2 assume !(0 != main_~p2~0); 45292#L70-1 assume !(0 != main_~p3~0); 45284#L74-1 assume !(0 != main_~p4~0); 45277#L78-1 assume !(0 != main_~p5~0); 45273#L82-1 assume !(0 != main_~p6~0); 45265#L86-1 assume !(0 != main_~p7~0); 45261#L90-1 assume !(0 != main_~p8~0); 45253#L94-1 assume !(0 != main_~p9~0); 45068#L98-1 assume !(0 != main_~p10~0); 45070#L102-1 assume !(0 != main_~p1~0); 45242#L108-1 assume !(0 != main_~p2~0); 45229#L113-1 assume !(0 != main_~p3~0); 45231#L118-1 assume !(0 != main_~p4~0); 45212#L123-1 assume !(0 != main_~p5~0); 45213#L128-1 assume !(0 != main_~p6~0); 45322#L133-1 assume !(0 != main_~p7~0); 45319#L138-1 assume !(0 != main_~p8~0); 45314#L143-1 assume !(0 != main_~p9~0); 45310#L148-1 assume !(0 != main_~p10~0); 44820#L153-1 [2018-11-18 12:06:03,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:06:03,745 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2018-11-18 12:06:03,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:06:03,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:06:03,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:03,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:06:03,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:03,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:06:03,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:06:03,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:06:03,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1813589409, now seen corresponding path program 1 times [2018-11-18 12:06:03,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:06:03,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:06:03,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:03,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:06:03,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:03,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:06:03,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:06:03,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:06:03,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1849576355, now seen corresponding path program 1 times [2018-11-18 12:06:03,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:06:03,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:06:03,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:03,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:06:03,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:03,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:06:03,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:06:03,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 12:06:03 BoogieIcfgContainer [2018-11-18 12:06:03,903 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 12:06:03,904 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 12:06:03,904 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 12:06:03,904 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 12:06:03,905 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:06:02" (3/4) ... [2018-11-18 12:06:03,907 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-18 12:06:03,942 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7131c4a5-a429-4d9a-80ba-c18737caf11b/bin-2019/uautomizer/witness.graphml [2018-11-18 12:06:03,942 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 12:06:03,943 INFO L168 Benchmark]: Toolchain (without parser) took 2361.62 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 303.6 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -173.3 MB). Peak memory consumption was 130.2 MB. Max. memory is 11.5 GB. [2018-11-18 12:06:03,944 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:06:03,945 INFO L168 Benchmark]: CACSL2BoogieTranslator took 150.06 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2018-11-18 12:06:03,945 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.15 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:06:03,945 INFO L168 Benchmark]: Boogie Preprocessor took 60.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -176.1 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2018-11-18 12:06:03,946 INFO L168 Benchmark]: RCFGBuilder took 197.79 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: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2018-11-18 12:06:03,946 INFO L168 Benchmark]: BuchiAutomizer took 1882.66 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 173.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -28.7 MB). Peak memory consumption was 144.3 MB. Max. memory is 11.5 GB. [2018-11-18 12:06:03,946 INFO L168 Benchmark]: Witness Printer took 38.34 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:06:03,948 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 150.06 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.15 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 60.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -176.1 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 197.79 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: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1882.66 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 173.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -28.7 MB). Peak memory consumption was 144.3 MB. Max. memory is 11.5 GB. * Witness Printer took 38.34 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 14594 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.8s and 10 iterations. TraceHistogramMax:1. Analysis of lassos took 0.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 9. Minimization of nondet autom 0. Automata minimization 0.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 14594 states and ocurred in iteration 9. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 745 SDtfs, 383 SDslu, 454 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@76bcf22d=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@10ec2794=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6534e112=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@523d0a04=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@319af583=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@742abe66=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@46e67972=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4cebbc9e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3a8b29e1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7f410953=0, lk10=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2ad40a6a=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...