./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ad877ab1-7fb1-4364-9c0c-add3733e2ce6/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ad877ab1-7fb1-4364-9c0c-add3733e2ce6/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ad877ab1-7fb1-4364-9c0c-add3733e2ce6/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ad877ab1-7fb1-4364-9c0c-add3733e2ce6/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-1.c -s /tmp/vcloud-vcloud-master/worker/working_dir_ad877ab1-7fb1-4364-9c0c-add3733e2ce6/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ad877ab1-7fb1-4364-9c0c-add3733e2ce6/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 375e158327910cae8c3594f7d2ad0376509a1ecb ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:54:46,953 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:54:46,955 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:54:46,965 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:54:46,965 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:54:46,966 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:54:46,967 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:54:46,968 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:54:46,970 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:54:46,970 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:54:46,971 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:54:46,972 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:54:46,972 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:54:46,974 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:54:46,975 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:54:46,976 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:54:46,977 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:54:46,977 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:54:46,979 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:54:46,981 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:54:46,982 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:54:46,983 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:54:46,987 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:54:46,990 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:54:46,993 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:54:46,993 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:54:46,993 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:54:46,994 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:54:46,995 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:54:46,995 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:54:46,996 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:54:46,997 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:54:46,997 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:54:46,998 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:54:46,999 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:54:46,999 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:54:47,000 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:54:47,000 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:54:47,000 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:54:47,001 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:54:47,002 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:54:47,003 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ad877ab1-7fb1-4364-9c0c-add3733e2ce6/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 08:54:47,017 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:54:47,018 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:54:47,019 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:54:47,019 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:54:47,019 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:54:47,019 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:54:47,019 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:54:47,019 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:54:47,020 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:54:47,020 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:54:47,020 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:54:47,020 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:54:47,020 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:54:47,020 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:54:47,020 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:54:47,021 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:54:47,021 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:54:47,021 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:54:47,021 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:54:47,021 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:54:47,021 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:54:47,021 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:54:47,022 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:54:47,022 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:54:47,022 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:54:47,022 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:54:47,022 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:54:47,022 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:54:47,022 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:54:47,023 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:54:47,023 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:54:47,025 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:54:47,025 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_ad877ab1-7fb1-4364-9c0c-add3733e2ce6/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 375e158327910cae8c3594f7d2ad0376509a1ecb [2019-10-22 08:54:47,066 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:54:47,080 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:54:47,083 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:54:47,086 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:54:47,086 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:54:47,087 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ad877ab1-7fb1-4364-9c0c-add3733e2ce6/bin/uautomizer/../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-1.c [2019-10-22 08:54:47,151 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ad877ab1-7fb1-4364-9c0c-add3733e2ce6/bin/uautomizer/data/d14133aa6/be5f41137c9f4ccbb04e2c16b82450c3/FLAGcbdbec22c [2019-10-22 08:54:47,536 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:54:47,536 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ad877ab1-7fb1-4364-9c0c-add3733e2ce6/sv-benchmarks/c/systemc/pc_sfifo_1.cil-1.c [2019-10-22 08:54:47,544 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ad877ab1-7fb1-4364-9c0c-add3733e2ce6/bin/uautomizer/data/d14133aa6/be5f41137c9f4ccbb04e2c16b82450c3/FLAGcbdbec22c [2019-10-22 08:54:47,924 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ad877ab1-7fb1-4364-9c0c-add3733e2ce6/bin/uautomizer/data/d14133aa6/be5f41137c9f4ccbb04e2c16b82450c3 [2019-10-22 08:54:47,926 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:54:47,927 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:54:47,928 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:47,928 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:54:47,931 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:54:47,932 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:47" (1/1) ... [2019-10-22 08:54:47,935 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35b680d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:47, skipping insertion in model container [2019-10-22 08:54:47,935 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:47" (1/1) ... [2019-10-22 08:54:47,943 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:54:47,970 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:54:48,153 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:48,158 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:54:48,270 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:48,287 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:54:48,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:48 WrapperNode [2019-10-22 08:54:48,288 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:48,289 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:48,289 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:54:48,289 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:54:48,298 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:48" (1/1) ... [2019-10-22 08:54:48,306 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:48" (1/1) ... [2019-10-22 08:54:48,332 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:48,333 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:54:48,333 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:54:48,333 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:54:48,342 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:48" (1/1) ... [2019-10-22 08:54:48,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:48" (1/1) ... [2019-10-22 08:54:48,343 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:48" (1/1) ... [2019-10-22 08:54:48,344 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:48" (1/1) ... [2019-10-22 08:54:48,348 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:48" (1/1) ... [2019-10-22 08:54:48,355 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:48" (1/1) ... [2019-10-22 08:54:48,364 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:48" (1/1) ... [2019-10-22 08:54:48,366 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:54:48,367 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:54:48,367 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:54:48,368 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:54:48,368 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad877ab1-7fb1-4364-9c0c-add3733e2ce6/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:48,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:54:48,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:54:48,717 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:54:48,718 INFO L284 CfgBuilder]: Removed 44 assume(true) statements. [2019-10-22 08:54:48,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:48 BoogieIcfgContainer [2019-10-22 08:54:48,719 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:54:48,720 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:54:48,720 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:54:48,724 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:54:48,724 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:48,725 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:54:47" (1/3) ... [2019-10-22 08:54:48,726 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@290a1a3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:54:48, skipping insertion in model container [2019-10-22 08:54:48,726 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:48,726 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:48" (2/3) ... [2019-10-22 08:54:48,726 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@290a1a3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:54:48, skipping insertion in model container [2019-10-22 08:54:48,727 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:48,727 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:48" (3/3) ... [2019-10-22 08:54:48,729 INFO L371 chiAutomizerObserver]: Analyzing ICFG pc_sfifo_1.cil-1.c [2019-10-22 08:54:48,774 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:54:48,775 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:54:48,775 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:54:48,775 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:54:48,775 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:54:48,775 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:54:48,775 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:54:48,775 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:54:48,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states. [2019-10-22 08:54:48,817 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2019-10-22 08:54:48,817 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:48,817 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:48,825 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:54:48,825 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:48,826 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:54:48,826 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states. [2019-10-22 08:54:48,832 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2019-10-22 08:54:48,832 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:48,832 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:48,833 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:54:48,833 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:48,839 INFO L791 eck$LassoCheckResult]: Stem: 33#ULTIMATE.startENTRYtrue ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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; 8#L-1true havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~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; 75#L346true havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 77#L196true assume !(1 == ~p_dw_i~0);~p_dw_st~0 := 2; 74#L196-2true assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 61#L313-1true [2019-10-22 08:54:48,839 INFO L793 eck$LassoCheckResult]: Loop: 61#L313-1true assume !false; 22#L314true start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 64#L262true assume false; 37#L278true havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 69#L214-1true assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 14#L226-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 42#L227-1true stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 23#L292true assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 12#L299true stop_simulation_#res := stop_simulation_~__retres2~0; 39#L300true start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 67#L320true assume !(0 != start_simulation_~tmp~3); 61#L313-1true [2019-10-22 08:54:48,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:48,844 INFO L82 PathProgramCache]: Analyzing trace with hash 28692871, now seen corresponding path program 1 times [2019-10-22 08:54:48,850 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:48,850 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346560330] [2019-10-22 08:54:48,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:48,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:48,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:48,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:48,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:48,962 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346560330] [2019-10-22 08:54:48,962 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:48,963 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:48,963 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561355597] [2019-10-22 08:54:48,967 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:54:48,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:48,967 INFO L82 PathProgramCache]: Analyzing trace with hash -778318386, now seen corresponding path program 1 times [2019-10-22 08:54:48,968 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:48,968 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294328322] [2019-10-22 08:54:48,968 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:48,968 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:48,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:48,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:48,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:48,975 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294328322] [2019-10-22 08:54:48,976 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:48,976 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:54:48,976 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831126709] [2019-10-22 08:54:48,978 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:54:48,978 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:48,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:48,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:48,994 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 3 states. [2019-10-22 08:54:49,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:49,015 INFO L93 Difference]: Finished difference Result 75 states and 103 transitions. [2019-10-22 08:54:49,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:49,017 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 103 transitions. [2019-10-22 08:54:49,021 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2019-10-22 08:54:49,025 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 68 states and 96 transitions. [2019-10-22 08:54:49,025 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2019-10-22 08:54:49,026 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-10-22 08:54:49,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 96 transitions. [2019-10-22 08:54:49,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:49,027 INFO L688 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2019-10-22 08:54:49,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 96 transitions. [2019-10-22 08:54:49,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-10-22 08:54:49,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-22 08:54:49,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2019-10-22 08:54:49,052 INFO L711 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2019-10-22 08:54:49,053 INFO L591 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2019-10-22 08:54:49,053 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:54:49,053 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 96 transitions. [2019-10-22 08:54:49,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2019-10-22 08:54:49,054 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:49,054 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:49,058 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:54:49,058 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:49,058 INFO L791 eck$LassoCheckResult]: Stem: 205#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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; 169#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~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; 170#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 226#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 225#L196-2 assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 222#L313-1 [2019-10-22 08:54:49,058 INFO L793 eck$LassoCheckResult]: Loop: 222#L313-1 assume !false; 191#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 174#L262 assume !false; 213#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 214#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 185#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 186#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 199#L242 assume !(0 != eval_~tmp___1~0); 200#L278 havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 206#L214-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 183#L226-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 184#L227-1 stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 192#L292 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 179#L299 stop_simulation_#res := stop_simulation_~__retres2~0; 180#L300 start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 210#L320 assume !(0 != start_simulation_~tmp~3); 222#L313-1 [2019-10-22 08:54:49,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:49,059 INFO L82 PathProgramCache]: Analyzing trace with hash 28692809, now seen corresponding path program 1 times [2019-10-22 08:54:49,059 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:49,059 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419374076] [2019-10-22 08:54:49,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,060 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:49,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:49,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:49,098 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419374076] [2019-10-22 08:54:49,098 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:49,099 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:54:49,099 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5033586] [2019-10-22 08:54:49,099 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:54:49,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:49,099 INFO L82 PathProgramCache]: Analyzing trace with hash -852169887, now seen corresponding path program 1 times [2019-10-22 08:54:49,100 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:49,100 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508379667] [2019-10-22 08:54:49,100 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,100 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:49,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:49,139 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508379667] [2019-10-22 08:54:49,139 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:49,139 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:54:49,139 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915549686] [2019-10-22 08:54:49,140 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:54:49,140 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:49,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:49,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:49,141 INFO L87 Difference]: Start difference. First operand 68 states and 96 transitions. cyclomatic complexity: 29 Second operand 3 states. [2019-10-22 08:54:49,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:49,150 INFO L93 Difference]: Finished difference Result 68 states and 95 transitions. [2019-10-22 08:54:49,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:49,151 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 95 transitions. [2019-10-22 08:54:49,152 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2019-10-22 08:54:49,153 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 68 states and 95 transitions. [2019-10-22 08:54:49,153 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2019-10-22 08:54:49,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-10-22 08:54:49,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 95 transitions. [2019-10-22 08:54:49,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:49,154 INFO L688 BuchiCegarLoop]: Abstraction has 68 states and 95 transitions. [2019-10-22 08:54:49,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 95 transitions. [2019-10-22 08:54:49,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-10-22 08:54:49,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-22 08:54:49,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 95 transitions. [2019-10-22 08:54:49,162 INFO L711 BuchiCegarLoop]: Abstraction has 68 states and 95 transitions. [2019-10-22 08:54:49,162 INFO L591 BuchiCegarLoop]: Abstraction has 68 states and 95 transitions. [2019-10-22 08:54:49,162 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:54:49,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 95 transitions. [2019-10-22 08:54:49,163 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2019-10-22 08:54:49,164 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:49,164 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:49,164 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:54:49,164 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:49,164 INFO L791 eck$LassoCheckResult]: Stem: 350#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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; 314#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~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; 315#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 371#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 370#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 367#L313-1 [2019-10-22 08:54:49,165 INFO L793 eck$LassoCheckResult]: Loop: 367#L313-1 assume !false; 336#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 319#L262 assume !false; 358#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 359#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 330#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 331#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 344#L242 assume !(0 != eval_~tmp___1~0); 345#L278 havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 351#L214-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 328#L226-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 329#L227-1 stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 337#L292 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 324#L299 stop_simulation_#res := stop_simulation_~__retres2~0; 325#L300 start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 352#L320 assume !(0 != start_simulation_~tmp~3); 367#L313-1 [2019-10-22 08:54:49,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:49,165 INFO L82 PathProgramCache]: Analyzing trace with hash 28692807, now seen corresponding path program 1 times [2019-10-22 08:54:49,165 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:49,165 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7881783] [2019-10-22 08:54:49,165 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,165 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:49,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:49,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:49,196 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:49,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:49,196 INFO L82 PathProgramCache]: Analyzing trace with hash -852169887, now seen corresponding path program 2 times [2019-10-22 08:54:49,197 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:49,197 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306600880] [2019-10-22 08:54:49,197 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,197 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:49,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:49,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:49,230 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306600880] [2019-10-22 08:54:49,230 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:49,230 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:54:49,230 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041921659] [2019-10-22 08:54:49,231 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:54:49,231 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:49,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:54:49,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:54:49,231 INFO L87 Difference]: Start difference. First operand 68 states and 95 transitions. cyclomatic complexity: 28 Second operand 5 states. [2019-10-22 08:54:49,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:49,313 INFO L93 Difference]: Finished difference Result 134 states and 185 transitions. [2019-10-22 08:54:49,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:54:49,318 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 185 transitions. [2019-10-22 08:54:49,320 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 129 [2019-10-22 08:54:49,321 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 134 states and 185 transitions. [2019-10-22 08:54:49,321 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 134 [2019-10-22 08:54:49,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 134 [2019-10-22 08:54:49,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 185 transitions. [2019-10-22 08:54:49,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:49,322 INFO L688 BuchiCegarLoop]: Abstraction has 134 states and 185 transitions. [2019-10-22 08:54:49,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 185 transitions. [2019-10-22 08:54:49,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 71. [2019-10-22 08:54:49,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-22 08:54:49,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 98 transitions. [2019-10-22 08:54:49,336 INFO L711 BuchiCegarLoop]: Abstraction has 71 states and 98 transitions. [2019-10-22 08:54:49,336 INFO L591 BuchiCegarLoop]: Abstraction has 71 states and 98 transitions. [2019-10-22 08:54:49,336 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:54:49,336 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 98 transitions. [2019-10-22 08:54:49,337 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2019-10-22 08:54:49,337 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:49,337 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:49,338 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:54:49,338 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:49,338 INFO L791 eck$LassoCheckResult]: Stem: 565#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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; 532#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~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; 533#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 591#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 590#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 587#L313-1 [2019-10-22 08:54:49,338 INFO L793 eck$LassoCheckResult]: Loop: 587#L313-1 assume !false; 554#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 535#L262 assume !false; 577#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 578#L214 assume !(0 == ~p_dw_st~0); 585#L218 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 548#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 549#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 592#L242 assume !(0 != eval_~tmp___1~0); 568#L278 havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 569#L214-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 546#L226-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 547#L227-1 stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 555#L292 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 542#L299 stop_simulation_#res := stop_simulation_~__retres2~0; 543#L300 start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 572#L320 assume !(0 != start_simulation_~tmp~3); 587#L313-1 [2019-10-22 08:54:49,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:49,338 INFO L82 PathProgramCache]: Analyzing trace with hash 28692807, now seen corresponding path program 2 times [2019-10-22 08:54:49,339 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:49,339 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821031812] [2019-10-22 08:54:49,339 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,339 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:49,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:49,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:49,370 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:49,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:49,376 INFO L82 PathProgramCache]: Analyzing trace with hash 6171900, now seen corresponding path program 1 times [2019-10-22 08:54:49,376 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:49,376 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193446586] [2019-10-22 08:54:49,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:49,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:49,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:49,399 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193446586] [2019-10-22 08:54:49,399 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:49,399 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:49,400 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151682776] [2019-10-22 08:54:49,400 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:54:49,400 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:49,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:49,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:49,401 INFO L87 Difference]: Start difference. First operand 71 states and 98 transitions. cyclomatic complexity: 28 Second operand 3 states. [2019-10-22 08:54:49,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:49,438 INFO L93 Difference]: Finished difference Result 116 states and 156 transitions. [2019-10-22 08:54:49,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:49,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 156 transitions. [2019-10-22 08:54:49,440 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 109 [2019-10-22 08:54:49,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 116 states and 156 transitions. [2019-10-22 08:54:49,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2019-10-22 08:54:49,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2019-10-22 08:54:49,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 156 transitions. [2019-10-22 08:54:49,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:49,442 INFO L688 BuchiCegarLoop]: Abstraction has 116 states and 156 transitions. [2019-10-22 08:54:49,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 156 transitions. [2019-10-22 08:54:49,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2019-10-22 08:54:49,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-22 08:54:49,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 132 transitions. [2019-10-22 08:54:49,447 INFO L711 BuchiCegarLoop]: Abstraction has 99 states and 132 transitions. [2019-10-22 08:54:49,448 INFO L591 BuchiCegarLoop]: Abstraction has 99 states and 132 transitions. [2019-10-22 08:54:49,448 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:54:49,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 132 transitions. [2019-10-22 08:54:49,449 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2019-10-22 08:54:49,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:49,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:49,450 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:49,450 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:49,450 INFO L791 eck$LassoCheckResult]: Stem: 761#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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; 725#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~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; 726#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 792#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 790#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 791#L313-1 assume !false; 803#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 801#L262 [2019-10-22 08:54:49,450 INFO L793 eck$LassoCheckResult]: Loop: 801#L262 assume !false; 800#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 799#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 798#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 797#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 796#L242 assume 0 != eval_~tmp___1~0; 795#L242-1 assume !(0 == ~p_dw_st~0); 754#L247 assume 0 == ~c_dr_st~0;eval_~tmp___0~1 := eval_#t~nondet5;havoc eval_#t~nondet5; 727#L266 assume 0 != eval_~tmp___0~1;~c_dr_st~0 := 1;havoc do_read_c_~a~0;havoc do_read_c_~a~0; 729#L139 assume !(0 == ~c_dr_pc~0); 744#L142 assume 1 == ~c_dr_pc~0; 745#L143 do_read_c_~a~0 := ~a_t~0; 750#L152-1 do_read_c_~a~0 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_read_ev~0 := 1;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 784#L32-3 assume !(1 == ~p_dw_pc~0); 785#L32-5 is_do_write_p_triggered_~__retres1~0 := 0; 813#L43-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 812#L44-1 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 811#L74-3 assume 0 != immediate_notify_threads_~tmp~0;~p_dw_st~0 := 0; 756#L74-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 715#L51-3 assume 1 == ~c_dr_pc~0; 716#L52-1 assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1 := 1; 810#L62-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 809#L63-1 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 808#L82-3 assume 0 != immediate_notify_threads_~tmp___0~0;~c_dr_st~0 := 0; 807#L82-5 ~q_read_ev~0 := 2; 806#L172 assume ~p_last_write~0 == ~c_last_read~0; 805#L173 assume ~p_num_write~0 == ~c_num_read~0; 804#L10-2 assume !false; 802#L151 assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 1;~a_t~0 := do_read_c_~a~0; 801#L262 [2019-10-22 08:54:49,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:49,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1803984585, now seen corresponding path program 1 times [2019-10-22 08:54:49,451 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:49,451 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568660325] [2019-10-22 08:54:49,451 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,451 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:49,464 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:49,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:49,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1836630604, now seen corresponding path program 1 times [2019-10-22 08:54:49,465 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:49,465 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138540048] [2019-10-22 08:54:49,465 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,465 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:49,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:49,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:49,479 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138540048] [2019-10-22 08:54:49,480 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:49,480 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:49,480 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878011538] [2019-10-22 08:54:49,480 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:54:49,480 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:49,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:49,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:49,481 INFO L87 Difference]: Start difference. First operand 99 states and 132 transitions. cyclomatic complexity: 34 Second operand 3 states. [2019-10-22 08:54:49,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:49,500 INFO L93 Difference]: Finished difference Result 116 states and 154 transitions. [2019-10-22 08:54:49,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:49,501 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 154 transitions. [2019-10-22 08:54:49,502 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 109 [2019-10-22 08:54:49,503 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 116 states and 154 transitions. [2019-10-22 08:54:49,503 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2019-10-22 08:54:49,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2019-10-22 08:54:49,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 154 transitions. [2019-10-22 08:54:49,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:49,504 INFO L688 BuchiCegarLoop]: Abstraction has 116 states and 154 transitions. [2019-10-22 08:54:49,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 154 transitions. [2019-10-22 08:54:49,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2019-10-22 08:54:49,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-22 08:54:49,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 130 transitions. [2019-10-22 08:54:49,509 INFO L711 BuchiCegarLoop]: Abstraction has 99 states and 130 transitions. [2019-10-22 08:54:49,509 INFO L591 BuchiCegarLoop]: Abstraction has 99 states and 130 transitions. [2019-10-22 08:54:49,509 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:54:49,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 130 transitions. [2019-10-22 08:54:49,509 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2019-10-22 08:54:49,510 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:49,510 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:49,510 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:49,510 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:49,511 INFO L791 eck$LassoCheckResult]: Stem: 980#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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; 946#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~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; 947#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 1014#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 1013#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 1003#L313-1 assume !false; 968#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 969#L262 [2019-10-22 08:54:49,511 INFO L793 eck$LassoCheckResult]: Loop: 969#L262 assume !false; 992#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 993#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 1011#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1021#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 1020#L242 assume 0 != eval_~tmp___1~0; 1018#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 1004#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 998#L96 assume 0 == ~p_dw_pc~0; 991#L107-1 assume !false; 997#L108 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 974#L247 assume 0 == ~c_dr_st~0;eval_~tmp___0~1 := eval_#t~nondet5;havoc eval_#t~nondet5; 948#L266 assume 0 != eval_~tmp___0~1;~c_dr_st~0 := 1;havoc do_read_c_~a~0;havoc do_read_c_~a~0; 950#L139 assume !(0 == ~c_dr_pc~0); 965#L142 assume 1 == ~c_dr_pc~0; 966#L143 do_read_c_~a~0 := ~a_t~0; 971#L152-1 do_read_c_~a~0 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_read_ev~0 := 1;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 1005#L32-3 assume !(1 == ~p_dw_pc~0); 1006#L32-5 is_do_write_p_triggered_~__retres1~0 := 0; 1034#L43-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 983#L44-1 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 975#L74-3 assume 0 != immediate_notify_threads_~tmp~0;~p_dw_st~0 := 0; 976#L74-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 1032#L51-3 assume 1 == ~c_dr_pc~0; 1030#L52-1 assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1 := 1; 1029#L62-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 1028#L63-1 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 1027#L82-3 assume 0 != immediate_notify_threads_~tmp___0~0;~c_dr_st~0 := 0; 1026#L82-5 ~q_read_ev~0 := 2; 1025#L172 assume ~p_last_write~0 == ~c_last_read~0; 1024#L173 assume ~p_num_write~0 == ~c_num_read~0; 1008#L10-2 assume !false; 999#L151 assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 1;~a_t~0 := do_read_c_~a~0; 969#L262 [2019-10-22 08:54:49,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:49,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1803984585, now seen corresponding path program 2 times [2019-10-22 08:54:49,511 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:49,512 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966946224] [2019-10-22 08:54:49,512 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,512 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:49,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:49,533 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:49,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:49,533 INFO L82 PathProgramCache]: Analyzing trace with hash 331104409, now seen corresponding path program 1 times [2019-10-22 08:54:49,533 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:49,534 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019890844] [2019-10-22 08:54:49,534 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,534 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:49,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:49,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:49,589 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019890844] [2019-10-22 08:54:49,589 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:49,589 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:49,590 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958607478] [2019-10-22 08:54:49,590 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:54:49,590 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:49,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:49,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:49,590 INFO L87 Difference]: Start difference. First operand 99 states and 130 transitions. cyclomatic complexity: 32 Second operand 3 states. [2019-10-22 08:54:49,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:49,622 INFO L93 Difference]: Finished difference Result 125 states and 159 transitions. [2019-10-22 08:54:49,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:49,623 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 159 transitions. [2019-10-22 08:54:49,624 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 108 [2019-10-22 08:54:49,625 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 125 states and 159 transitions. [2019-10-22 08:54:49,625 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2019-10-22 08:54:49,625 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2019-10-22 08:54:49,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 159 transitions. [2019-10-22 08:54:49,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:49,626 INFO L688 BuchiCegarLoop]: Abstraction has 125 states and 159 transitions. [2019-10-22 08:54:49,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 159 transitions. [2019-10-22 08:54:49,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-10-22 08:54:49,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-10-22 08:54:49,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 159 transitions. [2019-10-22 08:54:49,633 INFO L711 BuchiCegarLoop]: Abstraction has 125 states and 159 transitions. [2019-10-22 08:54:49,633 INFO L591 BuchiCegarLoop]: Abstraction has 125 states and 159 transitions. [2019-10-22 08:54:49,633 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 08:54:49,633 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 159 transitions. [2019-10-22 08:54:49,634 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 108 [2019-10-22 08:54:49,634 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:49,634 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:49,634 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:49,635 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:49,635 INFO L791 eck$LassoCheckResult]: Stem: 1211#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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; 1176#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~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; 1177#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 1250#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 1249#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 1242#L313-1 assume !false; 1199#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 1200#L262 assume !false; 1266#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1265#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 1264#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1263#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 1207#L242 assume 0 != eval_~tmp___1~0; 1204#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 1205#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 1243#L96 assume 0 == ~p_dw_pc~0; 1231#L107-1 [2019-10-22 08:54:49,635 INFO L793 eck$LassoCheckResult]: Loop: 1231#L107-1 assume !false; 1233#L108 assume !(0 == ~q_free~0); 1193#L109 ~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 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 1194#L32 assume !(1 == ~p_dw_pc~0); 1246#L32-2 is_do_write_p_triggered_~__retres1~0 := 0; 1185#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 1186#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 1219#L74 assume 0 != immediate_notify_threads_~tmp~0;~p_dw_st~0 := 0; 1208#L74-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 1173#L51 assume !(1 == ~c_dr_pc~0); 1169#L51-2 is_do_read_c_triggered_~__retres1~1 := 0; 1170#L62 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 1175#L63 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 1232#L82 assume 0 != immediate_notify_threads_~tmp___0~0;~c_dr_st~0 := 0; 1230#L82-2 ~q_write_ev~0 := 2; 1231#L107-1 [2019-10-22 08:54:49,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:49,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1783039958, now seen corresponding path program 1 times [2019-10-22 08:54:49,636 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:49,636 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447009126] [2019-10-22 08:54:49,636 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,636 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:49,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:49,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:49,651 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:49,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:49,651 INFO L82 PathProgramCache]: Analyzing trace with hash -62972986, now seen corresponding path program 1 times [2019-10-22 08:54:49,651 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:49,652 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104866920] [2019-10-22 08:54:49,652 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,652 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:49,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:49,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:49,695 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104866920] [2019-10-22 08:54:49,695 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:49,695 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:54:49,695 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189613741] [2019-10-22 08:54:49,695 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:54:49,696 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:49,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:54:49,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:54:49,696 INFO L87 Difference]: Start difference. First operand 125 states and 159 transitions. cyclomatic complexity: 36 Second operand 5 states. [2019-10-22 08:54:49,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:49,773 INFO L93 Difference]: Finished difference Result 275 states and 346 transitions. [2019-10-22 08:54:49,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:54:49,774 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 275 states and 346 transitions. [2019-10-22 08:54:49,776 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 255 [2019-10-22 08:54:49,778 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 275 states to 275 states and 346 transitions. [2019-10-22 08:54:49,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 275 [2019-10-22 08:54:49,778 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 275 [2019-10-22 08:54:49,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 275 states and 346 transitions. [2019-10-22 08:54:49,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:49,780 INFO L688 BuchiCegarLoop]: Abstraction has 275 states and 346 transitions. [2019-10-22 08:54:49,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states and 346 transitions. [2019-10-22 08:54:49,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 134. [2019-10-22 08:54:49,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-10-22 08:54:49,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 167 transitions. [2019-10-22 08:54:49,786 INFO L711 BuchiCegarLoop]: Abstraction has 134 states and 167 transitions. [2019-10-22 08:54:49,786 INFO L591 BuchiCegarLoop]: Abstraction has 134 states and 167 transitions. [2019-10-22 08:54:49,787 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 08:54:49,787 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 134 states and 167 transitions. [2019-10-22 08:54:49,788 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 117 [2019-10-22 08:54:49,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:49,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:49,788 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:49,789 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:49,789 INFO L791 eck$LassoCheckResult]: Stem: 1621#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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; 1589#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~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; 1590#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 1659#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 1657#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 1658#L313-1 assume !false; 1690#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 1689#L262 assume !false; 1688#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1687#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 1686#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1685#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 1684#L242 assume 0 != eval_~tmp___1~0; 1683#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 1682#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 1680#L96 assume 0 == ~p_dw_pc~0; 1642#L107-1 [2019-10-22 08:54:49,789 INFO L793 eck$LassoCheckResult]: Loop: 1642#L107-1 assume !false; 1644#L108 assume !(0 == ~q_free~0); 1606#L109 ~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 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 1607#L32 assume !(1 == ~p_dw_pc~0); 1653#L32-2 is_do_write_p_triggered_~__retres1~0 := 0; 1598#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 1599#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 1633#L74 assume !(0 != immediate_notify_threads_~tmp~0); 1619#L74-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 1586#L51 assume 1 == ~c_dr_pc~0; 1587#L52 assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1 := 1; 1583#L62 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 1588#L63 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 1643#L82 assume 0 != immediate_notify_threads_~tmp___0~0;~c_dr_st~0 := 0; 1641#L82-2 ~q_write_ev~0 := 2; 1642#L107-1 [2019-10-22 08:54:49,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:49,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1783039958, now seen corresponding path program 2 times [2019-10-22 08:54:49,789 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:49,790 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935223171] [2019-10-22 08:54:49,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:49,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:49,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:49,804 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:49,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:49,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1078264795, now seen corresponding path program 1 times [2019-10-22 08:54:49,804 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:49,805 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104590963] [2019-10-22 08:54:49,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:49,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:49,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:49,815 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:49,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:49,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1917816028, now seen corresponding path program 1 times [2019-10-22 08:54:49,816 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:49,816 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544758689] [2019-10-22 08:54:49,816 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,816 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:49,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:49,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:49,840 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544758689] [2019-10-22 08:54:49,840 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:49,840 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:49,840 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648799818] [2019-10-22 08:54:49,978 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:49,979 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:49,980 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:49,980 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:49,980 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:54:49,980 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:49,980 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:49,980 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:49,981 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1.cil-1.c_Iteration8_Loop [2019-10-22 08:54:49,981 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:49,981 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:50,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:50,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:50,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:50,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:50,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:50,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:50,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:50,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:50,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:50,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:50,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:50,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:50,238 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:50,239 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad877ab1-7fb1-4364-9c0c-add3733e2ce6/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:54:50,247 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:50,247 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:50,258 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:54:50,258 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_is_do_read_c_triggered_#res=1, ULTIMATE.start_immediate_notify_threads_~tmp___0~0=1, ULTIMATE.start_is_do_read_c_triggered_~__retres1~1=1} Honda state: {ULTIMATE.start_is_do_read_c_triggered_#res=1, ULTIMATE.start_immediate_notify_threads_~tmp___0~0=1, ULTIMATE.start_is_do_read_c_triggered_~__retres1~1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad877ab1-7fb1-4364-9c0c-add3733e2ce6/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:54:50,267 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:50,268 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:50,276 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:54:50,276 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_is_do_write_p_triggered_#res=0, ULTIMATE.start_is_do_write_p_triggered_~__retres1~0=0} Honda state: {ULTIMATE.start_is_do_write_p_triggered_#res=0, ULTIMATE.start_is_do_write_p_triggered_~__retres1~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad877ab1-7fb1-4364-9c0c-add3733e2ce6/bin/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 [2019-10-22 08:54:50,286 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:50,287 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad877ab1-7fb1-4364-9c0c-add3733e2ce6/bin/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 [2019-10-22 08:54:50,420 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:54:50,420 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:54:50,434 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:54:50,436 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:50,436 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:50,437 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:50,437 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:50,437 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:50,437 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:50,437 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:50,437 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:50,437 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1.cil-1.c_Iteration8_Loop [2019-10-22 08:54:50,437 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:50,438 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:50,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:50,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:50,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:50,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:50,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:50,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:50,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:50,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:50,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:50,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:50,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:50,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:50,675 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:50,679 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:50,683 INFO L120 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 [2019-10-22 08:54:50,684 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,685 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,685 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,685 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:50,685 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:50,686 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:50,686 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,688 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,688 INFO L120 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 [2019-10-22 08:54:50,689 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,689 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,689 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,689 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:50,689 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:50,690 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:50,690 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,696 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,699 INFO L120 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 [2019-10-22 08:54:50,701 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,701 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,701 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,701 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:50,702 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:50,702 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:50,702 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,703 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,704 INFO L120 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 [2019-10-22 08:54:50,704 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,704 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,704 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,705 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:50,705 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:50,705 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:50,705 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,706 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,706 INFO L120 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 [2019-10-22 08:54:50,706 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,707 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,707 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,707 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:50,707 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:50,707 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:50,707 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,712 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,713 INFO L120 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 [2019-10-22 08:54:50,713 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,714 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,715 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,715 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:50,715 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:50,715 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:50,716 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,717 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,718 INFO L120 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 [2019-10-22 08:54:50,719 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,720 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,720 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,720 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:50,720 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:50,721 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:50,721 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,724 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,727 INFO L120 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 [2019-10-22 08:54:50,727 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,727 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,728 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,728 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:50,728 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:50,728 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:50,729 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,731 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,734 INFO L120 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 [2019-10-22 08:54:50,734 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,734 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,734 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,735 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:50,735 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:50,735 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:50,735 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,736 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,736 INFO L120 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 [2019-10-22 08:54:50,737 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,737 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,737 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,737 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:50,737 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:50,738 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:50,738 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,739 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,741 INFO L120 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 [2019-10-22 08:54:50,742 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,743 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,743 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,743 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:50,743 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:50,744 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:50,745 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,746 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,747 INFO L120 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 [2019-10-22 08:54:50,748 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,749 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,749 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,750 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:50,750 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:50,751 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:50,751 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,752 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,754 INFO L489 LassoAnalysis]: Using template '2-nested'. [2019-10-22 08:54:50,754 INFO L120 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 [2019-10-22 08:54:50,755 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,755 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,756 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,756 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:50,756 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:54:50,756 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:54:50,756 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,757 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,757 INFO L120 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 [2019-10-22 08:54:50,758 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,758 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,758 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,758 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:50,758 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:54:50,759 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:50,759 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,769 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,773 INFO L120 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 [2019-10-22 08:54:50,774 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,775 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,775 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,775 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:50,775 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:54:50,775 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:54:50,776 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,777 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,778 INFO L120 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 [2019-10-22 08:54:50,778 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,778 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,778 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,778 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:50,779 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:54:50,779 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:50,779 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,784 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,794 INFO L120 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 [2019-10-22 08:54:50,795 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,795 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,795 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,795 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:50,795 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:54:50,796 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:54:50,796 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,796 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,797 INFO L120 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 [2019-10-22 08:54:50,797 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,797 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,797 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,798 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:50,798 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:54:50,798 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:54:50,798 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,799 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,800 INFO L120 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 [2019-10-22 08:54:50,800 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,801 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,801 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,801 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:50,801 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:54:50,802 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:54:50,802 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,806 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,806 INFO L120 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 [2019-10-22 08:54:50,807 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,807 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,807 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,807 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:50,808 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:54:50,808 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:54:50,809 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,811 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,811 INFO L120 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 [2019-10-22 08:54:50,811 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,812 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,812 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,812 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:50,812 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:54:50,813 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:54:50,813 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,814 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,814 INFO L120 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 [2019-10-22 08:54:50,815 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,815 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,815 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,815 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:50,815 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:54:50,816 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:54:50,816 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,819 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,819 INFO L120 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 [2019-10-22 08:54:50,820 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,820 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,820 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,820 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:50,820 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:54:50,821 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:54:50,821 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,822 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,822 INFO L120 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 [2019-10-22 08:54:50,823 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,823 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,823 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,823 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:50,824 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:54:50,825 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:54:50,825 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,826 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,826 INFO L489 LassoAnalysis]: Using template '3-nested'. [2019-10-22 08:54:50,826 INFO L120 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 [2019-10-22 08:54:50,827 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,827 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,827 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,827 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:50,827 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:50,828 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:50,828 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,829 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,830 INFO L120 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 [2019-10-22 08:54:50,830 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,830 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,830 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,831 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:50,831 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:50,831 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:54:50,832 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,837 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,838 INFO L120 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 [2019-10-22 08:54:50,838 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,838 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,838 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,839 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:50,839 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:50,839 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:50,839 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,842 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,842 INFO L120 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 [2019-10-22 08:54:50,843 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,843 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,843 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,843 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:50,843 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:50,848 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:54:50,848 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,849 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,849 INFO L120 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 [2019-10-22 08:54:50,849 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,850 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,850 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,850 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:50,850 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:50,851 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:50,851 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,852 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,852 INFO L120 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 [2019-10-22 08:54:50,852 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,853 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,853 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,853 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:50,853 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:50,854 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:50,854 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,855 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,855 INFO L120 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 [2019-10-22 08:54:50,856 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,856 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,856 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,857 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:50,857 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:50,858 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:50,858 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,866 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,866 INFO L120 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 [2019-10-22 08:54:50,867 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,867 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,869 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,869 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:50,869 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:50,869 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:50,870 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,872 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,874 INFO L120 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 [2019-10-22 08:54:50,875 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,875 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,876 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,876 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:50,876 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:50,877 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:50,877 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,878 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,879 INFO L120 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 [2019-10-22 08:54:50,880 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,880 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,880 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,881 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:50,881 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:50,882 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:50,882 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,884 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,885 INFO L120 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 [2019-10-22 08:54:50,885 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,885 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,886 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,886 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:50,886 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:50,887 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:50,887 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,892 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,893 INFO L120 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 [2019-10-22 08:54:50,893 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,895 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,895 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,895 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:50,895 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:50,896 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:50,896 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,898 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,898 INFO L489 LassoAnalysis]: Using template '4-nested'. [2019-10-22 08:54:50,898 INFO L120 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 [2019-10-22 08:54:50,899 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,899 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,899 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,899 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:50,899 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:54:50,900 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:54:50,901 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,902 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,904 INFO L120 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 [2019-10-22 08:54:50,904 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,904 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,904 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,905 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:50,905 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:54:50,906 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-10-22 08:54:50,910 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,918 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,920 INFO L120 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 [2019-10-22 08:54:50,921 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,921 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,921 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,921 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:50,921 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:54:50,922 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:54:50,922 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,925 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,927 INFO L120 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 [2019-10-22 08:54:50,928 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,928 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,928 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,930 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:50,931 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:54:50,931 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-10-22 08:54:50,931 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,932 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,933 INFO L120 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 [2019-10-22 08:54:50,933 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,933 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,934 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,934 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:50,934 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:54:50,934 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:54:50,934 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,935 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,935 INFO L120 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 [2019-10-22 08:54:50,938 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,939 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,939 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,939 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:50,940 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:54:50,940 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:54:50,941 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,941 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,942 INFO L120 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 [2019-10-22 08:54:50,942 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,943 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,943 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,944 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:50,944 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:54:50,945 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:54:50,947 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,954 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,954 INFO L120 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 [2019-10-22 08:54:50,955 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,955 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,955 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,955 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:50,955 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:54:50,960 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:54:50,960 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,963 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,964 INFO L120 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 [2019-10-22 08:54:50,965 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,965 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,965 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,966 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:50,966 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:54:50,966 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:54:50,967 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,968 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,968 INFO L120 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 [2019-10-22 08:54:50,968 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,969 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,969 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,969 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:50,969 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:54:50,970 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:54:50,970 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,973 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,974 INFO L120 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 [2019-10-22 08:54:50,975 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,976 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,976 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,976 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:50,976 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:54:50,977 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:54:50,977 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,978 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,978 INFO L120 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 [2019-10-22 08:54:50,979 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:50,979 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,980 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,980 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:50,980 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:54:50,981 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:54:50,981 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,982 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,982 INFO L489 LassoAnalysis]: Using template '2-phase'. [2019-10-22 08:54:50,982 INFO L120 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 [2019-10-22 08:54:50,983 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:50,983 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:54:50,983 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,984 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,984 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:50,984 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:54:50,985 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:54:50,985 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,986 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:50,986 INFO L120 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 [2019-10-22 08:54:50,987 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:50,987 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:54:50,987 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:50,987 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:50,987 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:50,988 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:54:50,989 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:50,989 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:50,998 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,003 INFO L120 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 [2019-10-22 08:54:51,005 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,005 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:54:51,006 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,006 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,006 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,006 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:54:51,006 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:54:51,007 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,010 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,011 INFO L120 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 [2019-10-22 08:54:51,012 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,012 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:54:51,012 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,012 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,012 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:51,012 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:54:51,013 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:51,013 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,014 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,015 INFO L120 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 [2019-10-22 08:54:51,015 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,016 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:54:51,017 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,017 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,017 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,017 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:54:51,018 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:54:51,018 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,019 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,019 INFO L120 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 [2019-10-22 08:54:51,020 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,020 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:54:51,020 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,020 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,020 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,021 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:54:51,021 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:54:51,021 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,022 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,028 INFO L120 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 [2019-10-22 08:54:51,029 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,029 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:54:51,029 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,029 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,030 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,030 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:54:51,031 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:54:51,031 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,038 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,039 INFO L120 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 [2019-10-22 08:54:51,040 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,040 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:54:51,041 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,041 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,041 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,041 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:54:51,041 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:54:51,042 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,045 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,045 INFO L120 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 [2019-10-22 08:54:51,046 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,046 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:54:51,047 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,047 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,047 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,047 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:54:51,048 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:54:51,048 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,049 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,049 INFO L120 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 [2019-10-22 08:54:51,051 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,052 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:54:51,052 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,052 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,052 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,053 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:54:51,053 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:54:51,054 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,059 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,061 INFO L120 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 [2019-10-22 08:54:51,062 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,062 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:54:51,063 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,063 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,063 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,063 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:54:51,064 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:54:51,064 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,065 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,066 INFO L120 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 [2019-10-22 08:54:51,066 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,066 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:54:51,067 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,067 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,067 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,067 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:54:51,068 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:54:51,068 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,070 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,070 INFO L489 LassoAnalysis]: Using template '3-phase'. [2019-10-22 08:54:51,070 INFO L120 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 [2019-10-22 08:54:51,071 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,071 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 08:54:51,071 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,071 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,071 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,072 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:51,073 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:51,073 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,074 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,075 INFO L120 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 [2019-10-22 08:54:51,075 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,076 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 08:54:51,076 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,076 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,076 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:51,076 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:51,078 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:54:51,078 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,086 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,086 INFO L120 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 [2019-10-22 08:54:51,087 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,087 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 08:54:51,087 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,087 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,088 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,088 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:51,089 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:51,089 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,092 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,093 INFO L120 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 [2019-10-22 08:54:51,093 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,094 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 08:54:51,123 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,123 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,123 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:51,123 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:51,125 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:54:51,125 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,149 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,149 INFO L120 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 [2019-10-22 08:54:51,150 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,150 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 08:54:51,150 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,151 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,151 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,151 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:51,152 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:51,153 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,154 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,154 INFO L120 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 [2019-10-22 08:54:51,155 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,155 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 08:54:51,155 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,155 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,155 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,155 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:51,156 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:51,157 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,158 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,158 INFO L120 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 [2019-10-22 08:54:51,159 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,159 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 08:54:51,159 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,159 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,159 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,159 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:51,161 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:51,161 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,174 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,176 INFO L120 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 [2019-10-22 08:54:51,176 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,176 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 08:54:51,177 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,177 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,177 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,177 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:51,178 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:51,178 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,183 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,184 INFO L120 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 [2019-10-22 08:54:51,185 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,186 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 08:54:51,186 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,186 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,186 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,187 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:51,187 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:51,187 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,188 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,189 INFO L120 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 [2019-10-22 08:54:51,189 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,189 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 08:54:51,190 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,190 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,190 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,190 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:51,191 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:51,191 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,211 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,211 INFO L120 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 [2019-10-22 08:54:51,212 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,212 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 08:54:51,212 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,212 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,212 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,212 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:51,213 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:51,213 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,215 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,215 INFO L120 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 [2019-10-22 08:54:51,215 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,228 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 08:54:51,228 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,228 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,228 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,228 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:51,229 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:51,229 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,231 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,232 INFO L489 LassoAnalysis]: Using template '4-phase'. [2019-10-22 08:54:51,236 INFO L120 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 [2019-10-22 08:54:51,236 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,236 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:54:51,237 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,237 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,237 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,237 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:54:51,238 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:54:51,238 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,239 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,239 INFO L120 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 [2019-10-22 08:54:51,241 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,242 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:54:51,243 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,243 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,243 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:51,243 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:54:51,245 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-10-22 08:54:51,245 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,258 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,259 INFO L120 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 [2019-10-22 08:54:51,259 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,260 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:54:51,260 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,260 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,260 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,260 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:54:51,261 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:54:51,261 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,266 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,268 INFO L120 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 [2019-10-22 08:54:51,269 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,269 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:54:51,269 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,269 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,269 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:51,269 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:54:51,271 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-10-22 08:54:51,271 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,273 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,273 INFO L120 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 [2019-10-22 08:54:51,274 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,275 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:54:51,275 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,275 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,276 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,276 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:54:51,277 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:54:51,277 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,278 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,278 INFO L120 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 [2019-10-22 08:54:51,279 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,279 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:54:51,279 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,279 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,279 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,279 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:54:51,282 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:54:51,282 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,283 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,283 INFO L120 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 [2019-10-22 08:54:51,284 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,285 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:54:51,285 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,285 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,285 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,285 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:54:51,287 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:54:51,287 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,314 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,315 INFO L120 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 [2019-10-22 08:54:51,316 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,316 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:54:51,316 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,316 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,316 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,316 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:54:51,318 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:54:51,318 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,326 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,326 INFO L120 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 [2019-10-22 08:54:51,327 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,327 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:54:51,327 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,327 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,327 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,327 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:54:51,329 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:54:51,329 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,330 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,330 INFO L120 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 [2019-10-22 08:54:51,330 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,331 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:54:51,331 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,331 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,331 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,331 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:54:51,332 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:54:51,333 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,355 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,356 INFO L120 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 [2019-10-22 08:54:51,357 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,357 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:54:51,357 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,357 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,357 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,357 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:54:51,359 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:54:51,359 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,360 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,361 INFO L120 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 [2019-10-22 08:54:51,361 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,361 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:54:51,362 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,362 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,362 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,362 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:54:51,364 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:54:51,365 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,366 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,366 INFO L489 LassoAnalysis]: Using template '2-lex'. [2019-10-22 08:54:51,366 INFO L120 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 [2019-10-22 08:54:51,367 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,367 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:54:51,367 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,368 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,368 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,368 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:51,368 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:51,368 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,370 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,370 INFO L120 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 [2019-10-22 08:54:51,371 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,371 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:54:51,371 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,371 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,371 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:51,371 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:51,372 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:54:51,372 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,378 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,385 INFO L120 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 [2019-10-22 08:54:51,385 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,385 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:54:51,385 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,386 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,386 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,386 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:51,386 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:51,386 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,390 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,390 INFO L120 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 [2019-10-22 08:54:51,390 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,390 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:54:51,390 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,391 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,391 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:51,391 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:51,391 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:54:51,391 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,393 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,393 INFO L120 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 [2019-10-22 08:54:51,394 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,394 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:54:51,394 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,394 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,394 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,394 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:51,395 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:51,395 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,397 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,397 INFO L120 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 [2019-10-22 08:54:51,398 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,398 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:54:51,398 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,398 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,398 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,398 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:51,399 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:51,399 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,400 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,401 INFO L120 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 [2019-10-22 08:54:51,402 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,403 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:54:51,403 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,403 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,403 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,403 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:51,404 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:51,404 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,409 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,411 INFO L120 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 [2019-10-22 08:54:51,412 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,412 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:54:51,412 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,412 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,412 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,412 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:51,413 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:51,413 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,416 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,417 INFO L120 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 [2019-10-22 08:54:51,417 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,417 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:54:51,418 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,418 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,418 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,418 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:51,418 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:51,418 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,421 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,421 INFO L120 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 [2019-10-22 08:54:51,423 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,423 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:54:51,423 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,423 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,423 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,424 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:51,424 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:51,424 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,427 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,428 INFO L120 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 [2019-10-22 08:54:51,429 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,429 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:54:51,429 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,429 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,429 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,430 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:51,430 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:51,430 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,432 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,433 INFO L120 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 [2019-10-22 08:54:51,433 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,434 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:54:51,434 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,434 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,434 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,434 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:51,435 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:51,435 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,438 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,438 INFO L489 LassoAnalysis]: Using template '3-lex'. [2019-10-22 08:54:51,438 INFO L120 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 [2019-10-22 08:54:51,438 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,439 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:54:51,439 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,439 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,439 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,439 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 08:54:51,440 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:51,440 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,443 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,446 INFO L120 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 [2019-10-22 08:54:51,447 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,449 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:54:51,449 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,449 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,449 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:51,449 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 08:54:51,450 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:54:51,450 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,459 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,460 INFO L120 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 [2019-10-22 08:54:51,461 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,461 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:54:51,461 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,461 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,461 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,461 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 08:54:51,462 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:51,462 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,465 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,469 INFO L120 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 [2019-10-22 08:54:51,470 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,470 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:54:51,470 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,470 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,470 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:51,471 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 08:54:51,471 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:54:51,471 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,473 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,474 INFO L120 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 [2019-10-22 08:54:51,475 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,475 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:54:51,475 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,475 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,475 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,476 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 08:54:51,476 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:51,476 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,478 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,479 INFO L120 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 [2019-10-22 08:54:51,480 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,480 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:54:51,480 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,480 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,480 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,480 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 08:54:51,481 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:51,482 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,485 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,485 INFO L120 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 [2019-10-22 08:54:51,486 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,486 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:54:51,486 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,486 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,486 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,487 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 08:54:51,488 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:51,488 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,510 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,510 INFO L120 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 [2019-10-22 08:54:51,510 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,511 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:54:51,511 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,511 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,511 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,511 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 08:54:51,512 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:51,516 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,522 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,525 INFO L120 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 [2019-10-22 08:54:51,526 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,526 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:54:51,526 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,526 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,527 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,527 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 08:54:51,527 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:51,528 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,530 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,532 INFO L120 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 [2019-10-22 08:54:51,532 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,533 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:54:51,533 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,533 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,533 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,533 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 08:54:51,534 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:51,534 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,540 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,544 INFO L120 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 [2019-10-22 08:54:51,545 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,545 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:54:51,545 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,545 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,545 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,545 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 08:54:51,546 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:51,546 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,550 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,551 INFO L120 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 [2019-10-22 08:54:51,551 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:51,551 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:54:51,552 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,552 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,552 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,552 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 08:54:51,553 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:51,554 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,559 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,559 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:51,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:51,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:51,560 INFO L87 Difference]: Start difference. First operand 134 states and 167 transitions. cyclomatic complexity: 35 Second operand 3 states. [2019-10-22 08:54:51,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:51,583 INFO L93 Difference]: Finished difference Result 220 states and 270 transitions. [2019-10-22 08:54:51,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:51,584 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 220 states and 270 transitions. [2019-10-22 08:54:51,585 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 201 [2019-10-22 08:54:51,587 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 220 states to 220 states and 270 transitions. [2019-10-22 08:54:51,587 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 220 [2019-10-22 08:54:51,587 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 220 [2019-10-22 08:54:51,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 220 states and 270 transitions. [2019-10-22 08:54:51,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:51,589 INFO L688 BuchiCegarLoop]: Abstraction has 220 states and 270 transitions. [2019-10-22 08:54:51,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states and 270 transitions. [2019-10-22 08:54:51,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2019-10-22 08:54:51,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-10-22 08:54:51,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 270 transitions. [2019-10-22 08:54:51,603 INFO L711 BuchiCegarLoop]: Abstraction has 220 states and 270 transitions. [2019-10-22 08:54:51,604 INFO L591 BuchiCegarLoop]: Abstraction has 220 states and 270 transitions. [2019-10-22 08:54:51,604 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-10-22 08:54:51,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 220 states and 270 transitions. [2019-10-22 08:54:51,605 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 201 [2019-10-22 08:54:51,605 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:51,605 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:51,606 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:51,606 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:51,606 INFO L791 eck$LassoCheckResult]: Stem: 1989#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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; 1949#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~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; 1950#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 2028#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 2026#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 2027#L313-1 assume !false; 2133#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 2132#L262 assume !false; 2131#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2130#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 2129#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2128#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 1980#L242 assume 0 != eval_~tmp___1~0; 1977#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 1978#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 2013#L96 assume 0 == ~p_dw_pc~0; 2006#L107-1 [2019-10-22 08:54:51,606 INFO L793 eck$LassoCheckResult]: Loop: 2006#L107-1 assume !false; 2012#L108 assume !(0 == ~q_free~0); 1966#L109 ~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 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 1967#L32 assume !(1 == ~p_dw_pc~0); 2021#L32-2 is_do_write_p_triggered_~__retres1~0 := 0; 1958#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 1959#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 1997#L74 assume !(0 != immediate_notify_threads_~tmp~0); 1981#L74-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 1947#L51 assume !(1 == ~c_dr_pc~0); 1943#L51-2 is_do_read_c_triggered_~__retres1~1 := 0; 1944#L62 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 1948#L63 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 2011#L82 assume 0 != immediate_notify_threads_~tmp___0~0;~c_dr_st~0 := 0; 2010#L82-2 ~q_write_ev~0 := 2; 2006#L107-1 [2019-10-22 08:54:51,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:51,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1783039958, now seen corresponding path program 3 times [2019-10-22 08:54:51,606 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:51,607 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106031782] [2019-10-22 08:54:51,607 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:51,607 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:51,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:51,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:51,622 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:51,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:51,625 INFO L82 PathProgramCache]: Analyzing trace with hash -872319612, now seen corresponding path program 1 times [2019-10-22 08:54:51,626 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:51,626 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050632510] [2019-10-22 08:54:51,626 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:51,626 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:51,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:51,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:51,670 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050632510] [2019-10-22 08:54:51,670 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:51,671 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:54:51,671 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519144165] [2019-10-22 08:54:51,671 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:54:51,671 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:51,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:54:51,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:54:51,672 INFO L87 Difference]: Start difference. First operand 220 states and 270 transitions. cyclomatic complexity: 54 Second operand 5 states. [2019-10-22 08:54:51,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:51,746 INFO L93 Difference]: Finished difference Result 428 states and 517 transitions. [2019-10-22 08:54:51,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:54:51,746 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 428 states and 517 transitions. [2019-10-22 08:54:51,749 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 387 [2019-10-22 08:54:51,751 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 428 states to 428 states and 517 transitions. [2019-10-22 08:54:51,752 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 428 [2019-10-22 08:54:51,753 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 428 [2019-10-22 08:54:51,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 428 states and 517 transitions. [2019-10-22 08:54:51,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:51,754 INFO L688 BuchiCegarLoop]: Abstraction has 428 states and 517 transitions. [2019-10-22 08:54:51,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states and 517 transitions. [2019-10-22 08:54:51,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 229. [2019-10-22 08:54:51,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-10-22 08:54:51,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 275 transitions. [2019-10-22 08:54:51,761 INFO L711 BuchiCegarLoop]: Abstraction has 229 states and 275 transitions. [2019-10-22 08:54:51,761 INFO L591 BuchiCegarLoop]: Abstraction has 229 states and 275 transitions. [2019-10-22 08:54:51,762 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-10-22 08:54:51,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 229 states and 275 transitions. [2019-10-22 08:54:51,763 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 210 [2019-10-22 08:54:51,763 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:51,763 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:51,763 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:51,763 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:51,764 INFO L791 eck$LassoCheckResult]: Stem: 2654#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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; 2613#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~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; 2614#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 2701#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 2699#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 2700#L313-1 assume !false; 2747#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 2746#L262 assume !false; 2745#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2744#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 2743#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2742#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 2741#L242 assume 0 != eval_~tmp___1~0; 2740#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 2688#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 2680#L96 assume 0 == ~p_dw_pc~0; 2670#L107-1 [2019-10-22 08:54:51,764 INFO L793 eck$LassoCheckResult]: Loop: 2670#L107-1 assume !false; 2679#L108 assume !(0 == ~q_free~0); 2757#L109 ~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 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 2756#L32 assume !(1 == ~p_dw_pc~0); 2693#L32-2 is_do_write_p_triggered_~__retres1~0 := 0; 2622#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 2623#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 2664#L74 assume !(0 != immediate_notify_threads_~tmp~0); 2646#L74-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 2647#L51 assume !(1 == ~c_dr_pc~0); 2605#L51-2 is_do_read_c_triggered_~__retres1~1 := 0; 2606#L62 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 2677#L63 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 2678#L82 assume !(0 != immediate_notify_threads_~tmp___0~0); 2674#L82-2 ~q_write_ev~0 := 2; 2670#L107-1 [2019-10-22 08:54:51,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:51,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1783039958, now seen corresponding path program 4 times [2019-10-22 08:54:51,764 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:51,765 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787503649] [2019-10-22 08:54:51,765 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:51,765 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:51,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:51,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:51,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:51,773 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:51,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:51,773 INFO L82 PathProgramCache]: Analyzing trace with hash -872319550, now seen corresponding path program 1 times [2019-10-22 08:54:51,774 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:51,774 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664471181] [2019-10-22 08:54:51,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:51,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:51,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:51,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:51,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:51,780 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:51,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:51,780 INFO L82 PathProgramCache]: Analyzing trace with hash 2123761273, now seen corresponding path program 1 times [2019-10-22 08:54:51,781 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:51,781 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936335954] [2019-10-22 08:54:51,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:51,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:51,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:51,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:51,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:51,792 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:51,875 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:51,875 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:51,875 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:51,875 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:51,875 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:54:51,875 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:51,876 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:51,876 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:51,876 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1.cil-1.c_Iteration10_Loop [2019-10-22 08:54:51,876 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:51,876 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:51,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:51,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:51,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:51,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:51,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:51,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:51,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:51,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:51,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:51,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:52,032 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:52,032 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad877ab1-7fb1-4364-9c0c-add3733e2ce6/bin/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 [2019-10-22 08:54:52,042 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:52,042 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:54:52,046 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:54:52,046 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_immediate_notify_threads_#t~ret0=0} Honda state: {ULTIMATE.start_immediate_notify_threads_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad877ab1-7fb1-4364-9c0c-add3733e2ce6/bin/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 [2019-10-22 08:54:52,050 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:52,050 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:54:52,053 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:54:52,053 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_immediate_notify_threads_#t~ret1=0} Honda state: {ULTIMATE.start_immediate_notify_threads_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad877ab1-7fb1-4364-9c0c-add3733e2ce6/bin/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 [2019-10-22 08:54:52,058 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:52,059 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad877ab1-7fb1-4364-9c0c-add3733e2ce6/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:54:52,073 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:54:52,073 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:52,085 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:54:52,088 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:52,088 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:52,088 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:52,088 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:52,088 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:52,088 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:52,088 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:52,089 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:52,089 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1.cil-1.c_Iteration10_Loop [2019-10-22 08:54:52,089 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:52,089 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:52,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:52,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:52,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:52,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:52,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:52,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:52,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:52,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:52,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:52,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:52,296 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:52,297 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:52,297 INFO L120 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 [2019-10-22 08:54:52,297 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,298 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,298 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,298 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,298 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:52,298 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:52,298 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,299 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,299 INFO L120 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 [2019-10-22 08:54:52,299 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,299 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,305 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,305 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,305 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:52,306 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:52,306 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,306 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,306 INFO L120 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 [2019-10-22 08:54:52,307 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,307 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,307 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,307 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:52,307 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:52,307 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:52,308 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,309 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,309 INFO L120 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 [2019-10-22 08:54:52,310 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,310 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,310 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,310 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,310 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:52,310 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:52,310 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,311 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,311 INFO L120 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 [2019-10-22 08:54:52,314 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,314 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,314 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,314 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,314 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:52,314 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:52,315 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,315 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,315 INFO L120 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 [2019-10-22 08:54:52,316 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,316 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,316 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,316 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,316 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:52,316 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:52,317 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,317 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,317 INFO L120 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 [2019-10-22 08:54:52,318 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,318 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,318 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,318 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,318 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:52,318 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:52,319 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,320 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,320 INFO L120 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 [2019-10-22 08:54:52,322 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,322 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,322 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,322 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:52,322 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:52,322 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:52,322 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,323 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,323 INFO L120 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 [2019-10-22 08:54:52,324 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,324 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,324 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,324 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,324 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:52,324 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:52,324 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,326 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,326 INFO L120 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 [2019-10-22 08:54:52,327 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,327 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,328 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,328 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:52,328 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:52,328 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:52,328 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,329 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,329 INFO L489 LassoAnalysis]: Using template '2-nested'. [2019-10-22 08:54:52,329 INFO L120 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 [2019-10-22 08:54:52,329 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,330 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,330 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,330 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,330 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:54:52,330 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:54:52,330 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,331 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,331 INFO L120 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 [2019-10-22 08:54:52,332 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,333 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,333 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,333 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,333 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:54:52,333 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:54:52,333 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,334 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,334 INFO L120 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 [2019-10-22 08:54:52,334 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,334 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,334 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,335 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:52,335 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:54:52,335 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:52,335 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,337 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,341 INFO L120 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 [2019-10-22 08:54:52,341 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,342 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,342 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,342 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,342 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:54:52,342 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:54:52,342 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,343 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,344 INFO L120 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 [2019-10-22 08:54:52,345 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,345 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,345 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,345 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,345 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:54:52,346 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:54:52,346 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,347 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,347 INFO L120 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 [2019-10-22 08:54:52,347 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,347 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,348 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,348 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,348 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:54:52,348 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:54:52,348 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,349 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,349 INFO L120 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 [2019-10-22 08:54:52,349 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,350 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,350 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,350 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,350 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:54:52,350 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:54:52,350 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,351 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,352 INFO L120 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 [2019-10-22 08:54:52,353 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,353 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,353 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,353 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:52,353 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:54:52,353 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:52,353 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,354 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,354 INFO L120 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 [2019-10-22 08:54:52,354 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,355 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,355 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,355 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,355 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:54:52,356 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:54:52,356 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,357 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,357 INFO L120 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 [2019-10-22 08:54:52,358 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,359 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,359 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,359 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:52,359 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:54:52,360 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:52,360 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,360 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,361 INFO L489 LassoAnalysis]: Using template '3-nested'. [2019-10-22 08:54:52,361 INFO L120 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 [2019-10-22 08:54:52,361 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,361 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,362 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,362 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,362 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:52,362 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:52,362 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,363 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,363 INFO L120 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 [2019-10-22 08:54:52,363 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,363 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,363 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,364 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,365 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:52,365 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:52,365 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,365 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,366 INFO L120 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 [2019-10-22 08:54:52,366 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,366 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,366 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,366 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:52,366 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:52,367 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:54:52,367 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,370 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,370 INFO L120 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 [2019-10-22 08:54:52,370 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,371 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,371 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,371 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,371 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:52,371 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:52,372 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,372 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,373 INFO L120 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 [2019-10-22 08:54:52,373 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,374 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,374 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,374 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,374 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:52,374 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:52,374 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,375 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,375 INFO L120 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 [2019-10-22 08:54:52,376 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,376 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,376 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,376 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,376 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:52,376 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:52,377 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,377 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,378 INFO L120 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 [2019-10-22 08:54:52,379 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,380 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,380 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,380 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,380 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:52,380 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:52,380 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,381 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,382 INFO L120 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 [2019-10-22 08:54:52,382 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,382 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,382 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,382 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:52,382 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:52,383 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:54:52,383 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,383 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,384 INFO L120 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 [2019-10-22 08:54:52,384 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,384 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,385 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,385 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,385 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:52,385 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:52,385 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,386 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,387 INFO L120 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 [2019-10-22 08:54:52,387 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,387 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,387 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,387 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:52,387 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:52,388 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:54:52,388 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,389 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,389 INFO L489 LassoAnalysis]: Using template '4-nested'. [2019-10-22 08:54:52,389 INFO L120 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 [2019-10-22 08:54:52,389 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,390 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,390 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,390 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,390 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:54:52,390 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:54:52,390 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,391 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,391 INFO L120 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 [2019-10-22 08:54:52,391 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,392 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,392 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,392 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,392 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:54:52,393 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:54:52,393 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,393 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,393 INFO L120 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 [2019-10-22 08:54:52,394 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,394 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,394 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,394 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:52,394 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:54:52,395 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-10-22 08:54:52,395 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,398 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,398 INFO L120 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 [2019-10-22 08:54:52,399 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,399 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,399 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,399 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,399 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:54:52,400 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:54:52,400 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,401 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,401 INFO L120 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 [2019-10-22 08:54:52,402 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,402 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,402 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,402 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,402 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:54:52,402 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:54:52,402 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,403 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,403 INFO L120 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 [2019-10-22 08:54:52,404 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,404 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,404 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,405 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,405 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:54:52,405 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:54:52,406 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,407 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,407 INFO L120 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 [2019-10-22 08:54:52,407 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,408 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,408 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,408 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,408 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:54:52,408 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:54:52,408 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,410 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,410 INFO L120 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 [2019-10-22 08:54:52,410 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,411 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,411 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,411 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:52,411 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:54:52,411 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-10-22 08:54:52,411 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,413 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,413 INFO L120 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 [2019-10-22 08:54:52,416 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,416 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,416 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,417 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,417 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:54:52,417 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:54:52,417 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,419 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,419 INFO L120 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 [2019-10-22 08:54:52,420 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,420 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,421 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,421 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:52,421 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:54:52,421 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-10-22 08:54:52,421 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,422 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,422 INFO L489 LassoAnalysis]: Using template '2-phase'. [2019-10-22 08:54:52,422 INFO L120 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 [2019-10-22 08:54:52,423 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,424 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:54:52,424 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,424 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,424 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,424 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:54:52,424 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:54:52,425 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,425 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,425 INFO L120 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 [2019-10-22 08:54:52,426 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,426 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:54:52,426 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,426 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,426 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,426 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:54:52,427 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:54:52,427 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,427 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,428 INFO L120 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 [2019-10-22 08:54:52,428 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,429 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:54:52,429 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,429 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,429 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:52,429 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:54:52,430 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:52,430 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,434 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,434 INFO L120 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 [2019-10-22 08:54:52,434 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,435 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:54:52,435 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,435 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,435 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,435 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:54:52,436 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:54:52,436 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,437 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,437 INFO L120 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 [2019-10-22 08:54:52,438 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,438 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:54:52,438 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,438 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,438 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,438 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:54:52,439 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:54:52,439 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,439 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,440 INFO L120 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 [2019-10-22 08:54:52,441 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,441 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:54:52,441 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,441 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,441 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,441 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:54:52,442 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:54:52,442 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,443 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,443 INFO L120 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 [2019-10-22 08:54:52,443 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,443 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:54:52,443 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,444 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,444 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,444 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:54:52,445 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:54:52,445 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,446 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,447 INFO L120 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 [2019-10-22 08:54:52,447 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,447 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:54:52,447 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,448 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,448 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:52,448 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:54:52,449 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:52,449 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,451 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,451 INFO L120 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 [2019-10-22 08:54:52,452 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,452 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:54:52,452 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,452 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,453 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,453 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:54:52,453 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:54:52,453 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,458 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,460 INFO L120 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 [2019-10-22 08:54:52,461 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,461 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:54:52,461 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,461 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,461 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:52,461 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:54:52,462 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:52,462 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,464 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,465 INFO L489 LassoAnalysis]: Using template '3-phase'. [2019-10-22 08:54:52,465 INFO L120 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 [2019-10-22 08:54:52,466 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,466 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 08:54:52,466 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,466 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,466 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,466 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:52,467 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:52,467 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,468 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,468 INFO L120 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 [2019-10-22 08:54:52,468 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,468 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 08:54:52,469 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,469 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,469 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,469 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:52,469 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:52,469 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,470 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,471 INFO L120 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 [2019-10-22 08:54:52,471 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,471 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 08:54:52,471 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,471 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,471 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:52,472 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:52,473 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:54:52,473 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,479 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,479 INFO L120 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 [2019-10-22 08:54:52,479 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,480 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 08:54:52,480 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,480 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,480 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,480 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:52,481 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:52,481 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,483 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,488 INFO L120 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 [2019-10-22 08:54:52,493 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,493 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 08:54:52,493 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,493 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,494 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,494 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:52,494 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:52,495 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,496 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,496 INFO L120 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 [2019-10-22 08:54:52,497 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,497 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 08:54:52,497 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,497 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,497 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,497 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:52,498 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:52,498 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,501 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,501 INFO L120 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 [2019-10-22 08:54:52,502 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,502 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 08:54:52,502 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,502 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,502 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,502 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:52,503 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:52,503 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,506 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,506 INFO L120 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 [2019-10-22 08:54:52,507 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,507 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 08:54:52,507 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,507 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,507 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:52,508 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:52,508 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:54:52,508 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,511 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,511 INFO L120 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 [2019-10-22 08:54:52,512 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,512 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 08:54:52,512 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,512 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,512 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,512 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:52,513 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:52,513 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,518 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,519 INFO L120 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 [2019-10-22 08:54:52,519 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,519 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 08:54:52,519 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,520 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,520 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:52,520 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:52,521 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:54:52,521 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,523 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,524 INFO L489 LassoAnalysis]: Using template '4-phase'. [2019-10-22 08:54:52,525 INFO L120 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 [2019-10-22 08:54:52,525 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,525 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:54:52,525 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,526 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,526 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,526 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:54:52,526 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:54:52,527 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,527 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,528 INFO L120 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 [2019-10-22 08:54:52,529 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,529 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:54:52,529 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,529 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,529 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,529 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:54:52,530 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:54:52,530 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,531 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,531 INFO L120 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 [2019-10-22 08:54:52,531 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,531 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:54:52,532 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,532 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,532 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:52,532 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:54:52,534 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-10-22 08:54:52,534 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,547 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,548 INFO L120 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 [2019-10-22 08:54:52,548 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,548 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:54:52,549 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,549 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,549 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,549 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:54:52,550 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:54:52,551 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,552 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,552 INFO L120 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 [2019-10-22 08:54:52,553 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,553 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:54:52,553 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,553 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,553 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,553 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:54:52,555 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:54:52,555 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,556 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,557 INFO L120 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 [2019-10-22 08:54:52,557 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,557 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:54:52,557 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,557 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,558 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,558 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:54:52,559 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:54:52,559 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,560 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,561 INFO L120 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 [2019-10-22 08:54:52,561 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,561 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:54:52,561 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,562 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,562 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,562 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:54:52,563 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:54:52,563 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,567 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,567 INFO L120 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 [2019-10-22 08:54:52,568 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,568 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:54:52,568 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,568 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,568 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:52,568 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:54:52,570 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-10-22 08:54:52,570 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,576 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,576 INFO L120 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 [2019-10-22 08:54:52,576 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,577 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:54:52,577 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,577 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,577 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,577 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:54:52,578 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:54:52,578 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,591 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,591 INFO L120 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 [2019-10-22 08:54:52,592 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,592 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:54:52,592 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,592 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,592 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:52,592 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:54:52,593 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-10-22 08:54:52,594 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,600 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,600 INFO L489 LassoAnalysis]: Using template '2-lex'. [2019-10-22 08:54:52,600 INFO L120 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 [2019-10-22 08:54:52,601 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,601 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:54:52,601 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,601 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,601 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,602 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:52,602 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:52,602 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,604 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,604 INFO L120 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 [2019-10-22 08:54:52,605 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,605 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:54:52,605 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,605 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,605 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,605 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:52,606 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:52,606 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,608 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,608 INFO L120 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 [2019-10-22 08:54:52,609 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,609 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:54:52,609 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,609 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,609 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:52,609 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:52,610 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:54:52,610 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,615 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,616 INFO L120 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 [2019-10-22 08:54:52,616 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,616 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:54:52,616 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,617 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,617 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,617 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:52,617 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:52,618 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,621 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,621 INFO L120 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 [2019-10-22 08:54:52,622 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,622 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:54:52,622 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,622 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,622 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,622 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:52,623 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:52,623 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,626 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,627 INFO L120 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 [2019-10-22 08:54:52,627 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,627 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:54:52,627 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,628 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,628 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,628 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:52,629 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:52,629 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,632 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,632 INFO L120 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 [2019-10-22 08:54:52,633 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,633 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:54:52,633 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,633 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,633 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,633 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:52,634 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:52,634 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,637 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,637 INFO L120 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 [2019-10-22 08:54:52,638 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,638 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:54:52,638 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,638 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,638 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:52,639 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:52,639 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:54:52,639 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,642 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,642 INFO L120 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 [2019-10-22 08:54:52,643 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,643 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:54:52,643 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,643 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,643 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,643 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:52,644 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:52,644 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,647 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,647 INFO L120 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 [2019-10-22 08:54:52,648 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,648 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:54:52,648 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,648 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,649 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:52,649 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:54:52,649 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:54:52,649 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,652 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,652 INFO L489 LassoAnalysis]: Using template '3-lex'. [2019-10-22 08:54:52,652 INFO L120 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 [2019-10-22 08:54:52,653 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,653 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:54:52,653 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,653 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,653 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,654 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 08:54:52,654 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:52,654 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,657 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,658 INFO L120 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 [2019-10-22 08:54:52,658 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,658 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:54:52,658 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,659 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,659 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,659 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 08:54:52,660 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:52,660 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,663 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,663 INFO L120 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 [2019-10-22 08:54:52,663 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,664 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:54:52,664 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,664 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,664 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:52,664 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 08:54:52,666 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:54:52,666 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,678 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,678 INFO L120 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 [2019-10-22 08:54:52,679 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,679 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:54:52,679 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,679 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,679 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,680 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 08:54:52,681 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:52,681 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,687 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,688 INFO L120 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 [2019-10-22 08:54:52,688 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,689 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:54:52,689 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,689 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,689 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,689 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 08:54:52,690 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:52,691 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,697 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,697 INFO L120 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 [2019-10-22 08:54:52,698 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,698 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:54:52,698 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,698 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,698 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,698 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 08:54:52,700 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:52,700 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,706 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,707 INFO L120 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 [2019-10-22 08:54:52,707 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,707 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:54:52,707 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,708 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,708 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,708 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 08:54:52,709 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:52,709 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,716 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,716 INFO L120 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 [2019-10-22 08:54:52,717 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,717 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:54:52,717 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,717 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,718 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:52,718 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 08:54:52,719 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:54:52,719 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,723 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,724 INFO L120 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 [2019-10-22 08:54:52,724 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,724 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:54:52,725 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,725 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,725 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,725 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 08:54:52,726 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:52,726 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,733 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,733 INFO L120 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 [2019-10-22 08:54:52,734 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:54:52,734 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:54:52,734 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,734 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,734 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:52,735 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 08:54:52,736 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:54:52,736 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,741 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,920 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2019-10-22 08:54:53,051 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-10-22 08:54:53,054 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:53,054 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:53,054 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:53,054 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:53,054 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:54:53,054 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:53,055 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:53,055 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:53,055 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1.cil-1.c_Iteration10_Lasso [2019-10-22 08:54:53,055 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:53,055 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:53,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,418 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:53,418 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad877ab1-7fb1-4364-9c0c-add3733e2ce6/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:54:53,425 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:53,425 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:53,429 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:54:53,429 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___0~1=0} Honda state: {ULTIMATE.start_eval_~tmp___0~1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad877ab1-7fb1-4364-9c0c-add3733e2ce6/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:54:53,436 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:53,436 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:53,439 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:54:53,439 INFO L440 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_ad877ab1-7fb1-4364-9c0c-add3733e2ce6/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:54:53,446 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:53,447 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:53,450 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:54:53,450 INFO L440 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_ad877ab1-7fb1-4364-9c0c-add3733e2ce6/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:54:53,457 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:53,457 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad877ab1-7fb1-4364-9c0c-add3733e2ce6/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:54:53,469 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:54:53,469 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:53,478 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:54:53,481 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:53,481 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:53,481 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:53,481 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:53,481 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:53,481 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:53,481 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:53,482 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:53,482 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1.cil-1.c_Iteration10_Lasso [2019-10-22 08:54:53,482 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:53,482 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:53,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:53,818 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:53,818 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:53,818 INFO L120 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 [2019-10-22 08:54:53,819 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:53,819 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:53,819 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:53,819 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:53,825 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:53,825 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:53,827 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:53,828 INFO L120 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 [2019-10-22 08:54:53,828 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:53,828 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:53,828 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:53,828 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:53,828 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:53,829 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:53,829 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:53,829 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:53,829 INFO L120 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 [2019-10-22 08:54:53,830 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:53,830 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:53,830 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:53,830 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:53,830 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:53,830 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:53,830 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:53,831 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:53,831 INFO L120 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 [2019-10-22 08:54:53,831 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:53,831 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:53,831 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:53,831 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:53,832 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:53,832 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:53,834 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:53,835 INFO L120 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 [2019-10-22 08:54:53,835 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:53,835 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:53,835 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:53,835 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:53,837 INFO L400 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-10-22 08:54:53,837 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-10-22 08:54:53,847 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:53,862 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 08:54:53,862 INFO L444 ModelExtractionUtils]: 3 out of 11 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 08:54:53,864 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:53,866 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2019-10-22 08:54:53,866 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:53,867 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~q_free~0) = 1*~q_free~0 Supporting invariants [1*~q_free~0 >= 0] [2019-10-22 08:54:53,871 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-10-22 08:54:53,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:53,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:53,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:54:53,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:53,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:53,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:54:53,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:53,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:53,984 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-10-22 08:54:53,984 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 229 states and 275 transitions. cyclomatic complexity: 50 Second operand 6 states. [2019-10-22 08:54:54,119 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 229 states and 275 transitions. cyclomatic complexity: 50. Second operand 6 states. Result 1087 states and 1324 transitions. Complement of second has 9 states. [2019-10-22 08:54:54,121 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 [2019-10-22 08:54:54,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-10-22 08:54:54,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 340 transitions. [2019-10-22 08:54:54,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 340 transitions. Stem has 16 letters. Loop has 15 letters. [2019-10-22 08:54:54,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:54,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 340 transitions. Stem has 31 letters. Loop has 15 letters. [2019-10-22 08:54:54,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:54,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 340 transitions. Stem has 16 letters. Loop has 30 letters. [2019-10-22 08:54:54,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:54,129 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1087 states and 1324 transitions. [2019-10-22 08:54:54,139 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 563 [2019-10-22 08:54:54,146 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1087 states to 892 states and 1084 transitions. [2019-10-22 08:54:54,147 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 646 [2019-10-22 08:54:54,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 650 [2019-10-22 08:54:54,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 892 states and 1084 transitions. [2019-10-22 08:54:54,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:54,148 INFO L688 BuchiCegarLoop]: Abstraction has 892 states and 1084 transitions. [2019-10-22 08:54:54,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states and 1084 transitions. [2019-10-22 08:54:54,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 659. [2019-10-22 08:54:54,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-10-22 08:54:54,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 802 transitions. [2019-10-22 08:54:54,160 INFO L711 BuchiCegarLoop]: Abstraction has 659 states and 802 transitions. [2019-10-22 08:54:54,160 INFO L591 BuchiCegarLoop]: Abstraction has 659 states and 802 transitions. [2019-10-22 08:54:54,160 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-10-22 08:54:54,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 659 states and 802 transitions. [2019-10-22 08:54:54,164 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 377 [2019-10-22 08:54:54,164 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:54,164 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:54,165 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:54,165 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:54,165 INFO L791 eck$LassoCheckResult]: Stem: 4150#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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; 4071#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~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; 4072#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 4231#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 4229#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 4230#L313-1 assume !false; 4372#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 4371#L262 assume !false; 4370#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 4369#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 4368#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 4367#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 4366#L242 assume 0 != eval_~tmp___1~0; 4365#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 4364#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 4363#L96 assume !(0 == ~p_dw_pc~0); 4174#L99 assume 1 == ~p_dw_pc~0; 4175#L109 [2019-10-22 08:54:54,165 INFO L793 eck$LassoCheckResult]: Loop: 4175#L109 ~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 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 4083#L32 assume 1 == ~p_dw_pc~0; 4084#L33 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 4088#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 4089#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 4166#L74 assume 0 != immediate_notify_threads_~tmp~0;~p_dw_st~0 := 0; 4689#L74-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 4063#L51 assume !(1 == ~c_dr_pc~0); 4064#L51-2 is_do_read_c_triggered_~__retres1~1 := 0; 4682#L62 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 4683#L63 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 4598#L82 assume !(0 != immediate_notify_threads_~tmp___0~0); 4599#L82-2 ~q_write_ev~0 := 2; 4590#L107-1 assume !false; 4591#L108 assume !(0 == ~q_free~0); 4175#L109 [2019-10-22 08:54:54,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:54,165 INFO L82 PathProgramCache]: Analyzing trace with hash 560336285, now seen corresponding path program 1 times [2019-10-22 08:54:54,165 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:54,166 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719249599] [2019-10-22 08:54:54,166 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:54,166 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:54,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:54,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:54,184 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719249599] [2019-10-22 08:54:54,184 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:54,184 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:54,184 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112978003] [2019-10-22 08:54:54,185 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:54:54,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:54,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1691430829, now seen corresponding path program 1 times [2019-10-22 08:54:54,185 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:54,185 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82825275] [2019-10-22 08:54:54,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:54,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:54,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:54,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:54,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:54,199 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82825275] [2019-10-22 08:54:54,199 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:54,199 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-10-22 08:54:54,199 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593077493] [2019-10-22 08:54:54,200 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:54:54,200 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:54,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:54,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:54,200 INFO L87 Difference]: Start difference. First operand 659 states and 802 transitions. cyclomatic complexity: 155 Second operand 3 states. [2019-10-22 08:54:54,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:54,218 INFO L93 Difference]: Finished difference Result 372 states and 445 transitions. [2019-10-22 08:54:54,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:54,218 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 372 states and 445 transitions. [2019-10-22 08:54:54,221 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 233 [2019-10-22 08:54:54,223 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 372 states to 314 states and 376 transitions. [2019-10-22 08:54:54,223 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 311 [2019-10-22 08:54:54,223 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 314 [2019-10-22 08:54:54,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 314 states and 376 transitions. [2019-10-22 08:54:54,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:54,225 INFO L688 BuchiCegarLoop]: Abstraction has 314 states and 376 transitions. [2019-10-22 08:54:54,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states and 376 transitions. [2019-10-22 08:54:54,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 249. [2019-10-22 08:54:54,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-10-22 08:54:54,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 301 transitions. [2019-10-22 08:54:54,230 INFO L711 BuchiCegarLoop]: Abstraction has 249 states and 301 transitions. [2019-10-22 08:54:54,230 INFO L591 BuchiCegarLoop]: Abstraction has 249 states and 301 transitions. [2019-10-22 08:54:54,230 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-10-22 08:54:54,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 249 states and 301 transitions. [2019-10-22 08:54:54,232 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 206 [2019-10-22 08:54:54,232 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:54,232 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:54,232 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:54,232 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:54,233 INFO L791 eck$LassoCheckResult]: Stem: 5135#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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; 5097#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~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; 5098#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 5176#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 5174#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 5175#L313-1 assume !false; 5218#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 5215#L262 assume !false; 5213#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5211#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 5209#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5207#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 5205#L242 assume 0 != eval_~tmp___1~0; 5200#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 5166#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 5167#L96 assume 0 == ~p_dw_pc~0; 5199#L107-1 assume !false; 5156#L108 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 5125#L247 [2019-10-22 08:54:54,233 INFO L793 eck$LassoCheckResult]: Loop: 5125#L247 assume !(0 == ~c_dr_st~0); 5100#L262 assume !false; 5150#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5151#L214 assume !(0 == ~p_dw_st~0); 5163#L218 assume 0 == ~c_dr_st~0;exists_runnable_thread_~__retres1~2 := 1; 5112#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5113#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 5127#L242 assume 0 != eval_~tmp___1~0; 5124#L242-1 assume !(0 == ~p_dw_st~0); 5125#L247 [2019-10-22 08:54:54,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:54,233 INFO L82 PathProgramCache]: Analyzing trace with hash 190554158, now seen corresponding path program 1 times [2019-10-22 08:54:54,233 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:54,233 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213040212] [2019-10-22 08:54:54,233 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:54,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:54,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:54,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:54,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:54,250 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213040212] [2019-10-22 08:54:54,250 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:54,251 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:54:54,251 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8127764] [2019-10-22 08:54:54,251 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:54:54,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:54,251 INFO L82 PathProgramCache]: Analyzing trace with hash 313858188, now seen corresponding path program 1 times [2019-10-22 08:54:54,251 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:54,252 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921763977] [2019-10-22 08:54:54,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:54,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:54,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:54,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:54,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:54,261 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921763977] [2019-10-22 08:54:54,261 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:54,261 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:54:54,261 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370613379] [2019-10-22 08:54:54,261 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:54:54,262 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:54,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:54,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:54,262 INFO L87 Difference]: Start difference. First operand 249 states and 301 transitions. cyclomatic complexity: 54 Second operand 3 states. [2019-10-22 08:54:54,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:54,284 INFO L93 Difference]: Finished difference Result 308 states and 364 transitions. [2019-10-22 08:54:54,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:54,285 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 308 states and 364 transitions. [2019-10-22 08:54:54,287 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 258 [2019-10-22 08:54:54,288 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 308 states to 308 states and 364 transitions. [2019-10-22 08:54:54,288 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 308 [2019-10-22 08:54:54,289 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 308 [2019-10-22 08:54:54,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 308 states and 364 transitions. [2019-10-22 08:54:54,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:54,289 INFO L688 BuchiCegarLoop]: Abstraction has 308 states and 364 transitions. [2019-10-22 08:54:54,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states and 364 transitions. [2019-10-22 08:54:54,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 218. [2019-10-22 08:54:54,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-10-22 08:54:54,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 258 transitions. [2019-10-22 08:54:54,293 INFO L711 BuchiCegarLoop]: Abstraction has 218 states and 258 transitions. [2019-10-22 08:54:54,294 INFO L591 BuchiCegarLoop]: Abstraction has 218 states and 258 transitions. [2019-10-22 08:54:54,294 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-10-22 08:54:54,294 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 218 states and 258 transitions. [2019-10-22 08:54:54,295 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 168 [2019-10-22 08:54:54,295 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:54,295 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:54,295 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:54,296 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:54,296 INFO L791 eck$LassoCheckResult]: Stem: 5701#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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; 5661#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~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; 5662#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 5737#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 5735#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 5736#L313-1 assume !false; 5803#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 5801#L262 assume !false; 5799#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5796#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 5794#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5791#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 5789#L242 assume 0 != eval_~tmp___1~0; 5788#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 5782#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 5781#L96 assume 0 == ~p_dw_pc~0; 5777#L107-1 assume !false; 5748#L108 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 5744#L247 [2019-10-22 08:54:54,297 INFO L793 eck$LassoCheckResult]: Loop: 5744#L247 assume 0 == ~c_dr_st~0;eval_~tmp___0~1 := eval_#t~nondet5;havoc eval_#t~nondet5; 5663#L266 assume !(0 != eval_~tmp___0~1); 5664#L262 assume !false; 5776#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5774#L214 assume !(0 == ~p_dw_st~0); 5772#L218 assume 0 == ~c_dr_st~0;exists_runnable_thread_~__retres1~2 := 1; 5770#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5768#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 5764#L242 assume 0 != eval_~tmp___1~0; 5749#L242-1 assume !(0 == ~p_dw_st~0); 5744#L247 [2019-10-22 08:54:54,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:54,297 INFO L82 PathProgramCache]: Analyzing trace with hash 190554158, now seen corresponding path program 2 times [2019-10-22 08:54:54,297 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:54,297 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141464203] [2019-10-22 08:54:54,297 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:54,297 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:54,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:54,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:54,313 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141464203] [2019-10-22 08:54:54,313 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:54,313 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:54:54,313 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645835065] [2019-10-22 08:54:54,313 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:54:54,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:54,314 INFO L82 PathProgramCache]: Analyzing trace with hash -750519281, now seen corresponding path program 1 times [2019-10-22 08:54:54,314 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:54,314 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663167850] [2019-10-22 08:54:54,314 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:54,314 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:54,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:54,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:54,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:54,322 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:54,360 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:54,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:54,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:54,360 INFO L87 Difference]: Start difference. First operand 218 states and 258 transitions. cyclomatic complexity: 43 Second operand 3 states. [2019-10-22 08:54:54,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:54,372 INFO L93 Difference]: Finished difference Result 241 states and 282 transitions. [2019-10-22 08:54:54,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:54,372 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 241 states and 282 transitions. [2019-10-22 08:54:54,374 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 190 [2019-10-22 08:54:54,375 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 241 states to 240 states and 281 transitions. [2019-10-22 08:54:54,375 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 240 [2019-10-22 08:54:54,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 240 [2019-10-22 08:54:54,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 240 states and 281 transitions. [2019-10-22 08:54:54,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:54,376 INFO L688 BuchiCegarLoop]: Abstraction has 240 states and 281 transitions. [2019-10-22 08:54:54,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states and 281 transitions. [2019-10-22 08:54:54,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 217. [2019-10-22 08:54:54,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-10-22 08:54:54,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 256 transitions. [2019-10-22 08:54:54,379 INFO L711 BuchiCegarLoop]: Abstraction has 217 states and 256 transitions. [2019-10-22 08:54:54,380 INFO L591 BuchiCegarLoop]: Abstraction has 217 states and 256 transitions. [2019-10-22 08:54:54,380 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-10-22 08:54:54,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 217 states and 256 transitions. [2019-10-22 08:54:54,381 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 168 [2019-10-22 08:54:54,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:54,381 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:54,382 INFO L849 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] [2019-10-22 08:54:54,383 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:54,383 INFO L791 eck$LassoCheckResult]: Stem: 6168#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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; 6127#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~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; 6128#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 6210#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 6209#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 6199#L313-1 assume !false; 6149#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 6150#L262 assume !false; 6184#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 6185#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 6260#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 6259#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 6158#L242 assume 0 != eval_~tmp___1~0; 6159#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 6257#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 6256#L96 assume !(0 == ~p_dw_pc~0); 6182#L99 assume 1 == ~p_dw_pc~0; 6144#L109 ~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 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 6145#L32 assume 1 == ~p_dw_pc~0; 6174#L33 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 6175#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 6250#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 6247#L74 assume !(0 != immediate_notify_threads_~tmp~0); 6191#L74-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 6124#L51 assume !(1 == ~c_dr_pc~0); 6125#L51-2 is_do_read_c_triggered_~__retres1~1 := 0; 6239#L62 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 6236#L63 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 6232#L82 assume !(0 != immediate_notify_threads_~tmp___0~0); 6228#L82-2 ~q_write_ev~0 := 2; 6224#L107-1 assume !false; 6220#L108 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 6217#L247 [2019-10-22 08:54:54,384 INFO L793 eck$LassoCheckResult]: Loop: 6217#L247 assume 0 == ~c_dr_st~0;eval_~tmp___0~1 := eval_#t~nondet5;havoc eval_#t~nondet5; 6129#L266 assume !(0 != eval_~tmp___0~1); 6130#L262 assume !false; 6242#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 6240#L214 assume !(0 == ~p_dw_st~0); 6237#L218 assume 0 == ~c_dr_st~0;exists_runnable_thread_~__retres1~2 := 1; 6233#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 6229#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 6225#L242 assume 0 != eval_~tmp___1~0; 6221#L242-1 assume !(0 == ~p_dw_st~0); 6217#L247 [2019-10-22 08:54:54,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:54,384 INFO L82 PathProgramCache]: Analyzing trace with hash -2034026126, now seen corresponding path program 1 times [2019-10-22 08:54:54,384 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:54,384 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300585882] [2019-10-22 08:54:54,384 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:54,384 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:54,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:54,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:54,399 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300585882] [2019-10-22 08:54:54,399 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:54,399 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:54,399 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231224340] [2019-10-22 08:54:54,400 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:54:54,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:54,400 INFO L82 PathProgramCache]: Analyzing trace with hash -750519281, now seen corresponding path program 2 times [2019-10-22 08:54:54,400 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:54,400 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27209234] [2019-10-22 08:54:54,400 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:54,400 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:54,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:54,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:54,406 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:54,442 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:54,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:54,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:54,442 INFO L87 Difference]: Start difference. First operand 217 states and 256 transitions. cyclomatic complexity: 42 Second operand 3 states. [2019-10-22 08:54:54,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:54,457 INFO L93 Difference]: Finished difference Result 210 states and 244 transitions. [2019-10-22 08:54:54,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:54,458 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 210 states and 244 transitions. [2019-10-22 08:54:54,459 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 168 [2019-10-22 08:54:54,460 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 210 states to 210 states and 244 transitions. [2019-10-22 08:54:54,460 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 210 [2019-10-22 08:54:54,461 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 210 [2019-10-22 08:54:54,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 210 states and 244 transitions. [2019-10-22 08:54:54,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:54,461 INFO L688 BuchiCegarLoop]: Abstraction has 210 states and 244 transitions. [2019-10-22 08:54:54,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states and 244 transitions. [2019-10-22 08:54:54,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2019-10-22 08:54:54,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-10-22 08:54:54,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 244 transitions. [2019-10-22 08:54:54,465 INFO L711 BuchiCegarLoop]: Abstraction has 210 states and 244 transitions. [2019-10-22 08:54:54,465 INFO L591 BuchiCegarLoop]: Abstraction has 210 states and 244 transitions. [2019-10-22 08:54:54,465 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-10-22 08:54:54,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 210 states and 244 transitions. [2019-10-22 08:54:54,466 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 168 [2019-10-22 08:54:54,467 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:54,467 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:54,467 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [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] [2019-10-22 08:54:54,468 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:54,468 INFO L791 eck$LassoCheckResult]: Stem: 6599#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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; 6560#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~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; 6561#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 6642#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 6640#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 6641#L313-1 assume !false; 6681#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 6679#L262 assume !false; 6677#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 6675#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 6670#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 6666#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 6662#L242 assume 0 != eval_~tmp___1~0; 6659#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 6633#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 6625#L96 assume 0 == ~p_dw_pc~0; 6626#L107-1 assume !false; 6651#L108 assume !(0 == ~q_free~0); 6577#L109 ~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 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 6567#L32 assume !(1 == ~p_dw_pc~0); 6568#L32-2 is_do_write_p_triggered_~__retres1~0 := 0; 6569#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 6570#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 6608#L74 assume !(0 != immediate_notify_threads_~tmp~0); 6594#L74-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 6557#L51 assume !(1 == ~c_dr_pc~0); 6558#L51-2 is_do_read_c_triggered_~__retres1~1 := 0; 6692#L62 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 6690#L63 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 6688#L82 assume !(0 != immediate_notify_threads_~tmp___0~0); 6687#L82-2 ~q_write_ev~0 := 2; 6686#L107-1 assume !false; 6671#L108 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 6667#L247 [2019-10-22 08:54:54,468 INFO L793 eck$LassoCheckResult]: Loop: 6667#L247 assume 0 == ~c_dr_st~0;eval_~tmp___0~1 := eval_#t~nondet5;havoc eval_#t~nondet5; 6562#L266 assume !(0 != eval_~tmp___0~1); 6563#L262 assume !false; 6615#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 6616#L214 assume !(0 == ~p_dw_st~0); 6693#L218 assume 0 == ~c_dr_st~0;exists_runnable_thread_~__retres1~2 := 1; 6685#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 6612#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 6592#L242 assume 0 != eval_~tmp___1~0; 6593#L242-1 assume !(0 == ~p_dw_st~0); 6667#L247 [2019-10-22 08:54:54,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:54,468 INFO L82 PathProgramCache]: Analyzing trace with hash 825120445, now seen corresponding path program 1 times [2019-10-22 08:54:54,468 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:54,468 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64543483] [2019-10-22 08:54:54,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:54,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:54,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:54,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:54,480 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:54,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:54,480 INFO L82 PathProgramCache]: Analyzing trace with hash -750519281, now seen corresponding path program 3 times [2019-10-22 08:54:54,481 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:54,481 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371816128] [2019-10-22 08:54:54,481 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:54,481 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:54,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:54,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:54,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:54,486 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:54,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:54,486 INFO L82 PathProgramCache]: Analyzing trace with hash 250746827, now seen corresponding path program 1 times [2019-10-22 08:54:54,486 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:54,486 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634909358] [2019-10-22 08:54:54,486 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:54,487 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:54,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:54,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:54,498 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:54,770 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 103 [2019-10-22 08:54:54,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:54:54 BoogieIcfgContainer [2019-10-22 08:54:54,844 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:54:54,845 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:54:54,845 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:54:54,845 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:54:54,845 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:48" (3/4) ... [2019-10-22 08:54:54,848 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-10-22 08:54:54,909 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ad877ab1-7fb1-4364-9c0c-add3733e2ce6/bin/uautomizer/witness.graphml [2019-10-22 08:54:54,911 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:54:54,912 INFO L168 Benchmark]: Toolchain (without parser) took 6985.26 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 296.2 MB). Free memory was 941.0 MB in the beginning and 861.1 MB in the end (delta: 79.9 MB). Peak memory consumption was 376.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:54,912 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 958.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:54,913 INFO L168 Benchmark]: CACSL2BoogieTranslator took 360.48 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -168.5 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:54,913 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.92 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:54,913 INFO L168 Benchmark]: Boogie Preprocessor took 33.96 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:54,914 INFO L168 Benchmark]: RCFGBuilder took 352.11 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:54,914 INFO L168 Benchmark]: BuchiAutomizer took 6124.87 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 177.2 MB). Free memory was 1.1 GB in the beginning and 864.4 MB in the end (delta: 207.5 MB). Peak memory consumption was 384.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:54,914 INFO L168 Benchmark]: Witness Printer took 65.98 ms. Allocated memory is still 1.3 GB. Free memory was 864.4 MB in the beginning and 861.1 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:54,916 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 958.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 360.48 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -168.5 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.92 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.96 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 352.11 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6124.87 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 177.2 MB). Free memory was 1.1 GB in the beginning and 864.4 MB in the end (delta: 207.5 MB). Peak memory consumption was 384.7 MB. Max. memory is 11.5 GB. * Witness Printer took 65.98 ms. Allocated memory is still 1.3 GB. Free memory was 864.4 MB in the beginning and 861.1 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 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 14 terminating modules (13 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function q_free and consists of 6 locations. 13 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 210 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.0s and 15 iterations. TraceHistogramMax:2. Analysis of lassos took 5.0s. Construction of modules took 0.2s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 11. Minimization of nondet autom 3. Automata minimization 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 848 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 659 states and ocurred in iteration 10. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1747 SDtfs, 1631 SDslu, 1732 SDs, 0 SdLazy, 203 SolverSat, 57 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI6 SFLT0 conc1 concLT0 SILN2 SILU0 SILI4 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital70 mio100 ax100 hnf100 lsp18 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq210 hnf86 smp100 dnf118 smp100 tf105 neg92 sie115 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 31ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 262]: 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, c_dr_pc=0, a_t=0, \result=0, \result=0, c_num_read=0, tmp=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1e19aee0=0, c_dr_st=0, kernel_st=1, q_read_ev=2, p_dw_i=1, tmp___0=0, tmp___1=1, q_write_ev=2, __retres1=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@13fbb81=0, p_dw_pc=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@327e78d2=0, tmp=0, q_free=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@18cfe7ff=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@32c7d5a5=0, __retres1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2c795700=0, p_dw_st=2, \result=0, tmp___0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6fb0e6b9=0, tmp=0, c_last_read=0, __retres1=0, p_num_write=1, q_buf_0=4, __retres1=0, \result=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 237]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L14] int q_buf_0 ; [L15] int q_free ; [L16] int q_read_ev ; [L17] int q_write_ev ; [L18] int p_num_write ; [L19] int p_last_write ; [L20] int p_dw_st ; [L21] int p_dw_pc ; [L22] int p_dw_i ; [L23] int c_num_read ; [L24] int c_last_read ; [L25] int c_dr_st ; [L26] int c_dr_pc ; [L27] int c_dr_i ; [L134] static int a_t ; [L350] int __retres1 ; [L336] q_free = 1 [L337] q_write_ev = 2 [L338] q_read_ev = q_write_ev [L339] p_num_write = 0 [L340] p_dw_pc = 0 [L341] p_dw_i = 1 [L342] c_num_read = 0 [L343] c_dr_pc = 0 [L344] c_dr_i = 1 [L304] int kernel_st ; [L305] int tmp ; [L309] kernel_st = 0 [L196] COND TRUE (int )p_dw_i == 1 [L197] p_dw_st = 0 [L201] COND TRUE (int )c_dr_i == 1 [L202] c_dr_st = 0 [L313] COND TRUE 1 [L316] kernel_st = 1 [L231] int tmp ; [L232] int tmp___0 ; [L233] int tmp___1 ; [L237] COND TRUE 1 [L211] int __retres1 ; [L214] COND TRUE (int )p_dw_st == 0 [L215] __retres1 = 1 [L227] return (__retres1); [L240] tmp___1 = exists_runnable_thread() [L242] COND TRUE \read(tmp___1) [L247] COND TRUE (int )p_dw_st == 0 [L249] tmp = __VERIFIER_nondet_int() [L251] COND TRUE \read(tmp) [L253] p_dw_st = 1 [L96] COND TRUE (int )p_dw_pc == 0 [L107] COND TRUE 1 [L109] COND FALSE !((int )q_free == 0) [L119] q_buf_0 = __VERIFIER_nondet_int() [L120] p_last_write = q_buf_0 [L121] p_num_write += 1 [L122] q_free = 0 [L123] q_write_ev = 1 [L67] int tmp ; [L68] int tmp___0 ; [L29] int __retres1 ; [L32] COND FALSE !((int )p_dw_pc == 1) [L42] __retres1 = 0 [L44] return (__retres1); [L72] tmp = is_do_write_p_triggered() [L74] COND FALSE !(\read(tmp)) [L48] int __retres1 ; [L51] COND FALSE !((int )c_dr_pc == 1) [L61] __retres1 = 0 [L63] return (__retres1); [L80] tmp___0 = is_do_read_c_triggered() [L82] COND FALSE !(\read(tmp___0)) [L125] q_write_ev = 2 [L107] COND TRUE 1 [L109] COND TRUE (int )q_free == 0 [L110] p_dw_st = 2 [L111] p_dw_pc = 1 Loop: [L262] COND TRUE (int )c_dr_st == 0 [L264] tmp___0 = __VERIFIER_nondet_int() [L266] COND FALSE !(\read(tmp___0)) [L237] COND TRUE 1 [L211] int __retres1 ; [L214] COND FALSE !((int )p_dw_st == 0) [L218] COND TRUE (int )c_dr_st == 0 [L219] __retres1 = 1 [L227] return (__retres1); [L240] tmp___1 = exists_runnable_thread() [L242] COND TRUE \read(tmp___1) [L247] COND FALSE !((int )p_dw_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...