./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_79d46a8f-93c9-46fa-a5a7-6aeb57c8fbdc/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_79d46a8f-93c9-46fa-a5a7-6aeb57c8fbdc/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_79d46a8f-93c9-46fa-a5a7-6aeb57c8fbdc/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_79d46a8f-93c9-46fa-a5a7-6aeb57c8fbdc/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_79d46a8f-93c9-46fa-a5a7-6aeb57c8fbdc/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_79d46a8f-93c9-46fa-a5a7-6aeb57c8fbdc/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 87288fc43230a9d3829930d8a140fe9b3ddaa0e7 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-1dbac8b [2018-11-10 07:48:14,264 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:48:14,265 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:48:14,272 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:48:14,273 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:48:14,273 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:48:14,274 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:48:14,276 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:48:14,277 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:48:14,277 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:48:14,278 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:48:14,278 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:48:14,280 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:48:14,281 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:48:14,282 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:48:14,282 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:48:14,283 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:48:14,284 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:48:14,285 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:48:14,287 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:48:14,288 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:48:14,289 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:48:14,291 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:48:14,291 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:48:14,292 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:48:14,292 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:48:14,294 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:48:14,294 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:48:14,295 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:48:14,296 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:48:14,296 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:48:14,296 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:48:14,297 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:48:14,297 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:48:14,298 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:48:14,298 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:48:14,298 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_79d46a8f-93c9-46fa-a5a7-6aeb57c8fbdc/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 07:48:14,310 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:48:14,310 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:48:14,311 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 07:48:14,311 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 07:48:14,311 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 07:48:14,312 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 07:48:14,312 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 07:48:14,312 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 07:48:14,312 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 07:48:14,312 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 07:48:14,312 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 07:48:14,312 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:48:14,313 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 07:48:14,313 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 07:48:14,313 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:48:14,313 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 07:48:14,313 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:48:14,313 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 07:48:14,313 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 07:48:14,314 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 07:48:14,314 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 07:48:14,314 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:48:14,314 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 07:48:14,314 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 07:48:14,314 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:48:14,315 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:48:14,315 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 07:48:14,315 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:48:14,315 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 07:48:14,315 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 07:48:14,316 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 07:48:14,316 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_79d46a8f-93c9-46fa-a5a7-6aeb57c8fbdc/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 -> 87288fc43230a9d3829930d8a140fe9b3ddaa0e7 [2018-11-10 07:48:14,339 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:48:14,349 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:48:14,352 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:48:14,353 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:48:14,353 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:48:14,353 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_79d46a8f-93c9-46fa-a5a7-6aeb57c8fbdc/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 07:48:14,390 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_79d46a8f-93c9-46fa-a5a7-6aeb57c8fbdc/bin-2019/uautomizer/data/ca660d0e8/13b985a2d1aa489f91bfcf79643ab525/FLAGd01f73fda [2018-11-10 07:48:14,794 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:48:14,794 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_79d46a8f-93c9-46fa-a5a7-6aeb57c8fbdc/sv-benchmarks/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 07:48:14,799 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_79d46a8f-93c9-46fa-a5a7-6aeb57c8fbdc/bin-2019/uautomizer/data/ca660d0e8/13b985a2d1aa489f91bfcf79643ab525/FLAGd01f73fda [2018-11-10 07:48:14,808 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_79d46a8f-93c9-46fa-a5a7-6aeb57c8fbdc/bin-2019/uautomizer/data/ca660d0e8/13b985a2d1aa489f91bfcf79643ab525 [2018-11-10 07:48:14,810 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:48:14,811 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 07:48:14,811 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:48:14,811 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:48:14,813 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:48:14,814 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:48:14" (1/1) ... [2018-11-10 07:48:14,815 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eeb45d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:14, skipping insertion in model container [2018-11-10 07:48:14,816 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:48:14" (1/1) ... [2018-11-10 07:48:14,821 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:48:14,836 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:48:14,956 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:48:14,958 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:48:14,975 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:48:14,983 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:48:14,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:14 WrapperNode [2018-11-10 07:48:14,983 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:48:14,984 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 07:48:14,984 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 07:48:14,984 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 07:48:14,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:14" (1/1) ... [2018-11-10 07:48:14,993 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:14" (1/1) ... [2018-11-10 07:48:15,006 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 07:48:15,006 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:48:15,006 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:48:15,006 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:48:15,012 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:14" (1/1) ... [2018-11-10 07:48:15,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:14" (1/1) ... [2018-11-10 07:48:15,013 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:14" (1/1) ... [2018-11-10 07:48:15,013 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:14" (1/1) ... [2018-11-10 07:48:15,015 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:14" (1/1) ... [2018-11-10 07:48:15,018 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:14" (1/1) ... [2018-11-10 07:48:15,019 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:14" (1/1) ... [2018-11-10 07:48:15,020 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:48:15,020 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:48:15,020 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:48:15,021 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:48:15,021 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_79d46a8f-93c9-46fa-a5a7-6aeb57c8fbdc/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-10 07:48:15,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:48:15,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:48:15,272 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:48:15,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:48:15 BoogieIcfgContainer [2018-11-10 07:48:15,273 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:48:15,273 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 07:48:15,274 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 07:48:15,276 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 07:48:15,277 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:48:15,277 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 07:48:14" (1/3) ... [2018-11-10 07:48:15,278 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59e135ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:48:15, skipping insertion in model container [2018-11-10 07:48:15,278 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:48:15,278 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:14" (2/3) ... [2018-11-10 07:48:15,279 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59e135ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:48:15, skipping insertion in model container [2018-11-10 07:48:15,279 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:48:15,279 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:48:15" (3/3) ... [2018-11-10 07:48:15,280 INFO L375 chiAutomizerObserver]: Analyzing ICFG test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 07:48:15,314 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 07:48:15,314 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 07:48:15,314 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 07:48:15,314 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 07:48:15,314 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:48:15,314 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:48:15,315 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 07:48:15,315 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:48:15,315 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 07:48:15,324 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states. [2018-11-10 07:48:15,338 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2018-11-10 07:48:15,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:48:15,339 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:48:15,343 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:48:15,344 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, 1, 1, 1, 1, 1, 1] [2018-11-10 07:48:15,344 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 07:48:15,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states. [2018-11-10 07:48:15,345 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2018-11-10 07:48:15,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:48:15,346 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:48:15,346 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:48:15,346 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, 1, 1, 1, 1, 1, 1] [2018-11-10 07:48:15,351 INFO L793 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 10#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_#t~nondet11, main_#t~nondet12, main_#t~nondet13, 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_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~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;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;havoc main_~cond~0; 39#L195-1true [2018-11-10 07:48:15,351 INFO L795 eck$LassoCheckResult]: Loop: 39#L195-1true assume true; 18#L48-1true assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 43#L50true assume !(main_~cond~0 == 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;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 21#L81true assume main_~p1~0 != 0;main_~lk1~0 := 1; 19#L81-2true assume main_~p2~0 != 0;main_~lk2~0 := 1; 25#L85-1true assume main_~p3~0 != 0;main_~lk3~0 := 1; 40#L89-1true assume main_~p4~0 != 0;main_~lk4~0 := 1; 33#L93-1true assume main_~p5~0 != 0;main_~lk5~0 := 1; 46#L97-1true assume main_~p6~0 != 0;main_~lk6~0 := 1; 50#L101-1true assume main_~p7~0 != 0;main_~lk7~0 := 1; 44#L105-1true assume !(main_~p8~0 != 0); 14#L109-1true assume main_~p9~0 != 0;main_~lk9~0 := 1; 4#L113-1true assume main_~p10~0 != 0;main_~lk10~0 := 1; 9#L117-1true assume main_~p11~0 != 0;main_~lk11~0 := 1; 29#L121-1true assume main_~p12~0 != 0;main_~lk12~0 := 1; 22#L125-1true assume main_~p13~0 != 0;main_~lk13~0 := 1; 36#L129-1true assume !(main_~p1~0 != 0); 5#L135-1true assume !(main_~p2~0 != 0); 37#L140-1true assume !(main_~p3~0 != 0); 41#L145-1true assume !(main_~p4~0 != 0); 26#L150-1true assume !(main_~p5~0 != 0); 31#L155-1true assume !(main_~p6~0 != 0); 11#L160-1true assume !(main_~p7~0 != 0); 30#L165-1true assume !(main_~p8~0 != 0); 34#L170-1true assume !(main_~p9~0 != 0); 17#L175-1true assume !(main_~p10~0 != 0); 24#L180-1true assume !(main_~p11~0 != 0); 48#L185-1true assume !(main_~p12~0 != 0); 7#L190-1true assume !(main_~p13~0 != 0); 39#L195-1true [2018-11-10 07:48:15,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:48:15,355 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 07:48:15,356 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:48:15,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:48:15,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:15,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:48:15,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:15,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:48:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:48:15,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:48:15,413 INFO L82 PathProgramCache]: Analyzing trace with hash -552291617, now seen corresponding path program 1 times [2018-11-10 07:48:15,413 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:48:15,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:48:15,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:15,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:48:15,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:48:15,476 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-10 07:48:15,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:48:15,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:48:15,482 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:48:15,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:48:15,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:48:15,498 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 3 states. [2018-11-10 07:48:15,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:48:15,543 INFO L93 Difference]: Finished difference Result 95 states and 168 transitions. [2018-11-10 07:48:15,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:48:15,545 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 168 transitions. [2018-11-10 07:48:15,547 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 83 [2018-11-10 07:48:15,551 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 85 states and 135 transitions. [2018-11-10 07:48:15,551 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 85 [2018-11-10 07:48:15,552 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2018-11-10 07:48:15,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 135 transitions. [2018-11-10 07:48:15,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:48:15,553 INFO L705 BuchiCegarLoop]: Abstraction has 85 states and 135 transitions. [2018-11-10 07:48:15,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 135 transitions. [2018-11-10 07:48:15,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-11-10 07:48:15,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-10 07:48:15,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 135 transitions. [2018-11-10 07:48:15,577 INFO L728 BuchiCegarLoop]: Abstraction has 85 states and 135 transitions. [2018-11-10 07:48:15,577 INFO L608 BuchiCegarLoop]: Abstraction has 85 states and 135 transitions. [2018-11-10 07:48:15,577 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 07:48:15,577 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 135 transitions. [2018-11-10 07:48:15,578 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 83 [2018-11-10 07:48:15,579 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:48:15,579 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:48:15,579 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:48:15,579 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, 1, 1, 1, 1, 1, 1] [2018-11-10 07:48:15,580 INFO L793 eck$LassoCheckResult]: Stem: 202#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 177#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_#t~nondet11, main_#t~nondet12, main_#t~nondet13, 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_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~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;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;havoc main_~cond~0; 178#L195-1 [2018-11-10 07:48:15,580 INFO L795 eck$LassoCheckResult]: Loop: 178#L195-1 assume true; 208#L48-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 198#L50 assume !(main_~cond~0 == 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;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 199#L81 assume !(main_~p1~0 != 0); 192#L81-2 assume main_~p2~0 != 0;main_~lk2~0 := 1; 193#L85-1 assume main_~p3~0 != 0;main_~lk3~0 := 1; 187#L89-1 assume main_~p4~0 != 0;main_~lk4~0 := 1; 165#L93-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 166#L97-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 234#L101-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 233#L105-1 assume !(main_~p8~0 != 0); 232#L109-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 231#L113-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 230#L117-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 206#L121-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 207#L125-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 229#L129-1 assume !(main_~p1~0 != 0); 228#L135-1 assume !(main_~p2~0 != 0); 181#L140-1 assume !(main_~p3~0 != 0); 168#L145-1 assume !(main_~p4~0 != 0); 185#L150-1 assume !(main_~p5~0 != 0); 155#L155-1 assume !(main_~p6~0 != 0); 156#L160-1 assume !(main_~p7~0 != 0); 164#L165-1 assume !(main_~p8~0 != 0); 172#L170-1 assume !(main_~p9~0 != 0); 173#L175-1 assume !(main_~p10~0 != 0); 201#L180-1 assume !(main_~p11~0 != 0); 154#L185-1 assume !(main_~p12~0 != 0); 210#L190-1 assume !(main_~p13~0 != 0); 178#L195-1 [2018-11-10 07:48:15,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:48:15,580 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-10 07:48:15,580 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:48:15,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:48:15,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:15,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:48:15,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:15,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:48:15,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:48:15,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:48:15,585 INFO L82 PathProgramCache]: Analyzing trace with hash -490252003, now seen corresponding path program 1 times [2018-11-10 07:48:15,586 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:48:15,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:48:15,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:15,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:48:15,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:15,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:48:15,614 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-10 07:48:15,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:48:15,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:48:15,614 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:48:15,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:48:15,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:48:15,615 INFO L87 Difference]: Start difference. First operand 85 states and 135 transitions. cyclomatic complexity: 52 Second operand 3 states. [2018-11-10 07:48:15,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:48:15,651 INFO L93 Difference]: Finished difference Result 166 states and 262 transitions. [2018-11-10 07:48:15,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:48:15,652 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 166 states and 262 transitions. [2018-11-10 07:48:15,654 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 164 [2018-11-10 07:48:15,655 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 166 states to 166 states and 262 transitions. [2018-11-10 07:48:15,656 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 166 [2018-11-10 07:48:15,656 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 166 [2018-11-10 07:48:15,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 166 states and 262 transitions. [2018-11-10 07:48:15,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:48:15,657 INFO L705 BuchiCegarLoop]: Abstraction has 166 states and 262 transitions. [2018-11-10 07:48:15,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states and 262 transitions. [2018-11-10 07:48:15,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-11-10 07:48:15,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-11-10 07:48:15,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 262 transitions. [2018-11-10 07:48:15,666 INFO L728 BuchiCegarLoop]: Abstraction has 166 states and 262 transitions. [2018-11-10 07:48:15,666 INFO L608 BuchiCegarLoop]: Abstraction has 166 states and 262 transitions. [2018-11-10 07:48:15,667 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 07:48:15,667 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 166 states and 262 transitions. [2018-11-10 07:48:15,668 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 164 [2018-11-10 07:48:15,669 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:48:15,669 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:48:15,669 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:48:15,669 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, 1, 1, 1, 1, 1, 1] [2018-11-10 07:48:15,670 INFO L793 eck$LassoCheckResult]: Stem: 459#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 433#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_#t~nondet11, main_#t~nondet12, main_#t~nondet13, 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_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~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;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;havoc main_~cond~0; 434#L195-1 [2018-11-10 07:48:15,670 INFO L795 eck$LassoCheckResult]: Loop: 434#L195-1 assume true; 469#L48-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 467#L50 assume !(main_~cond~0 == 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;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 464#L81 assume !(main_~p1~0 != 0); 465#L81-2 assume !(main_~p2~0 != 0); 530#L85-1 assume main_~p3~0 != 0;main_~lk3~0 := 1; 529#L89-1 assume main_~p4~0 != 0;main_~lk4~0 := 1; 528#L93-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 527#L97-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 526#L101-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 525#L105-1 assume !(main_~p8~0 != 0); 524#L109-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 523#L113-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 522#L117-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 521#L121-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 520#L125-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 518#L129-1 assume !(main_~p1~0 != 0); 517#L135-1 assume !(main_~p2~0 != 0); 514#L140-1 assume !(main_~p3~0 != 0); 510#L145-1 assume !(main_~p4~0 != 0); 506#L150-1 assume !(main_~p5~0 != 0); 501#L155-1 assume !(main_~p6~0 != 0); 498#L160-1 assume !(main_~p7~0 != 0); 494#L165-1 assume !(main_~p8~0 != 0); 489#L170-1 assume !(main_~p9~0 != 0); 486#L175-1 assume !(main_~p10~0 != 0); 482#L180-1 assume !(main_~p11~0 != 0); 478#L185-1 assume !(main_~p12~0 != 0); 474#L190-1 assume !(main_~p13~0 != 0); 434#L195-1 [2018-11-10 07:48:15,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:48:15,670 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-10 07:48:15,670 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:48:15,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:48:15,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:15,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:48:15,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:48:15,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:48:15,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:48:15,675 INFO L82 PathProgramCache]: Analyzing trace with hash -349703393, now seen corresponding path program 1 times [2018-11-10 07:48:15,675 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:48:15,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:48:15,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:15,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:48:15,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:15,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:48:15,711 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-10 07:48:15,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:48:15,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:48:15,711 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:48:15,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:48:15,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:48:15,712 INFO L87 Difference]: Start difference. First operand 166 states and 262 transitions. cyclomatic complexity: 100 Second operand 3 states. [2018-11-10 07:48:15,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:48:15,729 INFO L93 Difference]: Finished difference Result 326 states and 510 transitions. [2018-11-10 07:48:15,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:48:15,730 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 326 states and 510 transitions. [2018-11-10 07:48:15,732 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 324 [2018-11-10 07:48:15,734 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 326 states to 326 states and 510 transitions. [2018-11-10 07:48:15,735 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 326 [2018-11-10 07:48:15,735 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 326 [2018-11-10 07:48:15,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 326 states and 510 transitions. [2018-11-10 07:48:15,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:48:15,737 INFO L705 BuchiCegarLoop]: Abstraction has 326 states and 510 transitions. [2018-11-10 07:48:15,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states and 510 transitions. [2018-11-10 07:48:15,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2018-11-10 07:48:15,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-11-10 07:48:15,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 510 transitions. [2018-11-10 07:48:15,748 INFO L728 BuchiCegarLoop]: Abstraction has 326 states and 510 transitions. [2018-11-10 07:48:15,748 INFO L608 BuchiCegarLoop]: Abstraction has 326 states and 510 transitions. [2018-11-10 07:48:15,748 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 07:48:15,748 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 326 states and 510 transitions. [2018-11-10 07:48:15,750 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 324 [2018-11-10 07:48:15,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:48:15,750 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:48:15,750 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:48:15,751 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, 1, 1, 1, 1, 1, 1] [2018-11-10 07:48:15,751 INFO L793 eck$LassoCheckResult]: Stem: 953#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 930#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_#t~nondet11, main_#t~nondet12, main_#t~nondet13, 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_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~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;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;havoc main_~cond~0; 931#L195-1 [2018-11-10 07:48:15,751 INFO L795 eck$LassoCheckResult]: Loop: 931#L195-1 assume true; 972#L48-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 964#L50 assume !(main_~cond~0 == 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;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 965#L81 assume !(main_~p1~0 != 0); 1095#L81-2 assume !(main_~p2~0 != 0); 1091#L85-1 assume !(main_~p3~0 != 0); 1087#L89-1 assume main_~p4~0 != 0;main_~lk4~0 := 1; 1083#L93-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 1079#L97-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 1075#L101-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 1071#L105-1 assume !(main_~p8~0 != 0); 1067#L109-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 1063#L113-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 1059#L117-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 1055#L121-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 1051#L125-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 1047#L129-1 assume !(main_~p1~0 != 0); 1044#L135-1 assume !(main_~p2~0 != 0); 1041#L140-1 assume !(main_~p3~0 != 0); 1042#L145-1 assume !(main_~p4~0 != 0); 1113#L150-1 assume !(main_~p5~0 != 0); 1110#L155-1 assume !(main_~p6~0 != 0); 1109#L160-1 assume !(main_~p7~0 != 0); 1007#L165-1 assume !(main_~p8~0 != 0); 1006#L170-1 assume !(main_~p9~0 != 0); 995#L175-1 assume !(main_~p10~0 != 0); 994#L180-1 assume !(main_~p11~0 != 0); 984#L185-1 assume !(main_~p12~0 != 0); 983#L190-1 assume !(main_~p13~0 != 0); 931#L195-1 [2018-11-10 07:48:15,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:48:15,751 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-10 07:48:15,751 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:48:15,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:48:15,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:15,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:48:15,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:15,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:48:15,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:48:15,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:48:15,756 INFO L82 PathProgramCache]: Analyzing trace with hash -483716899, now seen corresponding path program 1 times [2018-11-10 07:48:15,756 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:48:15,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:48:15,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:15,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:48:15,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:15,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:48:15,781 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-10 07:48:15,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:48:15,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:48:15,782 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:48:15,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:48:15,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:48:15,783 INFO L87 Difference]: Start difference. First operand 326 states and 510 transitions. cyclomatic complexity: 192 Second operand 3 states. [2018-11-10 07:48:15,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:48:15,804 INFO L93 Difference]: Finished difference Result 642 states and 994 transitions. [2018-11-10 07:48:15,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:48:15,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 642 states and 994 transitions. [2018-11-10 07:48:15,808 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 640 [2018-11-10 07:48:15,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 642 states to 642 states and 994 transitions. [2018-11-10 07:48:15,810 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 642 [2018-11-10 07:48:15,810 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 642 [2018-11-10 07:48:15,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 642 states and 994 transitions. [2018-11-10 07:48:15,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:48:15,812 INFO L705 BuchiCegarLoop]: Abstraction has 642 states and 994 transitions. [2018-11-10 07:48:15,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states and 994 transitions. [2018-11-10 07:48:15,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2018-11-10 07:48:15,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2018-11-10 07:48:15,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 994 transitions. [2018-11-10 07:48:15,829 INFO L728 BuchiCegarLoop]: Abstraction has 642 states and 994 transitions. [2018-11-10 07:48:15,829 INFO L608 BuchiCegarLoop]: Abstraction has 642 states and 994 transitions. [2018-11-10 07:48:15,829 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 07:48:15,829 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 642 states and 994 transitions. [2018-11-10 07:48:15,832 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 640 [2018-11-10 07:48:15,832 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:48:15,832 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:48:15,833 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:48:15,833 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, 1, 1, 1, 1, 1, 1] [2018-11-10 07:48:15,833 INFO L793 eck$LassoCheckResult]: Stem: 1933#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1904#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_#t~nondet11, main_#t~nondet12, main_#t~nondet13, 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_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~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;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;havoc main_~cond~0; 1905#L195-1 [2018-11-10 07:48:15,833 INFO L795 eck$LassoCheckResult]: Loop: 1905#L195-1 assume true; 1991#L48-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 1989#L50 assume !(main_~cond~0 == 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;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 1987#L81 assume !(main_~p1~0 != 0); 1983#L81-2 assume !(main_~p2~0 != 0); 1979#L85-1 assume !(main_~p3~0 != 0); 1975#L89-1 assume !(main_~p4~0 != 0); 1973#L93-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 1971#L97-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 1969#L101-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 1967#L105-1 assume !(main_~p8~0 != 0); 1965#L109-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 1963#L113-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 1961#L117-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 1959#L121-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 1957#L125-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 1954#L129-1 assume !(main_~p1~0 != 0); 1955#L135-1 assume !(main_~p2~0 != 0); 2034#L140-1 assume !(main_~p3~0 != 0); 2030#L145-1 assume !(main_~p4~0 != 0); 2027#L150-1 assume !(main_~p5~0 != 0); 2022#L155-1 assume !(main_~p6~0 != 0); 2019#L160-1 assume !(main_~p7~0 != 0); 2015#L165-1 assume !(main_~p8~0 != 0); 2010#L170-1 assume !(main_~p9~0 != 0); 2007#L175-1 assume !(main_~p10~0 != 0); 2003#L180-1 assume !(main_~p11~0 != 0); 1999#L185-1 assume !(main_~p12~0 != 0); 1995#L190-1 assume !(main_~p13~0 != 0); 1905#L195-1 [2018-11-10 07:48:15,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:48:15,834 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-10 07:48:15,834 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:48:15,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:48:15,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:15,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:48:15,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:15,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:48:15,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:48:15,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:48:15,838 INFO L82 PathProgramCache]: Analyzing trace with hash 2005812063, now seen corresponding path program 1 times [2018-11-10 07:48:15,838 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:48:15,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:48:15,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:15,839 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:48:15,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:15,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:48:15,867 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-10 07:48:15,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:48:15,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:48:15,867 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:48:15,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:48:15,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:48:15,868 INFO L87 Difference]: Start difference. First operand 642 states and 994 transitions. cyclomatic complexity: 368 Second operand 3 states. [2018-11-10 07:48:15,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:48:15,895 INFO L93 Difference]: Finished difference Result 1266 states and 1938 transitions. [2018-11-10 07:48:15,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:48:15,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1266 states and 1938 transitions. [2018-11-10 07:48:15,904 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1264 [2018-11-10 07:48:15,911 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1266 states to 1266 states and 1938 transitions. [2018-11-10 07:48:15,911 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1266 [2018-11-10 07:48:15,912 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1266 [2018-11-10 07:48:15,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1266 states and 1938 transitions. [2018-11-10 07:48:15,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:48:15,915 INFO L705 BuchiCegarLoop]: Abstraction has 1266 states and 1938 transitions. [2018-11-10 07:48:15,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1266 states and 1938 transitions. [2018-11-10 07:48:15,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1266 to 1266. [2018-11-10 07:48:15,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1266 states. [2018-11-10 07:48:15,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1938 transitions. [2018-11-10 07:48:15,938 INFO L728 BuchiCegarLoop]: Abstraction has 1266 states and 1938 transitions. [2018-11-10 07:48:15,938 INFO L608 BuchiCegarLoop]: Abstraction has 1266 states and 1938 transitions. [2018-11-10 07:48:15,938 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 07:48:15,938 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1266 states and 1938 transitions. [2018-11-10 07:48:15,944 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1264 [2018-11-10 07:48:15,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:48:15,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:48:15,945 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:48:15,945 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, 1, 1, 1, 1, 1, 1] [2018-11-10 07:48:15,945 INFO L793 eck$LassoCheckResult]: Stem: 3842#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3818#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_#t~nondet11, main_#t~nondet12, main_#t~nondet13, 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_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~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;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;havoc main_~cond~0; 3819#L195-1 [2018-11-10 07:48:15,945 INFO L795 eck$LassoCheckResult]: Loop: 3819#L195-1 assume true; 3989#L48-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 3987#L50 assume !(main_~cond~0 == 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;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 3984#L81 assume !(main_~p1~0 != 0); 3985#L81-2 assume !(main_~p2~0 != 0); 4064#L85-1 assume !(main_~p3~0 != 0); 4060#L89-1 assume !(main_~p4~0 != 0); 4056#L93-1 assume !(main_~p5~0 != 0); 4054#L97-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 4052#L101-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 4050#L105-1 assume !(main_~p8~0 != 0); 4048#L109-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 4046#L113-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 4044#L117-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 4042#L121-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 4040#L125-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 4038#L129-1 assume !(main_~p1~0 != 0); 4035#L135-1 assume !(main_~p2~0 != 0); 4032#L140-1 assume !(main_~p3~0 != 0); 4029#L145-1 assume !(main_~p4~0 != 0); 4025#L150-1 assume !(main_~p5~0 != 0); 4021#L155-1 assume !(main_~p6~0 != 0); 4018#L160-1 assume !(main_~p7~0 != 0); 4014#L165-1 assume !(main_~p8~0 != 0); 4009#L170-1 assume !(main_~p9~0 != 0); 4006#L175-1 assume !(main_~p10~0 != 0); 4002#L180-1 assume !(main_~p11~0 != 0); 3998#L185-1 assume !(main_~p12~0 != 0); 3994#L190-1 assume !(main_~p13~0 != 0); 3819#L195-1 [2018-11-10 07:48:15,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:48:15,945 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-10 07:48:15,946 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:48:15,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:48:15,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:15,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:48:15,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:15,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:48:15,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:48:15,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:48:15,952 INFO L82 PathProgramCache]: Analyzing trace with hash -2070300515, now seen corresponding path program 1 times [2018-11-10 07:48:15,952 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:48:15,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:48:15,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:15,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:48:15,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:15,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:48:15,984 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-10 07:48:15,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:48:15,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:48:15,984 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:48:15,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:48:15,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:48:15,985 INFO L87 Difference]: Start difference. First operand 1266 states and 1938 transitions. cyclomatic complexity: 704 Second operand 3 states. [2018-11-10 07:48:16,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:48:16,008 INFO L93 Difference]: Finished difference Result 2498 states and 3778 transitions. [2018-11-10 07:48:16,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:48:16,008 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2498 states and 3778 transitions. [2018-11-10 07:48:16,021 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2496 [2018-11-10 07:48:16,028 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2498 states to 2498 states and 3778 transitions. [2018-11-10 07:48:16,028 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2498 [2018-11-10 07:48:16,029 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2498 [2018-11-10 07:48:16,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2498 states and 3778 transitions. [2018-11-10 07:48:16,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:48:16,032 INFO L705 BuchiCegarLoop]: Abstraction has 2498 states and 3778 transitions. [2018-11-10 07:48:16,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2498 states and 3778 transitions. [2018-11-10 07:48:16,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2498 to 2498. [2018-11-10 07:48:16,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2498 states. [2018-11-10 07:48:16,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2498 states to 2498 states and 3778 transitions. [2018-11-10 07:48:16,062 INFO L728 BuchiCegarLoop]: Abstraction has 2498 states and 3778 transitions. [2018-11-10 07:48:16,062 INFO L608 BuchiCegarLoop]: Abstraction has 2498 states and 3778 transitions. [2018-11-10 07:48:16,062 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 07:48:16,062 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2498 states and 3778 transitions. [2018-11-10 07:48:16,070 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2496 [2018-11-10 07:48:16,070 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:48:16,070 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:48:16,070 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:48:16,070 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, 1, 1, 1, 1, 1, 1] [2018-11-10 07:48:16,071 INFO L793 eck$LassoCheckResult]: Stem: 7616#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 7587#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_#t~nondet11, main_#t~nondet12, main_#t~nondet13, 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_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~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;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;havoc main_~cond~0; 7588#L195-1 [2018-11-10 07:48:16,071 INFO L795 eck$LassoCheckResult]: Loop: 7588#L195-1 assume true; 7998#L48-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 7986#L50 assume !(main_~cond~0 == 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;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 7987#L81 assume !(main_~p1~0 != 0); 8136#L81-2 assume !(main_~p2~0 != 0); 8133#L85-1 assume !(main_~p3~0 != 0); 8134#L89-1 assume !(main_~p4~0 != 0); 8124#L93-1 assume !(main_~p5~0 != 0); 8126#L97-1 assume !(main_~p6~0 != 0); 8115#L101-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 8116#L105-1 assume !(main_~p8~0 != 0); 8107#L109-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 8108#L113-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 8099#L117-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 8100#L121-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 8091#L125-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 8092#L129-1 assume !(main_~p1~0 != 0); 8082#L135-1 assume !(main_~p2~0 != 0); 8083#L140-1 assume !(main_~p3~0 != 0); 8167#L145-1 assume !(main_~p4~0 != 0); 8075#L150-1 assume !(main_~p5~0 != 0); 8071#L155-1 assume !(main_~p6~0 != 0); 8066#L160-1 assume !(main_~p7~0 != 0); 8065#L165-1 assume !(main_~p8~0 != 0); 8038#L170-1 assume !(main_~p9~0 != 0); 8039#L175-1 assume !(main_~p10~0 != 0); 8146#L180-1 assume !(main_~p11~0 != 0); 8015#L185-1 assume !(main_~p12~0 != 0); 8014#L190-1 assume !(main_~p13~0 != 0); 7588#L195-1 [2018-11-10 07:48:16,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:48:16,071 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-10 07:48:16,071 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:48:16,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:48:16,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:16,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:48:16,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:16,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:48:16,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:48:16,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:48:16,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1647598689, now seen corresponding path program 1 times [2018-11-10 07:48:16,076 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:48:16,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:48:16,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:16,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:48:16,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:16,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:48:16,096 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-10 07:48:16,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:48:16,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:48:16,096 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:48:16,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:48:16,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:48:16,097 INFO L87 Difference]: Start difference. First operand 2498 states and 3778 transitions. cyclomatic complexity: 1344 Second operand 3 states. [2018-11-10 07:48:16,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:48:16,127 INFO L93 Difference]: Finished difference Result 4930 states and 7362 transitions. [2018-11-10 07:48:16,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:48:16,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4930 states and 7362 transitions. [2018-11-10 07:48:16,145 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4928 [2018-11-10 07:48:16,158 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4930 states to 4930 states and 7362 transitions. [2018-11-10 07:48:16,158 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4930 [2018-11-10 07:48:16,161 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4930 [2018-11-10 07:48:16,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4930 states and 7362 transitions. [2018-11-10 07:48:16,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:48:16,166 INFO L705 BuchiCegarLoop]: Abstraction has 4930 states and 7362 transitions. [2018-11-10 07:48:16,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4930 states and 7362 transitions. [2018-11-10 07:48:16,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4930 to 4930. [2018-11-10 07:48:16,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4930 states. [2018-11-10 07:48:16,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4930 states to 4930 states and 7362 transitions. [2018-11-10 07:48:16,224 INFO L728 BuchiCegarLoop]: Abstraction has 4930 states and 7362 transitions. [2018-11-10 07:48:16,224 INFO L608 BuchiCegarLoop]: Abstraction has 4930 states and 7362 transitions. [2018-11-10 07:48:16,224 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 07:48:16,224 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4930 states and 7362 transitions. [2018-11-10 07:48:16,239 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4928 [2018-11-10 07:48:16,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:48:16,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:48:16,240 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:48:16,240 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, 1, 1, 1, 1, 1, 1] [2018-11-10 07:48:16,240 INFO L793 eck$LassoCheckResult]: Stem: 15047#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 15021#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_#t~nondet11, main_#t~nondet12, main_#t~nondet13, 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_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~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;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;havoc main_~cond~0; 15022#L195-1 [2018-11-10 07:48:16,240 INFO L795 eck$LassoCheckResult]: Loop: 15022#L195-1 assume true; 15157#L48-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 15156#L50 assume !(main_~cond~0 == 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;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 15154#L81 assume !(main_~p1~0 != 0); 15152#L81-2 assume !(main_~p2~0 != 0); 15150#L85-1 assume !(main_~p3~0 != 0); 15148#L89-1 assume !(main_~p4~0 != 0); 15146#L93-1 assume !(main_~p5~0 != 0); 15147#L97-1 assume !(main_~p6~0 != 0); 15261#L101-1 assume !(main_~p7~0 != 0); 15258#L105-1 assume !(main_~p8~0 != 0); 15257#L109-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 15250#L113-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 15245#L117-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 15240#L121-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 15235#L125-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 15230#L129-1 assume !(main_~p1~0 != 0); 15225#L135-1 assume !(main_~p2~0 != 0); 15220#L140-1 assume !(main_~p3~0 != 0); 15213#L145-1 assume !(main_~p4~0 != 0); 15206#L150-1 assume !(main_~p5~0 != 0); 15198#L155-1 assume !(main_~p6~0 != 0); 15170#L160-1 assume !(main_~p7~0 != 0); 15169#L165-1 assume !(main_~p8~0 != 0); 15166#L170-1 assume !(main_~p9~0 != 0); 15165#L175-1 assume !(main_~p10~0 != 0); 15163#L180-1 assume !(main_~p11~0 != 0); 15161#L185-1 assume !(main_~p12~0 != 0); 15159#L190-1 assume !(main_~p13~0 != 0); 15022#L195-1 [2018-11-10 07:48:16,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:48:16,241 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2018-11-10 07:48:16,241 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:48:16,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:48:16,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:16,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:48:16,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:16,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:48:16,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:48:16,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:48:16,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1829720157, now seen corresponding path program 1 times [2018-11-10 07:48:16,245 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:48:16,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:48:16,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:16,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:48:16,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:16,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:48:16,264 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-10 07:48:16,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:48:16,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:48:16,264 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:48:16,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:48:16,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:48:16,265 INFO L87 Difference]: Start difference. First operand 4930 states and 7362 transitions. cyclomatic complexity: 2560 Second operand 3 states. [2018-11-10 07:48:16,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:48:16,308 INFO L93 Difference]: Finished difference Result 9730 states and 14338 transitions. [2018-11-10 07:48:16,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:48:16,309 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9730 states and 14338 transitions. [2018-11-10 07:48:16,340 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 9728 [2018-11-10 07:48:16,369 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9730 states to 9730 states and 14338 transitions. [2018-11-10 07:48:16,370 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9730 [2018-11-10 07:48:16,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9730 [2018-11-10 07:48:16,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9730 states and 14338 transitions. [2018-11-10 07:48:16,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:48:16,384 INFO L705 BuchiCegarLoop]: Abstraction has 9730 states and 14338 transitions. [2018-11-10 07:48:16,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9730 states and 14338 transitions. [2018-11-10 07:48:16,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9730 to 9730. [2018-11-10 07:48:16,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9730 states. [2018-11-10 07:48:16,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9730 states to 9730 states and 14338 transitions. [2018-11-10 07:48:16,493 INFO L728 BuchiCegarLoop]: Abstraction has 9730 states and 14338 transitions. [2018-11-10 07:48:16,494 INFO L608 BuchiCegarLoop]: Abstraction has 9730 states and 14338 transitions. [2018-11-10 07:48:16,494 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 07:48:16,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9730 states and 14338 transitions. [2018-11-10 07:48:16,517 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 9728 [2018-11-10 07:48:16,517 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:48:16,517 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:48:16,518 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:48:16,518 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, 1, 1, 1, 1, 1, 1] [2018-11-10 07:48:16,518 INFO L793 eck$LassoCheckResult]: Stem: 29723#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 29686#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_#t~nondet11, main_#t~nondet12, main_#t~nondet13, 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_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~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;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;havoc main_~cond~0; 29687#L195-1 [2018-11-10 07:48:16,518 INFO L795 eck$LassoCheckResult]: Loop: 29687#L195-1 assume true; 30262#L48-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 30261#L50 assume !(main_~cond~0 == 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;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 30259#L81 assume !(main_~p1~0 != 0); 30257#L81-2 assume !(main_~p2~0 != 0); 30253#L85-1 assume !(main_~p3~0 != 0); 30249#L89-1 assume !(main_~p4~0 != 0); 30245#L93-1 assume !(main_~p5~0 != 0); 30241#L97-1 assume !(main_~p6~0 != 0); 30237#L101-1 assume !(main_~p7~0 != 0); 30238#L105-1 assume !(main_~p8~0 != 0); 30191#L109-1 assume !(main_~p9~0 != 0); 30192#L113-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 30207#L117-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 30208#L121-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 30183#L125-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 30184#L129-1 assume !(main_~p1~0 != 0); 30284#L135-1 assume !(main_~p2~0 != 0); 30282#L140-1 assume !(main_~p3~0 != 0); 30280#L145-1 assume !(main_~p4~0 != 0); 30279#L150-1 assume !(main_~p5~0 != 0); 30114#L155-1 assume !(main_~p6~0 != 0); 30115#L160-1 assume !(main_~p7~0 != 0); 30277#L165-1 assume !(main_~p8~0 != 0); 30275#L170-1 assume !(main_~p9~0 != 0); 30274#L175-1 assume !(main_~p10~0 != 0); 30271#L180-1 assume !(main_~p11~0 != 0); 30268#L185-1 assume !(main_~p12~0 != 0); 30265#L190-1 assume !(main_~p13~0 != 0); 29687#L195-1 [2018-11-10 07:48:16,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:48:16,518 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2018-11-10 07:48:16,518 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:48:16,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:48:16,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:16,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:48:16,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:48:16,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:48:16,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:48:16,522 INFO L82 PathProgramCache]: Analyzing trace with hash -164424549, now seen corresponding path program 1 times [2018-11-10 07:48:16,522 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:48:16,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:48:16,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:16,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:48:16,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:16,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:48:16,573 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-10 07:48:16,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:48:16,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:48:16,574 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:48:16,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:48:16,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:48:16,574 INFO L87 Difference]: Start difference. First operand 9730 states and 14338 transitions. cyclomatic complexity: 4864 Second operand 3 states. [2018-11-10 07:48:16,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:48:16,627 INFO L93 Difference]: Finished difference Result 19202 states and 27906 transitions. [2018-11-10 07:48:16,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:48:16,628 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19202 states and 27906 transitions. [2018-11-10 07:48:16,702 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 19200 [2018-11-10 07:48:16,764 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19202 states to 19202 states and 27906 transitions. [2018-11-10 07:48:16,765 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19202 [2018-11-10 07:48:16,774 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19202 [2018-11-10 07:48:16,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19202 states and 27906 transitions. [2018-11-10 07:48:16,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:48:16,790 INFO L705 BuchiCegarLoop]: Abstraction has 19202 states and 27906 transitions. [2018-11-10 07:48:16,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19202 states and 27906 transitions. [2018-11-10 07:48:17,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19202 to 19202. [2018-11-10 07:48:17,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19202 states. [2018-11-10 07:48:17,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19202 states to 19202 states and 27906 transitions. [2018-11-10 07:48:17,056 INFO L728 BuchiCegarLoop]: Abstraction has 19202 states and 27906 transitions. [2018-11-10 07:48:17,056 INFO L608 BuchiCegarLoop]: Abstraction has 19202 states and 27906 transitions. [2018-11-10 07:48:17,056 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 07:48:17,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19202 states and 27906 transitions. [2018-11-10 07:48:17,105 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 19200 [2018-11-10 07:48:17,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:48:17,105 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:48:17,106 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:48:17,106 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, 1, 1, 1, 1, 1, 1] [2018-11-10 07:48:17,106 INFO L793 eck$LassoCheckResult]: Stem: 58657#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 58625#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_#t~nondet11, main_#t~nondet12, main_#t~nondet13, 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_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~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;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;havoc main_~cond~0; 58626#L195-1 [2018-11-10 07:48:17,106 INFO L795 eck$LassoCheckResult]: Loop: 58626#L195-1 assume true; 59003#L48-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 59001#L50 assume !(main_~cond~0 == 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;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 58998#L81 assume !(main_~p1~0 != 0); 58994#L81-2 assume !(main_~p2~0 != 0); 58990#L85-1 assume !(main_~p3~0 != 0); 58986#L89-1 assume !(main_~p4~0 != 0); 58982#L93-1 assume !(main_~p5~0 != 0); 58978#L97-1 assume !(main_~p6~0 != 0); 58974#L101-1 assume !(main_~p7~0 != 0); 58971#L105-1 assume !(main_~p8~0 != 0); 58969#L109-1 assume !(main_~p9~0 != 0); 58934#L113-1 assume !(main_~p10~0 != 0); 58926#L117-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 58927#L121-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 58913#L125-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 58914#L129-1 assume !(main_~p1~0 != 0); 58892#L135-1 assume !(main_~p2~0 != 0); 58893#L140-1 assume !(main_~p3~0 != 0); 58871#L145-1 assume !(main_~p4~0 != 0); 58862#L150-1 assume !(main_~p5~0 != 0); 58863#L155-1 assume !(main_~p6~0 != 0); 58848#L160-1 assume !(main_~p7~0 != 0); 58850#L165-1 assume !(main_~p8~0 != 0); 59019#L170-1 assume !(main_~p9~0 != 0); 59017#L175-1 assume !(main_~p10~0 != 0); 59016#L180-1 assume !(main_~p11~0 != 0); 59012#L185-1 assume !(main_~p12~0 != 0); 59008#L190-1 assume !(main_~p13~0 != 0); 58626#L195-1 [2018-11-10 07:48:17,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:48:17,107 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2018-11-10 07:48:17,107 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:48:17,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:48:17,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:17,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:48:17,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:17,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:48:17,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:48:17,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:48:17,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1752772451, now seen corresponding path program 1 times [2018-11-10 07:48:17,113 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:48:17,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:48:17,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:17,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:48:17,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:17,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:48:17,140 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-10 07:48:17,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:48:17,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:48:17,140 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:48:17,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:48:17,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:48:17,141 INFO L87 Difference]: Start difference. First operand 19202 states and 27906 transitions. cyclomatic complexity: 9216 Second operand 3 states. [2018-11-10 07:48:17,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:48:17,222 INFO L93 Difference]: Finished difference Result 37890 states and 54274 transitions. [2018-11-10 07:48:17,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:48:17,223 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37890 states and 54274 transitions. [2018-11-10 07:48:17,349 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 37888 [2018-11-10 07:48:17,462 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37890 states to 37890 states and 54274 transitions. [2018-11-10 07:48:17,463 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37890 [2018-11-10 07:48:17,482 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37890 [2018-11-10 07:48:17,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37890 states and 54274 transitions. [2018-11-10 07:48:17,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:48:17,506 INFO L705 BuchiCegarLoop]: Abstraction has 37890 states and 54274 transitions. [2018-11-10 07:48:17,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37890 states and 54274 transitions. [2018-11-10 07:48:17,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37890 to 37890. [2018-11-10 07:48:17,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37890 states. [2018-11-10 07:48:17,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37890 states to 37890 states and 54274 transitions. [2018-11-10 07:48:17,931 INFO L728 BuchiCegarLoop]: Abstraction has 37890 states and 54274 transitions. [2018-11-10 07:48:17,931 INFO L608 BuchiCegarLoop]: Abstraction has 37890 states and 54274 transitions. [2018-11-10 07:48:17,931 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 07:48:17,931 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37890 states and 54274 transitions. [2018-11-10 07:48:17,993 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 37888 [2018-11-10 07:48:17,993 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:48:17,993 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:48:17,994 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:48:17,994 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, 1, 1, 1, 1, 1, 1] [2018-11-10 07:48:17,994 INFO L793 eck$LassoCheckResult]: Stem: 115761#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 115722#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_#t~nondet11, main_#t~nondet12, main_#t~nondet13, 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_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~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;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;havoc main_~cond~0; 115723#L195-1 [2018-11-10 07:48:17,994 INFO L795 eck$LassoCheckResult]: Loop: 115723#L195-1 assume true; 115982#L48-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 115980#L50 assume !(main_~cond~0 == 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;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 115977#L81 assume !(main_~p1~0 != 0); 115978#L81-2 assume !(main_~p2~0 != 0); 115956#L85-1 assume !(main_~p3~0 != 0); 115958#L89-1 assume !(main_~p4~0 != 0); 115936#L93-1 assume !(main_~p5~0 != 0); 115938#L97-1 assume !(main_~p6~0 != 0); 115912#L101-1 assume !(main_~p7~0 != 0); 115914#L105-1 assume !(main_~p8~0 != 0); 115892#L109-1 assume !(main_~p9~0 != 0); 115894#L113-1 assume !(main_~p10~0 != 0); 115868#L117-1 assume !(main_~p11~0 != 0); 115870#L121-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 115852#L125-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 115853#L129-1 assume !(main_~p1~0 != 0); 116024#L135-1 assume !(main_~p2~0 != 0); 116022#L140-1 assume !(main_~p3~0 != 0); 116020#L145-1 assume !(main_~p4~0 != 0); 116018#L150-1 assume !(main_~p5~0 != 0); 116014#L155-1 assume !(main_~p6~0 != 0); 116010#L160-1 assume !(main_~p7~0 != 0); 116007#L165-1 assume !(main_~p8~0 != 0); 116002#L170-1 assume !(main_~p9~0 != 0); 115998#L175-1 assume !(main_~p10~0 != 0); 115994#L180-1 assume !(main_~p11~0 != 0); 115991#L185-1 assume !(main_~p12~0 != 0); 115987#L190-1 assume !(main_~p13~0 != 0); 115723#L195-1 [2018-11-10 07:48:17,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:48:17,994 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2018-11-10 07:48:17,994 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:48:17,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:48:17,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:17,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:48:17,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:17,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:48:17,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:48:17,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:48:17,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1521126491, now seen corresponding path program 1 times [2018-11-10 07:48:17,998 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:48:17,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:48:17,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:17,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:48:17,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:48:18,015 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-10 07:48:18,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:48:18,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:48:18,016 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:48:18,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:48:18,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:48:18,016 INFO L87 Difference]: Start difference. First operand 37890 states and 54274 transitions. cyclomatic complexity: 17408 Second operand 3 states. [2018-11-10 07:48:18,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:48:18,148 INFO L93 Difference]: Finished difference Result 74754 states and 105474 transitions. [2018-11-10 07:48:18,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:48:18,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74754 states and 105474 transitions. [2018-11-10 07:48:18,325 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 74752 [2018-11-10 07:48:18,456 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74754 states to 74754 states and 105474 transitions. [2018-11-10 07:48:18,456 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74754 [2018-11-10 07:48:18,485 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 74754 [2018-11-10 07:48:18,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74754 states and 105474 transitions. [2018-11-10 07:48:18,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:48:18,521 INFO L705 BuchiCegarLoop]: Abstraction has 74754 states and 105474 transitions. [2018-11-10 07:48:18,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74754 states and 105474 transitions. [2018-11-10 07:48:19,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74754 to 74754. [2018-11-10 07:48:19,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74754 states. [2018-11-10 07:48:19,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74754 states to 74754 states and 105474 transitions. [2018-11-10 07:48:19,345 INFO L728 BuchiCegarLoop]: Abstraction has 74754 states and 105474 transitions. [2018-11-10 07:48:19,346 INFO L608 BuchiCegarLoop]: Abstraction has 74754 states and 105474 transitions. [2018-11-10 07:48:19,346 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 07:48:19,346 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74754 states and 105474 transitions. [2018-11-10 07:48:19,519 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 74752 [2018-11-10 07:48:19,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:48:19,520 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:48:19,520 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:48:19,521 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, 1, 1, 1, 1, 1, 1] [2018-11-10 07:48:19,521 INFO L793 eck$LassoCheckResult]: Stem: 228408#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 228373#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_#t~nondet11, main_#t~nondet12, main_#t~nondet13, 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_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~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;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;havoc main_~cond~0; 228374#L195-1 [2018-11-10 07:48:19,521 INFO L795 eck$LassoCheckResult]: Loop: 228374#L195-1 assume true; 228581#L48-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 228579#L50 assume !(main_~cond~0 == 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;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 228576#L81 assume !(main_~p1~0 != 0); 228573#L81-2 assume !(main_~p2~0 != 0); 228569#L85-1 assume !(main_~p3~0 != 0); 228565#L89-1 assume !(main_~p4~0 != 0); 228561#L93-1 assume !(main_~p5~0 != 0); 228557#L97-1 assume !(main_~p6~0 != 0); 228553#L101-1 assume !(main_~p7~0 != 0); 228550#L105-1 assume !(main_~p8~0 != 0); 228546#L109-1 assume !(main_~p9~0 != 0); 228543#L113-1 assume !(main_~p10~0 != 0); 228479#L117-1 assume !(main_~p11~0 != 0); 228480#L121-1 assume !(main_~p12~0 != 0); 228717#L125-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 228712#L129-1 assume !(main_~p1~0 != 0); 228713#L135-1 assume !(main_~p2~0 != 0); 228759#L140-1 assume !(main_~p3~0 != 0); 228757#L145-1 assume !(main_~p4~0 != 0); 228753#L150-1 assume !(main_~p5~0 != 0); 228749#L155-1 assume !(main_~p6~0 != 0); 228745#L160-1 assume !(main_~p7~0 != 0); 228742#L165-1 assume !(main_~p8~0 != 0); 228737#L170-1 assume !(main_~p9~0 != 0); 228652#L175-1 assume !(main_~p10~0 != 0); 228648#L180-1 assume !(main_~p11~0 != 0); 228646#L185-1 assume !(main_~p12~0 != 0); 228643#L190-1 assume !(main_~p13~0 != 0); 228374#L195-1 [2018-11-10 07:48:19,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:48:19,521 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 12 times [2018-11-10 07:48:19,521 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:48:19,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:48:19,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:19,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:48:19,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:19,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:48:19,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:48:19,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:48:19,524 INFO L82 PathProgramCache]: Analyzing trace with hash 241262813, now seen corresponding path program 1 times [2018-11-10 07:48:19,524 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:48:19,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:48:19,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:19,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:48:19,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:19,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:48:19,548 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-10 07:48:19,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:48:19,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 07:48:19,548 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:48:19,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:48:19,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:48:19,549 INFO L87 Difference]: Start difference. First operand 74754 states and 105474 transitions. cyclomatic complexity: 32768 Second operand 3 states. [2018-11-10 07:48:19,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:48:19,974 INFO L93 Difference]: Finished difference Result 147458 states and 204802 transitions. [2018-11-10 07:48:19,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:48:19,974 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 147458 states and 204802 transitions. [2018-11-10 07:48:20,341 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 147456 [2018-11-10 07:48:20,595 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 147458 states to 147458 states and 204802 transitions. [2018-11-10 07:48:20,595 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 147458 [2018-11-10 07:48:20,652 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 147458 [2018-11-10 07:48:20,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 147458 states and 204802 transitions. [2018-11-10 07:48:20,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:48:20,715 INFO L705 BuchiCegarLoop]: Abstraction has 147458 states and 204802 transitions. [2018-11-10 07:48:20,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147458 states and 204802 transitions. [2018-11-10 07:48:21,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147458 to 147458. [2018-11-10 07:48:21,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147458 states. [2018-11-10 07:48:22,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147458 states to 147458 states and 204802 transitions. [2018-11-10 07:48:22,065 INFO L728 BuchiCegarLoop]: Abstraction has 147458 states and 204802 transitions. [2018-11-10 07:48:22,065 INFO L608 BuchiCegarLoop]: Abstraction has 147458 states and 204802 transitions. [2018-11-10 07:48:22,065 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 07:48:22,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 147458 states and 204802 transitions. [2018-11-10 07:48:22,329 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 147456 [2018-11-10 07:48:22,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:48:22,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:48:22,331 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:48:22,331 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, 1, 1, 1, 1, 1, 1] [2018-11-10 07:48:22,331 INFO L793 eck$LassoCheckResult]: Stem: 450629#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 450589#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_#t~nondet11, main_#t~nondet12, main_#t~nondet13, 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_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~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;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;havoc main_~cond~0; 450590#L195-1 [2018-11-10 07:48:22,331 INFO L795 eck$LassoCheckResult]: Loop: 450590#L195-1 assume true; 450971#L48-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 450968#L50 assume !(main_~cond~0 == 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;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 450963#L81 assume !(main_~p1~0 != 0); 450957#L81-2 assume !(main_~p2~0 != 0); 450951#L85-1 assume !(main_~p3~0 != 0); 450945#L89-1 assume !(main_~p4~0 != 0); 450937#L93-1 assume !(main_~p5~0 != 0); 450929#L97-1 assume !(main_~p6~0 != 0); 450922#L101-1 assume !(main_~p7~0 != 0); 450923#L105-1 assume !(main_~p8~0 != 0); 450911#L109-1 assume !(main_~p9~0 != 0); 450913#L113-1 assume !(main_~p10~0 != 0); 450899#L117-1 assume !(main_~p11~0 != 0); 450901#L121-1 assume !(main_~p12~0 != 0); 451035#L125-1 assume !(main_~p13~0 != 0); 451030#L129-1 assume !(main_~p1~0 != 0); 451025#L135-1 assume !(main_~p2~0 != 0); 451021#L140-1 assume !(main_~p3~0 != 0); 451017#L145-1 assume !(main_~p4~0 != 0); 451012#L150-1 assume !(main_~p5~0 != 0); 451006#L155-1 assume !(main_~p6~0 != 0); 451004#L160-1 assume !(main_~p7~0 != 0); 450999#L165-1 assume !(main_~p8~0 != 0); 450993#L170-1 assume !(main_~p9~0 != 0); 450988#L175-1 assume !(main_~p10~0 != 0); 450984#L180-1 assume !(main_~p11~0 != 0); 450981#L185-1 assume !(main_~p12~0 != 0); 450977#L190-1 assume !(main_~p13~0 != 0); 450590#L195-1 [2018-11-10 07:48:22,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:48:22,331 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 13 times [2018-11-10 07:48:22,332 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:48:22,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:48:22,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:22,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:48:22,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:22,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:48:22,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:48:22,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:48:22,335 INFO L82 PathProgramCache]: Analyzing trace with hash -769854437, now seen corresponding path program 1 times [2018-11-10 07:48:22,335 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:48:22,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:48:22,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:22,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:48:22,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:48:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:48:22,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:48:22,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1526325145, now seen corresponding path program 1 times [2018-11-10 07:48:22,347 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:48:22,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:48:22,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:22,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:48:22,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:48:22,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:48:22,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:48:22,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 07:48:22 BoogieIcfgContainer [2018-11-10 07:48:22,530 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 07:48:22,530 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:48:22,530 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:48:22,530 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:48:22,531 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:48:15" (3/4) ... [2018-11-10 07:48:22,533 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-10 07:48:22,576 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_79d46a8f-93c9-46fa-a5a7-6aeb57c8fbdc/bin-2019/uautomizer/witness.graphml [2018-11-10 07:48:22,576 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:48:22,577 INFO L168 Benchmark]: Toolchain (without parser) took 7766.55 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 842.5 MB). Free memory was 959.1 MB in the beginning and 432.7 MB in the end (delta: 526.4 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-11-10 07:48:22,578 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:48:22,578 INFO L168 Benchmark]: CACSL2BoogieTranslator took 172.45 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.2 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-11-10 07:48:22,578 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.91 ms. Allocated memory is still 1.0 GB. Free memory was 948.2 MB in the beginning and 945.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:48:22,578 INFO L168 Benchmark]: Boogie Preprocessor took 14.33 ms. Allocated memory is still 1.0 GB. Free memory was 945.5 MB in the beginning and 942.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:48:22,581 INFO L168 Benchmark]: RCFGBuilder took 252.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 942.8 MB in the beginning and 1.1 GB in the end (delta: -171.6 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2018-11-10 07:48:22,581 INFO L168 Benchmark]: BuchiAutomizer took 7256.49 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 701.5 MB). Free memory was 1.1 GB in the beginning and 432.7 MB in the end (delta: 681.7 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-11-10 07:48:22,581 INFO L168 Benchmark]: Witness Printer took 46.02 ms. Allocated memory is still 1.9 GB. Free memory is still 432.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:48:22,582 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 172.45 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.2 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.91 ms. Allocated memory is still 1.0 GB. Free memory was 948.2 MB in the beginning and 945.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.33 ms. Allocated memory is still 1.0 GB. Free memory was 945.5 MB in the beginning and 942.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 252.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 942.8 MB in the beginning and 1.1 GB in the end (delta: -171.6 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7256.49 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 701.5 MB). Free memory was 1.1 GB in the beginning and 432.7 MB in the end (delta: 681.7 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 46.02 ms. Allocated memory is still 1.9 GB. Free memory is still 432.7 MB. 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 12 terminating modules (12 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.12 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 147458 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.2s and 13 iterations. TraceHistogramMax:1. Analysis of lassos took 0.6s. Construction of modules took 0.2s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 0. Minimization of det autom 12. Minimization of nondet autom 0. Automata minimization 3.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 1.4s Buchi closure took 0.1s. Biggest automaton had 147458 states and ocurred in iteration 12. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1258 SDtfs, 653 SDslu, 784 SDs, 0 SdLazy, 60 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI12 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: 48]: 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@5644c0f=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@40bc24a3=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1f65b933=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4b112c27=0, lk12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@53f2cde5=0, lk13=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@69c3ea89=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2a1ea304=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4e60d78a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@475630d6=0, p13=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@28261ba3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2d9a91fe=0, p11=0, lk10=0, p12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2cb823a2=0, lk11=0, cond=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6fd86bd9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5d46fb30=1, lk3=0, lk4=0, lk5=0, lk6=0, lk1=0, lk2=0, lk7=0, lk8=0, lk9=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 48]: 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; [L36] int p11 = __VERIFIER_nondet_int(); [L37] int lk11; [L39] int p12 = __VERIFIER_nondet_int(); [L40] int lk12; [L42] int p13 = __VERIFIER_nondet_int(); [L43] int lk13; [L46] int cond; Loop: [L48] COND TRUE 1 [L49] cond = __VERIFIER_nondet_int() [L50] COND FALSE !(cond == 0) [L53] lk1 = 0 [L55] lk2 = 0 [L57] lk3 = 0 [L59] lk4 = 0 [L61] lk5 = 0 [L63] lk6 = 0 [L65] lk7 = 0 [L67] lk8 = 0 [L69] lk9 = 0 [L71] lk10 = 0 [L73] lk11 = 0 [L75] lk12 = 0 [L77] lk13 = 0 [L81] COND FALSE !(p1 != 0) [L85] COND FALSE !(p2 != 0) [L89] COND FALSE !(p3 != 0) [L93] COND FALSE !(p4 != 0) [L97] COND FALSE !(p5 != 0) [L101] COND FALSE !(p6 != 0) [L105] COND FALSE !(p7 != 0) [L109] COND FALSE !(p8 != 0) [L113] COND FALSE !(p9 != 0) [L117] COND FALSE !(p10 != 0) [L121] COND FALSE !(p11 != 0) [L125] COND FALSE !(p12 != 0) [L129] COND FALSE !(p13 != 0) [L135] COND FALSE !(p1 != 0) [L140] COND FALSE !(p2 != 0) [L145] COND FALSE !(p3 != 0) [L150] COND FALSE !(p4 != 0) [L155] COND FALSE !(p5 != 0) [L160] COND FALSE !(p6 != 0) [L165] COND FALSE !(p7 != 0) [L170] COND FALSE !(p8 != 0) [L175] COND FALSE !(p9 != 0) [L180] COND FALSE !(p10 != 0) [L185] COND FALSE !(p11 != 0) [L190] COND FALSE !(p12 != 0) [L195] COND FALSE !(p13 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...