./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_2_false-unreach-call_false-termination.cil.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_2bdffb24-22b1-4181-a635-bac9c953030b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_2_false-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/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 df684da5e5a56662a7be6091ec5bb0a21e1453c5 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 07:49:42,960 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:49:42,961 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:49:42,968 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:49:42,968 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:49:42,969 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:49:42,970 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:49:42,971 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:49:42,972 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:49:42,972 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:49:42,973 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:49:42,973 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:49:42,974 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:49:42,974 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:49:42,975 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:49:42,976 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:49:42,976 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:49:42,977 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:49:42,979 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:49:42,980 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:49:42,980 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:49:42,981 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:49:42,983 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:49:42,983 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:49:42,983 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:49:42,984 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:49:42,985 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:49:42,985 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:49:42,986 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:49:42,986 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:49:42,987 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:49:42,987 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:49:42,987 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:49:42,987 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:49:42,988 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:49:42,988 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:49:42,988 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 07:49:42,996 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:49:42,997 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:49:42,998 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 07:49:42,998 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 07:49:42,998 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 07:49:42,998 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 07:49:42,998 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 07:49:42,998 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 07:49:42,998 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 07:49:42,999 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 07:49:42,999 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 07:49:42,999 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:49:42,999 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 07:49:42,999 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 07:49:42,999 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:49:42,999 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 07:49:42,999 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:49:43,000 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 07:49:43,000 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 07:49:43,000 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 07:49:43,000 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 07:49:43,000 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:49:43,000 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 07:49:43,000 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 07:49:43,000 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:49:43,001 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:49:43,001 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 07:49:43,001 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:49:43,001 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 07:49:43,001 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 07:49:43,002 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 07:49:43,002 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_2bdffb24-22b1-4181-a635-bac9c953030b/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 -> df684da5e5a56662a7be6091ec5bb0a21e1453c5 [2018-11-10 07:49:43,024 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:49:43,033 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:49:43,035 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:49:43,036 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:49:43,037 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:49:43,037 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/pc_sfifo_2_false-unreach-call_false-termination.cil.c [2018-11-10 07:49:43,079 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/bin-2019/uautomizer/data/ebfd9e5d8/ea0ec456af644ed689c7b516bdc0c35a/FLAG9409c7bf6 [2018-11-10 07:49:43,487 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:49:43,488 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/sv-benchmarks/c/systemc/pc_sfifo_2_false-unreach-call_false-termination.cil.c [2018-11-10 07:49:43,495 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/bin-2019/uautomizer/data/ebfd9e5d8/ea0ec456af644ed689c7b516bdc0c35a/FLAG9409c7bf6 [2018-11-10 07:49:43,505 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/bin-2019/uautomizer/data/ebfd9e5d8/ea0ec456af644ed689c7b516bdc0c35a [2018-11-10 07:49:43,508 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:49:43,508 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 07:49:43,509 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:49:43,509 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:49:43,512 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:49:43,512 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:49:43" (1/1) ... [2018-11-10 07:49:43,514 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@769b41f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:49:43, skipping insertion in model container [2018-11-10 07:49:43,514 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:49:43" (1/1) ... [2018-11-10 07:49:43,519 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:49:43,541 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:49:43,654 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:49:43,657 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:49:43,676 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:49:43,688 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:49:43,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:49:43 WrapperNode [2018-11-10 07:49:43,688 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:49:43,689 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 07:49:43,689 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 07:49:43,689 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 07:49:43,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:49:43" (1/1) ... [2018-11-10 07:49:43,698 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:49:43" (1/1) ... [2018-11-10 07:49:43,716 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 07:49:43,716 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:49:43,716 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:49:43,716 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:49:43,721 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:49:43" (1/1) ... [2018-11-10 07:49:43,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:49:43" (1/1) ... [2018-11-10 07:49:43,722 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:49:43" (1/1) ... [2018-11-10 07:49:43,723 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:49:43" (1/1) ... [2018-11-10 07:49:43,724 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:49:43" (1/1) ... [2018-11-10 07:49:43,729 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:49:43" (1/1) ... [2018-11-10 07:49:43,729 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:49:43" (1/1) ... [2018-11-10 07:49:43,731 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:49:43,731 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:49:43,731 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:49:43,731 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:49:43,732 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:49:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:49:43,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:49:43,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:49:44,098 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:49:44,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:49:44 BoogieIcfgContainer [2018-11-10 07:49:44,099 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:49:44,099 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 07:49:44,099 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 07:49:44,102 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 07:49:44,102 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:49:44,102 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 07:49:43" (1/3) ... [2018-11-10 07:49:44,103 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1943913a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:49:44, skipping insertion in model container [2018-11-10 07:49:44,103 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:49:44,103 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:49:43" (2/3) ... [2018-11-10 07:49:44,103 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1943913a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:49:44, skipping insertion in model container [2018-11-10 07:49:44,104 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:49:44,104 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:49:44" (3/3) ... [2018-11-10 07:49:44,105 INFO L375 chiAutomizerObserver]: Analyzing ICFG pc_sfifo_2_false-unreach-call_false-termination.cil.c [2018-11-10 07:49:44,143 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 07:49:44,143 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 07:49:44,143 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 07:49:44,143 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 07:49:44,143 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:49:44,143 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:49:44,144 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 07:49:44,144 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:49:44,144 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 07:49:44,154 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states. [2018-11-10 07:49:44,174 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 73 [2018-11-10 07:49:44,174 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:49:44,174 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:49:44,180 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:49:44,180 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:49:44,180 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 07:49:44,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states. [2018-11-10 07:49:44,184 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 73 [2018-11-10 07:49:44,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:49:44,184 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:49:44,185 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:49:44,186 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:49:44,190 INFO L793 eck$LassoCheckResult]: Stem: 73#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 37#L452true assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 51#L212true assume !(~q_req_up~0 == 1); 48#L212-2true assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 19#L227true assume ~p_dw_i~0 == 1;~p_dw_st~0 := 0; 16#L227-2true assume !(~c_dr_i~0 == 1);~c_dr_st~0 := 2; 26#L232-1true assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 28#L265true assume !(~q_read_ev~0 == 0); 27#L265-2true assume !(~q_write_ev~0 == 0); 60#L270-1true assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 76#L55true assume !(~p_dw_pc~0 == 1); 71#L55-2true is_do_write_p_triggered_~__retres1~0 := 0; 77#L66true is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 35#L67true activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 95#L305true assume !(activate_threads_~tmp~1 != 0); 99#L305-2true assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 90#L74true assume ~c_dr_pc~0 == 1; 42#L75true assume ~q_write_ev~0 == 1;is_do_read_c_triggered_~__retres1~1 := 1; 91#L85true is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 43#L86true activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 100#L313true assume !(activate_threads_~tmp___0~1 != 0); 101#L313-2true assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 83#L283true assume !(~q_read_ev~0 == 1); 98#L283-2true assume ~q_write_ev~0 == 1;~q_write_ev~0 := 2; 8#L288-1true assume { :end_inline_reset_delta_events } true; 6#L409-3true [2018-11-10 07:49:44,191 INFO L795 eck$LassoCheckResult]: Loop: 6#L409-3true assume true; 3#L409-1true assume !false; 79#L410true start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 4#L354true assume !true; 17#L370true assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 47#L212-3true assume !(~q_req_up~0 == 1); 46#L212-5true assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 23#L265-3true assume ~q_read_ev~0 == 0;~q_read_ev~0 := 1; 36#L265-5true assume ~q_write_ev~0 == 0;~q_write_ev~0 := 1; 54#L270-3true assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 52#L55-3true assume ~p_dw_pc~0 == 1; 32#L56-1true assume ~q_read_ev~0 == 1;is_do_write_p_triggered_~__retres1~0 := 1; 75#L66-1true is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 33#L67-1true activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 82#L305-3true assume activate_threads_~tmp~1 != 0;~p_dw_st~0 := 0; 85#L305-5true assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 66#L74-3true assume !(~c_dr_pc~0 == 1); 64#L74-5true is_do_read_c_triggered_~__retres1~1 := 0; 69#L85-1true is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 40#L86-1true activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 103#L313-3true assume activate_threads_~tmp___0~1 != 0;~c_dr_st~0 := 0; 89#L313-5true assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 97#L283-3true assume ~q_read_ev~0 == 1;~q_read_ev~0 := 2; 93#L283-5true assume ~q_write_ev~0 == 1;~q_write_ev~0 := 2; 104#L288-3true assume { :end_inline_reset_delta_events } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 53#L245-1true assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 30#L257-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 110#L258-1true stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 13#L384true assume stop_simulation_~tmp~3 != 0;stop_simulation_~__retres2~0 := 0; 57#L391true stop_simulation_#res := stop_simulation_~__retres2~0; 15#L392true start_simulation_#t~ret9 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 107#L426true assume !(start_simulation_~tmp~4 != 0); 6#L409-3true [2018-11-10 07:49:44,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:49:44,196 INFO L82 PathProgramCache]: Analyzing trace with hash -239976594, now seen corresponding path program 1 times [2018-11-10 07:49:44,197 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:49:44,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:49:44,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:44,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:49:44,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:44,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:49:44,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:49:44,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:49:44,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:49:44,298 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:49:44,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:49:44,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1229276384, now seen corresponding path program 1 times [2018-11-10 07:49:44,299 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:49:44,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:49:44,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:44,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:49:44,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:44,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:49:44,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:49:44,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:49:44,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 07:49:44,309 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:49:44,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:49:44,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:49:44,324 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 3 states. [2018-11-10 07:49:44,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:49:44,343 INFO L93 Difference]: Finished difference Result 106 states and 148 transitions. [2018-11-10 07:49:44,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:49:44,345 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 148 transitions. [2018-11-10 07:49:44,347 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 67 [2018-11-10 07:49:44,352 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 99 states and 141 transitions. [2018-11-10 07:49:44,353 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 99 [2018-11-10 07:49:44,353 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 99 [2018-11-10 07:49:44,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 141 transitions. [2018-11-10 07:49:44,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:49:44,354 INFO L705 BuchiCegarLoop]: Abstraction has 99 states and 141 transitions. [2018-11-10 07:49:44,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 141 transitions. [2018-11-10 07:49:44,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-11-10 07:49:44,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-10 07:49:44,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2018-11-10 07:49:44,376 INFO L728 BuchiCegarLoop]: Abstraction has 99 states and 141 transitions. [2018-11-10 07:49:44,377 INFO L608 BuchiCegarLoop]: Abstraction has 99 states and 141 transitions. [2018-11-10 07:49:44,377 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 07:49:44,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 141 transitions. [2018-11-10 07:49:44,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 67 [2018-11-10 07:49:44,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:49:44,378 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:49:44,379 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:49:44,379 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:49:44,380 INFO L793 eck$LassoCheckResult]: Stem: 309#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 231#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 232#L452 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 277#L212 assume !(~q_req_up~0 == 1); 296#L212-2 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 249#L227 assume ~p_dw_i~0 == 1;~p_dw_st~0 := 0; 243#L227-2 assume ~c_dr_i~0 == 1;~c_dr_st~0 := 0; 244#L232-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 260#L265 assume !(~q_read_ev~0 == 0); 261#L265-2 assume !(~q_write_ev~0 == 0); 262#L270-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 303#L55 assume !(~p_dw_pc~0 == 1); 273#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 272#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 274#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 275#L305 assume !(activate_threads_~tmp~1 != 0); 320#L305-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 317#L74 assume ~c_dr_pc~0 == 1; 286#L75 assume ~q_write_ev~0 == 1;is_do_read_c_triggered_~__retres1~1 := 1; 287#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 289#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 290#L313 assume !(activate_threads_~tmp___0~1 != 0); 322#L313-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 312#L283 assume !(~q_read_ev~0 == 1); 313#L283-2 assume ~q_write_ev~0 == 1;~q_write_ev~0 := 2; 233#L288-1 assume { :end_inline_reset_delta_events } true; 230#L409-3 [2018-11-10 07:49:44,380 INFO L795 eck$LassoCheckResult]: Loop: 230#L409-3 assume true; 224#L409-1 assume !false; 225#L410 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 226#L354 assume true; 227#L329-1 assume !false; 234#L330 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 308#L245 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 251#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 265#L258 eval_#t~ret5 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 252#L334 assume !(eval_~tmp___1~0 != 0); 245#L370 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 246#L212-3 assume !(~q_req_up~0 == 1); 294#L212-5 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 257#L265-3 assume ~q_read_ev~0 == 0;~q_read_ev~0 := 1; 258#L265-5 assume ~q_write_ev~0 == 0;~q_write_ev~0 := 1; 276#L270-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 298#L55-3 assume ~p_dw_pc~0 == 1; 266#L56-1 assume ~q_read_ev~0 == 1;is_do_write_p_triggered_~__retres1~0 := 1; 267#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 269#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 270#L305-3 assume activate_threads_~tmp~1 != 0;~p_dw_st~0 := 0; 311#L305-5 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 306#L74-3 assume ~c_dr_pc~0 == 1; 280#L75-1 assume ~q_write_ev~0 == 1;is_do_read_c_triggered_~__retres1~1 := 1; 281#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 283#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 284#L313-3 assume activate_threads_~tmp___0~1 != 0;~c_dr_st~0 := 0; 315#L313-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 316#L283-3 assume ~q_read_ev~0 == 1;~q_read_ev~0 := 2; 318#L283-5 assume ~q_write_ev~0 == 1;~q_write_ev~0 := 2; 319#L288-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 299#L245-1 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 248#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 264#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 237#L384 assume stop_simulation_~tmp~3 != 0;stop_simulation_~__retres2~0 := 0; 238#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 241#L392 start_simulation_#t~ret9 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 242#L426 assume !(start_simulation_~tmp~4 != 0); 230#L409-3 [2018-11-10 07:49:44,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:49:44,380 INFO L82 PathProgramCache]: Analyzing trace with hash 577671856, now seen corresponding path program 1 times [2018-11-10 07:49:44,380 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:49:44,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:49:44,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:44,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:49:44,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:44,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:49:44,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:49:44,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:49:44,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:49:44,416 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:49:44,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:49:44,417 INFO L82 PathProgramCache]: Analyzing trace with hash 60811614, now seen corresponding path program 1 times [2018-11-10 07:49:44,417 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:49:44,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:49:44,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:44,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:49:44,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:44,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:49:44,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:49:44,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:49:44,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 07:49:44,451 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:49:44,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:49:44,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:49:44,452 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. cyclomatic complexity: 43 Second operand 3 states. [2018-11-10 07:49:44,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:49:44,473 INFO L93 Difference]: Finished difference Result 162 states and 227 transitions. [2018-11-10 07:49:44,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:49:44,474 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 162 states and 227 transitions. [2018-11-10 07:49:44,475 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 129 [2018-11-10 07:49:44,477 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 162 states to 162 states and 227 transitions. [2018-11-10 07:49:44,477 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 162 [2018-11-10 07:49:44,477 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2018-11-10 07:49:44,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 162 states and 227 transitions. [2018-11-10 07:49:44,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:49:44,478 INFO L705 BuchiCegarLoop]: Abstraction has 162 states and 227 transitions. [2018-11-10 07:49:44,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states and 227 transitions. [2018-11-10 07:49:44,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 156. [2018-11-10 07:49:44,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-10 07:49:44,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 220 transitions. [2018-11-10 07:49:44,484 INFO L728 BuchiCegarLoop]: Abstraction has 156 states and 220 transitions. [2018-11-10 07:49:44,484 INFO L608 BuchiCegarLoop]: Abstraction has 156 states and 220 transitions. [2018-11-10 07:49:44,484 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 07:49:44,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 156 states and 220 transitions. [2018-11-10 07:49:44,485 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 123 [2018-11-10 07:49:44,485 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:49:44,485 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:49:44,486 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:49:44,486 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:49:44,487 INFO L793 eck$LassoCheckResult]: Stem: 581#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 501#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 502#L452 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 549#L212 assume !(~q_req_up~0 == 1); 565#L212-2 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 520#L227 assume ~p_dw_i~0 == 1;~p_dw_st~0 := 0; 514#L227-2 assume ~c_dr_i~0 == 1;~c_dr_st~0 := 0; 515#L232-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 532#L265 assume !(~q_read_ev~0 == 0); 533#L265-2 assume !(~q_write_ev~0 == 0); 534#L270-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 572#L55 assume !(~p_dw_pc~0 == 1); 545#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 544#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 546#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 547#L305 assume !(activate_threads_~tmp~1 != 0); 592#L305-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 589#L74 assume !(~c_dr_pc~0 == 1); 578#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 579#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 558#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 559#L313 assume !(activate_threads_~tmp___0~1 != 0); 594#L313-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 584#L283 assume !(~q_read_ev~0 == 1); 585#L283-2 assume ~q_write_ev~0 == 1;~q_write_ev~0 := 2; 503#L288-1 assume { :end_inline_reset_delta_events } true; 504#L409-3 [2018-11-10 07:49:44,487 INFO L795 eck$LassoCheckResult]: Loop: 504#L409-3 assume true; 626#L409-1 assume !false; 625#L410 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 599#L354 assume true; 624#L329-1 assume !false; 623#L330 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 618#L245 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 613#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 610#L258 eval_#t~ret5 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 606#L334 assume !(eval_~tmp___1~0 != 0); 516#L370 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 517#L212-3 assume !(~q_req_up~0 == 1); 563#L212-5 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 529#L265-3 assume ~q_read_ev~0 == 0;~q_read_ev~0 := 1; 530#L265-5 assume ~q_write_ev~0 == 0;~q_write_ev~0 := 1; 548#L270-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 567#L55-3 assume ~p_dw_pc~0 == 1; 538#L56-1 assume ~q_read_ev~0 == 1;is_do_write_p_triggered_~__retres1~0 := 1; 539#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 541#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 542#L305-3 assume activate_threads_~tmp~1 != 0;~p_dw_st~0 := 0; 583#L305-5 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 575#L74-3 assume !(~c_dr_pc~0 == 1); 576#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 649#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 648#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 647#L313-3 assume activate_threads_~tmp___0~1 != 0;~c_dr_st~0 := 0; 646#L313-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 645#L283-3 assume ~q_read_ev~0 == 1;~q_read_ev~0 := 2; 644#L283-5 assume ~q_write_ev~0 == 1;~q_write_ev~0 := 2; 643#L288-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 642#L245-1 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 640#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 639#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 638#L384 assume stop_simulation_~tmp~3 != 0;stop_simulation_~__retres2~0 := 0; 637#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 636#L392 start_simulation_#t~ret9 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 628#L426 assume !(start_simulation_~tmp~4 != 0); 504#L409-3 [2018-11-10 07:49:44,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:49:44,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1617647375, now seen corresponding path program 1 times [2018-11-10 07:49:44,487 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:49:44,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:49:44,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:44,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:49:44,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:44,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:49:44,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:49:44,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:49:44,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:49:44,525 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:49:44,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:49:44,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1237415933, now seen corresponding path program 1 times [2018-11-10 07:49:44,525 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:49:44,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:49:44,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:44,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:49:44,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:49:44,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:49:44,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:49:44,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 07:49:44,564 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:49:44,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:49:44,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:49:44,565 INFO L87 Difference]: Start difference. First operand 156 states and 220 transitions. cyclomatic complexity: 66 Second operand 3 states. [2018-11-10 07:49:44,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:49:44,595 INFO L93 Difference]: Finished difference Result 307 states and 426 transitions. [2018-11-10 07:49:44,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:49:44,595 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 307 states and 426 transitions. [2018-11-10 07:49:44,597 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 246 [2018-11-10 07:49:44,599 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 307 states to 307 states and 426 transitions. [2018-11-10 07:49:44,599 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 307 [2018-11-10 07:49:44,600 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 307 [2018-11-10 07:49:44,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 307 states and 426 transitions. [2018-11-10 07:49:44,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:49:44,601 INFO L705 BuchiCegarLoop]: Abstraction has 307 states and 426 transitions. [2018-11-10 07:49:44,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states and 426 transitions. [2018-11-10 07:49:44,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-11-10 07:49:44,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-11-10 07:49:44,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 426 transitions. [2018-11-10 07:49:44,613 INFO L728 BuchiCegarLoop]: Abstraction has 307 states and 426 transitions. [2018-11-10 07:49:44,613 INFO L608 BuchiCegarLoop]: Abstraction has 307 states and 426 transitions. [2018-11-10 07:49:44,613 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 07:49:44,613 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 307 states and 426 transitions. [2018-11-10 07:49:44,615 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 246 [2018-11-10 07:49:44,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:49:44,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:49:44,616 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:49:44,617 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:49:44,617 INFO L793 eck$LassoCheckResult]: Stem: 1060#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 973#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 974#L452 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 1024#L212 assume !(~q_req_up~0 == 1); 1041#L212-2 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 991#L227 assume ~p_dw_i~0 == 1;~p_dw_st~0 := 0; 985#L227-2 assume ~c_dr_i~0 == 1;~c_dr_st~0 := 0; 986#L232-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 1004#L265 assume !(~q_read_ev~0 == 0); 1245#L265-2 assume !(~q_write_ev~0 == 0); 1244#L270-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 1243#L55 assume !(~p_dw_pc~0 == 1); 1241#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 1240#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 1239#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 1238#L305 assume !(activate_threads_~tmp~1 != 0); 1237#L305-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 1069#L74 assume !(~c_dr_pc~0 == 1); 1057#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 1058#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 1070#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 1231#L313 assume !(activate_threads_~tmp___0~1 != 0); 1229#L313-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 1063#L283 assume !(~q_read_ev~0 == 1); 1064#L283-2 assume !(~q_write_ev~0 == 1); 975#L288-1 assume { :end_inline_reset_delta_events } true; 972#L409-3 [2018-11-10 07:49:44,617 INFO L795 eck$LassoCheckResult]: Loop: 972#L409-3 assume true; 966#L409-1 assume !false; 967#L410 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 968#L354 assume true; 969#L329-1 assume !false; 976#L330 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1059#L245 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 993#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1011#L258 eval_#t~ret5 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 994#L334 assume !(eval_~tmp___1~0 != 0); 987#L370 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 988#L212-3 assume !(~q_req_up~0 == 1); 1039#L212-5 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 1000#L265-3 assume ~q_read_ev~0 == 0;~q_read_ev~0 := 1; 1001#L265-5 assume !(~q_write_ev~0 == 0); 1266#L270-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 1265#L55-3 assume !(~p_dw_pc~0 == 1); 1264#L55-5 is_do_write_p_triggered_~__retres1~0 := 0; 1262#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 1261#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 1260#L305-3 assume activate_threads_~tmp~1 != 0;~p_dw_st~0 := 0; 1259#L305-5 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 1055#L74-3 assume !(~c_dr_pc~0 == 1); 1052#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 1053#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 1029#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 1030#L313-3 assume activate_threads_~tmp___0~1 != 0;~c_dr_st~0 := 0; 1067#L313-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 1068#L283-3 assume ~q_read_ev~0 == 1;~q_read_ev~0 := 2; 1072#L283-5 assume !(~q_write_ev~0 == 1); 1073#L288-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1044#L245-1 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 990#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1010#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 979#L384 assume stop_simulation_~tmp~3 != 0;stop_simulation_~__retres2~0 := 0; 980#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 983#L392 start_simulation_#t~ret9 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 984#L426 assume !(start_simulation_~tmp~4 != 0); 972#L409-3 [2018-11-10 07:49:44,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:49:44,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1617647313, now seen corresponding path program 1 times [2018-11-10 07:49:44,618 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:49:44,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:49:44,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:44,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:49:44,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:44,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:49:44,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:49:44,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:49:44,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1670074140, now seen corresponding path program 1 times [2018-11-10 07:49:44,644 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:49:44,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:49:44,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:44,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:49:44,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:44,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:49:44,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:49:44,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:49:44,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 07:49:44,678 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:49:44,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 07:49:44,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:49:44,679 INFO L87 Difference]: Start difference. First operand 307 states and 426 transitions. cyclomatic complexity: 121 Second operand 5 states. [2018-11-10 07:49:44,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:49:44,757 INFO L93 Difference]: Finished difference Result 471 states and 634 transitions. [2018-11-10 07:49:44,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 07:49:44,757 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 471 states and 634 transitions. [2018-11-10 07:49:44,759 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 406 [2018-11-10 07:49:44,761 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 471 states to 471 states and 634 transitions. [2018-11-10 07:49:44,761 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 471 [2018-11-10 07:49:44,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 471 [2018-11-10 07:49:44,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 471 states and 634 transitions. [2018-11-10 07:49:44,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:49:44,764 INFO L705 BuchiCegarLoop]: Abstraction has 471 states and 634 transitions. [2018-11-10 07:49:44,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states and 634 transitions. [2018-11-10 07:49:44,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 319. [2018-11-10 07:49:44,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-11-10 07:49:44,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 438 transitions. [2018-11-10 07:49:44,773 INFO L728 BuchiCegarLoop]: Abstraction has 319 states and 438 transitions. [2018-11-10 07:49:44,773 INFO L608 BuchiCegarLoop]: Abstraction has 319 states and 438 transitions. [2018-11-10 07:49:44,773 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 07:49:44,773 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 319 states and 438 transitions. [2018-11-10 07:49:44,775 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 258 [2018-11-10 07:49:44,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:49:44,775 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:49:44,775 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:49:44,776 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:49:44,776 INFO L793 eck$LassoCheckResult]: Stem: 1858#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 1767#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 1768#L452 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 1819#L212 assume !(~q_req_up~0 == 1); 1837#L212-2 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 1903#L227 assume ~p_dw_i~0 == 1;~p_dw_st~0 := 0; 1902#L227-2 assume ~c_dr_i~0 == 1;~c_dr_st~0 := 0; 1798#L232-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 1799#L265 assume !(~q_read_ev~0 == 0); 1802#L265-2 assume !(~q_write_ev~0 == 0); 1900#L270-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 1860#L55 assume !(~p_dw_pc~0 == 1); 1814#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 1813#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 1897#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 1879#L305 assume !(activate_threads_~tmp~1 != 0); 1880#L305-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 1873#L74 assume !(~c_dr_pc~0 == 1); 1855#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 1856#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 1827#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 1828#L313 assume !(activate_threads_~tmp___0~1 != 0); 1889#L313-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 1890#L283 assume !(~q_read_ev~0 == 1); 1884#L283-2 assume !(~q_write_ev~0 == 1); 1769#L288-1 assume { :end_inline_reset_delta_events } true; 1766#L409-3 [2018-11-10 07:49:44,776 INFO L795 eck$LassoCheckResult]: Loop: 1766#L409-3 assume true; 1760#L409-1 assume !false; 1761#L410 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 1862#L354 assume true; 1971#L329-1 assume !false; 1968#L330 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1966#L245 assume !(~p_dw_st~0 == 0); 1962#L249 assume !(~c_dr_st~0 == 0);exists_runnable_thread_~__retres1~2 := 0; 1958#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1954#L258 eval_#t~ret5 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 1952#L334 assume !(eval_~tmp___1~0 != 0); 1951#L370 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 1949#L212-3 assume !(~q_req_up~0 == 1); 1947#L212-5 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 1946#L265-3 assume ~q_read_ev~0 == 0;~q_read_ev~0 := 1; 1817#L265-5 assume !(~q_write_ev~0 == 0); 1818#L270-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 1838#L55-3 assume !(~p_dw_pc~0 == 1); 1840#L55-5 is_do_write_p_triggered_~__retres1~0 := 0; 1909#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 1910#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 1905#L305-3 assume activate_threads_~tmp~1 != 0;~p_dw_st~0 := 0; 1906#L305-5 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 1853#L74-3 assume !(~c_dr_pc~0 == 1); 1850#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 1851#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 1824#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 1825#L313-3 assume activate_threads_~tmp___0~1 != 0;~c_dr_st~0 := 0; 1871#L313-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 1872#L283-3 assume ~q_read_ev~0 == 1;~q_read_ev~0 := 2; 1876#L283-5 assume !(~q_write_ev~0 == 1); 1877#L288-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1841#L245-1 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 1784#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1805#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 1773#L384 assume stop_simulation_~tmp~3 != 0;stop_simulation_~__retres2~0 := 0; 1774#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 1777#L392 start_simulation_#t~ret9 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 1778#L426 assume !(start_simulation_~tmp~4 != 0); 1766#L409-3 [2018-11-10 07:49:44,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:49:44,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1617647313, now seen corresponding path program 2 times [2018-11-10 07:49:44,776 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:49:44,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:49:44,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:44,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:49:44,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:49:44,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:49:44,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:49:44,789 INFO L82 PathProgramCache]: Analyzing trace with hash 2083837260, now seen corresponding path program 1 times [2018-11-10 07:49:44,789 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:49:44,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:49:44,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:44,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:49:44,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:44,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:49:44,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:49:44,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:49:44,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 07:49:44,840 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:49:44,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 07:49:44,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:49:44,841 INFO L87 Difference]: Start difference. First operand 319 states and 438 transitions. cyclomatic complexity: 121 Second operand 5 states. [2018-11-10 07:49:44,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:49:44,915 INFO L93 Difference]: Finished difference Result 853 states and 1156 transitions. [2018-11-10 07:49:44,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 07:49:44,916 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 853 states and 1156 transitions. [2018-11-10 07:49:44,919 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 738 [2018-11-10 07:49:44,921 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 853 states to 853 states and 1156 transitions. [2018-11-10 07:49:44,921 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 853 [2018-11-10 07:49:44,922 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 853 [2018-11-10 07:49:44,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 853 states and 1156 transitions. [2018-11-10 07:49:44,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:49:44,923 INFO L705 BuchiCegarLoop]: Abstraction has 853 states and 1156 transitions. [2018-11-10 07:49:44,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states and 1156 transitions. [2018-11-10 07:49:44,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 337. [2018-11-10 07:49:44,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-11-10 07:49:44,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 456 transitions. [2018-11-10 07:49:44,934 INFO L728 BuchiCegarLoop]: Abstraction has 337 states and 456 transitions. [2018-11-10 07:49:44,934 INFO L608 BuchiCegarLoop]: Abstraction has 337 states and 456 transitions. [2018-11-10 07:49:44,935 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 07:49:44,935 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 337 states and 456 transitions. [2018-11-10 07:49:44,936 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 270 [2018-11-10 07:49:44,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:49:44,937 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:49:44,937 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:49:44,938 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:49:44,938 INFO L793 eck$LassoCheckResult]: Stem: 3048#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 2952#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 2953#L452 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 3006#L212 assume !(~q_req_up~0 == 1); 3021#L212-2 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 2971#L227 assume ~p_dw_i~0 == 1;~p_dw_st~0 := 0; 2972#L227-2 assume ~c_dr_i~0 == 1;~c_dr_st~0 := 0; 2985#L232-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 2986#L265 assume !(~q_read_ev~0 == 0); 2987#L265-2 assume !(~q_write_ev~0 == 0); 2988#L270-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 3049#L55 assume !(~p_dw_pc~0 == 1); 3050#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 3219#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 3217#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 3215#L305 assume !(activate_threads_~tmp~1 != 0); 3206#L305-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 3063#L74 assume !(~c_dr_pc~0 == 1); 3044#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 3045#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 3014#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 3015#L313 assume !(activate_threads_~tmp___0~1 != 0); 3074#L313-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 3056#L283 assume !(~q_read_ev~0 == 1); 3057#L283-2 assume !(~q_write_ev~0 == 1); 2954#L288-1 assume { :end_inline_reset_delta_events } true; 2955#L409-3 [2018-11-10 07:49:44,938 INFO L795 eck$LassoCheckResult]: Loop: 2955#L409-3 assume true; 3152#L409-1 assume !false; 3145#L410 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 3141#L354 assume true; 3139#L329-1 assume !false; 3137#L330 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3135#L245 assume !(~p_dw_st~0 == 0); 3132#L249 assume !(~c_dr_st~0 == 0);exists_runnable_thread_~__retres1~2 := 0; 3129#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3127#L258 eval_#t~ret5 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 3124#L334 assume !(eval_~tmp___1~0 != 0); 3119#L370 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 3114#L212-3 assume !(~q_req_up~0 == 1); 3109#L212-5 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 3107#L265-3 assume ~q_read_ev~0 == 0;~q_read_ev~0 := 1; 3105#L265-5 assume !(~q_write_ev~0 == 0); 3028#L270-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 3029#L55-3 assume ~p_dw_pc~0 == 1; 2995#L56-1 assume ~q_read_ev~0 == 1;is_do_write_p_triggered_~__retres1~0 := 1; 2996#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 2998#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 2999#L305-3 assume activate_threads_~tmp~1 != 0;~p_dw_st~0 := 0; 3055#L305-5 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 3041#L74-3 assume !(~c_dr_pc~0 == 1); 3042#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 3223#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 3221#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 3207#L313-3 assume activate_threads_~tmp___0~1 != 0;~c_dr_st~0 := 0; 3204#L313-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 3202#L283-3 assume ~q_read_ev~0 == 1;~q_read_ev~0 := 2; 3194#L283-5 assume !(~q_write_ev~0 == 1); 3191#L288-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3188#L245-1 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 3186#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3185#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 3184#L384 assume stop_simulation_~tmp~3 != 0;stop_simulation_~__retres2~0 := 0; 3183#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 3175#L392 start_simulation_#t~ret9 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 3169#L426 assume !(start_simulation_~tmp~4 != 0); 2955#L409-3 [2018-11-10 07:49:44,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:49:44,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1617647313, now seen corresponding path program 3 times [2018-11-10 07:49:44,938 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:49:44,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:49:44,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:44,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:49:44,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:44,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:49:44,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:49:44,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:49:44,951 INFO L82 PathProgramCache]: Analyzing trace with hash -2097743379, now seen corresponding path program 1 times [2018-11-10 07:49:44,951 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:49:44,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:49:44,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:44,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:49:44,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:44,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:49:45,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:49:45,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:49:45,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 07:49:45,003 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:49:45,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 07:49:45,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:49:45,004 INFO L87 Difference]: Start difference. First operand 337 states and 456 transitions. cyclomatic complexity: 121 Second operand 5 states. [2018-11-10 07:49:45,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:49:45,041 INFO L93 Difference]: Finished difference Result 582 states and 784 transitions. [2018-11-10 07:49:45,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 07:49:45,041 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 582 states and 784 transitions. [2018-11-10 07:49:45,044 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 515 [2018-11-10 07:49:45,046 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 582 states to 582 states and 784 transitions. [2018-11-10 07:49:45,046 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 582 [2018-11-10 07:49:45,046 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 582 [2018-11-10 07:49:45,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 582 states and 784 transitions. [2018-11-10 07:49:45,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:49:45,047 INFO L705 BuchiCegarLoop]: Abstraction has 582 states and 784 transitions. [2018-11-10 07:49:45,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states and 784 transitions. [2018-11-10 07:49:45,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 340. [2018-11-10 07:49:45,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-10 07:49:45,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 454 transitions. [2018-11-10 07:49:45,055 INFO L728 BuchiCegarLoop]: Abstraction has 340 states and 454 transitions. [2018-11-10 07:49:45,055 INFO L608 BuchiCegarLoop]: Abstraction has 340 states and 454 transitions. [2018-11-10 07:49:45,055 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 07:49:45,055 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 340 states and 454 transitions. [2018-11-10 07:49:45,056 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 273 [2018-11-10 07:49:45,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:49:45,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:49:45,057 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:49:45,057 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:49:45,057 INFO L793 eck$LassoCheckResult]: Stem: 3981#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 3886#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 3887#L452 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 3939#L212 assume !(~q_req_up~0 == 1); 3954#L212-2 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 3905#L227 assume ~p_dw_i~0 == 1;~p_dw_st~0 := 0; 3899#L227-2 assume ~c_dr_i~0 == 1;~c_dr_st~0 := 0; 3900#L232-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 3922#L265 assume !(~q_read_ev~0 == 0); 3923#L265-2 assume !(~q_write_ev~0 == 0); 4032#L270-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 3982#L55 assume !(~p_dw_pc~0 == 1); 3935#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 4026#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 4027#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 4001#L305 assume !(activate_threads_~tmp~1 != 0); 4002#L305-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 3995#L74 assume !(~c_dr_pc~0 == 1); 3974#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 3975#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 3947#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 3948#L313 assume !(activate_threads_~tmp___0~1 != 0); 4010#L313-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 4011#L283 assume !(~q_read_ev~0 == 1); 4005#L283-2 assume !(~q_write_ev~0 == 1); 3888#L288-1 assume { :end_inline_reset_delta_events } true; 3889#L409-3 [2018-11-10 07:49:45,058 INFO L795 eck$LassoCheckResult]: Loop: 3889#L409-3 assume true; 4100#L409-1 assume !false; 4094#L410 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 4089#L354 assume true; 4087#L329-1 assume !false; 4085#L330 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 4083#L245 assume !(~p_dw_st~0 == 0); 4080#L249 assume !(~c_dr_st~0 == 0);exists_runnable_thread_~__retres1~2 := 0; 4077#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 4075#L258 eval_#t~ret5 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 4072#L334 assume !(eval_~tmp___1~0 != 0); 4067#L370 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 4062#L212-3 assume !(~q_req_up~0 == 1); 4057#L212-5 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 4055#L265-3 assume ~q_read_ev~0 == 0;~q_read_ev~0 := 1; 4052#L265-5 assume !(~q_write_ev~0 == 0); 4053#L270-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 4047#L55-3 assume ~p_dw_pc~0 == 1; 4048#L56-1 assume ~q_read_ev~0 == 1;is_do_write_p_triggered_~__retres1~0 := 1; 4042#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 4043#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 4039#L305-3 assume activate_threads_~tmp~1 != 0;~p_dw_st~0 := 0; 3985#L305-5 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 3971#L74-3 assume !(~c_dr_pc~0 == 1); 3972#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 4149#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 4147#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 4145#L313-3 assume !(activate_threads_~tmp___0~1 != 0); 4143#L313-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 4139#L283-3 assume ~q_read_ev~0 == 1;~q_read_ev~0 := 2; 4134#L283-5 assume !(~q_write_ev~0 == 1); 4129#L288-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 4127#L245-1 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 4122#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 4119#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 4117#L384 assume stop_simulation_~tmp~3 != 0;stop_simulation_~__retres2~0 := 0; 4116#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 4115#L392 start_simulation_#t~ret9 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 4113#L426 assume !(start_simulation_~tmp~4 != 0); 3889#L409-3 [2018-11-10 07:49:45,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:49:45,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1617647313, now seen corresponding path program 4 times [2018-11-10 07:49:45,058 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:49:45,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:49:45,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:45,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:49:45,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:45,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:49:45,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:49:45,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:49:45,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1839577941, now seen corresponding path program 1 times [2018-11-10 07:49:45,070 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:49:45,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:49:45,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:45,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:49:45,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:45,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:49:45,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:49:45,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:49:45,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1079327811, now seen corresponding path program 1 times [2018-11-10 07:49:45,085 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:49:45,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:49:45,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:45,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:49:45,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:45,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:49:45,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:49:45,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:49:45,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:49:45,247 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2018-11-10 07:49:45,298 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:49:45,299 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:49:45,299 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:49:45,299 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:49:45,300 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 07:49:45,300 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:49:45,300 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:49:45,300 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:49:45,300 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_2_false-unreach-call_false-termination.cil.c_Iteration7_Loop [2018-11-10 07:49:45,300 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:49:45,300 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:49:45,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:45,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:45,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:45,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:45,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:45,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:45,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:45,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:45,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:45,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:45,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:45,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:45,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:45,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:45,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:45,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:45,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:45,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:45,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:45,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:45,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:45,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:45,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:45,585 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:49:45,586 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/bin-2019/uautomizer/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:49:45,589 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:49:45,589 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:49:45,593 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:49:45,593 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___0~2=0} Honda state: {ULTIMATE.start_eval_~tmp___0~2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/bin-2019/uautomizer/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:49:45,609 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:49:45,609 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:49:45,613 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:49:45,613 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_~tmp___0~1=0} Honda state: {ULTIMATE.start_activate_threads_~tmp___0~1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/bin-2019/uautomizer/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:49:45,629 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:49:45,629 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:49:45,631 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:49:45,631 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~ret5=0} Honda state: {ULTIMATE.start_eval_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/bin-2019/uautomizer/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:49:45,651 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:49:45,651 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/bin-2019/uautomizer/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:49:45,679 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 07:49:45,679 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:49:45,690 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 07:49:45,705 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:49:45,705 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:49:45,705 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:49:45,705 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:49:45,705 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:49:45,705 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:49:45,705 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:49:45,705 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:49:45,705 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_2_false-unreach-call_false-termination.cil.c_Iteration7_Loop [2018-11-10 07:49:45,705 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:49:45,706 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:49:45,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:45,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:45,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:45,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:45,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:45,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:45,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:45,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:45,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:45,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:45,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:45,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:45,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:45,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:45,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:45,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:45,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:45,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:45,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:45,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:45,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:45,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:45,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:45,928 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:49:45,934 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:49:45,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:45,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:49:45,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:49:45,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:45,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:45,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:49:45,938 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:49:45,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:49:45,941 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:45,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:45,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:49:45,941 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:49:45,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:45,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:45,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:49:45,942 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:49:45,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:49:45,943 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:45,943 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:45,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:49:45,943 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:49:45,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:45,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:45,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:49:45,944 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:49:45,944 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:49:45,944 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:45,945 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:45,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:49:45,945 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:49:45,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:45,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:45,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:49:45,946 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:49:45,946 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:49:45,949 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:49:45,951 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 07:49:45,951 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 07:49:45,952 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:49:45,952 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 07:49:45,952 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:49:45,953 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(~q_read_ev~0) = -1*~q_read_ev~0 + 1 Supporting invariants [] [2018-11-10 07:49:45,953 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 07:49:45,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:49:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:49:45,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:49:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:49:46,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:49:46,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:49:46,037 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 07:49:46,038 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 340 states and 454 transitions. cyclomatic complexity: 116 Second operand 5 states. [2018-11-10 07:49:46,102 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 340 states and 454 transitions. cyclomatic complexity: 116. Second operand 5 states. Result 914 states and 1226 transitions. Complement of second has 5 states. [2018-11-10 07:49:46,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-10 07:49:46,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 07:49:46,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2018-11-10 07:49:46,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 141 transitions. Stem has 26 letters. Loop has 39 letters. [2018-11-10 07:49:46,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:49:46,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 141 transitions. Stem has 65 letters. Loop has 39 letters. [2018-11-10 07:49:46,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:49:46,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 141 transitions. Stem has 26 letters. Loop has 78 letters. [2018-11-10 07:49:46,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:49:46,109 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 914 states and 1226 transitions. [2018-11-10 07:49:46,114 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 546 [2018-11-10 07:49:46,116 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 914 states to 914 states and 1226 transitions. [2018-11-10 07:49:46,116 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 619 [2018-11-10 07:49:46,117 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 629 [2018-11-10 07:49:46,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 914 states and 1226 transitions. [2018-11-10 07:49:46,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:49:46,117 INFO L705 BuchiCegarLoop]: Abstraction has 914 states and 1226 transitions. [2018-11-10 07:49:46,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states and 1226 transitions. [2018-11-10 07:49:46,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 904. [2018-11-10 07:49:46,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2018-11-10 07:49:46,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1216 transitions. [2018-11-10 07:49:46,129 INFO L728 BuchiCegarLoop]: Abstraction has 904 states and 1216 transitions. [2018-11-10 07:49:46,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:49:46,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:49:46,129 INFO L87 Difference]: Start difference. First operand 904 states and 1216 transitions. Second operand 3 states. [2018-11-10 07:49:46,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:49:46,145 INFO L93 Difference]: Finished difference Result 1309 states and 1681 transitions. [2018-11-10 07:49:46,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:49:46,145 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1309 states and 1681 transitions. [2018-11-10 07:49:46,149 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 780 [2018-11-10 07:49:46,153 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1309 states to 1309 states and 1681 transitions. [2018-11-10 07:49:46,153 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 903 [2018-11-10 07:49:46,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 903 [2018-11-10 07:49:46,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1309 states and 1681 transitions. [2018-11-10 07:49:46,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:49:46,154 INFO L705 BuchiCegarLoop]: Abstraction has 1309 states and 1681 transitions. [2018-11-10 07:49:46,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states and 1681 transitions. [2018-11-10 07:49:46,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 1309. [2018-11-10 07:49:46,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1309 states. [2018-11-10 07:49:46,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1309 states and 1681 transitions. [2018-11-10 07:49:46,167 INFO L728 BuchiCegarLoop]: Abstraction has 1309 states and 1681 transitions. [2018-11-10 07:49:46,167 INFO L608 BuchiCegarLoop]: Abstraction has 1309 states and 1681 transitions. [2018-11-10 07:49:46,167 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 07:49:46,167 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1309 states and 1681 transitions. [2018-11-10 07:49:46,170 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 780 [2018-11-10 07:49:46,170 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:49:46,170 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:49:46,171 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:49:46,171 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:49:46,171 INFO L793 eck$LassoCheckResult]: Stem: 7753#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 7577#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 7578#L452 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 7670#L212 assume !(~q_req_up~0 == 1); 7713#L212-2 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 7609#L227 assume !(~p_dw_i~0 == 1);~p_dw_st~0 := 2; 7610#L227-2 assume ~c_dr_i~0 == 1;~c_dr_st~0 := 0; 7636#L232-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 7637#L265 assume !(~q_read_ev~0 == 0); 7638#L265-2 assume !(~q_write_ev~0 == 0); 7639#L270-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 8176#L55 assume !(~p_dw_pc~0 == 1); 8174#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 8173#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 8172#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 7783#L305 assume !(activate_threads_~tmp~1 != 0); 7784#L305-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 7773#L74 assume !(~c_dr_pc~0 == 1); 7744#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 7745#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 7689#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 7690#L313 assume !(activate_threads_~tmp___0~1 != 0); 7797#L313-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 7761#L283 assume !(~q_read_ev~0 == 1); 7762#L283-2 assume !(~q_write_ev~0 == 1); 7579#L288-1 assume { :end_inline_reset_delta_events } true; 7580#L409-3 assume true; 8169#L409-1 [2018-11-10 07:49:46,172 INFO L795 eck$LassoCheckResult]: Loop: 8169#L409-1 assume !false; 8733#L410 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 8680#L354 assume true; 8730#L329-1 assume !false; 8727#L330 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 8725#L245 assume !(~p_dw_st~0 == 0); 8716#L249 assume !(~c_dr_st~0 == 0);exists_runnable_thread_~__retres1~2 := 0; 8714#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 8712#L258 eval_#t~ret5 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 8709#L334 assume !(eval_~tmp___1~0 != 0); 7601#L370 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 7602#L212-3 assume !(~q_req_up~0 == 1); 7699#L212-5 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 7628#L265-3 assume !(~q_read_ev~0 == 0); 7629#L265-5 assume !(~q_write_ev~0 == 0); 7668#L270-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 7714#L55-3 assume ~p_dw_pc~0 == 1; 7653#L56-1 assume ~q_read_ev~0 == 1;is_do_write_p_triggered_~__retres1~0 := 1; 7654#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 8868#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 8865#L305-3 assume !(activate_threads_~tmp~1 != 0); 8766#L305-5 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 8765#L74-3 assume !(~c_dr_pc~0 == 1); 8764#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 8762#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 8760#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 8758#L313-3 assume !(activate_threads_~tmp___0~1 != 0); 8756#L313-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 8754#L283-3 assume !(~q_read_ev~0 == 1); 8752#L283-5 assume !(~q_write_ev~0 == 1); 8749#L288-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 8747#L245-1 assume !(~p_dw_st~0 == 0); 8746#L249-1 assume ~c_dr_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 8744#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 8742#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 8741#L384 assume stop_simulation_~tmp~3 != 0;stop_simulation_~__retres2~0 := 0; 8740#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 8739#L392 start_simulation_#t~ret9 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 8737#L426 assume !(start_simulation_~tmp~4 != 0); 8736#L409-3 assume true; 8169#L409-1 [2018-11-10 07:49:46,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:49:46,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1611395687, now seen corresponding path program 1 times [2018-11-10 07:49:46,172 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:49:46,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:49:46,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:46,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:49:46,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:46,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:49:46,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:49:46,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:49:46,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:49:46,191 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:49:46,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:49:46,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1781247699, now seen corresponding path program 1 times [2018-11-10 07:49:46,191 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:49:46,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:49:46,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:46,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:49:46,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:46,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:49:46,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:49:46,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:49:46,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:49:46,203 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:49:46,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:49:46,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:49:46,204 INFO L87 Difference]: Start difference. First operand 1309 states and 1681 transitions. cyclomatic complexity: 378 Second operand 3 states. [2018-11-10 07:49:46,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:49:46,213 INFO L93 Difference]: Finished difference Result 1259 states and 1615 transitions. [2018-11-10 07:49:46,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:49:46,214 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1259 states and 1615 transitions. [2018-11-10 07:49:46,218 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 780 [2018-11-10 07:49:46,221 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1259 states to 1259 states and 1615 transitions. [2018-11-10 07:49:46,221 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 853 [2018-11-10 07:49:46,222 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 853 [2018-11-10 07:49:46,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1259 states and 1615 transitions. [2018-11-10 07:49:46,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:49:46,222 INFO L705 BuchiCegarLoop]: Abstraction has 1259 states and 1615 transitions. [2018-11-10 07:49:46,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states and 1615 transitions. [2018-11-10 07:49:46,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 1259. [2018-11-10 07:49:46,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1259 states. [2018-11-10 07:49:46,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1259 states and 1615 transitions. [2018-11-10 07:49:46,234 INFO L728 BuchiCegarLoop]: Abstraction has 1259 states and 1615 transitions. [2018-11-10 07:49:46,234 INFO L608 BuchiCegarLoop]: Abstraction has 1259 states and 1615 transitions. [2018-11-10 07:49:46,234 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 07:49:46,234 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1259 states and 1615 transitions. [2018-11-10 07:49:46,237 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 780 [2018-11-10 07:49:46,237 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:49:46,237 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:49:46,238 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:49:46,238 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:49:46,238 INFO L793 eck$LassoCheckResult]: Stem: 10318#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 10152#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 10153#L452 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 10239#L212 assume !(~q_req_up~0 == 1); 10272#L212-2 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 10184#L227 assume ~p_dw_i~0 == 1;~p_dw_st~0 := 0; 10174#L227-2 assume ~c_dr_i~0 == 1;~c_dr_st~0 := 0; 10175#L232-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 10210#L265 assume !(~q_read_ev~0 == 0); 10211#L265-2 assume !(~q_write_ev~0 == 0); 10385#L270-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 10384#L55 assume !(~p_dw_pc~0 == 1); 10314#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 10315#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 10235#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 10236#L305 assume !(activate_threads_~tmp~1 != 0); 10353#L305-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 10341#L74 assume !(~c_dr_pc~0 == 1); 10310#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 10311#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 10258#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 10259#L313 assume !(activate_threads_~tmp___0~1 != 0); 10361#L313-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 10327#L283 assume !(~q_read_ev~0 == 1); 10328#L283-2 assume !(~q_write_ev~0 == 1); 10358#L288-1 assume { :end_inline_reset_delta_events } true; 10561#L409-3 assume true; 10562#L409-1 [2018-11-10 07:49:46,238 INFO L795 eck$LassoCheckResult]: Loop: 10562#L409-1 assume !false; 11039#L410 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 11036#L354 assume true; 11034#L329-1 assume !false; 11029#L330 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 11028#L245 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 10710#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 11024#L258 eval_#t~ret5 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 11022#L334 assume eval_~tmp___1~0 != 0; 11001#L334-1 assume ~p_dw_st~0 == 0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; 11002#L343 assume eval_~tmp~2 != 0;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet2; 10344#L118 assume ~p_dw_pc~0 == 0; 10159#L129-2 assume true; 10704#L129 assume !false; 10260#L130 assume ~q_free~0 == 0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 10261#L148 assume { :end_inline_do_write_p } true; 10252#L339 assume !(~c_dr_st~0 == 0); 10253#L354 assume true; 10716#L329-1 assume !false; 10714#L330 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 10709#L245 assume !(~p_dw_st~0 == 0); 10185#L249 assume !(~c_dr_st~0 == 0);exists_runnable_thread_~__retres1~2 := 0; 10187#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 10963#L258 eval_#t~ret5 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 10706#L334 assume !(eval_~tmp___1~0 != 0); 10708#L370 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 10977#L212-3 assume !(~q_req_up~0 == 1); 10978#L212-5 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 11030#L265-3 assume !(~q_read_ev~0 == 0); 11027#L265-5 assume !(~q_write_ev~0 == 0); 11025#L270-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 11023#L55-3 assume ~p_dw_pc~0 == 1; 11019#L56-1 assume ~q_read_ev~0 == 1;is_do_write_p_triggered_~__retres1~0 := 1; 11020#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 10965#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 10966#L305-3 assume !(activate_threads_~tmp~1 != 0); 10768#L305-5 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 10766#L74-3 assume !(~c_dr_pc~0 == 1); 10764#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 10762#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 10760#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 10758#L313-3 assume !(activate_threads_~tmp___0~1 != 0); 10756#L313-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 10754#L283-3 assume !(~q_read_ev~0 == 1); 10751#L283-5 assume !(~q_write_ev~0 == 1); 10748#L288-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 10745#L245-1 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 10747#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 11051#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 11049#L384 assume stop_simulation_~tmp~3 != 0;stop_simulation_~__retres2~0 := 0; 11047#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 11046#L392 start_simulation_#t~ret9 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 11044#L426 assume !(start_simulation_~tmp~4 != 0); 11042#L409-3 assume true; 10562#L409-1 [2018-11-10 07:49:46,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:49:46,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1392540969, now seen corresponding path program 1 times [2018-11-10 07:49:46,239 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:49:46,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:49:46,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:46,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:49:46,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:46,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:49:46,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:49:46,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:49:46,249 INFO L82 PathProgramCache]: Analyzing trace with hash 73375067, now seen corresponding path program 1 times [2018-11-10 07:49:46,249 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:49:46,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:49:46,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:46,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:49:46,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:46,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:49:46,305 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 07:49:46,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:49:46,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 07:49:46,305 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:49:46,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 07:49:46,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-10 07:49:46,306 INFO L87 Difference]: Start difference. First operand 1259 states and 1615 transitions. cyclomatic complexity: 362 Second operand 6 states. [2018-11-10 07:49:46,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:49:46,370 INFO L93 Difference]: Finished difference Result 1293 states and 1607 transitions. [2018-11-10 07:49:46,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 07:49:46,371 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1293 states and 1607 transitions. [2018-11-10 07:49:46,375 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 735 [2018-11-10 07:49:46,377 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1293 states to 1244 states and 1554 transitions. [2018-11-10 07:49:46,377 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 846 [2018-11-10 07:49:46,378 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 846 [2018-11-10 07:49:46,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1244 states and 1554 transitions. [2018-11-10 07:49:46,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:49:46,378 INFO L705 BuchiCegarLoop]: Abstraction has 1244 states and 1554 transitions. [2018-11-10 07:49:46,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states and 1554 transitions. [2018-11-10 07:49:46,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 1244. [2018-11-10 07:49:46,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1244 states. [2018-11-10 07:49:46,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 1554 transitions. [2018-11-10 07:49:46,389 INFO L728 BuchiCegarLoop]: Abstraction has 1244 states and 1554 transitions. [2018-11-10 07:49:46,390 INFO L608 BuchiCegarLoop]: Abstraction has 1244 states and 1554 transitions. [2018-11-10 07:49:46,390 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 07:49:46,390 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1244 states and 1554 transitions. [2018-11-10 07:49:46,393 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 735 [2018-11-10 07:49:46,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:49:46,393 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:49:46,394 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:49:46,394 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:49:46,394 INFO L793 eck$LassoCheckResult]: Stem: 12884#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 12717#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 12718#L452 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 12805#L212 assume !(~q_req_up~0 == 1); 12848#L212-2 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 12980#L227 assume ~p_dw_i~0 == 1;~p_dw_st~0 := 0; 12979#L227-2 assume ~c_dr_i~0 == 1;~c_dr_st~0 := 0; 12774#L232-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 12775#L265 assume !(~q_read_ev~0 == 0); 12776#L265-2 assume !(~q_write_ev~0 == 0); 12777#L270-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 12864#L55 assume !(~p_dw_pc~0 == 1); 12800#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 12883#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 12957#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 12955#L305 assume !(activate_threads_~tmp~1 != 0); 12953#L305-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 12951#L74 assume !(~c_dr_pc~0 == 1); 12949#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 12947#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 12945#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 12943#L313 assume !(activate_threads_~tmp___0~1 != 0); 12941#L313-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 12939#L283 assume !(~q_read_ev~0 == 1); 12895#L283-2 assume !(~q_write_ev~0 == 1); 12922#L288-1 assume { :end_inline_reset_delta_events } true; 13227#L409-3 assume true; 13228#L409-1 [2018-11-10 07:49:46,394 INFO L795 eck$LassoCheckResult]: Loop: 13228#L409-1 assume !false; 13896#L410 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 13895#L354 assume true; 13893#L329-1 assume !false; 13892#L330 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 13890#L245 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 13343#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 13888#L258 eval_#t~ret5 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 13887#L334 assume eval_~tmp___1~0 != 0; 12765#L334-1 assume ~p_dw_st~0 == 0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; 12711#L343 assume eval_~tmp~2 != 0;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet2; 12712#L118 assume ~p_dw_pc~0 == 0; 13587#L129-2 assume true; 13586#L129 assume !false; 13584#L130 assume ~q_free~0 == 0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 13583#L148 assume { :end_inline_do_write_p } true; 13581#L339 assume !(~c_dr_st~0 == 0); 12707#L354 assume true; 12708#L329-1 assume !false; 13345#L330 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 13342#L245 assume !(~p_dw_st~0 == 0); 13339#L249 assume !(~c_dr_st~0 == 0);exists_runnable_thread_~__retres1~2 := 0; 13337#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 13335#L258 eval_#t~ret5 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 13332#L334 assume !(eval_~tmp___1~0 != 0); 13327#L370 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 12836#L212-3 assume !(~q_req_up~0 == 1); 12834#L212-5 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 12767#L265-3 assume !(~q_read_ev~0 == 0); 12768#L265-5 assume !(~q_write_ev~0 == 0); 12803#L270-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 12849#L55-3 assume !(~p_dw_pc~0 == 1); 12790#L55-5 is_do_write_p_triggered_~__retres1~0 := 0; 12842#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 12794#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 12795#L305-3 assume !(activate_threads_~tmp~1 != 0); 12892#L305-5 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 12873#L74-3 assume !(~c_dr_pc~0 == 1); 12866#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 12867#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 12815#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 12816#L313-3 assume !(activate_threads_~tmp___0~1 != 0); 12899#L313-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 12900#L283-3 assume !(~q_read_ev~0 == 1); 12908#L283-5 assume !(~q_write_ev~0 == 1); 12909#L288-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 13931#L245-1 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 13903#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 13902#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 13901#L384 assume stop_simulation_~tmp~3 != 0;stop_simulation_~__retres2~0 := 0; 13900#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 13899#L392 start_simulation_#t~ret9 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 13898#L426 assume !(start_simulation_~tmp~4 != 0); 13897#L409-3 assume true; 13228#L409-1 [2018-11-10 07:49:46,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:49:46,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1392540969, now seen corresponding path program 2 times [2018-11-10 07:49:46,394 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:49:46,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:49:46,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:46,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:49:46,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:46,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:49:46,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:49:46,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:49:46,403 INFO L82 PathProgramCache]: Analyzing trace with hash 853355996, now seen corresponding path program 1 times [2018-11-10 07:49:46,403 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:49:46,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:49:46,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:46,404 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:49:46,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:46,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:49:46,423 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:49:46,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:49:46,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:49:46,424 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:49:46,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:49:46,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:49:46,424 INFO L87 Difference]: Start difference. First operand 1244 states and 1554 transitions. cyclomatic complexity: 316 Second operand 3 states. [2018-11-10 07:49:46,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:49:46,440 INFO L93 Difference]: Finished difference Result 1342 states and 1633 transitions. [2018-11-10 07:49:46,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:49:46,441 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1342 states and 1633 transitions. [2018-11-10 07:49:46,445 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 743 [2018-11-10 07:49:46,448 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1342 states to 1342 states and 1633 transitions. [2018-11-10 07:49:46,448 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 910 [2018-11-10 07:49:46,449 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 910 [2018-11-10 07:49:46,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1342 states and 1633 transitions. [2018-11-10 07:49:46,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:49:46,449 INFO L705 BuchiCegarLoop]: Abstraction has 1342 states and 1633 transitions. [2018-11-10 07:49:46,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states and 1633 transitions. [2018-11-10 07:49:46,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1326. [2018-11-10 07:49:46,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1326 states. [2018-11-10 07:49:46,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 1613 transitions. [2018-11-10 07:49:46,461 INFO L728 BuchiCegarLoop]: Abstraction has 1326 states and 1613 transitions. [2018-11-10 07:49:46,461 INFO L608 BuchiCegarLoop]: Abstraction has 1326 states and 1613 transitions. [2018-11-10 07:49:46,461 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 07:49:46,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1326 states and 1613 transitions. [2018-11-10 07:49:46,464 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 735 [2018-11-10 07:49:46,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:49:46,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:49:46,465 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:49:46,465 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:49:46,465 INFO L793 eck$LassoCheckResult]: Stem: 15482#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 15309#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 15310#L452 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 15400#L212 assume !(~q_req_up~0 == 1); 15447#L212-2 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 15565#L227 assume ~p_dw_i~0 == 1;~p_dw_st~0 := 0; 15336#L227-2 assume ~c_dr_i~0 == 1;~c_dr_st~0 := 0; 15337#L232-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 15367#L265 assume !(~q_read_ev~0 == 0); 15368#L265-2 assume !(~q_write_ev~0 == 0); 15369#L270-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 15462#L55 assume ~p_dw_pc~0 == 1; 15391#L56 assume ~q_read_ev~0 == 1;is_do_write_p_triggered_~__retres1~0 := 1; 15392#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 15649#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 15650#L305 assume activate_threads_~tmp~1 != 0;~p_dw_st~0 := 0; 15527#L305-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 15528#L74 assume !(~c_dr_pc~0 == 1); 15632#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 15633#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 15628#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 15629#L313 assume !(activate_threads_~tmp___0~1 != 0); 15620#L313-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 15621#L283 assume ~q_read_ev~0 == 1;~q_read_ev~0 := 2; 15526#L283-2 assume !(~q_write_ev~0 == 1); 15311#L288-1 assume { :end_inline_reset_delta_events } true; 15312#L409-3 assume true; 16145#L409-1 [2018-11-10 07:49:46,465 INFO L795 eck$LassoCheckResult]: Loop: 16145#L409-1 assume !false; 16143#L410 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 16141#L354 assume true; 16139#L329-1 assume !false; 16137#L330 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 16135#L245 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 16125#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 16132#L258 eval_#t~ret5 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 16130#L334 assume eval_~tmp___1~0 != 0; 16129#L334-1 assume ~p_dw_st~0 == 0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; 16063#L343 assume eval_~tmp~2 != 0;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet2; 16126#L118 assume !(~p_dw_pc~0 == 0); 16123#L121 assume ~p_dw_pc~0 == 1; 16068#L131 ~q_buf_0~0 := do_write_p_#t~nondet2;havoc do_write_p_#t~nondet2;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := ~p_num_write~0 + 1;~q_free~0 := 0;~q_req_up~0 := 1; 16089#L129-2 assume true; 16087#L129 assume !false; 16067#L130 assume ~q_free~0 == 0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 16064#L148 assume { :end_inline_do_write_p } true; 16060#L339 assume !(~c_dr_st~0 == 0); 16058#L354 assume true; 16128#L329-1 assume !false; 16127#L330 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 16124#L245 assume !(~p_dw_st~0 == 0); 16121#L249 assume !(~c_dr_st~0 == 0);exists_runnable_thread_~__retres1~2 := 0; 16122#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 16201#L258 eval_#t~ret5 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 16199#L334 assume !(eval_~tmp___1~0 != 0); 16196#L370 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 16192#L212-3 assume !(~q_req_up~0 == 1); 16193#L212-5 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 16372#L265-3 assume !(~q_read_ev~0 == 0); 15396#L265-5 assume !(~q_write_ev~0 == 0); 15397#L270-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 15442#L55-3 assume ~p_dw_pc~0 == 1; 15382#L56-1 assume !(~q_read_ev~0 == 1); 15383#L55-5 is_do_write_p_triggered_~__retres1~0 := 0; 15438#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 16391#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 15493#L305-3 assume !(activate_threads_~tmp~1 != 0); 15494#L305-5 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 15470#L74-3 assume !(~c_dr_pc~0 == 1); 15471#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 16590#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 16588#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 16586#L313-3 assume !(activate_threads_~tmp___0~1 != 0); 16584#L313-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 16583#L283-3 assume !(~q_read_ev~0 == 1); 16157#L283-5 assume !(~q_write_ev~0 == 1); 16153#L288-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 16150#L245-1 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 16151#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 16159#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 16158#L384 assume stop_simulation_~tmp~3 != 0;stop_simulation_~__retres2~0 := 0; 16154#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 16152#L392 start_simulation_#t~ret9 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 16149#L426 assume !(start_simulation_~tmp~4 != 0); 16147#L409-3 assume true; 16145#L409-1 [2018-11-10 07:49:46,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:49:46,465 INFO L82 PathProgramCache]: Analyzing trace with hash -42288370, now seen corresponding path program 1 times [2018-11-10 07:49:46,465 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:49:46,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:49:46,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:46,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:49:46,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:49:46,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:49:46,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:49:46,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:49:46,479 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:49:46,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:49:46,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1736843849, now seen corresponding path program 1 times [2018-11-10 07:49:46,479 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:49:46,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:49:46,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:46,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:49:46,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:49:46,495 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:49:46,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:49:46,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:49:46,496 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:49:46,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:49:46,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:49:46,496 INFO L87 Difference]: Start difference. First operand 1326 states and 1613 transitions. cyclomatic complexity: 293 Second operand 3 states. [2018-11-10 07:49:46,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:49:46,528 INFO L93 Difference]: Finished difference Result 1288 states and 1566 transitions. [2018-11-10 07:49:46,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:49:46,529 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1288 states and 1566 transitions. [2018-11-10 07:49:46,532 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 743 [2018-11-10 07:49:46,535 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1288 states to 1288 states and 1566 transitions. [2018-11-10 07:49:46,535 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 856 [2018-11-10 07:49:46,535 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 856 [2018-11-10 07:49:46,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1288 states and 1566 transitions. [2018-11-10 07:49:46,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:49:46,536 INFO L705 BuchiCegarLoop]: Abstraction has 1288 states and 1566 transitions. [2018-11-10 07:49:46,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states and 1566 transitions. [2018-11-10 07:49:46,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1272. [2018-11-10 07:49:46,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2018-11-10 07:49:46,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1546 transitions. [2018-11-10 07:49:46,547 INFO L728 BuchiCegarLoop]: Abstraction has 1272 states and 1546 transitions. [2018-11-10 07:49:46,547 INFO L608 BuchiCegarLoop]: Abstraction has 1272 states and 1546 transitions. [2018-11-10 07:49:46,547 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 07:49:46,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1272 states and 1546 transitions. [2018-11-10 07:49:46,550 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 735 [2018-11-10 07:49:46,550 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:49:46,550 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:49:46,550 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:49:46,550 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 07:49:46,551 INFO L793 eck$LassoCheckResult]: Stem: 18097#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 17930#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 17931#L452 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 18014#L212 assume !(~q_req_up~0 == 1); 18057#L212-2 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 18166#L227 assume ~p_dw_i~0 == 1;~p_dw_st~0 := 0; 18164#L227-2 assume ~c_dr_i~0 == 1;~c_dr_st~0 := 0; 18162#L232-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 18160#L265 assume !(~q_read_ev~0 == 0); 18158#L265-2 assume !(~q_write_ev~0 == 0); 18157#L270-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 18156#L55 assume !(~p_dw_pc~0 == 1); 18155#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 18154#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 18153#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 18130#L305 assume !(activate_threads_~tmp~1 != 0); 18131#L305-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 18117#L74 assume !(~c_dr_pc~0 == 1); 18118#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 18150#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 18033#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 18034#L313 assume !(activate_threads_~tmp___0~1 != 0); 18136#L313-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 18107#L283 assume !(~q_read_ev~0 == 1); 18108#L283-2 assume !(~q_write_ev~0 == 1); 17932#L288-1 assume { :end_inline_reset_delta_events } true; 17933#L409-3 assume true; 18374#L409-1 assume !false; 19170#L410 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 19169#L354 assume true; 19168#L329-1 assume !false; 19167#L330 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 19166#L245 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 19165#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 19164#L258 eval_#t~ret5 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 19163#L334 assume eval_~tmp___1~0 != 0; 19162#L334-1 assume ~p_dw_st~0 == 0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; 19161#L343 assume eval_~tmp~2 != 0;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet2; 19160#L118 assume ~p_dw_pc~0 == 0; 19158#L129-2 [2018-11-10 07:49:46,551 INFO L795 eck$LassoCheckResult]: Loop: 19158#L129-2 assume true; 18127#L129 assume !false; 18128#L130 assume !(~q_free~0 == 0); 18100#L131 ~q_buf_0~0 := do_write_p_#t~nondet2;havoc do_write_p_#t~nondet2;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := ~p_num_write~0 + 1;~q_free~0 := 0;~q_req_up~0 := 1; 19158#L129-2 [2018-11-10 07:49:46,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:49:46,551 INFO L82 PathProgramCache]: Analyzing trace with hash -2036845665, now seen corresponding path program 1 times [2018-11-10 07:49:46,551 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:49:46,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:49:46,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:46,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:49:46,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:46,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:49:46,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:49:46,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:49:46,562 INFO L82 PathProgramCache]: Analyzing trace with hash 6470825, now seen corresponding path program 1 times [2018-11-10 07:49:46,562 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:49:46,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:49:46,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:46,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:49:46,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:46,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:49:46,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:49:46,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:49:46,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1381757255, now seen corresponding path program 1 times [2018-11-10 07:49:46,567 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:49:46,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:49:46,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:46,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:49:46,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:46,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:49:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:49:46,610 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:49:46,610 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:49:46,610 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:49:46,611 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:49:46,611 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 07:49:46,611 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:49:46,611 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:49:46,611 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:49:46,611 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_2_false-unreach-call_false-termination.cil.c_Iteration12_Loop [2018-11-10 07:49:46,611 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:49:46,611 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:49:46,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:46,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:46,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:46,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:46,654 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:49:46,655 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/bin-2019/uautomizer/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:49:46,658 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:49:46,658 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:49:46,671 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:49:46,671 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~q_buf_0~0=1, ~p_last_write~0=1, ULTIMATE.start_do_write_p_#t~nondet2=1} Honda state: {~q_buf_0~0=1, ~p_last_write~0=1, ULTIMATE.start_do_write_p_#t~nondet2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/bin-2019/uautomizer/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:49:46,689 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:49:46,689 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/bin-2019/uautomizer/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:49:46,727 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 07:49:46,727 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:49:46,750 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:49:46,751 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~p_num_write~0=0} Honda state: {~p_num_write~0=0} Generalized eigenvectors: [{~p_num_write~0=0}, {~p_num_write~0=3}, {~p_num_write~0=-2}] Lambdas: [14, 1, 1] Nus: [0, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/bin-2019/uautomizer/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:49:46,769 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:49:46,769 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/bin-2019/uautomizer/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:49:46,815 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 07:49:46,815 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:49:46,838 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 07:49:46,840 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:49:46,840 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:49:46,840 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:49:46,840 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:49:46,840 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:49:46,840 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:49:46,840 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:49:46,840 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:49:46,840 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_2_false-unreach-call_false-termination.cil.c_Iteration12_Loop [2018-11-10 07:49:46,841 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:49:46,841 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:49:46,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:46,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:46,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:46,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:46,885 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:49:46,885 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:49:46,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:46,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:49:46,886 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:49:46,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:46,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:46,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:49:46,887 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:49:46,887 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:49:46,889 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:46,889 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:46,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:49:46,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:49:46,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:46,890 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 07:49:46,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:49:46,890 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 07:49:46,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:49:46,892 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:46,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:46,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:49:46,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:49:46,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:46,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:46,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:49:46,894 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:49:46,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:49:46,895 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:46,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:46,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:49:46,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:49:46,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:46,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:46,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:49:46,896 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:49:46,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:49:46,897 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:46,897 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 07:49:46,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:46,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:49:46,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:49:46,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:46,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:46,899 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 07:49:46,899 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 07:49:46,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:49:46,901 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:46,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:46,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:49:46,901 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:49:46,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:46,902 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 07:49:46,902 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 07:49:46,903 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:49:46,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:49:46,905 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:46,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:46,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:49:46,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:49:46,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:46,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:46,907 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 07:49:46,907 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 07:49:46,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:49:46,908 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:46,908 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:46,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:49:46,909 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:49:46,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:46,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:46,909 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 07:49:46,910 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 07:49:46,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:49:46,911 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:46,911 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 07:49:46,911 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:46,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:49:46,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:49:46,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:46,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:46,912 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 07:49:46,912 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 07:49:46,913 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:49:46,914 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:46,915 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:46,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:49:46,915 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:49:46,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:46,915 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 07:49:46,915 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 07:49:46,916 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 07:49:46,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:49:46,920 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:46,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:46,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:49:46,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:49:46,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:46,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:46,921 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 07:49:46,922 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 07:49:46,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:49:46,923 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:46,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:46,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:49:46,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:49:46,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:46,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:46,924 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 07:49:46,924 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 07:49:46,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:49:46,926 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:46,926 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 07:49:46,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:46,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:49:46,927 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:49:46,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:46,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:46,927 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 07:49:46,928 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 07:49:46,928 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:49:46,930 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:46,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:46,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:49:46,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:49:46,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:46,931 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 07:49:46,931 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 07:49:46,932 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 07:49:46,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:49:46,936 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:46,937 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:46,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:49:46,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:49:46,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:46,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:46,937 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 07:49:46,938 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 07:49:46,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:49:46,939 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:46,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:46,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:49:46,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:49:46,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:46,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:46,940 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 07:49:46,941 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 07:49:46,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:49:46,943 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:46,943 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 07:49:46,943 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:46,944 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:49:46,944 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 07:49:46,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:49:46,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:46,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:46,944 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 07:49:46,945 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 07:49:46,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:49:46,950 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:46,951 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:46,951 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:49:46,951 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 07:49:46,952 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:49:46,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:46,952 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 07:49:46,952 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 07:49:46,953 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:49:46,953 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:49:46,958 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:46,959 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:46,959 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:49:46,959 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 07:49:46,959 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:49:46,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:46,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:46,960 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 07:49:46,961 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 07:49:46,961 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:49:46,962 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:46,962 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:46,962 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:49:46,962 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 07:49:46,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:49:46,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:46,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:46,963 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 07:49:46,963 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 07:49:46,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:49:46,966 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:46,966 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 07:49:46,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:46,967 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:49:46,967 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 07:49:46,967 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:49:46,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:46,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:46,967 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 07:49:46,969 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 07:49:46,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:49:46,977 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:46,977 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:46,978 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:49:46,978 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 07:49:46,978 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:49:46,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:46,978 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 07:49:46,978 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 07:49:46,980 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 07:49:46,980 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:49:46,988 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:46,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:46,988 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:49:46,989 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 07:49:46,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:49:46,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:46,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:46,989 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 07:49:46,990 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 07:49:46,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:49:46,992 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:46,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:46,993 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:49:46,993 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 07:49:46,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:49:46,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:46,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:46,993 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 07:49:46,994 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 07:49:46,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:49:46,998 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:46,998 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 07:49:46,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:46,999 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:49:46,999 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 07:49:46,999 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:49:46,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:46,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:46,999 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 07:49:47,001 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 07:49:47,001 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:49:47,015 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:47,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:47,016 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:49:47,016 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 07:49:47,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:49:47,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:47,017 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 07:49:47,017 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 07:49:47,019 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 07:49:47,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:49:47,030 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:47,030 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:47,031 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:49:47,031 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 07:49:47,031 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:49:47,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:47,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:47,031 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 07:49:47,033 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 07:49:47,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:49:47,034 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:47,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:47,035 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:49:47,035 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 07:49:47,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:49:47,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:47,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:47,036 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 07:49:47,037 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 07:49:47,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:49:47,042 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:47,042 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 07:49:47,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:47,043 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:49:47,043 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 07:49:47,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:49:47,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:47,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:47,043 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 07:49:47,044 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 07:49:47,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:49:47,047 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:47,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:47,048 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:49:47,048 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 07:49:47,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:49:47,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:47,048 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 07:49:47,048 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 07:49:47,049 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 07:49:47,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:49:47,054 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:47,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:47,055 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:49:47,055 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 07:49:47,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:49:47,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:47,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:47,056 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 07:49:47,056 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 07:49:47,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:49:47,059 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:47,060 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:47,060 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:49:47,060 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 07:49:47,060 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:49:47,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:47,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:47,061 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 07:49:47,061 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 07:49:47,061 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:49:47,069 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:47,069 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 07:49:47,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:47,070 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:49:47,070 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 07:49:47,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:49:47,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:47,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:47,071 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 07:49:47,071 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:49:47,071 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:49:47,078 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:47,089 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:47,089 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:49:47,089 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 07:49:47,089 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:49:47,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:47,090 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 07:49:47,090 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 07:49:47,091 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 07:49:47,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:49:47,105 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:47,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:47,106 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:49:47,106 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 07:49:47,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:49:47,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:47,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:47,110 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 07:49:47,111 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:49:47,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:49:47,117 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:47,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:47,118 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 07:49:47,118 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 07:49:47,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:49:47,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:47,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:47,119 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 07:49:47,119 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:49:47,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:49:47,124 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:47,339 WARN L179 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 89 [2018-11-10 07:49:47,377 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:49:47,377 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:49:47,378 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:49:47,378 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:49:47,378 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 07:49:47,378 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:49:47,378 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:49:47,378 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:49:47,378 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_2_false-unreach-call_false-termination.cil.c_Iteration12_Lasso [2018-11-10 07:49:47,378 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:49:47,378 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:49:47,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:47,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:47,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:47,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:47,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:47,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:47,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:47,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:47,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:47,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:47,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:47,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:47,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:47,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:47,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:47,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:47,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:47,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:47,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:47,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:47,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:47,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:47,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:47,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:47,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:47,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:47,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:47,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:47,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:47,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:47,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:47,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:47,607 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:49:47,607 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/bin-2019/uautomizer/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:49:47,619 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:49:47,619 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:49:47,621 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:49:47,621 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c_dr_st~0=0} Honda state: {~c_dr_st~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/bin-2019/uautomizer/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:49:47,639 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:49:47,639 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:49:47,641 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:49:47,641 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~__retres1~3=0} Honda state: {ULTIMATE.start_main_~__retres1~3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/bin-2019/uautomizer/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:49:47,667 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:49:47,667 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:49:47,670 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:49:47,670 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_~tmp~1=0, ULTIMATE.start_is_do_write_p_triggered_#res=0} Honda state: {ULTIMATE.start_activate_threads_~tmp~1=0, ULTIMATE.start_is_do_write_p_triggered_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/bin-2019/uautomizer/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:49:47,695 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:49:47,695 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:49:47,711 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:49:47,711 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~kernel_st~0=0} Honda state: {ULTIMATE.start_start_simulation_~kernel_st~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/bin-2019/uautomizer/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:49:47,737 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:49:47,737 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:49:47,739 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:49:47,739 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/bin-2019/uautomizer/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:49:47,757 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:49:47,757 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:49:47,759 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:49:47,759 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~tmp~4=0} Honda state: {ULTIMATE.start_start_simulation_~tmp~4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/bin-2019/uautomizer/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:49:47,776 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:49:47,776 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:49:47,778 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:49:47,778 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_#t~ret9=0} Honda state: {ULTIMATE.start_start_simulation_#t~ret9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/bin-2019/uautomizer/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:49:47,795 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:49:47,795 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:49:47,799 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:49:47,799 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_#t~ret3=0} Honda state: {ULTIMATE.start_activate_threads_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/bin-2019/uautomizer/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:49:47,816 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:49:47,816 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:49:47,818 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:49:47,818 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a_t~0=0} Honda state: {~a_t~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/bin-2019/uautomizer/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:49:47,844 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:49:47,844 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:49:47,846 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:49:47,846 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_is_do_read_c_triggered_~__retres1~1=0} Honda state: {ULTIMATE.start_is_do_read_c_triggered_~__retres1~1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/bin-2019/uautomizer/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:49:47,864 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:49:47,864 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:49:47,870 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:49:47,870 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_exists_runnable_thread_~__retres1~2=0, ULTIMATE.start_exists_runnable_thread_#res=0, ULTIMATE.start_eval_~tmp___1~0=0} Honda state: {ULTIMATE.start_exists_runnable_thread_~__retres1~2=1, ULTIMATE.start_exists_runnable_thread_#res=1, ULTIMATE.start_eval_~tmp___1~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/bin-2019/uautomizer/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:49:47,887 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:49:47,887 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:49:47,889 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:49:47,889 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~ret5=0} Honda state: {ULTIMATE.start_eval_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/bin-2019/uautomizer/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:49:47,907 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:49:47,907 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:49:47,910 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:49:47,910 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~p_last_write~0=0, ~q_buf_0~0=0, ULTIMATE.start_do_write_p_#t~nondet2=0} Honda state: {~p_last_write~0=0, ~q_buf_0~0=0, ULTIMATE.start_do_write_p_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/bin-2019/uautomizer/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:49:47,930 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:49:47,931 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:49:47,933 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:49:47,933 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c_dr_pc~0=0} Honda state: {~c_dr_pc~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/bin-2019/uautomizer/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:49:47,955 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:49:47,955 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:49:47,957 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:49:47,958 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet6=0} Honda state: {ULTIMATE.start_eval_#t~nondet6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/bin-2019/uautomizer/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:49:47,976 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:49:47,976 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:49:47,997 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:49:47,997 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c_dr_i~0=0} Honda state: {~c_dr_i~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/bin-2019/uautomizer/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:49:48,000 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:49:48,000 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:49:48,016 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:49:48,017 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~p_dw_st~0=0} Honda state: {~p_dw_st~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/bin-2019/uautomizer/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:49:48,019 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:49:48,020 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:49:48,021 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:49:48,022 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~p_dw_pc~0=0} Honda state: {~p_dw_pc~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/bin-2019/uautomizer/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:49:48,038 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:49:48,038 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/bin-2019/uautomizer/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:49:48,057 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 07:49:48,057 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:49:48,081 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:49:48,081 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~p_num_write~0=0} Honda state: {~p_num_write~0=0} Generalized eigenvectors: [{~p_num_write~0=0}, {~p_num_write~0=3}, {~p_num_write~0=-2}] Lambdas: [14, 1, 1] Nus: [0, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/bin-2019/uautomizer/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:49:48,098 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:49:48,098 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:49:48,100 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:49:48,101 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c_last_read~0=0} Honda state: {~c_last_read~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/bin-2019/uautomizer/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:49:48,117 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:49:48,117 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:49:48,134 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:49:48,134 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~p_dw_i~0=0} Honda state: {~p_dw_i~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/bin-2019/uautomizer/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:49:48,138 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:49:48,138 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:49:48,140 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:49:48,140 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet7=0} Honda state: {ULTIMATE.start_eval_#t~nondet7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/bin-2019/uautomizer/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:49:48,156 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:49:48,157 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:49:48,158 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:49:48,159 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_#t~ret4=0} Honda state: {ULTIMATE.start_activate_threads_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/bin-2019/uautomizer/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:49:48,175 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:49:48,175 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:49:48,177 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 07:49:48,177 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___0~2=0} Honda state: {ULTIMATE.start_eval_~tmp___0~2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/bin-2019/uautomizer/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:49:48,193 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:49:48,193 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/bin-2019/uautomizer/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:49:48,211 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 07:49:48,212 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:49:48,240 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 07:49:48,241 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:49:48,242 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:49:48,242 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:49:48,242 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:49:48,242 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:49:48,242 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:49:48,242 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:49:48,242 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:49:48,242 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_2_false-unreach-call_false-termination.cil.c_Iteration12_Lasso [2018-11-10 07:49:48,242 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:49:48,242 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:49:48,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:48,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:48,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:48,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:48,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:48,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:48,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:48,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:48,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:48,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:48,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:48,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:48,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:48,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:48,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:48,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:48,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:48,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:48,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:48,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:48,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:48,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:48,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:48,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:48,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:48,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:48,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:48,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:48,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:48,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:48,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:48,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:49:48,520 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:49:48,520 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:49:48,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:48,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:49:48,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:48,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:48,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:49:48,522 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:49:48,522 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:49:48,524 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:48,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:48,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:49:48,525 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:49:48,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:48,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:48,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:49:48,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:49:48,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:49:48,526 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:48,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:48,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:49:48,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:49:48,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:48,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:48,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:49:48,527 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:49:48,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:49:48,527 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:48,527 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:48,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:49:48,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:48,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:48,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:49:48,528 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:49:48,528 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:49:48,529 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:48,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:48,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:49:48,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:48,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:48,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:49:48,531 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:49:48,531 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:49:48,533 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:48,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:48,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:49:48,534 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:49:48,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:48,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:48,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:49:48,534 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:49:48,534 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:49:48,534 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:48,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:48,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:49:48,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:48,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:48,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:49:48,536 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:49:48,536 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:49:48,537 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:48,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:48,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:49:48,537 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:49:48,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:48,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:48,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:49:48,538 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:49:48,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:49:48,539 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:48,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:48,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:49:48,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:48,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:48,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:49:48,540 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:49:48,540 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:49:48,541 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:48,542 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:48,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:49:48,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:48,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:48,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:49:48,544 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:49:48,544 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:49:48,545 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:48,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:48,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:49:48,546 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:49:48,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:48,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:48,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:49:48,546 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:49:48,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:49:48,547 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:48,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:48,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:49:48,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:49:48,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:48,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:48,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:49:48,548 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:49:48,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:49:48,548 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:48,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:48,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:49:48,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:48,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:48,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:49:48,549 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:49:48,549 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:49:48,552 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:48,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:48,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:49:48,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:48,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:48,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:49:48,553 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:49:48,553 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:49:48,554 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:48,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:48,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:49:48,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:48,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:48,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:49:48,556 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:49:48,556 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:49:48,557 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:48,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:48,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:49:48,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:49:48,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:48,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:48,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:49:48,558 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:49:48,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:49:48,559 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:48,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:48,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:49:48,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:48,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:48,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:49:48,561 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:49:48,561 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:49:48,563 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:48,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:48,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:49:48,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:48,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:48,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:49:48,564 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:49:48,564 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:49:48,565 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:48,565 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:48,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:49:48,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:48,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:48,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:49:48,566 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:49:48,567 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:49:48,567 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:48,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:48,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:49:48,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:48,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:48,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:49:48,569 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:49:48,569 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:49:48,570 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:48,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:48,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:49:48,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:48,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:48,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:49:48,571 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:49:48,571 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:49:48,574 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:48,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:48,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:49:48,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:48,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:48,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:49:48,575 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:49:48,575 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:49:48,576 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:48,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:48,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:49:48,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:48,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:48,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:49:48,577 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:49:48,577 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:49:48,580 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:48,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:48,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:49:48,581 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:49:48,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:48,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:48,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:49:48,581 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:49:48,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:49:48,582 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:48,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:48,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:49:48,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:49:48,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:48,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:49:48,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:49:48,583 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:49:48,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:49:48,583 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:49:48,583 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:49:48,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:49:48,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:49:48,584 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 07:49:48,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:49:48,585 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-10 07:49:48,585 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 07:49:48,597 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:49:48,611 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 07:49:48,611 INFO L444 ModelExtractionUtils]: 5 out of 11 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 07:49:48,611 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:49:48,613 INFO L440 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2018-11-10 07:49:48,614 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:49:48,614 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(~q_free~0) = 1*~q_free~0 Supporting invariants [1*~q_free~0 >= 0] [2018-11-10 07:49:48,654 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2018-11-10 07:49:48,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:49:48,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:49:48,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:49:48,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:49:48,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:49:48,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:49:48,784 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-10 07:49:48,785 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1272 states and 1546 transitions. cyclomatic complexity: 280 Second operand 5 states. [2018-11-10 07:49:48,884 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1272 states and 1546 transitions. cyclomatic complexity: 280. Second operand 5 states. Result 8652 states and 10594 transitions. Complement of second has 9 states. [2018-11-10 07:49:48,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 07:49:48,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 07:49:48,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 517 transitions. [2018-11-10 07:49:48,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 517 transitions. Stem has 39 letters. Loop has 4 letters. [2018-11-10 07:49:48,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:49:48,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 517 transitions. Stem has 43 letters. Loop has 4 letters. [2018-11-10 07:49:48,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:49:48,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 517 transitions. Stem has 39 letters. Loop has 8 letters. [2018-11-10 07:49:48,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:49:48,886 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8652 states and 10594 transitions. [2018-11-10 07:49:48,909 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 2802 [2018-11-10 07:49:48,927 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8652 states to 6612 states and 8095 transitions. [2018-11-10 07:49:48,927 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2954 [2018-11-10 07:49:48,929 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2968 [2018-11-10 07:49:48,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6612 states and 8095 transitions. [2018-11-10 07:49:48,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:49:48,929 INFO L705 BuchiCegarLoop]: Abstraction has 6612 states and 8095 transitions. [2018-11-10 07:49:48,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6612 states and 8095 transitions. [2018-11-10 07:49:48,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6612 to 6260. [2018-11-10 07:49:48,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6260 states. [2018-11-10 07:49:48,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6260 states to 6260 states and 7695 transitions. [2018-11-10 07:49:48,994 INFO L728 BuchiCegarLoop]: Abstraction has 6260 states and 7695 transitions. [2018-11-10 07:49:48,994 INFO L608 BuchiCegarLoop]: Abstraction has 6260 states and 7695 transitions. [2018-11-10 07:49:48,994 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 07:49:48,994 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6260 states and 7695 transitions. [2018-11-10 07:49:49,028 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 2587 [2018-11-10 07:49:49,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:49:49,028 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:49:49,028 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:49:49,029 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:49:49,029 INFO L793 eck$LassoCheckResult]: Stem: 28186#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 28022#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 28023#L452 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 28111#L212 assume !(~q_req_up~0 == 1); 28151#L212-2 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 28250#L227 assume ~p_dw_i~0 == 1;~p_dw_st~0 := 0; 28249#L227-2 assume ~c_dr_i~0 == 1;~c_dr_st~0 := 0; 28082#L232-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 28083#L265 assume !(~q_read_ev~0 == 0); 28084#L265-2 assume !(~q_write_ev~0 == 0); 28085#L270-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 28169#L55 assume !(~p_dw_pc~0 == 1); 28181#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 28182#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 28106#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 28107#L305 assume !(activate_threads_~tmp~1 != 0); 28224#L305-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 28213#L74 assume !(~c_dr_pc~0 == 1); 28179#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 28180#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 28131#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 28132#L313 assume !(activate_threads_~tmp___0~1 != 0); 28229#L313-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 28196#L283 assume !(~q_read_ev~0 == 1); 28197#L283-2 assume !(~q_write_ev~0 == 1); 28024#L288-1 assume { :end_inline_reset_delta_events } true; 28025#L409-3 assume true; 28283#L409-1 assume !false; 28282#L410 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 28281#L354 assume true; 28280#L329-1 assume !false; 28279#L330 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 28278#L245 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 28277#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 28276#L258 eval_#t~ret5 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 28275#L334 assume eval_~tmp___1~0 != 0; 28274#L334-1 assume ~p_dw_st~0 == 0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; 28273#L343 assume eval_~tmp~2 != 0;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet2; 28271#L118 assume ~p_dw_pc~0 == 0; 28272#L129-2 assume true; 29060#L129 [2018-11-10 07:49:49,029 INFO L795 eck$LassoCheckResult]: Loop: 29060#L129 assume !false; 31728#L130 assume ~q_free~0 == 0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 32023#L148 assume { :end_inline_do_write_p } true; 31784#L339 assume !(~c_dr_st~0 == 0); 31781#L354 assume true; 32007#L329-1 assume !false; 32006#L330 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 32005#L245 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 31748#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 31744#L258 eval_#t~ret5 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 31743#L334 assume eval_~tmp___1~0 != 0; 31739#L334-1 assume ~p_dw_st~0 == 0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; 31740#L343 assume eval_~tmp~2 != 0;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet2; 31733#L118 assume !(~p_dw_pc~0 == 0); 31734#L121 assume ~p_dw_pc~0 == 1; 31729#L131 ~q_buf_0~0 := do_write_p_#t~nondet2;havoc do_write_p_#t~nondet2;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := ~p_num_write~0 + 1;~q_free~0 := 0;~q_req_up~0 := 1; 31730#L129-2 assume true; 29060#L129 [2018-11-10 07:49:49,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:49:49,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1282294005, now seen corresponding path program 1 times [2018-11-10 07:49:49,029 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:49:49,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:49:49,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:49,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:49:49,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:49,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:49:49,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:49:49,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:49:49,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1693091944, now seen corresponding path program 1 times [2018-11-10 07:49:49,045 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:49:49,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:49:49,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:49,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:49:49,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:49,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:49:49,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:49:49,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:49:49,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:49:49,059 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:49:49,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:49:49,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:49:49,059 INFO L87 Difference]: Start difference. First operand 6260 states and 7695 transitions. cyclomatic complexity: 1468 Second operand 3 states. [2018-11-10 07:49:49,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:49:49,086 INFO L93 Difference]: Finished difference Result 6260 states and 7509 transitions. [2018-11-10 07:49:49,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:49:49,088 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6260 states and 7509 transitions. [2018-11-10 07:49:49,100 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 2361 [2018-11-10 07:49:49,116 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6260 states to 6260 states and 7509 transitions. [2018-11-10 07:49:49,116 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2722 [2018-11-10 07:49:49,118 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2722 [2018-11-10 07:49:49,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6260 states and 7509 transitions. [2018-11-10 07:49:49,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:49:49,118 INFO L705 BuchiCegarLoop]: Abstraction has 6260 states and 7509 transitions. [2018-11-10 07:49:49,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6260 states and 7509 transitions. [2018-11-10 07:49:49,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6260 to 6260. [2018-11-10 07:49:49,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6260 states. [2018-11-10 07:49:49,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6260 states to 6260 states and 7509 transitions. [2018-11-10 07:49:49,174 INFO L728 BuchiCegarLoop]: Abstraction has 6260 states and 7509 transitions. [2018-11-10 07:49:49,174 INFO L608 BuchiCegarLoop]: Abstraction has 6260 states and 7509 transitions. [2018-11-10 07:49:49,174 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-10 07:49:49,174 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6260 states and 7509 transitions. [2018-11-10 07:49:49,183 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 2361 [2018-11-10 07:49:49,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:49:49,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:49:49,183 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:49:49,184 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:49:49,184 INFO L793 eck$LassoCheckResult]: Stem: 40711#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 40548#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 40549#L452 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 40633#L212 assume !(~q_req_up~0 == 1); 40671#L212-2 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 40758#L227 assume ~p_dw_i~0 == 1;~p_dw_st~0 := 0; 40757#L227-2 assume ~c_dr_i~0 == 1;~c_dr_st~0 := 0; 40607#L232-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 40608#L265 assume !(~q_read_ev~0 == 0); 40609#L265-2 assume !(~q_write_ev~0 == 0); 40610#L270-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 40688#L55 assume !(~p_dw_pc~0 == 1); 40706#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 40707#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 40629#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 40630#L305 assume !(activate_threads_~tmp~1 != 0); 40741#L305-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 40732#L74 assume !(~c_dr_pc~0 == 1); 40703#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 40704#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 40650#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 40651#L313 assume !(activate_threads_~tmp___0~1 != 0); 40747#L313-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 40718#L283 assume !(~q_read_ev~0 == 1); 40719#L283-2 assume !(~q_write_ev~0 == 1); 40550#L288-1 assume { :end_inline_reset_delta_events } true; 40551#L409-3 assume true; 40803#L409-1 assume !false; 41785#L410 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 41782#L354 assume true; 41779#L329-1 assume !false; 41776#L330 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 41773#L245 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 41772#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 41770#L258 eval_#t~ret5 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 41767#L334 assume eval_~tmp___1~0 != 0; 41764#L334-1 assume ~p_dw_st~0 == 0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; 41761#L343 assume eval_~tmp~2 != 0;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet2; 41757#L118 assume ~p_dw_pc~0 == 0; 41753#L129-2 assume true; 41754#L129 assume !false; 42340#L130 assume ~q_free~0 == 0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 45693#L148 assume { :end_inline_do_write_p } true; 45687#L339 [2018-11-10 07:49:49,184 INFO L795 eck$LassoCheckResult]: Loop: 45687#L339 assume !(~c_dr_st~0 == 0); 45682#L354 assume true; 46226#L329-1 assume !false; 46225#L330 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 46224#L245 assume !(~p_dw_st~0 == 0); 46222#L249 assume ~c_dr_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 46218#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 46219#L258 eval_#t~ret5 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 45751#L334 assume eval_~tmp___1~0 != 0; 45692#L334-1 assume !(~p_dw_st~0 == 0); 45687#L339 [2018-11-10 07:49:49,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:49:49,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1381757167, now seen corresponding path program 1 times [2018-11-10 07:49:49,184 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:49:49,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:49:49,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:49,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:49:49,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:49,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:49:49,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:49:49,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:49:49,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:49:49,203 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:49:49,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:49:49,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1417818988, now seen corresponding path program 1 times [2018-11-10 07:49:49,204 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:49:49,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:49:49,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:49,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:49:49,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:49,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:49:49,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:49:49,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:49:49,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 07:49:49,215 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:49:49,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:49:49,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:49:49,215 INFO L87 Difference]: Start difference. First operand 6260 states and 7509 transitions. cyclomatic complexity: 1294 Second operand 3 states. [2018-11-10 07:49:49,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:49:49,250 INFO L93 Difference]: Finished difference Result 7878 states and 9175 transitions. [2018-11-10 07:49:49,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:49:49,252 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7878 states and 9175 transitions. [2018-11-10 07:49:49,266 INFO L131 ngComponentsAnalysis]: Automaton has 39 accepting balls. 2880 [2018-11-10 07:49:49,288 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7878 states to 7878 states and 9175 transitions. [2018-11-10 07:49:49,288 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3427 [2018-11-10 07:49:49,290 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3427 [2018-11-10 07:49:49,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7878 states and 9175 transitions. [2018-11-10 07:49:49,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:49:49,291 INFO L705 BuchiCegarLoop]: Abstraction has 7878 states and 9175 transitions. [2018-11-10 07:49:49,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7878 states and 9175 transitions. [2018-11-10 07:49:49,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7878 to 7878. [2018-11-10 07:49:49,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7878 states. [2018-11-10 07:49:49,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7878 states to 7878 states and 9175 transitions. [2018-11-10 07:49:49,351 INFO L728 BuchiCegarLoop]: Abstraction has 7878 states and 9175 transitions. [2018-11-10 07:49:49,351 INFO L608 BuchiCegarLoop]: Abstraction has 7878 states and 9175 transitions. [2018-11-10 07:49:49,351 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-10 07:49:49,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7878 states and 9175 transitions. [2018-11-10 07:49:49,362 INFO L131 ngComponentsAnalysis]: Automaton has 39 accepting balls. 2880 [2018-11-10 07:49:49,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:49:49,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:49:49,362 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:49:49,363 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:49:49,363 INFO L793 eck$LassoCheckResult]: Stem: 54868#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 54693#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 54694#L452 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 54779#L212 assume !(~q_req_up~0 == 1); 54825#L212-2 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 54937#L227 assume ~p_dw_i~0 == 1;~p_dw_st~0 := 0; 54936#L227-2 assume ~c_dr_i~0 == 1;~c_dr_st~0 := 0; 54752#L232-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 54753#L265 assume !(~q_read_ev~0 == 0); 54754#L265-2 assume !(~q_write_ev~0 == 0); 54755#L270-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 54846#L55 assume !(~p_dw_pc~0 == 1); 54866#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 54867#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 54774#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 54775#L305 assume !(activate_threads_~tmp~1 != 0); 54916#L305-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 54899#L74 assume !(~c_dr_pc~0 == 1); 54859#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 54860#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 54795#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 54796#L313 assume !(activate_threads_~tmp___0~1 != 0); 54919#L313-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 54881#L283 assume !(~q_read_ev~0 == 1); 54882#L283-2 assume !(~q_write_ev~0 == 1); 54695#L288-1 assume { :end_inline_reset_delta_events } true; 54696#L409-3 assume true; 54985#L409-1 assume !false; 54984#L410 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 54983#L354 assume true; 54982#L329-1 assume !false; 54981#L330 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 54980#L245 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 54979#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 54978#L258 eval_#t~ret5 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 54977#L334 assume eval_~tmp___1~0 != 0; 54975#L334-1 assume ~p_dw_st~0 == 0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; 54973#L343 assume eval_~tmp~2 != 0;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet2; 54970#L118 assume ~p_dw_pc~0 == 0; 54966#L129-2 assume true; 54962#L129 assume !false; 54953#L130 assume ~q_free~0 == 0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 54954#L148 assume { :end_inline_do_write_p } true; 54945#L339 [2018-11-10 07:49:49,363 INFO L795 eck$LassoCheckResult]: Loop: 54945#L339 assume ~c_dr_st~0 == 0;eval_~tmp___0~2 := eval_#t~nondet7;havoc eval_#t~nondet7; 54947#L358 assume !(eval_~tmp___0~2 != 0); 60939#L354 assume true; 61035#L329-1 assume !false; 54988#L330 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 54987#L245 assume !(~p_dw_st~0 == 0); 54967#L249 assume ~c_dr_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 54958#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 54955#L258 eval_#t~ret5 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 54951#L334 assume eval_~tmp___1~0 != 0; 54952#L334-1 assume !(~p_dw_st~0 == 0); 54945#L339 [2018-11-10 07:49:49,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:49:49,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1381757167, now seen corresponding path program 2 times [2018-11-10 07:49:49,363 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:49:49,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:49:49,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:49,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:49:49,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:49,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:49:49,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:49:49,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:49:49,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:49:49,383 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:49:49,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:49:49,383 INFO L82 PathProgramCache]: Analyzing trace with hash -860123838, now seen corresponding path program 1 times [2018-11-10 07:49:49,383 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:49:49,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:49:49,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:49,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:49:49,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:49:49,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:49:49,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:49:49,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:49:49,449 INFO L87 Difference]: Start difference. First operand 7878 states and 9175 transitions. cyclomatic complexity: 1366 Second operand 3 states. [2018-11-10 07:49:49,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:49:49,487 INFO L93 Difference]: Finished difference Result 10752 states and 12505 transitions. [2018-11-10 07:49:49,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:49:49,488 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10752 states and 12505 transitions. [2018-11-10 07:49:49,516 INFO L131 ngComponentsAnalysis]: Automaton has 51 accepting balls. 3872 [2018-11-10 07:49:49,543 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10752 states to 10748 states and 12501 transitions. [2018-11-10 07:49:49,543 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4708 [2018-11-10 07:49:49,548 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4708 [2018-11-10 07:49:49,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10748 states and 12501 transitions. [2018-11-10 07:49:49,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:49:49,548 INFO L705 BuchiCegarLoop]: Abstraction has 10748 states and 12501 transitions. [2018-11-10 07:49:49,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10748 states and 12501 transitions. [2018-11-10 07:49:49,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10748 to 7525. [2018-11-10 07:49:49,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7525 states. [2018-11-10 07:49:49,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7525 states to 7525 states and 8768 transitions. [2018-11-10 07:49:49,635 INFO L728 BuchiCegarLoop]: Abstraction has 7525 states and 8768 transitions. [2018-11-10 07:49:49,635 INFO L608 BuchiCegarLoop]: Abstraction has 7525 states and 8768 transitions. [2018-11-10 07:49:49,635 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-10 07:49:49,635 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7525 states and 8768 transitions. [2018-11-10 07:49:49,649 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 2380 [2018-11-10 07:49:49,649 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:49:49,649 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:49:49,650 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:49:49,650 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 07:49:49,650 INFO L793 eck$LassoCheckResult]: Stem: 73500#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 73330#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 73331#L452 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 73415#L212 assume !(~q_req_up~0 == 1); 73460#L212-2 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 73563#L227 assume ~p_dw_i~0 == 1;~p_dw_st~0 := 0; 73562#L227-2 assume ~c_dr_i~0 == 1;~c_dr_st~0 := 0; 73387#L232-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 73388#L265 assume !(~q_read_ev~0 == 0); 73389#L265-2 assume !(~q_write_ev~0 == 0); 73390#L270-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 73479#L55 assume !(~p_dw_pc~0 == 1); 73498#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 73499#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 73409#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 73410#L305 assume !(activate_threads_~tmp~1 != 0); 73541#L305-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 73529#L74 assume !(~c_dr_pc~0 == 1); 73491#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 73492#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 73431#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 73432#L313 assume !(activate_threads_~tmp___0~1 != 0); 73543#L313-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 73513#L283 assume !(~q_read_ev~0 == 1); 73514#L283-2 assume !(~q_write_ev~0 == 1); 73332#L288-1 assume { :end_inline_reset_delta_events } true; 73333#L409-3 assume true; 73614#L409-1 assume !false; 73613#L410 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 73612#L354 assume true; 73611#L329-1 assume !false; 73610#L330 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 73609#L245 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 73608#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 73607#L258 eval_#t~ret5 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 73606#L334 assume eval_~tmp___1~0 != 0; 73605#L334-1 assume ~p_dw_st~0 == 0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; 73604#L343 assume eval_~tmp~2 != 0;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet2; 73602#L118 assume !(~p_dw_pc~0 == 0); 73601#L121 assume !(~p_dw_pc~0 == 1); 73600#L129-2 assume true; 73599#L129 assume !false; 73598#L130 assume !(~q_free~0 == 0); 73593#L131 [2018-11-10 07:49:49,650 INFO L795 eck$LassoCheckResult]: Loop: 73593#L131 ~q_buf_0~0 := do_write_p_#t~nondet2;havoc do_write_p_#t~nondet2;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := ~p_num_write~0 + 1;~q_free~0 := 0;~q_req_up~0 := 1; 73591#L129-2 assume true; 73584#L129 assume !false; 73585#L130 assume !(~q_free~0 == 0); 73593#L131 [2018-11-10 07:49:49,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:49:49,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1383479148, now seen corresponding path program 1 times [2018-11-10 07:49:49,650 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:49:49,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:49:49,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:49,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:49:49,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:49,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:49:49,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:49:49,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:49:49,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:49:49,669 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:49:49,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:49:49,669 INFO L82 PathProgramCache]: Analyzing trace with hash 6911705, now seen corresponding path program 2 times [2018-11-10 07:49:49,669 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:49:49,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:49:49,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:49,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:49:49,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:49,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:49:49,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:49:49,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:49:49,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-11-10 07:49:49,703 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:49:49,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:49:49,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:49:49,703 INFO L87 Difference]: Start difference. First operand 7525 states and 8768 transitions. cyclomatic complexity: 1309 Second operand 3 states. [2018-11-10 07:49:49,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:49:49,747 INFO L93 Difference]: Finished difference Result 2865 states and 3258 transitions. [2018-11-10 07:49:49,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:49:49,749 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2865 states and 3258 transitions. [2018-11-10 07:49:49,756 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 1100 [2018-11-10 07:49:49,761 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2865 states to 2509 states and 2862 transitions. [2018-11-10 07:49:49,761 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1508 [2018-11-10 07:49:49,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1512 [2018-11-10 07:49:49,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2509 states and 2862 transitions. [2018-11-10 07:49:49,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:49:49,763 INFO L705 BuchiCegarLoop]: Abstraction has 2509 states and 2862 transitions. [2018-11-10 07:49:49,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2509 states and 2862 transitions. [2018-11-10 07:49:49,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2509 to 1788. [2018-11-10 07:49:49,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1788 states. [2018-11-10 07:49:49,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1788 states to 1788 states and 2072 transitions. [2018-11-10 07:49:49,779 INFO L728 BuchiCegarLoop]: Abstraction has 1788 states and 2072 transitions. [2018-11-10 07:49:49,779 INFO L608 BuchiCegarLoop]: Abstraction has 1788 states and 2072 transitions. [2018-11-10 07:49:49,779 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-10 07:49:49,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1788 states and 2072 transitions. [2018-11-10 07:49:49,782 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 867 [2018-11-10 07:49:49,782 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:49:49,782 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:49:49,783 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:49:49,783 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:49:49,783 INFO L793 eck$LassoCheckResult]: Stem: 83887#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 83725#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 83726#L452 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 83805#L212 assume !(~q_req_up~0 == 1); 83851#L212-2 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 83935#L227 assume ~p_dw_i~0 == 1;~p_dw_st~0 := 0; 83934#L227-2 assume ~c_dr_i~0 == 1;~c_dr_st~0 := 0; 83777#L232-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 83778#L265 assume !(~q_read_ev~0 == 0); 83779#L265-2 assume !(~q_write_ev~0 == 0); 83780#L270-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 83866#L55 assume !(~p_dw_pc~0 == 1); 83885#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 83886#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 83800#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 83801#L305 assume !(activate_threads_~tmp~1 != 0); 83919#L305-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 83910#L74 assume !(~c_dr_pc~0 == 1); 83876#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 83877#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 83822#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 83823#L313 assume !(activate_threads_~tmp___0~1 != 0); 83922#L313-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 83896#L283 assume !(~q_read_ev~0 == 1); 83897#L283-2 assume !(~q_write_ev~0 == 1); 83727#L288-1 assume { :end_inline_reset_delta_events } true; 83728#L409-3 assume true; 84495#L409-1 assume !false; 85430#L410 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 85429#L354 assume true; 85428#L329-1 assume !false; 85427#L330 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 85426#L245 assume ~p_dw_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 85425#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 85424#L258 eval_#t~ret5 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 85423#L334 assume eval_~tmp___1~0 != 0; 85422#L334-1 assume ~p_dw_st~0 == 0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; 85421#L343 assume eval_~tmp~2 != 0;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet2; 85420#L118 assume ~p_dw_pc~0 == 0; 85418#L129-2 assume true; 85416#L129 assume !false; 85414#L130 assume !(~q_free~0 == 0); 85412#L131 ~q_buf_0~0 := do_write_p_#t~nondet2;havoc do_write_p_#t~nondet2;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := ~p_num_write~0 + 1;~q_free~0 := 0;~q_req_up~0 := 1; 85410#L129-2 assume true; 85408#L129 assume !false; 85406#L130 assume ~q_free~0 == 0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 84539#L148 assume { :end_inline_do_write_p } true; 84537#L339 [2018-11-10 07:49:49,783 INFO L795 eck$LassoCheckResult]: Loop: 84537#L339 assume ~c_dr_st~0 == 0;eval_~tmp___0~2 := eval_#t~nondet7;havoc eval_#t~nondet7; 83860#L358 assume !(eval_~tmp___0~2 != 0); 83861#L354 assume true; 85417#L329-1 assume !false; 85415#L330 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 85413#L245 assume !(~p_dw_st~0 == 0); 85411#L249 assume ~c_dr_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 85409#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 85407#L258 eval_#t~ret5 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 85405#L334 assume eval_~tmp___1~0 != 0; 84538#L334-1 assume !(~p_dw_st~0 == 0); 84537#L339 [2018-11-10 07:49:49,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:49:49,783 INFO L82 PathProgramCache]: Analyzing trace with hash -180839785, now seen corresponding path program 1 times [2018-11-10 07:49:49,783 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:49:49,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:49:49,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:49,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:49:49,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:49,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:49:49,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:49:49,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:49:49,793 INFO L82 PathProgramCache]: Analyzing trace with hash -860123838, now seen corresponding path program 2 times [2018-11-10 07:49:49,793 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:49:49,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:49:49,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:49,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:49:49,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:49,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:49:49,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:49:49,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:49:49,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1142266092, now seen corresponding path program 1 times [2018-11-10 07:49:49,797 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:49:49,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:49:49,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:49,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:49:49,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:49:49,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:49:49,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:49:50,103 WARN L179 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 105 [2018-11-10 07:49:50,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 07:49:50 BoogieIcfgContainer [2018-11-10 07:49:50,165 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 07:49:50,166 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:49:50,166 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:49:50,166 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:49:50,166 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:49:44" (3/4) ... [2018-11-10 07:49:50,168 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-10 07:49:50,209 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_2bdffb24-22b1-4181-a635-bac9c953030b/bin-2019/uautomizer/witness.graphml [2018-11-10 07:49:50,210 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:49:50,210 INFO L168 Benchmark]: Toolchain (without parser) took 6702.40 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 251.1 MB). Free memory was 960.3 MB in the beginning and 1.2 GB in the end (delta: -246.0 MB). Peak memory consumption was 5.1 MB. Max. memory is 11.5 GB. [2018-11-10 07:49:50,211 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 07:49:50,211 INFO L168 Benchmark]: CACSL2BoogieTranslator took 179.19 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 946.7 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-11-10 07:49:50,211 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.29 ms. Allocated memory is still 1.0 GB. Free memory was 946.7 MB in the beginning and 944.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:49:50,211 INFO L168 Benchmark]: Boogie Preprocessor took 15.05 ms. Allocated memory is still 1.0 GB. Free memory was 944.0 MB in the beginning and 941.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:49:50,211 INFO L168 Benchmark]: RCFGBuilder took 367.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 941.4 MB in the beginning and 1.1 GB in the end (delta: -181.7 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-10 07:49:50,212 INFO L168 Benchmark]: BuchiAutomizer took 6066.10 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 94.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -92.8 MB). Peak memory consumption was 360.2 MB. Max. memory is 11.5 GB. [2018-11-10 07:49:50,212 INFO L168 Benchmark]: Witness Printer took 44.12 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-10 07:49:50,213 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 179.19 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 946.7 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.29 ms. Allocated memory is still 1.0 GB. Free memory was 946.7 MB in the beginning and 944.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.05 ms. Allocated memory is still 1.0 GB. Free memory was 944.0 MB in the beginning and 941.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 367.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 941.4 MB in the beginning and 1.1 GB in the end (delta: -181.7 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6066.10 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 94.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -92.8 MB). Peak memory consumption was 360.2 MB. Max. memory is 11.5 GB. * Witness Printer took 44.12 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 17 terminating modules (15 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * q_read_ev + 1 and consists of 3 locations. One deterministic module has affine ranking function q_free and consists of 6 locations. 15 modules have a trivial ranking function, the largest among these consists of 6 locations. The remainder module has 1788 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.0s and 17 iterations. TraceHistogramMax:2. Analysis of lassos took 4.2s. Construction of modules took 0.3s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 11. Automata minimization 0.4s AutomataMinimizationTime, 17 MinimizatonAttempts, 5254 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 7878 states and ocurred in iteration 14. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 2706 SDtfs, 2569 SDslu, 3133 SDs, 0 SdLazy, 336 SolverSat, 88 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont1 unkn0 SFLI6 SFLT0 conc0 concLT1 SILN1 SILU0 SILI7 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital70 mio100 ax100 hnf100 lsp21 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq204 hnf89 smp100 dnf151 smp87 tf105 neg92 sie115 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 30ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 27 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 354]: 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 {p_last_write=4, c_dr_i=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@134ec1f9=0, c_dr_pc=0, a_t=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@59929001=0, \result=0, \result=0, c_num_read=0, tmp=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@79c5189=0, c_dr_st=0, kernel_st=1, q_read_ev=2, p_dw_i=1, tmp___1=1, q_req_up=1, tmp___0=0, q_write_ev=2, __retres1=1, p_dw_pc=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6d9037fc=0, q_free=0, __retres1=0, p_dw_st=2, \result=0, q_ev=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5a74a71a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4671dc5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4a97c675=0, c_last_read=0, tmp___0=0, __retres1=0, tmp=0, p_num_write=1, q_buf_0=4, __retres1=0, \result=1, tmp=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 329]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L15] int q_buf_0 ; [L16] int q_free ; [L17] int q_read_ev ; [L18] int q_write_ev ; [L19] int q_req_up ; [L20] int q_ev ; [L41] int p_num_write ; [L42] int p_last_write ; [L43] int p_dw_st ; [L44] int p_dw_pc ; [L45] int p_dw_i ; [L46] int c_num_read ; [L47] int c_last_read ; [L48] int c_dr_st ; [L49] int c_dr_pc ; [L50] int c_dr_i ; [L154] static int a_t ; [L456] int __retres1 ; [L460] CALL init_model() [L442] q_free = 1 [L443] q_write_ev = 2 [L444] q_read_ev = q_write_ev [L445] p_num_write = 0 [L446] p_dw_pc = 0 [L447] p_dw_i = 1 [L448] c_num_read = 0 [L449] c_dr_pc = 0 [L450] RET c_dr_i = 1 [L460] init_model() [L461] CALL start_simulation() [L396] int kernel_st ; [L397] int tmp ; [L401] kernel_st = 0 [L402] CALL update_channels() [L212] COND FALSE, RET !((int )q_req_up == 1) [L402] update_channels() [L403] CALL init_threads() [L227] COND TRUE (int )p_dw_i == 1 [L228] p_dw_st = 0 [L232] COND TRUE (int )c_dr_i == 1 [L233] RET c_dr_st = 0 [L403] init_threads() [L404] CALL fire_delta_events() [L265] COND FALSE !((int )q_read_ev == 0) [L270] COND FALSE, RET !((int )q_write_ev == 0) [L404] fire_delta_events() [L405] CALL activate_threads() [L298] int tmp ; [L299] int tmp___0 ; [L303] CALL, EXPR is_do_write_p_triggered() [L52] int __retres1 ; [L55] COND FALSE !((int )p_dw_pc == 1) [L65] __retres1 = 0 [L67] RET return (__retres1); [L303] EXPR is_do_write_p_triggered() [L303] tmp = is_do_write_p_triggered() [L305] COND FALSE !(\read(tmp)) [L311] CALL, EXPR is_do_read_c_triggered() [L71] int __retres1 ; [L74] COND FALSE !((int )c_dr_pc == 1) [L84] __retres1 = 0 [L86] RET return (__retres1); [L311] EXPR is_do_read_c_triggered() [L311] tmp___0 = is_do_read_c_triggered() [L313] COND FALSE, RET !(\read(tmp___0)) [L405] activate_threads() [L406] CALL reset_delta_events() [L283] COND FALSE !((int )q_read_ev == 1) [L288] COND FALSE, RET !((int )q_write_ev == 1) [L406] reset_delta_events() [L409] COND TRUE 1 [L412] kernel_st = 1 [L413] CALL eval() [L323] int tmp ; [L324] int tmp___0 ; [L325] int tmp___1 ; [L329] COND TRUE 1 [L332] CALL, EXPR exists_runnable_thread() [L242] int __retres1 ; [L245] COND TRUE (int )p_dw_st == 0 [L246] __retres1 = 1 [L258] RET return (__retres1); [L332] EXPR exists_runnable_thread() [L332] tmp___1 = exists_runnable_thread() [L334] COND TRUE \read(tmp___1) [L339] COND TRUE (int )p_dw_st == 0 [L341] tmp = __VERIFIER_nondet_int() [L343] COND TRUE \read(tmp) [L345] p_dw_st = 1 [L346] CALL do_write_p() [L118] COND TRUE (int )p_dw_pc == 0 [L129] COND TRUE 1 [L131] COND FALSE !((int )q_free == 0) [L141] q_buf_0 = __VERIFIER_nondet_int() [L142] p_last_write = q_buf_0 [L143] p_num_write += 1 [L144] q_free = 0 [L145] q_req_up = 1 [L129] COND TRUE 1 [L131] COND TRUE (int )q_free == 0 [L132] p_dw_st = 2 [L133] RET p_dw_pc = 1 [L346] do_write_p() Loop: [L354] COND TRUE (int )c_dr_st == 0 [L356] tmp___0 = __VERIFIER_nondet_int() [L358] COND FALSE !(\read(tmp___0)) [L329] COND TRUE 1 [L332] CALL, EXPR exists_runnable_thread() [L242] int __retres1 ; [L245] COND FALSE !((int )p_dw_st == 0) [L249] COND TRUE (int )c_dr_st == 0 [L250] __retres1 = 1 [L258] RET return (__retres1); [L332] EXPR exists_runnable_thread() [L332] tmp___1 = exists_runnable_thread() [L334] COND TRUE \read(tmp___1) [L339] COND FALSE !((int )p_dw_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...