./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/locks/test_locks_11_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_9fa0dc65-8184-48ff-bf81-0d41e0f22fe8/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9fa0dc65-8184-48ff-bf81-0d41e0f22fe8/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9fa0dc65-8184-48ff-bf81-0d41e0f22fe8/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9fa0dc65-8184-48ff-bf81-0d41e0f22fe8/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9fa0dc65-8184-48ff-bf81-0d41e0f22fe8/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9fa0dc65-8184-48ff-bf81-0d41e0f22fe8/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 56f043bec3037ec37b4a132611abd4a337934428 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 12:18:20,276 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:18:20,277 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:18:20,283 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:18:20,284 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:18:20,284 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:18:20,285 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:18:20,286 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:18:20,287 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:18:20,288 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:18:20,289 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:18:20,289 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:18:20,289 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:18:20,290 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:18:20,290 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:18:20,291 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:18:20,291 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:18:20,292 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:18:20,293 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:18:20,294 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:18:20,294 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:18:20,295 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:18:20,297 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:18:20,297 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:18:20,297 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:18:20,298 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:18:20,298 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:18:20,299 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:18:20,299 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:18:20,300 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:18:20,300 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:18:20,300 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:18:20,300 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:18:20,300 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:18:20,301 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:18:20,301 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:18:20,301 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9fa0dc65-8184-48ff-bf81-0d41e0f22fe8/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 12:18:20,310 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:18:20,311 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:18:20,312 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:18:20,312 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:18:20,312 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 12:18:20,312 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 12:18:20,312 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 12:18:20,312 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 12:18:20,312 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 12:18:20,312 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 12:18:20,313 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 12:18:20,313 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:18:20,313 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 12:18:20,313 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 12:18:20,313 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:18:20,313 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 12:18:20,313 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:18:20,314 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 12:18:20,314 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 12:18:20,314 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 12:18:20,314 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 12:18:20,314 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:18:20,314 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 12:18:20,314 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 12:18:20,315 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:18:20,315 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:18:20,315 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 12:18:20,315 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:18:20,315 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 12:18:20,315 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 12:18:20,316 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 12:18:20,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_9fa0dc65-8184-48ff-bf81-0d41e0f22fe8/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 -> 56f043bec3037ec37b4a132611abd4a337934428 [2018-11-10 12:18:20,339 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:18:20,348 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:18:20,351 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:18:20,352 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:18:20,352 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:18:20,352 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9fa0dc65-8184-48ff-bf81-0d41e0f22fe8/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 12:18:20,396 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9fa0dc65-8184-48ff-bf81-0d41e0f22fe8/bin-2019/uautomizer/data/5331d9494/17283176955c4cf295f9aa25dee0b6f6/FLAGc9053225f [2018-11-10 12:18:20,800 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:18:20,801 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9fa0dc65-8184-48ff-bf81-0d41e0f22fe8/sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 12:18:20,806 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9fa0dc65-8184-48ff-bf81-0d41e0f22fe8/bin-2019/uautomizer/data/5331d9494/17283176955c4cf295f9aa25dee0b6f6/FLAGc9053225f [2018-11-10 12:18:20,816 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9fa0dc65-8184-48ff-bf81-0d41e0f22fe8/bin-2019/uautomizer/data/5331d9494/17283176955c4cf295f9aa25dee0b6f6 [2018-11-10 12:18:20,819 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:18:20,820 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 12:18:20,821 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:18:20,821 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:18:20,824 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:18:20,825 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:18:20" (1/1) ... [2018-11-10 12:18:20,827 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 12:18:20, skipping insertion in model container [2018-11-10 12:18:20,827 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:18:20" (1/1) ... [2018-11-10 12:18:20,836 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:18:20,854 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:18:20,973 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:18:20,976 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:18:20,991 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:18:20,999 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:18:20,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:18:20 WrapperNode [2018-11-10 12:18:20,999 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:18:21,000 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 12:18:21,000 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 12:18:21,000 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 12:18:21,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:18:20" (1/1) ... [2018-11-10 12:18:21,010 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:18:20" (1/1) ... [2018-11-10 12:18:21,021 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 12:18:21,022 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:18:21,022 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:18:21,022 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:18:21,028 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:18:20" (1/1) ... [2018-11-10 12:18:21,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:18:20" (1/1) ... [2018-11-10 12:18:21,029 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:18:20" (1/1) ... [2018-11-10 12:18:21,029 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:18:20" (1/1) ... [2018-11-10 12:18:21,030 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:18:20" (1/1) ... [2018-11-10 12:18:21,033 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:18:20" (1/1) ... [2018-11-10 12:18:21,034 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:18:20" (1/1) ... [2018-11-10 12:18:21,035 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:18:21,036 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:18:21,036 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:18:21,036 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:18:21,036 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:18:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9fa0dc65-8184-48ff-bf81-0d41e0f22fe8/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 12:18:21,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:18:21,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:18:21,283 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:18:21,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:18:21 BoogieIcfgContainer [2018-11-10 12:18:21,283 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:18:21,284 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 12:18:21,284 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 12:18:21,287 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 12:18:21,287 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:18:21,287 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 12:18:20" (1/3) ... [2018-11-10 12:18:21,288 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d8b41e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:18:21, skipping insertion in model container [2018-11-10 12:18:21,288 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:18:21,288 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:18:20" (2/3) ... [2018-11-10 12:18:21,289 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d8b41e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:18:21, skipping insertion in model container [2018-11-10 12:18:21,289 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:18:21,289 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:18:21" (3/3) ... [2018-11-10 12:18:21,290 INFO L375 chiAutomizerObserver]: Analyzing ICFG test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 12:18:21,335 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 12:18:21,335 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 12:18:21,335 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 12:18:21,335 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 12:18:21,336 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:18:21,336 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:18:21,336 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 12:18:21,336 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:18:21,336 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 12:18:21,347 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states. [2018-11-10 12:18:21,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2018-11-10 12:18:21,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:18:21,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:18:21,369 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 12:18:21,369 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] [2018-11-10 12:18:21,369 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 12:18:21,369 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states. [2018-11-10 12:18:21,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2018-11-10 12:18:21,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:18:21,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:18:21,372 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 12:18:21,372 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] [2018-11-10 12:18:21,377 INFO L793 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 15#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_~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_~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;havoc main_~cond~0; 31#L167-1true [2018-11-10 12:18:21,377 INFO L795 eck$LassoCheckResult]: Loop: 31#L167-1true assume true; 12#L42-1true assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 40#L44true 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; 7#L71true assume main_~p1~0 != 0;main_~lk1~0 := 1; 4#L71-2true assume main_~p2~0 != 0;main_~lk2~0 := 1; 37#L75-1true assume main_~p3~0 != 0;main_~lk3~0 := 1; 45#L79-1true assume main_~p4~0 != 0;main_~lk4~0 := 1; 33#L83-1true assume main_~p5~0 != 0;main_~lk5~0 := 1; 18#L87-1true assume main_~p6~0 != 0;main_~lk6~0 := 1; 3#L91-1true assume main_~p7~0 != 0;main_~lk7~0 := 1; 11#L95-1true assume !(main_~p8~0 != 0); 42#L99-1true assume main_~p9~0 != 0;main_~lk9~0 := 1; 32#L103-1true assume main_~p10~0 != 0;main_~lk10~0 := 1; 16#L107-1true assume main_~p11~0 != 0;main_~lk11~0 := 1; 25#L111-1true assume !(main_~p1~0 != 0); 13#L117-1true assume !(main_~p2~0 != 0); 26#L122-1true assume !(main_~p3~0 != 0); 35#L127-1true assume !(main_~p4~0 != 0); 43#L132-1true assume !(main_~p5~0 != 0); 9#L137-1true assume !(main_~p6~0 != 0); 23#L142-1true assume !(main_~p7~0 != 0); 34#L147-1true assume !(main_~p8~0 != 0); 41#L152-1true assume !(main_~p9~0 != 0); 6#L157-1true assume !(main_~p10~0 != 0); 20#L162-1true assume !(main_~p11~0 != 0); 31#L167-1true [2018-11-10 12:18:21,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:18:21,381 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 12:18:21,382 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:18:21,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:18:21,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:18:21,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:18:21,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:18:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:18:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:18:21,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:18:21,447 INFO L82 PathProgramCache]: Analyzing trace with hash 880454670, now seen corresponding path program 1 times [2018-11-10 12:18:21,447 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:18:21,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:18:21,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:18:21,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:18:21,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:18:21,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:18:21,505 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 12:18:21,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:18:21,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:18:21,512 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:18:21,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:18:21,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:18:21,527 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 3 states. [2018-11-10 12:18:21,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:18:21,556 INFO L93 Difference]: Finished difference Result 83 states and 144 transitions. [2018-11-10 12:18:21,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:18:21,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 144 transitions. [2018-11-10 12:18:21,559 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 71 [2018-11-10 12:18:21,562 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 73 states and 115 transitions. [2018-11-10 12:18:21,563 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2018-11-10 12:18:21,563 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2018-11-10 12:18:21,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 115 transitions. [2018-11-10 12:18:21,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:18:21,565 INFO L705 BuchiCegarLoop]: Abstraction has 73 states and 115 transitions. [2018-11-10 12:18:21,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 115 transitions. [2018-11-10 12:18:21,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-11-10 12:18:21,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-10 12:18:21,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 115 transitions. [2018-11-10 12:18:21,589 INFO L728 BuchiCegarLoop]: Abstraction has 73 states and 115 transitions. [2018-11-10 12:18:21,589 INFO L608 BuchiCegarLoop]: Abstraction has 73 states and 115 transitions. [2018-11-10 12:18:21,589 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 12:18:21,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 115 transitions. [2018-11-10 12:18:21,590 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 71 [2018-11-10 12:18:21,590 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:18:21,590 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:18:21,591 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 12:18:21,591 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] [2018-11-10 12:18:21,591 INFO L793 eck$LassoCheckResult]: Stem: 180#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 159#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_~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_~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;havoc main_~cond~0; 149#L167-1 [2018-11-10 12:18:21,591 INFO L795 eck$LassoCheckResult]: Loop: 149#L167-1 assume true; 190#L42-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 189#L44 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; 188#L71 assume !(main_~p1~0 != 0); 187#L71-2 assume main_~p2~0 != 0;main_~lk2~0 := 1; 178#L75-1 assume main_~p3~0 != 0;main_~lk3~0 := 1; 179#L79-1 assume main_~p4~0 != 0;main_~lk4~0 := 1; 184#L83-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 163#L87-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 135#L91-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 136#L95-1 assume !(main_~p8~0 != 0); 182#L99-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 183#L103-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 160#L107-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 161#L111-1 assume !(main_~p1~0 != 0); 154#L117-1 assume !(main_~p2~0 != 0); 156#L122-1 assume !(main_~p3~0 != 0); 168#L127-1 assume !(main_~p4~0 != 0); 140#L132-1 assume !(main_~p5~0 != 0); 145#L137-1 assume !(main_~p6~0 != 0); 146#L142-1 assume !(main_~p7~0 != 0); 158#L147-1 assume !(main_~p8~0 != 0); 171#L152-1 assume !(main_~p9~0 != 0); 192#L157-1 assume !(main_~p10~0 != 0); 166#L162-1 assume !(main_~p11~0 != 0); 149#L167-1 [2018-11-10 12:18:21,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:18:21,592 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-10 12:18:21,592 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:18:21,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:18:21,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:18:21,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:18:21,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:18:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:18:21,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:18:21,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:18:21,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1099309388, now seen corresponding path program 1 times [2018-11-10 12:18:21,597 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:18:21,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:18:21,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:18:21,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:18:21,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:18:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:18:21,630 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 12:18:21,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:18:21,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:18:21,630 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:18:21,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:18:21,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:18:21,631 INFO L87 Difference]: Start difference. First operand 73 states and 115 transitions. cyclomatic complexity: 44 Second operand 3 states. [2018-11-10 12:18:21,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:18:21,651 INFO L93 Difference]: Finished difference Result 142 states and 222 transitions. [2018-11-10 12:18:21,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:18:21,652 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 222 transitions. [2018-11-10 12:18:21,654 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 140 [2018-11-10 12:18:21,656 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 142 states and 222 transitions. [2018-11-10 12:18:21,656 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 142 [2018-11-10 12:18:21,656 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 142 [2018-11-10 12:18:21,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 142 states and 222 transitions. [2018-11-10 12:18:21,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:18:21,657 INFO L705 BuchiCegarLoop]: Abstraction has 142 states and 222 transitions. [2018-11-10 12:18:21,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states and 222 transitions. [2018-11-10 12:18:21,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-11-10 12:18:21,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-11-10 12:18:21,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 222 transitions. [2018-11-10 12:18:21,665 INFO L728 BuchiCegarLoop]: Abstraction has 142 states and 222 transitions. [2018-11-10 12:18:21,665 INFO L608 BuchiCegarLoop]: Abstraction has 142 states and 222 transitions. [2018-11-10 12:18:21,665 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 12:18:21,666 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states and 222 transitions. [2018-11-10 12:18:21,667 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 140 [2018-11-10 12:18:21,667 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:18:21,667 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:18:21,668 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 12:18:21,668 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] [2018-11-10 12:18:21,668 INFO L793 eck$LassoCheckResult]: Stem: 403#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 379#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_~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_~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;havoc main_~cond~0; 380#L167-1 [2018-11-10 12:18:21,668 INFO L795 eck$LassoCheckResult]: Loop: 380#L167-1 assume true; 416#L42-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 414#L44 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; 411#L71 assume !(main_~p1~0 != 0); 412#L71-2 assume !(main_~p2~0 != 0); 467#L75-1 assume main_~p3~0 != 0;main_~lk3~0 := 1; 466#L79-1 assume main_~p4~0 != 0;main_~lk4~0 := 1; 465#L83-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 464#L87-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 463#L91-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 462#L95-1 assume !(main_~p8~0 != 0); 461#L99-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 460#L103-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 459#L107-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 457#L111-1 assume !(main_~p1~0 != 0); 455#L117-1 assume !(main_~p2~0 != 0); 453#L122-1 assume !(main_~p3~0 != 0); 449#L127-1 assume !(main_~p4~0 != 0); 445#L132-1 assume !(main_~p5~0 != 0); 441#L137-1 assume !(main_~p6~0 != 0); 437#L142-1 assume !(main_~p7~0 != 0); 433#L147-1 assume !(main_~p8~0 != 0); 429#L152-1 assume !(main_~p9~0 != 0); 424#L157-1 assume !(main_~p10~0 != 0); 421#L162-1 assume !(main_~p11~0 != 0); 380#L167-1 [2018-11-10 12:18:21,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:18:21,669 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-10 12:18:21,669 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:18:21,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:18:21,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:18:21,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:18:21,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:18:21,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:18:21,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:18:21,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:18:21,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1522011214, now seen corresponding path program 1 times [2018-11-10 12:18:21,673 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:18:21,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:18:21,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:18:21,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:18:21,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:18:21,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:18:21,700 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 12:18:21,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:18:21,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:18:21,701 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:18:21,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:18:21,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:18:21,701 INFO L87 Difference]: Start difference. First operand 142 states and 222 transitions. cyclomatic complexity: 84 Second operand 3 states. [2018-11-10 12:18:21,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:18:21,732 INFO L93 Difference]: Finished difference Result 278 states and 430 transitions. [2018-11-10 12:18:21,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:18:21,732 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 278 states and 430 transitions. [2018-11-10 12:18:21,735 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 276 [2018-11-10 12:18:21,736 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 278 states to 278 states and 430 transitions. [2018-11-10 12:18:21,737 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 278 [2018-11-10 12:18:21,737 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 278 [2018-11-10 12:18:21,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 278 states and 430 transitions. [2018-11-10 12:18:21,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:18:21,738 INFO L705 BuchiCegarLoop]: Abstraction has 278 states and 430 transitions. [2018-11-10 12:18:21,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states and 430 transitions. [2018-11-10 12:18:21,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2018-11-10 12:18:21,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-11-10 12:18:21,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 430 transitions. [2018-11-10 12:18:21,751 INFO L728 BuchiCegarLoop]: Abstraction has 278 states and 430 transitions. [2018-11-10 12:18:21,751 INFO L608 BuchiCegarLoop]: Abstraction has 278 states and 430 transitions. [2018-11-10 12:18:21,751 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 12:18:21,751 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 278 states and 430 transitions. [2018-11-10 12:18:21,753 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 276 [2018-11-10 12:18:21,753 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:18:21,753 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:18:21,753 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 12:18:21,753 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] [2018-11-10 12:18:21,753 INFO L793 eck$LassoCheckResult]: Stem: 827#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 804#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_~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_~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;havoc main_~cond~0; 805#L167-1 [2018-11-10 12:18:21,754 INFO L795 eck$LassoCheckResult]: Loop: 805#L167-1 assume true; 847#L42-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 839#L44 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; 840#L71 assume !(main_~p1~0 != 0); 948#L71-2 assume !(main_~p2~0 != 0); 944#L75-1 assume !(main_~p3~0 != 0); 940#L79-1 assume main_~p4~0 != 0;main_~lk4~0 := 1; 936#L83-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 932#L87-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 928#L91-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 924#L95-1 assume !(main_~p8~0 != 0); 920#L99-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 916#L103-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 912#L107-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 908#L111-1 assume !(main_~p1~0 != 0); 904#L117-1 assume !(main_~p2~0 != 0); 901#L122-1 assume !(main_~p3~0 != 0); 902#L127-1 assume !(main_~p4~0 != 0); 882#L132-1 assume !(main_~p5~0 != 0); 881#L137-1 assume !(main_~p6~0 != 0); 870#L142-1 assume !(main_~p7~0 != 0); 869#L147-1 assume !(main_~p8~0 != 0); 964#L152-1 assume !(main_~p9~0 != 0); 855#L157-1 assume !(main_~p10~0 != 0); 852#L162-1 assume !(main_~p11~0 != 0); 805#L167-1 [2018-11-10 12:18:21,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:18:21,754 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-10 12:18:21,754 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:18:21,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:18:21,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:18:21,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:18:21,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:18:21,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:18:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:18:21,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:18:21,757 INFO L82 PathProgramCache]: Analyzing trace with hash 704362764, now seen corresponding path program 1 times [2018-11-10 12:18:21,757 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:18:21,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:18:21,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:18:21,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:18:21,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:18:21,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:18:21,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 12:18:21,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:18:21,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:18:21,782 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:18:21,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:18:21,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:18:21,782 INFO L87 Difference]: Start difference. First operand 278 states and 430 transitions. cyclomatic complexity: 160 Second operand 3 states. [2018-11-10 12:18:21,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:18:21,796 INFO L93 Difference]: Finished difference Result 546 states and 834 transitions. [2018-11-10 12:18:21,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:18:21,797 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 546 states and 834 transitions. [2018-11-10 12:18:21,799 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 544 [2018-11-10 12:18:21,802 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 546 states to 546 states and 834 transitions. [2018-11-10 12:18:21,802 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 546 [2018-11-10 12:18:21,803 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 546 [2018-11-10 12:18:21,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 546 states and 834 transitions. [2018-11-10 12:18:21,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:18:21,805 INFO L705 BuchiCegarLoop]: Abstraction has 546 states and 834 transitions. [2018-11-10 12:18:21,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states and 834 transitions. [2018-11-10 12:18:21,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 546. [2018-11-10 12:18:21,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2018-11-10 12:18:21,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 834 transitions. [2018-11-10 12:18:21,820 INFO L728 BuchiCegarLoop]: Abstraction has 546 states and 834 transitions. [2018-11-10 12:18:21,820 INFO L608 BuchiCegarLoop]: Abstraction has 546 states and 834 transitions. [2018-11-10 12:18:21,820 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 12:18:21,820 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 546 states and 834 transitions. [2018-11-10 12:18:21,822 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 544 [2018-11-10 12:18:21,822 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:18:21,823 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:18:21,823 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 12:18:21,823 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] [2018-11-10 12:18:21,823 INFO L793 eck$LassoCheckResult]: Stem: 1659#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1635#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_~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_~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;havoc main_~cond~0; 1636#L167-1 [2018-11-10 12:18:21,823 INFO L795 eck$LassoCheckResult]: Loop: 1636#L167-1 assume true; 1819#L42-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 1817#L44 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; 1814#L71 assume !(main_~p1~0 != 0); 1815#L71-2 assume !(main_~p2~0 != 0); 1799#L75-1 assume !(main_~p3~0 != 0); 1801#L79-1 assume !(main_~p4~0 != 0); 1783#L83-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 1784#L87-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 1767#L91-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 1768#L95-1 assume !(main_~p8~0 != 0); 1751#L99-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 1752#L103-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 1735#L107-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 1736#L111-1 assume !(main_~p1~0 != 0); 1853#L117-1 assume !(main_~p2~0 != 0); 1851#L122-1 assume !(main_~p3~0 != 0); 1847#L127-1 assume !(main_~p4~0 != 0); 1844#L132-1 assume !(main_~p5~0 != 0); 1840#L137-1 assume !(main_~p6~0 != 0); 1836#L142-1 assume !(main_~p7~0 != 0); 1834#L147-1 assume !(main_~p8~0 != 0); 1832#L152-1 assume !(main_~p9~0 != 0); 1827#L157-1 assume !(main_~p10~0 != 0); 1824#L162-1 assume !(main_~p11~0 != 0); 1636#L167-1 [2018-11-10 12:18:21,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:18:21,824 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-10 12:18:21,824 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:18:21,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:18:21,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:18:21,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:18:21,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:18:21,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:18:21,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:18:21,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:18:21,827 INFO L82 PathProgramCache]: Analyzing trace with hash -984580978, now seen corresponding path program 1 times [2018-11-10 12:18:21,827 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:18:21,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:18:21,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:18:21,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:18:21,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:18:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:18:21,850 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 12:18:21,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:18:21,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:18:21,850 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:18:21,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:18:21,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:18:21,851 INFO L87 Difference]: Start difference. First operand 546 states and 834 transitions. cyclomatic complexity: 304 Second operand 3 states. [2018-11-10 12:18:21,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:18:21,884 INFO L93 Difference]: Finished difference Result 1074 states and 1618 transitions. [2018-11-10 12:18:21,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:18:21,885 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1074 states and 1618 transitions. [2018-11-10 12:18:21,892 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1072 [2018-11-10 12:18:21,895 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1074 states to 1074 states and 1618 transitions. [2018-11-10 12:18:21,895 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1074 [2018-11-10 12:18:21,896 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1074 [2018-11-10 12:18:21,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1074 states and 1618 transitions. [2018-11-10 12:18:21,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:18:21,897 INFO L705 BuchiCegarLoop]: Abstraction has 1074 states and 1618 transitions. [2018-11-10 12:18:21,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states and 1618 transitions. [2018-11-10 12:18:21,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 1074. [2018-11-10 12:18:21,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1074 states. [2018-11-10 12:18:21,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 1618 transitions. [2018-11-10 12:18:21,910 INFO L728 BuchiCegarLoop]: Abstraction has 1074 states and 1618 transitions. [2018-11-10 12:18:21,910 INFO L608 BuchiCegarLoop]: Abstraction has 1074 states and 1618 transitions. [2018-11-10 12:18:21,910 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 12:18:21,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1074 states and 1618 transitions. [2018-11-10 12:18:21,913 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1072 [2018-11-10 12:18:21,913 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:18:21,913 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:18:21,914 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 12:18:21,914 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] [2018-11-10 12:18:21,914 INFO L793 eck$LassoCheckResult]: Stem: 3282#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3260#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_~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_~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;havoc main_~cond~0; 3261#L167-1 [2018-11-10 12:18:21,914 INFO L795 eck$LassoCheckResult]: Loop: 3261#L167-1 assume true; 3632#L42-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 3633#L44 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; 3682#L71 assume !(main_~p1~0 != 0); 3679#L71-2 assume !(main_~p2~0 != 0); 3678#L75-1 assume !(main_~p3~0 != 0); 3675#L79-1 assume !(main_~p4~0 != 0); 3676#L83-1 assume !(main_~p5~0 != 0); 3674#L87-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 3671#L91-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 3520#L95-1 assume !(main_~p8~0 != 0); 3521#L99-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 3512#L103-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 3509#L107-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 3505#L111-1 assume !(main_~p1~0 != 0); 3500#L117-1 assume !(main_~p2~0 != 0); 3498#L122-1 assume !(main_~p3~0 != 0); 3499#L127-1 assume !(main_~p4~0 != 0); 3653#L132-1 assume !(main_~p5~0 != 0); 3655#L137-1 assume !(main_~p6~0 != 0); 3649#L142-1 assume !(main_~p7~0 != 0); 3648#L147-1 assume !(main_~p8~0 != 0); 3643#L152-1 assume !(main_~p9~0 != 0); 3642#L157-1 assume !(main_~p10~0 != 0); 3637#L162-1 assume !(main_~p11~0 != 0); 3261#L167-1 [2018-11-10 12:18:21,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:18:21,915 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-10 12:18:21,915 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:18:21,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:18:21,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:18:21,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:18:21,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:18:21,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:18:21,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:18:21,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:18:21,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1316241612, now seen corresponding path program 1 times [2018-11-10 12:18:21,918 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:18:21,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:18:21,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:18:21,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:18:21,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:18:21,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:18:21,953 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 12:18:21,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:18:21,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:18:21,954 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:18:21,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:18:21,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:18:21,954 INFO L87 Difference]: Start difference. First operand 1074 states and 1618 transitions. cyclomatic complexity: 576 Second operand 3 states. [2018-11-10 12:18:21,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:18:21,971 INFO L93 Difference]: Finished difference Result 2114 states and 3138 transitions. [2018-11-10 12:18:21,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:18:21,972 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2114 states and 3138 transitions. [2018-11-10 12:18:21,983 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2112 [2018-11-10 12:18:21,987 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2114 states to 2114 states and 3138 transitions. [2018-11-10 12:18:21,987 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2114 [2018-11-10 12:18:21,989 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2114 [2018-11-10 12:18:21,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2114 states and 3138 transitions. [2018-11-10 12:18:21,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:18:21,991 INFO L705 BuchiCegarLoop]: Abstraction has 2114 states and 3138 transitions. [2018-11-10 12:18:21,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2114 states and 3138 transitions. [2018-11-10 12:18:22,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2114 to 2114. [2018-11-10 12:18:22,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2114 states. [2018-11-10 12:18:22,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 3138 transitions. [2018-11-10 12:18:22,012 INFO L728 BuchiCegarLoop]: Abstraction has 2114 states and 3138 transitions. [2018-11-10 12:18:22,012 INFO L608 BuchiCegarLoop]: Abstraction has 2114 states and 3138 transitions. [2018-11-10 12:18:22,012 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 12:18:22,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2114 states and 3138 transitions. [2018-11-10 12:18:22,019 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2112 [2018-11-10 12:18:22,019 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:18:22,019 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:18:22,020 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 12:18:22,020 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] [2018-11-10 12:18:22,020 INFO L793 eck$LassoCheckResult]: Stem: 6484#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 6454#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_~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_~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;havoc main_~cond~0; 6455#L167-1 [2018-11-10 12:18:22,020 INFO L795 eck$LassoCheckResult]: Loop: 6455#L167-1 assume true; 6865#L42-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 6863#L44 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; 6859#L71 assume !(main_~p1~0 != 0); 6850#L71-2 assume !(main_~p2~0 != 0); 6852#L75-1 assume !(main_~p3~0 != 0); 6855#L79-1 assume !(main_~p4~0 != 0); 6847#L83-1 assume !(main_~p5~0 != 0); 6849#L87-1 assume !(main_~p6~0 != 0); 6690#L91-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 6691#L95-1 assume !(main_~p8~0 != 0); 6682#L99-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 6683#L103-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 6900#L107-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 6897#L111-1 assume !(main_~p1~0 != 0); 6896#L117-1 assume !(main_~p2~0 != 0); 6853#L122-1 assume !(main_~p3~0 != 0); 6854#L127-1 assume !(main_~p4~0 != 0); 6892#L132-1 assume !(main_~p5~0 != 0); 6888#L137-1 assume !(main_~p6~0 != 0); 6885#L142-1 assume !(main_~p7~0 != 0); 6881#L147-1 assume !(main_~p8~0 != 0); 6877#L152-1 assume !(main_~p9~0 != 0); 6872#L157-1 assume !(main_~p10~0 != 0); 6869#L162-1 assume !(main_~p11~0 != 0); 6455#L167-1 [2018-11-10 12:18:22,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:18:22,020 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-10 12:18:22,021 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:18:22,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:18:22,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:18:22,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:18:22,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:18:22,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:18:22,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:18:22,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:18:22,024 INFO L82 PathProgramCache]: Analyzing trace with hash -272106290, now seen corresponding path program 1 times [2018-11-10 12:18:22,024 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:18:22,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:18:22,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:18:22,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:18:22,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:18:22,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:18:22,045 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 12:18:22,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:18:22,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:18:22,046 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:18:22,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:18:22,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:18:22,046 INFO L87 Difference]: Start difference. First operand 2114 states and 3138 transitions. cyclomatic complexity: 1088 Second operand 3 states. [2018-11-10 12:18:22,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:18:22,077 INFO L93 Difference]: Finished difference Result 4162 states and 6082 transitions. [2018-11-10 12:18:22,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:18:22,077 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4162 states and 6082 transitions. [2018-11-10 12:18:22,093 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4160 [2018-11-10 12:18:22,104 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4162 states to 4162 states and 6082 transitions. [2018-11-10 12:18:22,105 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4162 [2018-11-10 12:18:22,107 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4162 [2018-11-10 12:18:22,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4162 states and 6082 transitions. [2018-11-10 12:18:22,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:18:22,111 INFO L705 BuchiCegarLoop]: Abstraction has 4162 states and 6082 transitions. [2018-11-10 12:18:22,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4162 states and 6082 transitions. [2018-11-10 12:18:22,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4162 to 4162. [2018-11-10 12:18:22,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4162 states. [2018-11-10 12:18:22,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4162 states to 4162 states and 6082 transitions. [2018-11-10 12:18:22,160 INFO L728 BuchiCegarLoop]: Abstraction has 4162 states and 6082 transitions. [2018-11-10 12:18:22,160 INFO L608 BuchiCegarLoop]: Abstraction has 4162 states and 6082 transitions. [2018-11-10 12:18:22,160 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 12:18:22,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4162 states and 6082 transitions. [2018-11-10 12:18:22,171 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4160 [2018-11-10 12:18:22,172 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:18:22,172 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:18:22,172 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 12:18:22,172 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] [2018-11-10 12:18:22,173 INFO L793 eck$LassoCheckResult]: Stem: 12764#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 12736#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_~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_~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;havoc main_~cond~0; 12737#L167-1 [2018-11-10 12:18:22,173 INFO L795 eck$LassoCheckResult]: Loop: 12737#L167-1 assume true; 12940#L42-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 12938#L44 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; 12935#L71 assume !(main_~p1~0 != 0); 12936#L71-2 assume !(main_~p2~0 != 0); 12915#L75-1 assume !(main_~p3~0 != 0); 12917#L79-1 assume !(main_~p4~0 != 0); 12895#L83-1 assume !(main_~p5~0 != 0); 12897#L87-1 assume !(main_~p6~0 != 0); 12871#L91-1 assume !(main_~p7~0 != 0); 12873#L95-1 assume !(main_~p8~0 != 0); 12855#L99-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 12856#L103-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 12840#L107-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 12841#L111-1 assume !(main_~p1~0 != 0); 12974#L117-1 assume !(main_~p2~0 != 0); 12972#L122-1 assume !(main_~p3~0 != 0); 12970#L127-1 assume !(main_~p4~0 != 0); 12968#L132-1 assume !(main_~p5~0 != 0); 12966#L137-1 assume !(main_~p6~0 != 0); 12962#L142-1 assume !(main_~p7~0 != 0); 12959#L147-1 assume !(main_~p8~0 != 0); 12955#L152-1 assume !(main_~p9~0 != 0); 12948#L157-1 assume !(main_~p10~0 != 0); 12945#L162-1 assume !(main_~p11~0 != 0); 12737#L167-1 [2018-11-10 12:18:22,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:18:22,173 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2018-11-10 12:18:22,173 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:18:22,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:18:22,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:18:22,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:18:22,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:18:22,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:18:22,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:18:22,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:18:22,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1293174644, now seen corresponding path program 1 times [2018-11-10 12:18:22,177 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:18:22,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:18:22,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:18:22,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:18:22,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:18:22,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:18:22,204 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 12:18:22,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:18:22,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:18:22,205 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:18:22,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:18:22,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:18:22,205 INFO L87 Difference]: Start difference. First operand 4162 states and 6082 transitions. cyclomatic complexity: 2048 Second operand 3 states. [2018-11-10 12:18:22,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:18:22,235 INFO L93 Difference]: Finished difference Result 8194 states and 11778 transitions. [2018-11-10 12:18:22,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:18:22,235 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8194 states and 11778 transitions. [2018-11-10 12:18:22,262 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 8192 [2018-11-10 12:18:22,284 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8194 states to 8194 states and 11778 transitions. [2018-11-10 12:18:22,284 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8194 [2018-11-10 12:18:22,289 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8194 [2018-11-10 12:18:22,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8194 states and 11778 transitions. [2018-11-10 12:18:22,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:18:22,295 INFO L705 BuchiCegarLoop]: Abstraction has 8194 states and 11778 transitions. [2018-11-10 12:18:22,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8194 states and 11778 transitions. [2018-11-10 12:18:22,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8194 to 8194. [2018-11-10 12:18:22,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8194 states. [2018-11-10 12:18:22,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8194 states to 8194 states and 11778 transitions. [2018-11-10 12:18:22,419 INFO L728 BuchiCegarLoop]: Abstraction has 8194 states and 11778 transitions. [2018-11-10 12:18:22,419 INFO L608 BuchiCegarLoop]: Abstraction has 8194 states and 11778 transitions. [2018-11-10 12:18:22,419 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 12:18:22,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8194 states and 11778 transitions. [2018-11-10 12:18:22,441 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 8192 [2018-11-10 12:18:22,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:18:22,441 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:18:22,441 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 12:18:22,441 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] [2018-11-10 12:18:22,442 INFO L793 eck$LassoCheckResult]: Stem: 25124#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 25098#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_~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_~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;havoc main_~cond~0; 25099#L167-1 [2018-11-10 12:18:22,442 INFO L795 eck$LassoCheckResult]: Loop: 25099#L167-1 assume true; 25477#L42-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 25476#L44 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; 25474#L71 assume !(main_~p1~0 != 0); 25472#L71-2 assume !(main_~p2~0 != 0); 25470#L75-1 assume !(main_~p3~0 != 0); 25468#L79-1 assume !(main_~p4~0 != 0); 25466#L83-1 assume !(main_~p5~0 != 0); 25464#L87-1 assume !(main_~p6~0 != 0); 25462#L91-1 assume !(main_~p7~0 != 0); 25463#L95-1 assume !(main_~p8~0 != 0); 25450#L99-1 assume !(main_~p9~0 != 0); 25452#L103-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 25420#L107-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 25421#L111-1 assume !(main_~p1~0 != 0); 25400#L117-1 assume !(main_~p2~0 != 0); 25402#L122-1 assume !(main_~p3~0 != 0); 25379#L127-1 assume !(main_~p4~0 != 0); 25381#L132-1 assume !(main_~p5~0 != 0); 25357#L137-1 assume !(main_~p6~0 != 0); 25358#L142-1 assume !(main_~p7~0 != 0); 25485#L147-1 assume !(main_~p8~0 != 0); 25482#L152-1 assume !(main_~p9~0 != 0); 25480#L157-1 assume !(main_~p10~0 != 0); 25479#L162-1 assume !(main_~p11~0 != 0); 25099#L167-1 [2018-11-10 12:18:22,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:18:22,442 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2018-11-10 12:18:22,442 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:18:22,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:18:22,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:18:22,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:18:22,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:18:22,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:18:22,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:18:22,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:18:22,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1990675402, now seen corresponding path program 1 times [2018-11-10 12:18:22,446 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:18:22,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:18:22,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:18:22,446 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:18:22,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:18:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:18:22,465 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 12:18:22,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:18:22,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:18:22,466 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:18:22,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:18:22,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:18:22,466 INFO L87 Difference]: Start difference. First operand 8194 states and 11778 transitions. cyclomatic complexity: 3840 Second operand 3 states. [2018-11-10 12:18:22,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:18:22,507 INFO L93 Difference]: Finished difference Result 16130 states and 22786 transitions. [2018-11-10 12:18:22,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:18:22,507 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16130 states and 22786 transitions. [2018-11-10 12:18:22,566 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 16128 [2018-11-10 12:18:22,619 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16130 states to 16130 states and 22786 transitions. [2018-11-10 12:18:22,619 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16130 [2018-11-10 12:18:22,626 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16130 [2018-11-10 12:18:22,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16130 states and 22786 transitions. [2018-11-10 12:18:22,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:18:22,640 INFO L705 BuchiCegarLoop]: Abstraction has 16130 states and 22786 transitions. [2018-11-10 12:18:22,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16130 states and 22786 transitions. [2018-11-10 12:18:22,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16130 to 16130. [2018-11-10 12:18:22,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16130 states. [2018-11-10 12:18:22,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16130 states to 16130 states and 22786 transitions. [2018-11-10 12:18:22,846 INFO L728 BuchiCegarLoop]: Abstraction has 16130 states and 22786 transitions. [2018-11-10 12:18:22,846 INFO L608 BuchiCegarLoop]: Abstraction has 16130 states and 22786 transitions. [2018-11-10 12:18:22,846 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 12:18:22,846 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16130 states and 22786 transitions. [2018-11-10 12:18:22,890 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 16128 [2018-11-10 12:18:22,890 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:18:22,890 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:18:22,890 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 12:18:22,890 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] [2018-11-10 12:18:22,891 INFO L793 eck$LassoCheckResult]: Stem: 49454#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 49426#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_~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_~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;havoc main_~cond~0; 49427#L167-1 [2018-11-10 12:18:22,891 INFO L795 eck$LassoCheckResult]: Loop: 49427#L167-1 assume true; 49847#L42-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 49840#L44 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; 49841#L71 assume !(main_~p1~0 != 0); 49829#L71-2 assume !(main_~p2~0 != 0); 49831#L75-1 assume !(main_~p3~0 != 0); 49772#L79-1 assume !(main_~p4~0 != 0); 49773#L83-1 assume !(main_~p5~0 != 0); 49862#L87-1 assume !(main_~p6~0 != 0); 49858#L91-1 assume !(main_~p7~0 != 0); 49855#L95-1 assume !(main_~p8~0 != 0); 49850#L99-1 assume !(main_~p9~0 != 0); 49845#L103-1 assume !(main_~p10~0 != 0); 49842#L107-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 49838#L111-1 assume !(main_~p1~0 != 0); 49839#L117-1 assume !(main_~p2~0 != 0); 50679#L122-1 assume !(main_~p3~0 != 0); 49659#L127-1 assume !(main_~p4~0 != 0); 49660#L132-1 assume !(main_~p5~0 != 0); 49807#L137-1 assume !(main_~p6~0 != 0); 49624#L142-1 assume !(main_~p7~0 != 0); 49626#L147-1 assume !(main_~p8~0 != 0); 49795#L152-1 assume !(main_~p9~0 != 0); 49873#L157-1 assume !(main_~p10~0 != 0); 49870#L162-1 assume !(main_~p11~0 != 0); 49427#L167-1 [2018-11-10 12:18:22,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:18:22,891 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2018-11-10 12:18:22,891 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:18:22,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:18:22,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:18:22,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:18:22,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:18:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:18:22,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:18:22,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:18:22,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1403869388, now seen corresponding path program 1 times [2018-11-10 12:18:22,894 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:18:22,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:18:22,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:18:22,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:18:22,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:18:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:18:22,911 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 12:18:22,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:18:22,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 12:18:22,912 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:18:22,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:18:22,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:18:22,912 INFO L87 Difference]: Start difference. First operand 16130 states and 22786 transitions. cyclomatic complexity: 7168 Second operand 3 states. [2018-11-10 12:18:22,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:18:22,983 INFO L93 Difference]: Finished difference Result 31746 states and 44034 transitions. [2018-11-10 12:18:22,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:18:22,983 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31746 states and 44034 transitions. [2018-11-10 12:18:23,146 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 31744 [2018-11-10 12:18:23,231 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31746 states to 31746 states and 44034 transitions. [2018-11-10 12:18:23,231 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31746 [2018-11-10 12:18:23,246 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31746 [2018-11-10 12:18:23,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31746 states and 44034 transitions. [2018-11-10 12:18:23,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:18:23,268 INFO L705 BuchiCegarLoop]: Abstraction has 31746 states and 44034 transitions. [2018-11-10 12:18:23,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31746 states and 44034 transitions. [2018-11-10 12:18:23,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31746 to 31746. [2018-11-10 12:18:23,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31746 states. [2018-11-10 12:18:23,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31746 states to 31746 states and 44034 transitions. [2018-11-10 12:18:23,570 INFO L728 BuchiCegarLoop]: Abstraction has 31746 states and 44034 transitions. [2018-11-10 12:18:23,570 INFO L608 BuchiCegarLoop]: Abstraction has 31746 states and 44034 transitions. [2018-11-10 12:18:23,570 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 12:18:23,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31746 states and 44034 transitions. [2018-11-10 12:18:23,644 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 31744 [2018-11-10 12:18:23,645 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:18:23,645 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:18:23,645 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 12:18:23,645 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] [2018-11-10 12:18:23,646 INFO L793 eck$LassoCheckResult]: Stem: 97336#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 97309#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_~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_~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;havoc main_~cond~0; 97310#L167-1 [2018-11-10 12:18:23,646 INFO L795 eck$LassoCheckResult]: Loop: 97310#L167-1 assume true; 97615#L42-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 97614#L44 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; 97612#L71 assume !(main_~p1~0 != 0); 97610#L71-2 assume !(main_~p2~0 != 0); 97608#L75-1 assume !(main_~p3~0 != 0); 97606#L79-1 assume !(main_~p4~0 != 0); 97604#L83-1 assume !(main_~p5~0 != 0); 97602#L87-1 assume !(main_~p6~0 != 0); 97600#L91-1 assume !(main_~p7~0 != 0); 97599#L95-1 assume !(main_~p8~0 != 0); 97597#L99-1 assume !(main_~p9~0 != 0); 97595#L103-1 assume !(main_~p10~0 != 0); 97593#L107-1 assume !(main_~p11~0 != 0); 97594#L111-1 assume !(main_~p1~0 != 0); 97568#L117-1 assume !(main_~p2~0 != 0); 97570#L122-1 assume !(main_~p3~0 != 0); 97544#L127-1 assume !(main_~p4~0 != 0); 97546#L132-1 assume !(main_~p5~0 != 0); 97518#L137-1 assume !(main_~p6~0 != 0); 97519#L142-1 assume !(main_~p7~0 != 0); 97500#L147-1 assume !(main_~p8~0 != 0); 97499#L152-1 assume !(main_~p9~0 != 0); 97447#L157-1 assume !(main_~p10~0 != 0); 97448#L162-1 assume !(main_~p11~0 != 0); 97310#L167-1 [2018-11-10 12:18:23,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:18:23,646 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2018-11-10 12:18:23,646 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:18:23,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:18:23,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:18:23,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:18:23,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:18:23,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:18:23,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:18:23,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:18:23,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1662034826, now seen corresponding path program 1 times [2018-11-10 12:18:23,650 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:18:23,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:18:23,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:18:23,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:18:23,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:18:23,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:18:23,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:18:23,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:18:23,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1438318088, now seen corresponding path program 1 times [2018-11-10 12:18:23,661 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:18:23,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:18:23,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:18:23,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:18:23,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:18:23,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:18:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:18:23,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 12:18:23 BoogieIcfgContainer [2018-11-10 12:18:23,874 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 12:18:23,874 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:18:23,874 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:18:23,874 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:18:23,875 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:18:21" (3/4) ... [2018-11-10 12:18:23,877 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-10 12:18:23,919 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9fa0dc65-8184-48ff-bf81-0d41e0f22fe8/bin-2019/uautomizer/witness.graphml [2018-11-10 12:18:23,919 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:18:23,920 INFO L168 Benchmark]: Toolchain (without parser) took 3101.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 218.6 MB). Free memory was 959.2 MB in the beginning and 863.9 MB in the end (delta: 95.3 MB). Peak memory consumption was 313.9 MB. Max. memory is 11.5 GB. [2018-11-10 12:18:23,922 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:18:23,922 INFO L168 Benchmark]: CACSL2BoogieTranslator took 178.85 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:18:23,922 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.91 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.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 12:18:23,922 INFO L168 Benchmark]: Boogie Preprocessor took 13.70 ms. Allocated memory is still 1.0 GB. Free memory was 945.8 MB in the beginning and 943.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:18:23,923 INFO L168 Benchmark]: RCFGBuilder took 247.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -175.4 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2018-11-10 12:18:23,923 INFO L168 Benchmark]: BuchiAutomizer took 2590.11 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 80.2 MB). Free memory was 1.1 GB in the beginning and 863.9 MB in the end (delta: 254.6 MB). Peak memory consumption was 334.8 MB. Max. memory is 11.5 GB. [2018-11-10 12:18:23,923 INFO L168 Benchmark]: Witness Printer took 45.56 ms. Allocated memory is still 1.2 GB. Free memory is still 863.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:18:23,925 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 178.85 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 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.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.70 ms. Allocated memory is still 1.0 GB. Free memory was 945.8 MB in the beginning and 943.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 247.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -175.4 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2590.11 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 80.2 MB). Free memory was 1.1 GB in the beginning and 863.9 MB in the end (delta: 254.6 MB). Peak memory consumption was 334.8 MB. Max. memory is 11.5 GB. * Witness Printer took 45.56 ms. Allocated memory is still 1.2 GB. Free memory is still 863.9 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 10 terminating modules (10 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.10 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 31746 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.5s and 11 iterations. TraceHistogramMax:1. Analysis of lassos took 0.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 10. Minimization of nondet autom 0. Automata minimization 0.7s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.4s Buchi closure took 0.0s. Biggest automaton had 31746 states and ocurred in iteration 10. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 901 SDtfs, 465 SDslu, 554 SDs, 0 SdLazy, 50 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI10 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: 42]: 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@58b4e979=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6d801572=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@14b55c18=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5e6b6ae8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@76aeeb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@26aac720=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@90e1852=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@59aa0dad=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5d8df40a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@76251cc2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5fcad760=0, p11=0, lk10=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5dc132d3=0, lk11=0, cond=1, lk3=0, lk4=0, lk5=0, lk6=0, lk1=0, lk2=0, lk7=0, lk8=0, lk9=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 42]: 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; [L40] int cond; Loop: [L42] COND TRUE 1 [L43] cond = __VERIFIER_nondet_int() [L44] COND FALSE !(cond == 0) [L47] lk1 = 0 [L49] lk2 = 0 [L51] lk3 = 0 [L53] lk4 = 0 [L55] lk5 = 0 [L57] lk6 = 0 [L59] lk7 = 0 [L61] lk8 = 0 [L63] lk9 = 0 [L65] lk10 = 0 [L67] lk11 = 0 [L71] COND FALSE !(p1 != 0) [L75] COND FALSE !(p2 != 0) [L79] COND FALSE !(p3 != 0) [L83] COND FALSE !(p4 != 0) [L87] COND FALSE !(p5 != 0) [L91] COND FALSE !(p6 != 0) [L95] COND FALSE !(p7 != 0) [L99] COND FALSE !(p8 != 0) [L103] COND FALSE !(p9 != 0) [L107] COND FALSE !(p10 != 0) [L111] COND FALSE !(p11 != 0) [L117] COND FALSE !(p1 != 0) [L122] COND FALSE !(p2 != 0) [L127] COND FALSE !(p3 != 0) [L132] COND FALSE !(p4 != 0) [L137] COND FALSE !(p5 != 0) [L142] COND FALSE !(p6 != 0) [L147] COND FALSE !(p7 != 0) [L152] COND FALSE !(p8 != 0) [L157] COND FALSE !(p9 != 0) [L162] COND FALSE !(p10 != 0) [L167] COND FALSE !(p11 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...