./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loops/eureka_01-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/run_dir_7fb7c2f0-0b38-4f63-9fff-74ca34e2482b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7fb7c2f0-0b38-4f63-9fff-74ca34e2482b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7fb7c2f0-0b38-4f63-9fff-74ca34e2482b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7fb7c2f0-0b38-4f63-9fff-74ca34e2482b/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/eureka_01-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_7fb7c2f0-0b38-4f63-9fff-74ca34e2482b/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7fb7c2f0-0b38-4f63-9fff-74ca34e2482b/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 95fd85f45b093ce7164d10dc9660c11119aaa9b2 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_7fb7c2f0-0b38-4f63-9fff-74ca34e2482b/bin/uautomizer/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:49:34,644 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:49:34,646 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:49:34,660 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:49:34,661 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:49:34,662 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:49:34,664 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:49:34,674 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:49:34,678 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:49:34,681 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:49:34,682 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:49:34,682 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:49:34,683 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:49:34,683 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:49:34,684 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:49:34,685 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:49:34,685 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:49:34,686 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:49:34,688 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:49:34,689 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:49:34,690 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:49:34,691 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:49:34,695 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:49:34,696 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:49:34,700 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:49:34,701 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:49:34,701 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:49:34,703 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:49:34,703 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:49:34,705 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:49:34,705 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:49:34,706 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:49:34,706 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:49:34,707 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:49:34,710 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:49:34,710 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:49:34,711 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:49:34,711 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:49:34,711 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:49:34,714 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:49:34,715 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:49:34,716 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7fb7c2f0-0b38-4f63-9fff-74ca34e2482b/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 23:49:34,744 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:49:34,744 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:49:34,745 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:49:34,745 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:49:34,746 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:49:34,746 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:49:34,746 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:49:34,746 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:49:34,746 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:49:34,747 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:49:34,747 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:49:34,747 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:49:34,747 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:49:34,747 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:49:34,748 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:49:34,748 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:49:34,748 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:49:34,748 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:49:34,748 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:49:34,749 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:49:34,749 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:49:34,749 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:49:34,749 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:49:34,749 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:49:34,750 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:49:34,750 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:49:34,750 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:49:34,750 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:49:34,751 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:49:34,751 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:49:34,751 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:49:34,752 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:49:34,752 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/run_dir_7fb7c2f0-0b38-4f63-9fff-74ca34e2482b/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 -> 95fd85f45b093ce7164d10dc9660c11119aaa9b2 [2019-11-15 23:49:34,789 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:49:34,800 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:49:34,803 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:49:34,804 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:49:34,804 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:49:34,805 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7fb7c2f0-0b38-4f63-9fff-74ca34e2482b/bin/uautomizer/../../sv-benchmarks/c/loops/eureka_01-1.c [2019-11-15 23:49:34,856 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7fb7c2f0-0b38-4f63-9fff-74ca34e2482b/bin/uautomizer/data/b4a0ee179/aec4c1d8ba7440d0bda3802bc9b8969a/FLAG199061d0a [2019-11-15 23:49:35,231 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:49:35,232 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7fb7c2f0-0b38-4f63-9fff-74ca34e2482b/sv-benchmarks/c/loops/eureka_01-1.c [2019-11-15 23:49:35,241 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7fb7c2f0-0b38-4f63-9fff-74ca34e2482b/bin/uautomizer/data/b4a0ee179/aec4c1d8ba7440d0bda3802bc9b8969a/FLAG199061d0a [2019-11-15 23:49:35,624 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7fb7c2f0-0b38-4f63-9fff-74ca34e2482b/bin/uautomizer/data/b4a0ee179/aec4c1d8ba7440d0bda3802bc9b8969a [2019-11-15 23:49:35,627 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:49:35,628 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:49:35,629 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:49:35,629 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:49:35,632 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:49:35,633 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:49:35" (1/1) ... [2019-11-15 23:49:35,636 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@787041ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:35, skipping insertion in model container [2019-11-15 23:49:35,636 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:49:35" (1/1) ... [2019-11-15 23:49:35,643 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:49:35,666 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:49:35,887 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:49:35,891 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:49:35,928 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:49:35,947 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:49:35,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:35 WrapperNode [2019-11-15 23:49:35,948 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:49:35,949 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:49:35,949 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:49:35,949 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:49:35,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:35" (1/1) ... [2019-11-15 23:49:35,967 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:35" (1/1) ... [2019-11-15 23:49:36,000 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:49:36,000 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:49:36,001 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:49:36,001 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:49:36,010 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:35" (1/1) ... [2019-11-15 23:49:36,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:35" (1/1) ... [2019-11-15 23:49:36,014 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:35" (1/1) ... [2019-11-15 23:49:36,014 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:35" (1/1) ... [2019-11-15 23:49:36,024 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:35" (1/1) ... [2019-11-15 23:49:36,029 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:35" (1/1) ... [2019-11-15 23:49:36,031 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:35" (1/1) ... [2019-11-15 23:49:36,034 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:49:36,035 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:49:36,035 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:49:36,035 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:49:36,036 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7fb7c2f0-0b38-4f63-9fff-74ca34e2482b/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-11-15 23:49:36,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:49:36,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:49:36,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:49:36,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:49:36,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-15 23:49:36,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:49:36,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:49:36,547 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:49:36,547 INFO L284 CfgBuilder]: Removed 11 assume(true) statements. [2019-11-15 23:49:36,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:49:36 BoogieIcfgContainer [2019-11-15 23:49:36,548 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:49:36,549 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:49:36,549 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:49:36,555 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:49:36,555 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:49:36,556 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:49:35" (1/3) ... [2019-11-15 23:49:36,557 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d16950b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:49:36, skipping insertion in model container [2019-11-15 23:49:36,557 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:49:36,557 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:35" (2/3) ... [2019-11-15 23:49:36,558 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d16950b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:49:36, skipping insertion in model container [2019-11-15 23:49:36,558 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:49:36,558 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:49:36" (3/3) ... [2019-11-15 23:49:36,560 INFO L371 chiAutomizerObserver]: Analyzing ICFG eureka_01-1.c [2019-11-15 23:49:36,599 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:49:36,599 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:49:36,599 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:49:36,599 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:49:36,600 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:49:36,600 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:49:36,600 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:49:36,600 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:49:36,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2019-11-15 23:49:36,643 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2019-11-15 23:49:36,644 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:49:36,644 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:49:36,651 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 23:49:36,651 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:49:36,651 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:49:36,652 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2019-11-15 23:49:36,657 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2019-11-15 23:49:36,658 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:49:36,658 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:49:36,658 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 23:49:36,658 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:49:36,676 INFO L791 eck$LassoCheckResult]: Stem: 26#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; 7#L-1true havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~post3, main_#t~mem6, main_#t~mem7, main_#t~mem10, main_#t~mem8, main_#t~mem9, main_#t~post5, main_#t~post4, main_#t~mem12, main_#t~mem13, main_#t~mem16, main_#t~mem14, main_#t~mem15, main_#t~post11, main_#t~mem18, main_#t~post17, main_~nodecount~0, main_~edgecount~0, main_~source~0, main_~#Source~0.base, main_~#Source~0.offset, main_~#Dest~0.base, main_~#Dest~0.offset, main_~#Weight~0.base, main_~#Weight~0.offset, main_~#distance~0.base, main_~#distance~0.offset, main_~x~0, main_~y~0, main_~i~0, main_~j~0;main_~nodecount~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~edgecount~0 := main_#t~nondet2;havoc main_#t~nondet2; 19#L15true assume !!(0 <= main_~nodecount~0 && main_~nodecount~0 <= 4); 3#L16true assume !!(0 <= main_~edgecount~0 && main_~edgecount~0 <= 19);main_~source~0 := 0;call main_~#Source~0.base, main_~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, main_~#Source~0.base, main_~#Source~0.offset, 4);call write~init~int(4, main_~#Source~0.base, 4 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 8 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 12 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 16 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 20 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 24 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 28 + main_~#Source~0.offset, 4);call write~init~int(4, main_~#Source~0.base, 32 + main_~#Source~0.offset, 4);call write~init~int(4, main_~#Source~0.base, 36 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 40 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 44 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 48 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 52 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 56 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 60 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 64 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 68 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 72 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 76 + main_~#Source~0.offset, 4);call main_~#Dest~0.base, main_~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, main_~#Dest~0.base, main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 4 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 8 + main_~#Dest~0.offset, 4);call write~init~int(1, main_~#Dest~0.base, 12 + main_~#Dest~0.offset, 4);call write~init~int(1, main_~#Dest~0.base, 16 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 20 + main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 24 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 28 + main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 32 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 36 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 40 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 44 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 48 + main_~#Dest~0.offset, 4);call write~init~int(2, main_~#Dest~0.base, 52 + main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 56 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 60 + main_~#Dest~0.offset, 4);call write~init~int(2, main_~#Dest~0.base, 64 + main_~#Dest~0.offset, 4);call write~init~int(1, main_~#Dest~0.base, 68 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 72 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 76 + main_~#Dest~0.offset, 4);call main_~#Weight~0.base, main_~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, main_~#Weight~0.base, main_~#Weight~0.offset, 4);call write~init~int(1, main_~#Weight~0.base, 4 + main_~#Weight~0.offset, 4);call write~init~int(2, main_~#Weight~0.base, 8 + main_~#Weight~0.offset, 4);call write~init~int(3, main_~#Weight~0.base, 12 + main_~#Weight~0.offset, 4);call write~init~int(4, main_~#Weight~0.base, 16 + main_~#Weight~0.offset, 4);call write~init~int(5, main_~#Weight~0.base, 20 + main_~#Weight~0.offset, 4);call write~init~int(6, main_~#Weight~0.base, 24 + main_~#Weight~0.offset, 4);call write~init~int(7, main_~#Weight~0.base, 28 + main_~#Weight~0.offset, 4);call write~init~int(8, main_~#Weight~0.base, 32 + main_~#Weight~0.offset, 4);call write~init~int(9, main_~#Weight~0.base, 36 + main_~#Weight~0.offset, 4);call write~init~int(10, main_~#Weight~0.base, 40 + main_~#Weight~0.offset, 4);call write~init~int(11, main_~#Weight~0.base, 44 + main_~#Weight~0.offset, 4);call write~init~int(12, main_~#Weight~0.base, 48 + main_~#Weight~0.offset, 4);call write~init~int(13, main_~#Weight~0.base, 52 + main_~#Weight~0.offset, 4);call write~init~int(14, main_~#Weight~0.base, 56 + main_~#Weight~0.offset, 4);call write~init~int(15, main_~#Weight~0.base, 60 + main_~#Weight~0.offset, 4);call write~init~int(16, main_~#Weight~0.base, 64 + main_~#Weight~0.offset, 4);call write~init~int(17, main_~#Weight~0.base, 68 + main_~#Weight~0.offset, 4);call write~init~int(18, main_~#Weight~0.base, 72 + main_~#Weight~0.offset, 4);call write~init~int(19, main_~#Weight~0.base, 76 + main_~#Weight~0.offset, 4);call main_~#distance~0.base, main_~#distance~0.offset := #Ultimate.allocOnStack(20);havoc main_~x~0;havoc main_~y~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 12#L25-3true [2019-11-15 23:49:36,678 INFO L793 eck$LassoCheckResult]: Loop: 12#L25-3true assume !!(main_~i~0 < main_~nodecount~0); 20#L26true assume main_~i~0 == main_~source~0;call write~int(0, main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~i~0, 4); 16#L25-2true main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 12#L25-3true [2019-11-15 23:49:36,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:36,684 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2019-11-15 23:49:36,692 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:36,693 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848765065] [2019-11-15 23:49:36,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:36,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:36,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:49:36,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:49:37,012 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:49:37,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:37,013 INFO L82 PathProgramCache]: Analyzing trace with hash 49751, now seen corresponding path program 1 times [2019-11-15 23:49:37,014 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:37,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405189131] [2019-11-15 23:49:37,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:37,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:37,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:37,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:49:37,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:49:37,035 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:49:37,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:37,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1806910736, now seen corresponding path program 1 times [2019-11-15 23:49:37,037 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:37,037 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13987366] [2019-11-15 23:49:37,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:37,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:37,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:37,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:49:37,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:49:37,106 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:49:38,186 WARN L191 SmtUtils]: Spent 989.00 ms on a formula simplification that was a NOOP. DAG size: 289 [2019-11-15 23:49:39,111 WARN L191 SmtUtils]: Spent 910.00 ms on a formula simplification that was a NOOP. DAG size: 283 [2019-11-15 23:49:39,124 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:49:39,125 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:49:39,125 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:49:39,125 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:49:39,125 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:49:39,126 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:49:39,126 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:49:39,126 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:49:39,126 INFO L131 ssoRankerPreferences]: Filename of dumped script: eureka_01-1.c_Iteration1_Lasso [2019-11-15 23:49:39,126 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:49:39,127 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:49:39,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:49:39,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:49:39,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:49:39,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-11-15 23:49:39,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:49:39,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:49:39,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:49:39,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:49:39,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:49:39,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:49:39,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:49:39,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:49:39,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:49:39,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:49:39,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:49:39,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:49:39,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:49:39,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:49:39,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:49:39,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:49:39,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:49:39,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:49:39,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:49:51,828 WARN L191 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 329 DAG size of output: 201 [2019-11-15 23:49:53,067 WARN L191 SmtUtils]: Spent 987.00 ms on a formula simplification. DAG size of input: 339 DAG size of output: 212 [2019-11-15 23:49: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-11-15 23:49:53,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:49:53,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:49:53,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:49:54,535 WARN L191 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-15 23:49:54,655 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:49:54,659 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:49:54,661 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-11-15 23:49:54,663 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,663 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:49:54,663 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,664 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,664 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,665 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:49:54,666 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:49:54,667 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,668 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-11-15 23:49:54,669 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,669 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:49:54,669 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,669 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,669 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,670 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:49:54,670 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:49:54,671 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,671 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-11-15 23:49:54,672 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,672 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:49:54,672 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,672 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,673 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,673 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:49:54,673 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:49:54,674 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,674 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-11-15 23:49:54,675 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,675 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:49:54,676 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,676 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,676 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,676 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:49:54,677 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:49:54,677 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,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-11-15 23:49:54,678 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,679 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,679 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,679 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,682 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:49:54,682 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:49:54,684 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,685 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-11-15 23:49:54,686 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,686 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:49:54,686 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,686 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,686 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,687 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:49:54,687 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:49:54,688 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,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-11-15 23:49:54,689 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,689 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:49:54,689 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,690 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,690 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,690 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:49:54,690 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:49:54,691 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,692 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-11-15 23:49:54,692 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,693 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,693 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,693 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,695 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:49:54,695 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:49:54,699 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,700 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-11-15 23:49:54,701 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,701 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:49:54,701 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,701 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,701 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,702 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:49:54,702 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:49:54,703 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,703 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-11-15 23:49:54,704 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,704 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,704 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,705 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,706 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:49:54,707 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:49:54,709 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,710 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-11-15 23:49:54,710 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,710 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:49:54,711 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,711 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,711 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,711 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:49:54,712 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:49:54,713 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,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-11-15 23:49:54,714 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,714 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:49:54,714 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,714 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,714 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,715 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:49:54,715 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:49:54,716 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,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-11-15 23:49:54,717 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,717 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:49:54,717 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,717 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,718 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,718 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:49:54,718 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:49:54,719 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,720 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-11-15 23:49:54,720 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,720 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:49:54,721 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,721 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,721 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,722 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:49:54,722 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:49:54,722 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,723 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-11-15 23:49:54,724 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,724 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:49:54,724 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,724 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,724 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,725 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:49:54,725 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:49:54,726 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,726 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-11-15 23:49:54,727 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,727 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:49:54,727 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,727 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,728 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,728 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:49:54,728 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:49:54,729 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,729 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-11-15 23:49:54,730 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,730 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:49:54,730 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,731 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,731 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,731 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:49:54,731 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:49:54,732 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,732 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-11-15 23:49:54,733 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,733 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:49:54,734 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,734 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,734 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,734 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:49:54,735 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:49:54,735 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,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-11-15 23:49:54,736 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,737 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:49:54,737 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,737 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,737 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,738 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:49:54,738 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:49:54,739 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,739 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-11-15 23:49:54,740 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,740 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:49:54,740 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,740 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,740 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,741 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:49:54,741 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:49:54,742 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,742 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-11-15 23:49:54,743 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,743 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:49:54,743 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,743 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,744 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,744 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:49:54,744 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:49:54,745 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,745 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-11-15 23:49:54,746 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,746 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:49:54,746 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,747 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,747 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,747 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:49:54,747 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:49:54,748 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,749 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-11-15 23:49:54,749 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,749 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,750 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,750 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,751 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:49:54,752 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:49:54,757 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,758 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-11-15 23:49:54,759 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,759 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,759 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,759 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,761 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:49:54,761 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:49:54,765 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,766 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-11-15 23:49:54,767 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,767 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,767 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,767 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,769 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:49:54,769 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:49:54,774 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,774 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-11-15 23:49:54,775 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,775 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,775 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,775 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,777 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:49:54,777 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:49:54,782 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,782 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-11-15 23:49:54,783 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,783 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,784 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,784 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,785 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:49:54,785 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:49:54,790 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,790 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-11-15 23:49:54,791 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,791 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,791 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,791 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,793 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:49:54,793 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:49:54,797 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,798 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-11-15 23:49:54,799 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,799 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,799 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,799 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,801 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:49:54,801 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:49:54,805 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,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-11-15 23:49:54,806 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,807 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,807 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,807 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,808 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:49:54,808 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:49:54,811 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,812 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-11-15 23:49:54,812 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,812 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,813 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,813 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,814 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:49:54,814 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:49:54,817 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,817 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-11-15 23:49:54,818 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,818 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,818 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,819 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,820 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:49:54,820 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:49:54,823 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,823 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-11-15 23:49:54,824 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,824 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,824 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,824 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,826 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:49:54,826 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:49:54,828 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,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-11-15 23:49:54,829 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,830 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,830 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,830 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,831 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:49:54,831 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:49:54,834 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,834 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-11-15 23:49:54,835 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,835 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,835 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,836 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,837 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:49:54,837 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:49:54,839 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,840 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-11-15 23:49:54,841 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,841 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,841 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,841 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,842 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:49:54,843 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:49:54,846 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,847 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-11-15 23:49:54,848 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,848 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,848 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,848 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,849 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:49:54,850 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:49:54,853 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,854 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-11-15 23:49:54,854 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,855 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,855 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,855 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,856 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:49:54,856 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:49:54,858 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,859 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-11-15 23:49:54,859 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,860 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,860 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,860 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,861 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:49:54,861 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:49:54,865 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,865 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-11-15 23:49:54,866 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,866 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,866 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,867 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,868 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:49:54,868 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:49:54,872 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,872 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-11-15 23:49:54,873 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,873 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,873 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,874 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,875 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:49:54,875 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:49:54,879 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,880 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-11-15 23:49:54,880 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,881 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,881 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,881 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,882 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:49:54,882 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:49:54,886 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,886 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-11-15 23:49:54,887 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,887 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,887 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,888 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,889 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:49:54,889 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:49:54,892 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,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-11-15 23:49:54,893 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,893 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,894 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,894 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,895 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:49:54,895 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:49:54,898 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,899 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-11-15 23:49:54,899 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,900 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,900 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,900 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,901 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:49:54,901 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:49:54,905 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,905 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-11-15 23:49:54,906 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,906 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,906 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,906 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,907 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:49:54,908 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:49:54,911 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,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-11-15 23:49:54,921 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,921 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,921 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,922 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,922 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:49:54,923 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:49:54,926 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,926 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-11-15 23:49:54,927 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,927 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,927 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,927 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,928 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:49:54,928 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:49:54,931 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,932 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-11-15 23:49:54,932 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,932 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,933 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,933 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,934 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:49:54,934 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:49:54,936 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,936 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-11-15 23:49:54,944 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,944 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:49:54,945 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,945 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,945 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,945 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:49:54,946 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:49:54,946 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:54,947 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-11-15 23:49:54,947 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:54,948 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:54,948 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:54,948 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:54,950 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:49:54,950 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:49:55,006 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:49:55,072 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-15 23:49:55,073 INFO L444 ModelExtractionUtils]: 20 out of 28 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-11-15 23:49:55,075 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:49:55,076 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:49:55,077 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:49:55,077 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~nodecount~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~nodecount~0 Supporting invariants [] [2019-11-15 23:50:29,749 INFO L297 tatePredicateManager]: 1780 out of 1780 supporting invariants were superfluous and have been removed [2019-11-15 23:50:29,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:29,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:29,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:50:29,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:50:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:29,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:50:29,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:50:29,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:50:29,866 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 23:50:29,867 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states. Second operand 3 states. [2019-11-15 23:50:29,922 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states.. Second operand 3 states. Result 54 states and 83 transitions. Complement of second has 8 states. [2019-11-15 23:50:29,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 23:50:29,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:50:29,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2019-11-15 23:50:29,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 44 transitions. Stem has 4 letters. Loop has 3 letters. [2019-11-15 23:50:29,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:50:29,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 44 transitions. Stem has 7 letters. Loop has 3 letters. [2019-11-15 23:50:29,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:50:29,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 44 transitions. Stem has 4 letters. Loop has 6 letters. [2019-11-15 23:50:29,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:50:29,929 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 83 transitions. [2019-11-15 23:50:29,933 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-11-15 23:50:29,938 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 24 states and 35 transitions. [2019-11-15 23:50:29,939 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-15 23:50:29,939 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-11-15 23:50:29,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 35 transitions. [2019-11-15 23:50:29,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:50:29,940 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2019-11-15 23:50:29,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 35 transitions. [2019-11-15 23:50:29,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-11-15 23:50:29,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-15 23:50:29,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2019-11-15 23:50:29,964 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2019-11-15 23:50:29,964 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2019-11-15 23:50:29,964 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:50:29,964 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 35 transitions. [2019-11-15 23:50:29,965 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-11-15 23:50:29,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:50:29,965 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:50:29,966 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 23:50:29,966 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:50:29,966 INFO L791 eck$LassoCheckResult]: Stem: 7270#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; 7266#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~post3, main_#t~mem6, main_#t~mem7, main_#t~mem10, main_#t~mem8, main_#t~mem9, main_#t~post5, main_#t~post4, main_#t~mem12, main_#t~mem13, main_#t~mem16, main_#t~mem14, main_#t~mem15, main_#t~post11, main_#t~mem18, main_#t~post17, main_~nodecount~0, main_~edgecount~0, main_~source~0, main_~#Source~0.base, main_~#Source~0.offset, main_~#Dest~0.base, main_~#Dest~0.offset, main_~#Weight~0.base, main_~#Weight~0.offset, main_~#distance~0.base, main_~#distance~0.offset, main_~x~0, main_~y~0, main_~i~0, main_~j~0;main_~nodecount~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~edgecount~0 := main_#t~nondet2;havoc main_#t~nondet2; 7250#L15 assume !!(0 <= main_~nodecount~0 && main_~nodecount~0 <= 4); 7251#L16 assume !!(0 <= main_~edgecount~0 && main_~edgecount~0 <= 19);main_~source~0 := 0;call main_~#Source~0.base, main_~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, main_~#Source~0.base, main_~#Source~0.offset, 4);call write~init~int(4, main_~#Source~0.base, 4 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 8 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 12 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 16 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 20 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 24 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 28 + main_~#Source~0.offset, 4);call write~init~int(4, main_~#Source~0.base, 32 + main_~#Source~0.offset, 4);call write~init~int(4, main_~#Source~0.base, 36 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 40 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 44 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 48 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 52 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 56 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 60 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 64 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 68 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 72 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 76 + main_~#Source~0.offset, 4);call main_~#Dest~0.base, main_~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, main_~#Dest~0.base, main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 4 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 8 + main_~#Dest~0.offset, 4);call write~init~int(1, main_~#Dest~0.base, 12 + main_~#Dest~0.offset, 4);call write~init~int(1, main_~#Dest~0.base, 16 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 20 + main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 24 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 28 + main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 32 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 36 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 40 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 44 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 48 + main_~#Dest~0.offset, 4);call write~init~int(2, main_~#Dest~0.base, 52 + main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 56 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 60 + main_~#Dest~0.offset, 4);call write~init~int(2, main_~#Dest~0.base, 64 + main_~#Dest~0.offset, 4);call write~init~int(1, main_~#Dest~0.base, 68 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 72 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 76 + main_~#Dest~0.offset, 4);call main_~#Weight~0.base, main_~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, main_~#Weight~0.base, main_~#Weight~0.offset, 4);call write~init~int(1, main_~#Weight~0.base, 4 + main_~#Weight~0.offset, 4);call write~init~int(2, main_~#Weight~0.base, 8 + main_~#Weight~0.offset, 4);call write~init~int(3, main_~#Weight~0.base, 12 + main_~#Weight~0.offset, 4);call write~init~int(4, main_~#Weight~0.base, 16 + main_~#Weight~0.offset, 4);call write~init~int(5, main_~#Weight~0.base, 20 + main_~#Weight~0.offset, 4);call write~init~int(6, main_~#Weight~0.base, 24 + main_~#Weight~0.offset, 4);call write~init~int(7, main_~#Weight~0.base, 28 + main_~#Weight~0.offset, 4);call write~init~int(8, main_~#Weight~0.base, 32 + main_~#Weight~0.offset, 4);call write~init~int(9, main_~#Weight~0.base, 36 + main_~#Weight~0.offset, 4);call write~init~int(10, main_~#Weight~0.base, 40 + main_~#Weight~0.offset, 4);call write~init~int(11, main_~#Weight~0.base, 44 + main_~#Weight~0.offset, 4);call write~init~int(12, main_~#Weight~0.base, 48 + main_~#Weight~0.offset, 4);call write~init~int(13, main_~#Weight~0.base, 52 + main_~#Weight~0.offset, 4);call write~init~int(14, main_~#Weight~0.base, 56 + main_~#Weight~0.offset, 4);call write~init~int(15, main_~#Weight~0.base, 60 + main_~#Weight~0.offset, 4);call write~init~int(16, main_~#Weight~0.base, 64 + main_~#Weight~0.offset, 4);call write~init~int(17, main_~#Weight~0.base, 68 + main_~#Weight~0.offset, 4);call write~init~int(18, main_~#Weight~0.base, 72 + main_~#Weight~0.offset, 4);call write~init~int(19, main_~#Weight~0.base, 76 + main_~#Weight~0.offset, 4);call main_~#distance~0.base, main_~#distance~0.offset := #Ultimate.allocOnStack(20);havoc main_~x~0;havoc main_~y~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 7254#L25-3 assume !(main_~i~0 < main_~nodecount~0); 7269#L25-4 main_~i~0 := 0; 7264#L34-3 [2019-11-15 23:50:29,967 INFO L793 eck$LassoCheckResult]: Loop: 7264#L34-3 assume !!(main_~i~0 < main_~nodecount~0);main_~j~0 := 0; 7265#L36-3 assume !true; 7271#L34-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 7264#L34-3 [2019-11-15 23:50:29,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:29,967 INFO L82 PathProgramCache]: Analyzing trace with hash 889571381, now seen corresponding path program 1 times [2019-11-15 23:50:29,967 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:29,967 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452043513] [2019-11-15 23:50:29,968 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:29,968 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:29,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:29,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:50:30,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:50:30,015 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:50:30,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:30,016 INFO L82 PathProgramCache]: Analyzing trace with hash 69064, now seen corresponding path program 1 times [2019-11-15 23:50:30,016 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:30,016 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141149931] [2019-11-15 23:50:30,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:30,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:30,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:30,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:30,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:50:30,036 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141149931] [2019-11-15 23:50:30,037 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:50:30,037 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:50:30,037 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052377726] [2019-11-15 23:50:30,039 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:50:30,040 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:50:30,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 23:50:30,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 23:50:30,044 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. cyclomatic complexity: 15 Second operand 2 states. [2019-11-15 23:50:30,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:50:30,049 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2019-11-15 23:50:30,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 23:50:30,050 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2019-11-15 23:50:30,051 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-11-15 23:50:30,052 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 23 states and 30 transitions. [2019-11-15 23:50:30,053 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-15 23:50:30,053 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-15 23:50:30,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2019-11-15 23:50:30,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:50:30,054 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-11-15 23:50:30,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2019-11-15 23:50:30,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-15 23:50:30,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-15 23:50:30,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2019-11-15 23:50:30,056 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-11-15 23:50:30,057 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-11-15 23:50:30,057 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 23:50:30,057 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2019-11-15 23:50:30,058 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-11-15 23:50:30,058 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:50:30,058 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:50:30,059 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 23:50:30,059 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:50:30,059 INFO L791 eck$LassoCheckResult]: Stem: 7322#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; 7316#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~post3, main_#t~mem6, main_#t~mem7, main_#t~mem10, main_#t~mem8, main_#t~mem9, main_#t~post5, main_#t~post4, main_#t~mem12, main_#t~mem13, main_#t~mem16, main_#t~mem14, main_#t~mem15, main_#t~post11, main_#t~mem18, main_#t~post17, main_~nodecount~0, main_~edgecount~0, main_~source~0, main_~#Source~0.base, main_~#Source~0.offset, main_~#Dest~0.base, main_~#Dest~0.offset, main_~#Weight~0.base, main_~#Weight~0.offset, main_~#distance~0.base, main_~#distance~0.offset, main_~x~0, main_~y~0, main_~i~0, main_~j~0;main_~nodecount~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~edgecount~0 := main_#t~nondet2;havoc main_#t~nondet2; 7303#L15 assume !!(0 <= main_~nodecount~0 && main_~nodecount~0 <= 4); 7304#L16 assume !!(0 <= main_~edgecount~0 && main_~edgecount~0 <= 19);main_~source~0 := 0;call main_~#Source~0.base, main_~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, main_~#Source~0.base, main_~#Source~0.offset, 4);call write~init~int(4, main_~#Source~0.base, 4 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 8 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 12 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 16 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 20 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 24 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 28 + main_~#Source~0.offset, 4);call write~init~int(4, main_~#Source~0.base, 32 + main_~#Source~0.offset, 4);call write~init~int(4, main_~#Source~0.base, 36 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 40 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 44 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 48 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 52 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 56 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 60 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 64 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 68 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 72 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 76 + main_~#Source~0.offset, 4);call main_~#Dest~0.base, main_~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, main_~#Dest~0.base, main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 4 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 8 + main_~#Dest~0.offset, 4);call write~init~int(1, main_~#Dest~0.base, 12 + main_~#Dest~0.offset, 4);call write~init~int(1, main_~#Dest~0.base, 16 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 20 + main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 24 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 28 + main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 32 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 36 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 40 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 44 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 48 + main_~#Dest~0.offset, 4);call write~init~int(2, main_~#Dest~0.base, 52 + main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 56 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 60 + main_~#Dest~0.offset, 4);call write~init~int(2, main_~#Dest~0.base, 64 + main_~#Dest~0.offset, 4);call write~init~int(1, main_~#Dest~0.base, 68 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 72 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 76 + main_~#Dest~0.offset, 4);call main_~#Weight~0.base, main_~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, main_~#Weight~0.base, main_~#Weight~0.offset, 4);call write~init~int(1, main_~#Weight~0.base, 4 + main_~#Weight~0.offset, 4);call write~init~int(2, main_~#Weight~0.base, 8 + main_~#Weight~0.offset, 4);call write~init~int(3, main_~#Weight~0.base, 12 + main_~#Weight~0.offset, 4);call write~init~int(4, main_~#Weight~0.base, 16 + main_~#Weight~0.offset, 4);call write~init~int(5, main_~#Weight~0.base, 20 + main_~#Weight~0.offset, 4);call write~init~int(6, main_~#Weight~0.base, 24 + main_~#Weight~0.offset, 4);call write~init~int(7, main_~#Weight~0.base, 28 + main_~#Weight~0.offset, 4);call write~init~int(8, main_~#Weight~0.base, 32 + main_~#Weight~0.offset, 4);call write~init~int(9, main_~#Weight~0.base, 36 + main_~#Weight~0.offset, 4);call write~init~int(10, main_~#Weight~0.base, 40 + main_~#Weight~0.offset, 4);call write~init~int(11, main_~#Weight~0.base, 44 + main_~#Weight~0.offset, 4);call write~init~int(12, main_~#Weight~0.base, 48 + main_~#Weight~0.offset, 4);call write~init~int(13, main_~#Weight~0.base, 52 + main_~#Weight~0.offset, 4);call write~init~int(14, main_~#Weight~0.base, 56 + main_~#Weight~0.offset, 4);call write~init~int(15, main_~#Weight~0.base, 60 + main_~#Weight~0.offset, 4);call write~init~int(16, main_~#Weight~0.base, 64 + main_~#Weight~0.offset, 4);call write~init~int(17, main_~#Weight~0.base, 68 + main_~#Weight~0.offset, 4);call write~init~int(18, main_~#Weight~0.base, 72 + main_~#Weight~0.offset, 4);call write~init~int(19, main_~#Weight~0.base, 76 + main_~#Weight~0.offset, 4);call main_~#distance~0.base, main_~#distance~0.offset := #Ultimate.allocOnStack(20);havoc main_~x~0;havoc main_~y~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 7307#L25-3 assume !(main_~i~0 < main_~nodecount~0); 7321#L25-4 main_~i~0 := 0; 7317#L34-3 [2019-11-15 23:50:30,059 INFO L793 eck$LassoCheckResult]: Loop: 7317#L34-3 assume !!(main_~i~0 < main_~nodecount~0);main_~j~0 := 0; 7318#L36-3 assume !(main_~j~0 < main_~edgecount~0); 7323#L34-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 7317#L34-3 [2019-11-15 23:50:30,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:30,060 INFO L82 PathProgramCache]: Analyzing trace with hash 889571381, now seen corresponding path program 2 times [2019-11-15 23:50:30,060 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:30,060 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882862491] [2019-11-15 23:50:30,060 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:30,060 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:30,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:30,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:50:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:50:30,099 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:50:30,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:30,100 INFO L82 PathProgramCache]: Analyzing trace with hash 68723, now seen corresponding path program 1 times [2019-11-15 23:50:30,100 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:30,100 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176387496] [2019-11-15 23:50:30,100 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:30,100 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:30,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:30,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:50:30,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:50:30,105 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:50:30,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:30,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1272833983, now seen corresponding path program 1 times [2019-11-15 23:50:30,106 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:30,106 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759229843] [2019-11-15 23:50:30,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:30,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:30,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:30,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:30,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:50:30,167 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759229843] [2019-11-15 23:50:30,167 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:50:30,167 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:50:30,167 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373228495] [2019-11-15 23:50:30,184 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:50:30,184 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:50:30,184 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:50:30,184 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:50:30,184 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:50:30,185 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:50:30,185 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:50:30,185 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:50:30,185 INFO L131 ssoRankerPreferences]: Filename of dumped script: eureka_01-1.c_Iteration3_Loop [2019-11-15 23:50:30,185 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:50:30,185 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:50:30,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:30,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:30,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:30,237 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:50:30,238 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7fb7c2f0-0b38-4f63-9fff-74ca34e2482b/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-11-15 23:50:30,245 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:50:30,245 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-11-15 23:50:30,253 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:50:30,253 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~edgecount~0=0} Honda state: {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~edgecount~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7fb7c2f0-0b38-4f63-9fff-74ca34e2482b/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-11-15 23:50:30,273 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:50:30,273 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-11-15 23:50:30,278 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:50:30,278 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post4=0} Honda state: {ULTIMATE.start_main_#t~post4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7fb7c2f0-0b38-4f63-9fff-74ca34e2482b/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-11-15 23:50:30,289 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:50:30,289 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7fb7c2f0-0b38-4f63-9fff-74ca34e2482b/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-11-15 23:50:30,305 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:50:30,305 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:50:30,548 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:50:30,550 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:50:30,550 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:50:30,551 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:50:30,551 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:50:30,551 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:50:30,551 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:50:30,551 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:50:30,551 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:50:30,551 INFO L131 ssoRankerPreferences]: Filename of dumped script: eureka_01-1.c_Iteration3_Loop [2019-11-15 23:50:30,551 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:50:30,551 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:50:30,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:30,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:30,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:30,660 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:50:30,660 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:50:30,660 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-11-15 23:50:30,661 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:30,661 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:30,661 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:30,661 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:30,661 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:30,661 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:50:30,662 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:30,662 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:30,662 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-11-15 23:50:30,662 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:30,663 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:30,663 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:30,663 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:30,663 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:30,663 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:50:30,663 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:30,664 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:30,664 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-11-15 23:50:30,664 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:30,664 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:30,664 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:30,665 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:30,665 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:30,665 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:50:30,665 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:30,666 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:50:30,670 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 23:50:30,671 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:50:30,671 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:50:30,671 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:50:30,672 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:50:30,672 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~nodecount~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~nodecount~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-11-15 23:50:30,672 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:50:30,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:30,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:50:30,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:50:30,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:30,746 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:50:30,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:50:30,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:50:30,758 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 23:50:30,758 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 30 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-15 23:50:30,781 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 30 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 30 states and 43 transitions. Complement of second has 7 states. [2019-11-15 23:50:30,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 23:50:30,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:50:30,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-11-15 23:50:30,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 6 letters. Loop has 3 letters. [2019-11-15 23:50:30,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:50:30,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 3 letters. [2019-11-15 23:50:30,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:50:30,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 6 letters. Loop has 6 letters. [2019-11-15 23:50:30,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:50:30,785 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 43 transitions. [2019-11-15 23:50:30,786 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-15 23:50:30,787 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 28 states and 39 transitions. [2019-11-15 23:50:30,787 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-15 23:50:30,787 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-15 23:50:30,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 39 transitions. [2019-11-15 23:50:30,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:50:30,788 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2019-11-15 23:50:30,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 39 transitions. [2019-11-15 23:50:30,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-11-15 23:50:30,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-15 23:50:30,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 38 transitions. [2019-11-15 23:50:30,794 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 38 transitions. [2019-11-15 23:50:30,794 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:50:30,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:50:30,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:50:30,795 INFO L87 Difference]: Start difference. First operand 27 states and 38 transitions. Second operand 5 states. [2019-11-15 23:50:30,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:50:30,908 INFO L93 Difference]: Finished difference Result 56 states and 73 transitions. [2019-11-15 23:50:30,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:50:30,909 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 73 transitions. [2019-11-15 23:50:30,913 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2019-11-15 23:50:30,914 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 53 states and 69 transitions. [2019-11-15 23:50:30,915 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2019-11-15 23:50:30,915 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2019-11-15 23:50:30,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 69 transitions. [2019-11-15 23:50:30,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:50:30,915 INFO L688 BuchiCegarLoop]: Abstraction has 53 states and 69 transitions. [2019-11-15 23:50:30,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 69 transitions. [2019-11-15 23:50:30,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 33. [2019-11-15 23:50:30,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-15 23:50:30,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2019-11-15 23:50:30,919 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2019-11-15 23:50:30,919 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2019-11-15 23:50:30,919 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 23:50:30,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 44 transitions. [2019-11-15 23:50:30,920 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2019-11-15 23:50:30,920 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:50:30,920 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:50:30,921 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:50:30,921 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:50:30,921 INFO L791 eck$LassoCheckResult]: Stem: 7517#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; 7508#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~post3, main_#t~mem6, main_#t~mem7, main_#t~mem10, main_#t~mem8, main_#t~mem9, main_#t~post5, main_#t~post4, main_#t~mem12, main_#t~mem13, main_#t~mem16, main_#t~mem14, main_#t~mem15, main_#t~post11, main_#t~mem18, main_#t~post17, main_~nodecount~0, main_~edgecount~0, main_~source~0, main_~#Source~0.base, main_~#Source~0.offset, main_~#Dest~0.base, main_~#Dest~0.offset, main_~#Weight~0.base, main_~#Weight~0.offset, main_~#distance~0.base, main_~#distance~0.offset, main_~x~0, main_~y~0, main_~i~0, main_~j~0;main_~nodecount~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~edgecount~0 := main_#t~nondet2;havoc main_#t~nondet2; 7493#L15 assume !!(0 <= main_~nodecount~0 && main_~nodecount~0 <= 4); 7494#L16 assume !!(0 <= main_~edgecount~0 && main_~edgecount~0 <= 19);main_~source~0 := 0;call main_~#Source~0.base, main_~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, main_~#Source~0.base, main_~#Source~0.offset, 4);call write~init~int(4, main_~#Source~0.base, 4 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 8 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 12 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 16 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 20 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 24 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 28 + main_~#Source~0.offset, 4);call write~init~int(4, main_~#Source~0.base, 32 + main_~#Source~0.offset, 4);call write~init~int(4, main_~#Source~0.base, 36 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 40 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 44 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 48 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 52 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 56 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 60 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 64 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 68 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 72 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 76 + main_~#Source~0.offset, 4);call main_~#Dest~0.base, main_~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, main_~#Dest~0.base, main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 4 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 8 + main_~#Dest~0.offset, 4);call write~init~int(1, main_~#Dest~0.base, 12 + main_~#Dest~0.offset, 4);call write~init~int(1, main_~#Dest~0.base, 16 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 20 + main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 24 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 28 + main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 32 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 36 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 40 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 44 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 48 + main_~#Dest~0.offset, 4);call write~init~int(2, main_~#Dest~0.base, 52 + main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 56 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 60 + main_~#Dest~0.offset, 4);call write~init~int(2, main_~#Dest~0.base, 64 + main_~#Dest~0.offset, 4);call write~init~int(1, main_~#Dest~0.base, 68 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 72 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 76 + main_~#Dest~0.offset, 4);call main_~#Weight~0.base, main_~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, main_~#Weight~0.base, main_~#Weight~0.offset, 4);call write~init~int(1, main_~#Weight~0.base, 4 + main_~#Weight~0.offset, 4);call write~init~int(2, main_~#Weight~0.base, 8 + main_~#Weight~0.offset, 4);call write~init~int(3, main_~#Weight~0.base, 12 + main_~#Weight~0.offset, 4);call write~init~int(4, main_~#Weight~0.base, 16 + main_~#Weight~0.offset, 4);call write~init~int(5, main_~#Weight~0.base, 20 + main_~#Weight~0.offset, 4);call write~init~int(6, main_~#Weight~0.base, 24 + main_~#Weight~0.offset, 4);call write~init~int(7, main_~#Weight~0.base, 28 + main_~#Weight~0.offset, 4);call write~init~int(8, main_~#Weight~0.base, 32 + main_~#Weight~0.offset, 4);call write~init~int(9, main_~#Weight~0.base, 36 + main_~#Weight~0.offset, 4);call write~init~int(10, main_~#Weight~0.base, 40 + main_~#Weight~0.offset, 4);call write~init~int(11, main_~#Weight~0.base, 44 + main_~#Weight~0.offset, 4);call write~init~int(12, main_~#Weight~0.base, 48 + main_~#Weight~0.offset, 4);call write~init~int(13, main_~#Weight~0.base, 52 + main_~#Weight~0.offset, 4);call write~init~int(14, main_~#Weight~0.base, 56 + main_~#Weight~0.offset, 4);call write~init~int(15, main_~#Weight~0.base, 60 + main_~#Weight~0.offset, 4);call write~init~int(16, main_~#Weight~0.base, 64 + main_~#Weight~0.offset, 4);call write~init~int(17, main_~#Weight~0.base, 68 + main_~#Weight~0.offset, 4);call write~init~int(18, main_~#Weight~0.base, 72 + main_~#Weight~0.offset, 4);call write~init~int(19, main_~#Weight~0.base, 76 + main_~#Weight~0.offset, 4);call main_~#distance~0.base, main_~#distance~0.offset := #Ultimate.allocOnStack(20);havoc main_~x~0;havoc main_~y~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 7497#L25-3 assume !(main_~i~0 < main_~nodecount~0); 7516#L25-4 main_~i~0 := 0; 7509#L34-3 assume !(main_~i~0 < main_~nodecount~0); 7506#L34-4 main_~i~0 := 0; 7507#L46-3 [2019-11-15 23:50:30,921 INFO L793 eck$LassoCheckResult]: Loop: 7507#L46-3 assume !!(main_~i~0 < main_~edgecount~0);call main_#t~mem12 := read~int(main_~#Dest~0.base, main_~#Dest~0.offset + 4 * main_~i~0, 4);main_~x~0 := main_#t~mem12;havoc main_#t~mem12;call main_#t~mem13 := read~int(main_~#Source~0.base, main_~#Source~0.offset + 4 * main_~i~0, 4);main_~y~0 := main_#t~mem13;havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~x~0, 4);call main_#t~mem14 := read~int(main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~y~0, 4);call main_#t~mem15 := read~int(main_~#Weight~0.base, main_~#Weight~0.offset + 4 * main_~i~0, 4); 7500#L50 assume !(main_#t~mem16 > main_#t~mem14 + main_#t~mem15);havoc main_#t~mem15;havoc main_#t~mem14;havoc main_#t~mem16; 7501#L46-2 main_#t~post11 := main_~i~0;main_~i~0 := 1 + main_#t~post11;havoc main_#t~post11; 7507#L46-3 [2019-11-15 23:50:30,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:30,922 INFO L82 PathProgramCache]: Analyzing trace with hash 179606446, now seen corresponding path program 1 times [2019-11-15 23:50:30,922 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:30,922 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87827439] [2019-11-15 23:50:30,922 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:30,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:30,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:30,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:50:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:50:30,958 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:50:30,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:30,959 INFO L82 PathProgramCache]: Analyzing trace with hash 99463, now seen corresponding path program 1 times [2019-11-15 23:50:30,959 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:30,959 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776280441] [2019-11-15 23:50:30,960 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:30,960 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:30,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:30,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:50:30,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:50:30,969 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:50:30,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:30,970 INFO L82 PathProgramCache]: Analyzing trace with hash -873548358, now seen corresponding path program 1 times [2019-11-15 23:50:30,970 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:30,971 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832977836] [2019-11-15 23:50:30,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:30,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:30,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:30,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:50:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:50:31,023 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:50:32,692 WARN L191 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 297 DAG size of output: 294 [2019-11-15 23:50:33,195 WARN L191 SmtUtils]: Spent 500.00 ms on a formula simplification that was a NOOP. DAG size: 283 [2019-11-15 23:50:33,198 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:50:33,199 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:50:33,199 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:50:33,199 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:50:33,199 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:50:33,199 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:50:33,199 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:50:33,199 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:50:33,199 INFO L131 ssoRankerPreferences]: Filename of dumped script: eureka_01-1.c_Iteration4_Lasso [2019-11-15 23:50:33,199 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:50:33,199 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:50:33,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:33,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:33,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:33,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:33,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:33,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:33,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:33,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:33,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:33,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:33,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:33,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:33,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:33,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:33,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:33,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:33,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:33,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:33,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:33,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:33,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:46,934 WARN L191 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 344 DAG size of output: 205 [2019-11-15 23:50:47,904 WARN L191 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 64 [2019-11-15 23:50:47,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:47,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-11-15 23:50:47,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:47,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:47,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:50:48,940 WARN L191 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-15 23:50:48,965 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:50:48,965 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:50:48,966 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-11-15 23:50:48,967 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:48,967 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:48,967 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:48,967 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:48,967 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:48,968 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:50:48,968 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:48,969 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:48,969 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-11-15 23:50:48,970 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:48,970 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:48,970 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:48,970 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:48,970 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:48,970 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:50:48,971 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:48,971 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:48,972 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-11-15 23:50:48,972 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:48,972 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:48,972 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:48,973 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:48,973 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:50:48,973 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:50:48,975 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:48,975 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-11-15 23:50:48,976 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:48,976 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:48,976 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:48,976 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:48,976 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:48,977 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:50:48,977 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:48,977 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:48,977 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-11-15 23:50:48,978 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:48,978 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:48,978 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:48,978 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:48,979 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:48,979 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:50:48,979 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:48,980 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:48,980 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-11-15 23:50:48,980 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:48,981 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:48,981 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:48,981 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:48,982 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:50:48,982 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:50:48,983 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:48,983 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-11-15 23:50:48,984 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:48,984 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:48,984 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:48,984 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:48,985 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:50:48,985 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:50:48,986 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:48,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-11-15 23:50:48,987 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:48,987 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:48,987 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:48,987 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:48,988 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:48,988 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:50:48,988 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:48,988 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:48,989 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-11-15 23:50:48,989 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:48,989 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:48,990 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:48,990 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:48,990 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:48,990 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:50:48,990 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:48,991 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:48,991 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-11-15 23:50:48,992 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:48,992 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:48,992 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:48,992 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:48,992 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:48,993 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:50:48,993 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:48,993 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:48,993 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-11-15 23:50:48,994 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:48,994 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:48,994 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:48,994 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:48,995 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:48,995 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:50:48,995 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:48,995 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:48,996 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-11-15 23:50:48,996 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:48,996 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:48,997 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:48,997 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:48,997 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:48,997 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:50:48,998 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:48,998 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:48,998 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-11-15 23:50:48,999 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:48,999 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:48,999 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:48,999 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:49,000 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:49,000 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:50:49,000 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:49,000 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:49,001 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-11-15 23:50:49,001 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:49,002 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:49,002 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:49,002 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:49,002 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:49,002 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:50:49,002 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:49,003 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:49,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-11-15 23:50:49,004 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:49,004 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:49,004 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:49,004 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:49,005 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:50:49,005 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:50:49,006 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:49,006 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-11-15 23:50:49,007 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:49,007 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:49,007 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:49,007 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:49,007 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:49,008 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:50:49,008 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:49,008 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:49,009 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-11-15 23:50:49,009 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:49,009 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:49,009 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:49,010 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:49,010 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:49,010 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:50:49,010 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:49,011 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:49,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-11-15 23:50:49,011 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:49,012 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:49,012 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:49,012 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:49,012 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:49,012 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:50:49,012 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:49,013 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:49,013 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-11-15 23:50:49,014 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:49,014 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:49,014 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:49,014 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:49,014 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:49,015 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:50:49,015 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:49,015 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:49,016 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-11-15 23:50:49,016 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:49,016 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:50:49,016 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:49,017 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:49,017 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:49,017 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:50:49,017 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:50:49,018 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:49,018 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-11-15 23:50:49,018 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:49,019 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:49,019 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:49,019 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:49,020 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:50:49,020 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:50:49,021 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:49,022 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-11-15 23:50:49,022 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:49,022 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:49,022 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:49,023 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:49,023 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:50:49,023 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:50:49,025 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:49,025 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-11-15 23:50:49,026 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:49,026 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:49,026 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:49,026 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:49,027 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:50:49,027 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:50:49,029 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:49,029 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-11-15 23:50:49,029 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:49,030 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:49,030 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:49,030 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:49,030 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:50:49,031 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:50:49,032 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:49,032 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-11-15 23:50:49,033 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:49,033 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:49,033 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:49,033 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:49,034 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:50:49,034 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:50:49,036 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:49,037 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-11-15 23:50:49,037 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:49,037 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:49,038 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:49,038 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:49,038 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:50:49,038 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:50:49,040 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:49,040 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-11-15 23:50:49,041 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:49,041 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:49,041 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:49,041 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:49,042 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:50:49,042 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:50:49,044 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:49,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-11-15 23:50:49,045 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:49,045 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:49,046 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:49,046 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:49,046 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:50:49,046 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:50:49,047 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:49,048 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-11-15 23:50:49,048 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:49,048 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:49,049 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:49,049 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:49,049 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:50:49,050 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:50:49,051 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:49,051 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-11-15 23:50:49,051 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:49,052 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:49,052 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:49,052 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:49,053 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:50:49,053 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:50:49,054 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:49,055 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-11-15 23:50:49,055 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:49,055 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:49,055 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:49,056 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:49,056 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:50:49,056 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:50:49,058 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:49,058 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-11-15 23:50:49,059 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:49,059 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:49,059 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:49,059 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:49,059 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:50:49,060 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:50:49,061 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:49,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-11-15 23:50:49,061 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:49,062 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:49,062 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:49,062 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:49,062 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:50:49,063 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:50:49,064 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:49,065 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-11-15 23:50:49,065 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:49,065 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:49,065 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:49,066 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:49,066 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:50:49,067 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:50:49,068 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:49,069 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-11-15 23:50:49,069 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:49,069 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:49,069 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:49,070 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:49,070 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:50:49,070 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:50:49,071 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:49,072 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-11-15 23:50:49,072 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:49,072 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:49,072 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:49,073 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:49,073 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:50:49,073 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:50:49,075 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:49,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-11-15 23:50:49,076 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:49,076 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:49,076 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:49,076 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:49,077 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:50:49,077 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:50:49,078 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:49,079 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-11-15 23:50:49,079 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:49,080 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:49,080 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:49,080 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:49,080 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:50:49,081 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:50:49,082 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:49,082 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-11-15 23:50:49,083 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:49,083 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:49,083 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:49,083 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:49,084 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:50:49,084 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:50:49,085 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:49,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-11-15 23:50:49,086 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:49,086 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:49,087 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:49,087 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:49,087 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:50:49,087 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:50:49,089 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:49,089 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-11-15 23:50:49,090 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:49,090 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:49,090 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:49,090 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:49,091 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:50:49,091 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:50:49,093 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:49,094 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-11-15 23:50:49,094 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:49,094 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:49,095 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:49,095 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:49,095 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:50:49,095 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:50:49,097 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:49,097 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-11-15 23:50:49,098 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:49,098 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:49,098 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:49,098 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:49,099 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:50:49,099 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:50:49,101 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:49,102 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-11-15 23:50:49,102 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:49,102 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:49,103 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:49,103 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:49,103 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:50:49,103 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:50:49,105 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:49,105 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-11-15 23:50:49,106 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:49,106 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:49,106 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:49,106 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:49,107 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:50:49,107 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:50:49,109 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:49,109 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-11-15 23:50:49,110 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:49,110 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:49,110 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:49,110 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:49,111 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:50:49,111 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:50:49,112 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:49,112 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-11-15 23:50:49,113 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:49,113 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:49,113 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:49,113 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:49,114 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:50:49,114 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:50:49,115 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:49,116 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-11-15 23:50:49,116 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:49,117 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:49,117 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:49,117 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:49,117 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:50:49,118 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:50:49,119 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:49,119 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-11-15 23:50:49,120 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:49,120 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:49,120 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:49,120 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:49,121 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:50:49,121 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:50:49,122 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:49,123 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-11-15 23:50:49,123 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:49,123 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:49,123 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:49,124 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:49,124 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:50:49,124 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:50:49,126 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:49,126 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-11-15 23:50:49,127 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:49,127 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:49,127 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:49,127 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:49,128 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:50:49,128 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:50:49,133 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:49,134 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-11-15 23:50:49,135 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:49,135 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:49,136 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:49,136 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:49,137 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:50:49,137 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:50:49,158 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:49,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-11-15 23:50:49,159 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:49,159 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:49,159 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:49,159 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:49,160 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:50:49,160 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:50:49,161 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:49,162 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-11-15 23:50:49,162 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:49,162 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:49,162 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:49,163 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:49,163 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:50:49,163 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:50:49,175 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:49,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-11-15 23:50:49,176 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:49,177 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:49,177 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:49,177 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:49,177 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:50:49,177 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:50:49,179 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:49,180 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-11-15 23:50:49,180 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:49,180 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:49,180 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:49,180 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:49,181 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:50:49,181 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:50:49,182 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:49,183 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-11-15 23:50:49,183 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:49,183 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:49,183 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:49,183 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:49,184 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:50:49,184 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:50:49,185 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:49,186 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-11-15 23:50:49,186 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:49,186 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:49,186 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:49,186 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:49,187 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:50:49,187 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:50:49,188 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:49,204 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-11-15 23:50:49,208 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:49,209 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:49,209 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:49,209 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:49,209 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:50:49,210 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:50:49,212 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:49,213 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-11-15 23:50:49,215 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:49,215 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:49,215 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:49,215 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:49,216 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:50:49,216 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:50:49,222 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:50:49,228 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-11-15 23:50:49,228 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:50:49,229 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:50:49,229 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:50:49,229 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:50:49,230 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:50:49,231 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:50:49,266 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:50:49,316 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 23:50:49,316 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-15 23:50:49,316 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:50:49,317 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:50:49,317 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:50:49,318 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~#Source~0.base)_2, ULTIMATE.start_main_~#Weight~0.offset) = -4*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~#Source~0.base)_2 - 1*ULTIMATE.start_main_~#Weight~0.offset Supporting invariants [] [2019-11-15 23:51:25,527 INFO L297 tatePredicateManager]: 1782 out of 1783 supporting invariants were superfluous and have been removed [2019-11-15 23:51:25,529 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 23:51:25,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:25,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:25,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:51:25,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:51:25,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:25,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:51:25,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:51:25,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:51:25,609 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-15 23:51:25,610 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 44 transitions. cyclomatic complexity: 17 Second operand 4 states. [2019-11-15 23:51:25,648 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 44 transitions. cyclomatic complexity: 17. Second operand 4 states. Result 40 states and 55 transitions. Complement of second has 8 states. [2019-11-15 23:51:25,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 23:51:25,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 23:51:25,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2019-11-15 23:51:25,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 8 letters. Loop has 3 letters. [2019-11-15 23:51:25,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:51:25,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 11 letters. Loop has 3 letters. [2019-11-15 23:51:25,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:51:25,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 8 letters. Loop has 6 letters. [2019-11-15 23:51:25,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:51:25,651 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 55 transitions. [2019-11-15 23:51:25,652 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 23:51:25,653 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 28 states and 38 transitions. [2019-11-15 23:51:25,653 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-15 23:51:25,653 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-15 23:51:25,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 38 transitions. [2019-11-15 23:51:25,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:51:25,653 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 38 transitions. [2019-11-15 23:51:25,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 38 transitions. [2019-11-15 23:51:25,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-15 23:51:25,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-15 23:51:25,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2019-11-15 23:51:25,655 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 38 transitions. [2019-11-15 23:51:25,656 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 38 transitions. [2019-11-15 23:51:25,656 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 23:51:25,656 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 38 transitions. [2019-11-15 23:51:25,656 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 23:51:25,656 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:51:25,656 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:51:25,657 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:25,657 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:51:25,657 INFO L791 eck$LassoCheckResult]: Stem: 14787#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; 14782#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~post3, main_#t~mem6, main_#t~mem7, main_#t~mem10, main_#t~mem8, main_#t~mem9, main_#t~post5, main_#t~post4, main_#t~mem12, main_#t~mem13, main_#t~mem16, main_#t~mem14, main_#t~mem15, main_#t~post11, main_#t~mem18, main_#t~post17, main_~nodecount~0, main_~edgecount~0, main_~source~0, main_~#Source~0.base, main_~#Source~0.offset, main_~#Dest~0.base, main_~#Dest~0.offset, main_~#Weight~0.base, main_~#Weight~0.offset, main_~#distance~0.base, main_~#distance~0.offset, main_~x~0, main_~y~0, main_~i~0, main_~j~0;main_~nodecount~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~edgecount~0 := main_#t~nondet2;havoc main_#t~nondet2; 14763#L15 assume !!(0 <= main_~nodecount~0 && main_~nodecount~0 <= 4); 14764#L16 assume !!(0 <= main_~edgecount~0 && main_~edgecount~0 <= 19);main_~source~0 := 0;call main_~#Source~0.base, main_~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, main_~#Source~0.base, main_~#Source~0.offset, 4);call write~init~int(4, main_~#Source~0.base, 4 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 8 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 12 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 16 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 20 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 24 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 28 + main_~#Source~0.offset, 4);call write~init~int(4, main_~#Source~0.base, 32 + main_~#Source~0.offset, 4);call write~init~int(4, main_~#Source~0.base, 36 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 40 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 44 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 48 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 52 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 56 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 60 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 64 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 68 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 72 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 76 + main_~#Source~0.offset, 4);call main_~#Dest~0.base, main_~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, main_~#Dest~0.base, main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 4 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 8 + main_~#Dest~0.offset, 4);call write~init~int(1, main_~#Dest~0.base, 12 + main_~#Dest~0.offset, 4);call write~init~int(1, main_~#Dest~0.base, 16 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 20 + main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 24 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 28 + main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 32 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 36 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 40 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 44 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 48 + main_~#Dest~0.offset, 4);call write~init~int(2, main_~#Dest~0.base, 52 + main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 56 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 60 + main_~#Dest~0.offset, 4);call write~init~int(2, main_~#Dest~0.base, 64 + main_~#Dest~0.offset, 4);call write~init~int(1, main_~#Dest~0.base, 68 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 72 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 76 + main_~#Dest~0.offset, 4);call main_~#Weight~0.base, main_~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, main_~#Weight~0.base, main_~#Weight~0.offset, 4);call write~init~int(1, main_~#Weight~0.base, 4 + main_~#Weight~0.offset, 4);call write~init~int(2, main_~#Weight~0.base, 8 + main_~#Weight~0.offset, 4);call write~init~int(3, main_~#Weight~0.base, 12 + main_~#Weight~0.offset, 4);call write~init~int(4, main_~#Weight~0.base, 16 + main_~#Weight~0.offset, 4);call write~init~int(5, main_~#Weight~0.base, 20 + main_~#Weight~0.offset, 4);call write~init~int(6, main_~#Weight~0.base, 24 + main_~#Weight~0.offset, 4);call write~init~int(7, main_~#Weight~0.base, 28 + main_~#Weight~0.offset, 4);call write~init~int(8, main_~#Weight~0.base, 32 + main_~#Weight~0.offset, 4);call write~init~int(9, main_~#Weight~0.base, 36 + main_~#Weight~0.offset, 4);call write~init~int(10, main_~#Weight~0.base, 40 + main_~#Weight~0.offset, 4);call write~init~int(11, main_~#Weight~0.base, 44 + main_~#Weight~0.offset, 4);call write~init~int(12, main_~#Weight~0.base, 48 + main_~#Weight~0.offset, 4);call write~init~int(13, main_~#Weight~0.base, 52 + main_~#Weight~0.offset, 4);call write~init~int(14, main_~#Weight~0.base, 56 + main_~#Weight~0.offset, 4);call write~init~int(15, main_~#Weight~0.base, 60 + main_~#Weight~0.offset, 4);call write~init~int(16, main_~#Weight~0.base, 64 + main_~#Weight~0.offset, 4);call write~init~int(17, main_~#Weight~0.base, 68 + main_~#Weight~0.offset, 4);call write~init~int(18, main_~#Weight~0.base, 72 + main_~#Weight~0.offset, 4);call write~init~int(19, main_~#Weight~0.base, 76 + main_~#Weight~0.offset, 4);call main_~#distance~0.base, main_~#distance~0.offset := #Ultimate.allocOnStack(20);havoc main_~x~0;havoc main_~y~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 14767#L25-3 assume !!(main_~i~0 < main_~nodecount~0); 14765#L26 assume !(main_~i~0 == main_~source~0);call write~int(~INFINITY~0, main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~i~0, 4); 14766#L25-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 14789#L25-3 assume !(main_~i~0 < main_~nodecount~0); 14785#L25-4 main_~i~0 := 0; 14778#L34-3 assume !!(main_~i~0 < main_~nodecount~0);main_~j~0 := 0; 14780#L36-3 [2019-11-15 23:51:25,657 INFO L793 eck$LassoCheckResult]: Loop: 14780#L36-3 assume !!(main_~j~0 < main_~edgecount~0);call main_#t~mem6 := read~int(main_~#Dest~0.base, main_~#Dest~0.offset + 4 * main_~j~0, 4);main_~x~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#Source~0.base, main_~#Source~0.offset + 4 * main_~j~0, 4);main_~y~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem10 := read~int(main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~x~0, 4);call main_#t~mem8 := read~int(main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~y~0, 4);call main_#t~mem9 := read~int(main_~#Weight~0.base, main_~#Weight~0.offset + 4 * main_~j~0, 4); 14772#L40 assume main_#t~mem10 > main_#t~mem8 + main_#t~mem9;havoc main_#t~mem9;havoc main_#t~mem8;havoc main_#t~mem10;call write~int(-1, main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~x~0, 4); 14773#L36-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 14780#L36-3 [2019-11-15 23:51:25,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:25,658 INFO L82 PathProgramCache]: Analyzing trace with hash 854480748, now seen corresponding path program 1 times [2019-11-15 23:51:25,658 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:25,658 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847646227] [2019-11-15 23:51:25,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:25,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:25,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:25,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:25,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:51:25,689 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847646227] [2019-11-15 23:51:25,689 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:25,689 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:51:25,690 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66248643] [2019-11-15 23:51:25,690 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:51:25,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:25,690 INFO L82 PathProgramCache]: Analyzing trace with hash 76562, now seen corresponding path program 1 times [2019-11-15 23:51:25,690 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:25,691 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872526027] [2019-11-15 23:51:25,691 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:25,691 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:25,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:25,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:51:25,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:51:25,711 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:51:25,895 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:25,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:51:25,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:51:25,895 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. cyclomatic complexity: 15 Second operand 3 states. [2019-11-15 23:51:25,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:25,926 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2019-11-15 23:51:25,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:51:25,926 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2019-11-15 23:51:25,927 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 23:51:25,927 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 40 transitions. [2019-11-15 23:51:25,928 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-15 23:51:25,928 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-15 23:51:25,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2019-11-15 23:51:25,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:51:25,928 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2019-11-15 23:51:25,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2019-11-15 23:51:25,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-11-15 23:51:25,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-15 23:51:25,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2019-11-15 23:51:25,930 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 39 transitions. [2019-11-15 23:51:25,931 INFO L591 BuchiCegarLoop]: Abstraction has 29 states and 39 transitions. [2019-11-15 23:51:25,931 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 23:51:25,931 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 39 transitions. [2019-11-15 23:51:25,931 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 23:51:25,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:51:25,932 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:51:25,932 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:25,932 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:51:25,932 INFO L791 eck$LassoCheckResult]: Stem: 14850#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; 14842#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~post3, main_#t~mem6, main_#t~mem7, main_#t~mem10, main_#t~mem8, main_#t~mem9, main_#t~post5, main_#t~post4, main_#t~mem12, main_#t~mem13, main_#t~mem16, main_#t~mem14, main_#t~mem15, main_#t~post11, main_#t~mem18, main_#t~post17, main_~nodecount~0, main_~edgecount~0, main_~source~0, main_~#Source~0.base, main_~#Source~0.offset, main_~#Dest~0.base, main_~#Dest~0.offset, main_~#Weight~0.base, main_~#Weight~0.offset, main_~#distance~0.base, main_~#distance~0.offset, main_~x~0, main_~y~0, main_~i~0, main_~j~0;main_~nodecount~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~edgecount~0 := main_#t~nondet2;havoc main_#t~nondet2; 14827#L15 assume !!(0 <= main_~nodecount~0 && main_~nodecount~0 <= 4); 14828#L16 assume !!(0 <= main_~edgecount~0 && main_~edgecount~0 <= 19);main_~source~0 := 0;call main_~#Source~0.base, main_~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, main_~#Source~0.base, main_~#Source~0.offset, 4);call write~init~int(4, main_~#Source~0.base, 4 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 8 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 12 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 16 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 20 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 24 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 28 + main_~#Source~0.offset, 4);call write~init~int(4, main_~#Source~0.base, 32 + main_~#Source~0.offset, 4);call write~init~int(4, main_~#Source~0.base, 36 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 40 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 44 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 48 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 52 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 56 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 60 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 64 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 68 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 72 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 76 + main_~#Source~0.offset, 4);call main_~#Dest~0.base, main_~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, main_~#Dest~0.base, main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 4 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 8 + main_~#Dest~0.offset, 4);call write~init~int(1, main_~#Dest~0.base, 12 + main_~#Dest~0.offset, 4);call write~init~int(1, main_~#Dest~0.base, 16 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 20 + main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 24 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 28 + main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 32 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 36 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 40 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 44 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 48 + main_~#Dest~0.offset, 4);call write~init~int(2, main_~#Dest~0.base, 52 + main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 56 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 60 + main_~#Dest~0.offset, 4);call write~init~int(2, main_~#Dest~0.base, 64 + main_~#Dest~0.offset, 4);call write~init~int(1, main_~#Dest~0.base, 68 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 72 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 76 + main_~#Dest~0.offset, 4);call main_~#Weight~0.base, main_~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, main_~#Weight~0.base, main_~#Weight~0.offset, 4);call write~init~int(1, main_~#Weight~0.base, 4 + main_~#Weight~0.offset, 4);call write~init~int(2, main_~#Weight~0.base, 8 + main_~#Weight~0.offset, 4);call write~init~int(3, main_~#Weight~0.base, 12 + main_~#Weight~0.offset, 4);call write~init~int(4, main_~#Weight~0.base, 16 + main_~#Weight~0.offset, 4);call write~init~int(5, main_~#Weight~0.base, 20 + main_~#Weight~0.offset, 4);call write~init~int(6, main_~#Weight~0.base, 24 + main_~#Weight~0.offset, 4);call write~init~int(7, main_~#Weight~0.base, 28 + main_~#Weight~0.offset, 4);call write~init~int(8, main_~#Weight~0.base, 32 + main_~#Weight~0.offset, 4);call write~init~int(9, main_~#Weight~0.base, 36 + main_~#Weight~0.offset, 4);call write~init~int(10, main_~#Weight~0.base, 40 + main_~#Weight~0.offset, 4);call write~init~int(11, main_~#Weight~0.base, 44 + main_~#Weight~0.offset, 4);call write~init~int(12, main_~#Weight~0.base, 48 + main_~#Weight~0.offset, 4);call write~init~int(13, main_~#Weight~0.base, 52 + main_~#Weight~0.offset, 4);call write~init~int(14, main_~#Weight~0.base, 56 + main_~#Weight~0.offset, 4);call write~init~int(15, main_~#Weight~0.base, 60 + main_~#Weight~0.offset, 4);call write~init~int(16, main_~#Weight~0.base, 64 + main_~#Weight~0.offset, 4);call write~init~int(17, main_~#Weight~0.base, 68 + main_~#Weight~0.offset, 4);call write~init~int(18, main_~#Weight~0.base, 72 + main_~#Weight~0.offset, 4);call write~init~int(19, main_~#Weight~0.base, 76 + main_~#Weight~0.offset, 4);call main_~#distance~0.base, main_~#distance~0.offset := #Ultimate.allocOnStack(20);havoc main_~x~0;havoc main_~y~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 14831#L25-3 assume !!(main_~i~0 < main_~nodecount~0); 14829#L26 assume main_~i~0 == main_~source~0;call write~int(0, main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~i~0, 4); 14830#L25-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 14853#L25-3 assume !(main_~i~0 < main_~nodecount~0); 14849#L25-4 main_~i~0 := 0; 14843#L34-3 assume !!(main_~i~0 < main_~nodecount~0);main_~j~0 := 0; 14845#L36-3 [2019-11-15 23:51:25,932 INFO L793 eck$LassoCheckResult]: Loop: 14845#L36-3 assume !!(main_~j~0 < main_~edgecount~0);call main_#t~mem6 := read~int(main_~#Dest~0.base, main_~#Dest~0.offset + 4 * main_~j~0, 4);main_~x~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#Source~0.base, main_~#Source~0.offset + 4 * main_~j~0, 4);main_~y~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem10 := read~int(main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~x~0, 4);call main_#t~mem8 := read~int(main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~y~0, 4);call main_#t~mem9 := read~int(main_~#Weight~0.base, main_~#Weight~0.offset + 4 * main_~j~0, 4); 14836#L40 assume main_#t~mem10 > main_#t~mem8 + main_#t~mem9;havoc main_#t~mem9;havoc main_#t~mem8;havoc main_#t~mem10;call write~int(-1, main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~x~0, 4); 14837#L36-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 14845#L36-3 [2019-11-15 23:51:25,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:25,933 INFO L82 PathProgramCache]: Analyzing trace with hash 852633706, now seen corresponding path program 1 times [2019-11-15 23:51:25,933 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:25,933 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118405489] [2019-11-15 23:51:25,933 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:25,933 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:25,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:25,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:51:25,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:51:25,971 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:51:25,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:25,971 INFO L82 PathProgramCache]: Analyzing trace with hash 76562, now seen corresponding path program 2 times [2019-11-15 23:51:25,971 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:25,972 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054138230] [2019-11-15 23:51:25,972 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:25,972 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:25,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:25,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:51:25,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:51:25,981 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:51:25,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:25,981 INFO L82 PathProgramCache]: Analyzing trace with hash 374193673, now seen corresponding path program 1 times [2019-11-15 23:51:25,982 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:25,982 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551943847] [2019-11-15 23:51:25,982 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:25,982 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:25,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:26,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:51:26,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:51:26,058 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:51:27,489 WARN L191 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 316 DAG size of output: 304 [2019-11-15 23:51:28,062 WARN L191 SmtUtils]: Spent 570.00 ms on a formula simplification that was a NOOP. DAG size: 293 [2019-11-15 23:51:28,065 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:51:28,066 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:51:28,066 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:51:28,066 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:51:28,066 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:51:28,066 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:51:28,066 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:51:28,066 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:51:28,066 INFO L131 ssoRankerPreferences]: Filename of dumped script: eureka_01-1.c_Iteration6_Lasso [2019-11-15 23:51:28,066 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:51:28,066 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:51:28,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-11-15 23:51:28,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-11-15 23:51:41,323 WARN L191 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 79 [2019-11-15 23:51:43,361 WARN L191 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 393 DAG size of output: 246 [2019-11-15 23:51:43,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:51:43,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:51:43,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:51:43,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:51:43,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:51:43,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:51:43,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:51:43,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:51:43,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:51:43,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:51:43,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:51:43,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:51:43,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:51:43,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:51:43,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:51:43,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:51:43,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:51:43,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:51:43,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:51:43,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:51:43,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:51:44,440 WARN L191 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-15 23:51:44,521 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:51:44,521 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:51:44,522 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-11-15 23:51:44,522 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:51:44,522 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:51:44,523 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:51:44,523 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:51:44,523 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:51:44,523 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:51:44,523 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:51:44,524 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:51:44,524 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-11-15 23:51:44,524 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:51:44,524 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:51:44,525 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:51:44,525 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:51:44,525 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:51:44,525 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:51:44,525 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:51:44,526 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:51:44,526 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-11-15 23:51:44,526 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:51:44,527 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:51:44,527 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:51:44,527 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:51:44,527 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:51:44,527 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:51:44,529 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:51:44,530 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-11-15 23:51:44,530 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:51:44,530 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:51:44,530 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:51:44,531 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:51:44,531 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:51:44,531 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:51:44,533 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:51:44,534 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-11-15 23:51:44,534 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:51:44,534 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:51:44,534 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:51:44,534 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:51:44,535 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:51:44,535 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:51:44,535 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:51:44,535 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:51:44,536 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-11-15 23:51:44,536 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:51:44,536 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:51:44,536 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:51:44,536 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:51:44,537 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:51:44,537 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:51:44,537 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:51:44,537 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:51:44,538 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-11-15 23:51:44,538 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:51:44,538 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:51:44,538 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:51:44,538 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:51:44,539 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:51:44,539 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:51:44,539 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:51:44,539 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:51:44,540 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-11-15 23:51:44,540 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:51:44,540 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:51:44,540 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:51:44,540 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:51:44,541 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:51:44,541 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:51:44,541 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:51:44,541 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:51:44,542 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-11-15 23:51:44,542 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:51:44,542 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:51:44,542 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:51:44,542 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:51:44,542 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:51:44,543 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:51:44,543 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:51:44,543 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:51:44,543 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-11-15 23:51:44,544 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:51:44,544 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:51:44,544 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:51:44,544 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:51:44,544 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:51:44,545 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:51:44,545 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:51:44,545 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:51:44,546 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-11-15 23:51:44,546 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:51:44,546 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:51:44,546 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:51:44,547 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:51:44,547 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:51:44,547 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:51:44,547 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:51:44,547 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:51:44,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-11-15 23:51:44,548 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:51:44,548 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:51:44,548 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:51:44,549 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:51:44,549 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:51:44,549 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:51:44,549 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:51:44,549 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:51:44,550 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-11-15 23:51:44,550 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:51:44,550 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:51:44,550 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:51:44,551 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:51:44,551 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:51:44,551 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:51:44,551 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:51:44,552 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:51:44,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-11-15 23:51:44,552 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:51:44,552 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:51:44,553 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:51:44,553 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:51:44,553 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:51:44,553 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:51:44,554 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:51:44,555 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-11-15 23:51:44,555 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:51:44,555 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:51:44,555 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:51:44,555 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:51:44,556 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:51:44,556 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:51:44,556 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:51:44,556 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:51:44,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-11-15 23:51:44,557 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:51:44,557 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:51:44,557 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:51:44,557 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:51:44,558 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:51:44,558 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:51:44,558 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:51:44,558 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:51:44,559 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-11-15 23:51:44,559 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:51:44,559 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:51:44,559 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:51:44,560 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:51:44,560 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:51:44,560 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:51:44,560 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:51:44,560 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:51:44,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-11-15 23:51:44,561 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:51:44,561 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:51:44,561 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:51:44,562 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:51:44,562 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:51:44,562 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:51:44,562 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:51:44,562 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:51:44,563 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-11-15 23:51:44,563 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:51:44,563 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:51:44,563 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:51:44,564 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:51:44,564 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:51:44,564 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:51:44,564 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:51:44,565 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:51:44,565 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-11-15 23:51:44,565 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:51:44,565 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:51:44,566 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:51:44,566 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:51:44,566 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:51:44,566 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:51:44,566 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:51:44,567 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:51:44,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-11-15 23:51:44,567 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:51:44,567 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:51:44,568 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:51:44,568 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:51:44,568 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:51:44,568 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:51:44,568 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:51:44,569 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:51:44,569 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-11-15 23:51:44,569 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:51:44,569 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:51:44,570 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:51:44,570 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:51:44,570 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:51:44,570 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:51:44,570 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:51:44,571 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:51:44,571 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-11-15 23:51:44,571 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:51:44,571 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:51:44,572 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:51:44,572 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:51:44,572 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:51:44,572 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:51:44,574 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:51:44,574 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-11-15 23:51:44,575 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:51:44,575 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:51:44,575 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:51:44,575 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:51:44,575 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:51:44,576 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:51:44,576 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:51:44,576 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:51:44,577 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-11-15 23:51:44,577 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:51:44,577 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:51:44,577 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:51:44,577 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:51:44,577 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:51:44,578 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:51:44,578 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:51:44,578 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:51:44,579 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-11-15 23:51:44,579 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:51:44,579 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:51:44,579 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:51:44,579 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:51:44,580 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:51:44,580 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:51:44,580 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:51:44,580 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:51:44,581 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-11-15 23:51:44,581 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:51:44,581 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:51:44,581 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:51:44,581 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:51:44,582 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:51:44,582 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:51:44,582 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:51:44,582 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:51:44,583 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-11-15 23:51:44,583 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:51:44,583 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:51:44,583 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:51:44,584 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:51:44,584 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:51:44,584 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:51:44,584 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:51:44,585 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:51:44,585 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-11-15 23:51:44,585 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:51:44,585 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:51:44,585 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:51:44,586 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:51:44,586 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:51:44,586 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:51:44,586 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:51:44,587 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:51:44,587 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-11-15 23:51:44,587 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:51:44,587 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:51:44,588 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:51:44,588 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:51:44,588 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:51:44,588 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:51:44,588 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:51:44,589 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:51:44,589 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-11-15 23:51:44,589 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:51:44,589 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:51:44,590 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:51:44,590 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:51:44,590 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:51:44,590 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:51:44,590 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:51:44,591 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:51:44,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-11-15 23:51:44,591 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:51:44,591 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:51:44,592 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:51:44,592 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:51:44,592 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:51:44,592 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:51:44,592 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:51:44,593 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:51:44,593 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-11-15 23:51:44,593 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:51:44,593 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:51:44,594 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:51:44,594 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:51:44,594 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:51:44,594 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:51:44,594 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:51:44,595 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:51:44,595 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-11-15 23:51:44,595 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:51:44,595 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:51:44,596 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:51:44,596 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:51:44,596 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:51:44,596 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:51:44,596 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:51:44,597 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:51:44,597 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-11-15 23:51:44,597 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:51:44,598 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:51:44,598 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:51:44,598 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:51:44,598 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:51:44,598 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:51:44,598 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:51:44,599 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:51:44,599 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-11-15 23:51:44,600 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:51:44,600 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:51:44,600 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:51:44,600 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:51:44,603 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:51:44,603 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:51:44,642 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:51:44,666 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 23:51:44,666 INFO L444 ModelExtractionUtils]: 56 out of 61 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:51:44,667 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:51:44,667 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:51:44,668 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:51:44,668 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#Dest~0.base)_3, ULTIMATE.start_main_~#Dest~0.offset, ULTIMATE.start_main_~j~0) = 1*v_rep(select #length ULTIMATE.start_main_~#Dest~0.base)_3 - 1*ULTIMATE.start_main_~#Dest~0.offset - 4*ULTIMATE.start_main_~j~0 Supporting invariants [] [2019-11-15 23:52:20,532 INFO L297 tatePredicateManager]: 1843 out of 1843 supporting invariants were superfluous and have been removed [2019-11-15 23:52:20,533 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 23:52:20,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:20,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:20,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:52:20,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:20,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:52:20,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:20,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:20,585 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 23:52:20,586 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 39 transitions. cyclomatic complexity: 15 Second operand 3 states. [2019-11-15 23:52:20,616 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 39 transitions. cyclomatic complexity: 15. Second operand 3 states. Result 64 states and 87 transitions. Complement of second has 7 states. [2019-11-15 23:52:20,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 23:52:20,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:52:20,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2019-11-15 23:52:20,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 10 letters. Loop has 3 letters. [2019-11-15 23:52:20,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:52:20,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 13 letters. Loop has 3 letters. [2019-11-15 23:52:20,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:52:20,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-15 23:52:20,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:52:20,619 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 87 transitions. [2019-11-15 23:52:20,620 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-11-15 23:52:20,621 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 44 states and 59 transitions. [2019-11-15 23:52:20,621 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-11-15 23:52:20,621 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-11-15 23:52:20,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 59 transitions. [2019-11-15 23:52:20,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:52:20,622 INFO L688 BuchiCegarLoop]: Abstraction has 44 states and 59 transitions. [2019-11-15 23:52:20,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 59 transitions. [2019-11-15 23:52:20,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 29. [2019-11-15 23:52:20,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-15 23:52:20,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2019-11-15 23:52:20,624 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2019-11-15 23:52:20,624 INFO L591 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2019-11-15 23:52:20,624 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 23:52:20,624 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 38 transitions. [2019-11-15 23:52:20,624 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 23:52:20,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:52:20,625 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:52:20,625 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:20,625 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:52:20,625 INFO L791 eck$LassoCheckResult]: Stem: 22378#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; 22370#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~post3, main_#t~mem6, main_#t~mem7, main_#t~mem10, main_#t~mem8, main_#t~mem9, main_#t~post5, main_#t~post4, main_#t~mem12, main_#t~mem13, main_#t~mem16, main_#t~mem14, main_#t~mem15, main_#t~post11, main_#t~mem18, main_#t~post17, main_~nodecount~0, main_~edgecount~0, main_~source~0, main_~#Source~0.base, main_~#Source~0.offset, main_~#Dest~0.base, main_~#Dest~0.offset, main_~#Weight~0.base, main_~#Weight~0.offset, main_~#distance~0.base, main_~#distance~0.offset, main_~x~0, main_~y~0, main_~i~0, main_~j~0;main_~nodecount~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~edgecount~0 := main_#t~nondet2;havoc main_#t~nondet2; 22355#L15 assume !!(0 <= main_~nodecount~0 && main_~nodecount~0 <= 4); 22356#L16 assume !!(0 <= main_~edgecount~0 && main_~edgecount~0 <= 19);main_~source~0 := 0;call main_~#Source~0.base, main_~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, main_~#Source~0.base, main_~#Source~0.offset, 4);call write~init~int(4, main_~#Source~0.base, 4 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 8 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 12 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 16 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 20 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 24 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 28 + main_~#Source~0.offset, 4);call write~init~int(4, main_~#Source~0.base, 32 + main_~#Source~0.offset, 4);call write~init~int(4, main_~#Source~0.base, 36 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 40 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 44 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 48 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 52 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 56 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 60 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 64 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 68 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 72 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 76 + main_~#Source~0.offset, 4);call main_~#Dest~0.base, main_~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, main_~#Dest~0.base, main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 4 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 8 + main_~#Dest~0.offset, 4);call write~init~int(1, main_~#Dest~0.base, 12 + main_~#Dest~0.offset, 4);call write~init~int(1, main_~#Dest~0.base, 16 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 20 + main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 24 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 28 + main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 32 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 36 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 40 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 44 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 48 + main_~#Dest~0.offset, 4);call write~init~int(2, main_~#Dest~0.base, 52 + main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 56 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 60 + main_~#Dest~0.offset, 4);call write~init~int(2, main_~#Dest~0.base, 64 + main_~#Dest~0.offset, 4);call write~init~int(1, main_~#Dest~0.base, 68 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 72 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 76 + main_~#Dest~0.offset, 4);call main_~#Weight~0.base, main_~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, main_~#Weight~0.base, main_~#Weight~0.offset, 4);call write~init~int(1, main_~#Weight~0.base, 4 + main_~#Weight~0.offset, 4);call write~init~int(2, main_~#Weight~0.base, 8 + main_~#Weight~0.offset, 4);call write~init~int(3, main_~#Weight~0.base, 12 + main_~#Weight~0.offset, 4);call write~init~int(4, main_~#Weight~0.base, 16 + main_~#Weight~0.offset, 4);call write~init~int(5, main_~#Weight~0.base, 20 + main_~#Weight~0.offset, 4);call write~init~int(6, main_~#Weight~0.base, 24 + main_~#Weight~0.offset, 4);call write~init~int(7, main_~#Weight~0.base, 28 + main_~#Weight~0.offset, 4);call write~init~int(8, main_~#Weight~0.base, 32 + main_~#Weight~0.offset, 4);call write~init~int(9, main_~#Weight~0.base, 36 + main_~#Weight~0.offset, 4);call write~init~int(10, main_~#Weight~0.base, 40 + main_~#Weight~0.offset, 4);call write~init~int(11, main_~#Weight~0.base, 44 + main_~#Weight~0.offset, 4);call write~init~int(12, main_~#Weight~0.base, 48 + main_~#Weight~0.offset, 4);call write~init~int(13, main_~#Weight~0.base, 52 + main_~#Weight~0.offset, 4);call write~init~int(14, main_~#Weight~0.base, 56 + main_~#Weight~0.offset, 4);call write~init~int(15, main_~#Weight~0.base, 60 + main_~#Weight~0.offset, 4);call write~init~int(16, main_~#Weight~0.base, 64 + main_~#Weight~0.offset, 4);call write~init~int(17, main_~#Weight~0.base, 68 + main_~#Weight~0.offset, 4);call write~init~int(18, main_~#Weight~0.base, 72 + main_~#Weight~0.offset, 4);call write~init~int(19, main_~#Weight~0.base, 76 + main_~#Weight~0.offset, 4);call main_~#distance~0.base, main_~#distance~0.offset := #Ultimate.allocOnStack(20);havoc main_~x~0;havoc main_~y~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 22359#L25-3 assume !!(main_~i~0 < main_~nodecount~0); 22357#L26 assume main_~i~0 == main_~source~0;call write~int(0, main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~i~0, 4); 22358#L25-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 22381#L25-3 assume !(main_~i~0 < main_~nodecount~0); 22377#L25-4 main_~i~0 := 0; 22371#L34-3 assume !!(main_~i~0 < main_~nodecount~0);main_~j~0 := 0; 22372#L36-3 assume !(main_~j~0 < main_~edgecount~0); 22379#L34-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 22373#L34-3 assume !!(main_~i~0 < main_~nodecount~0);main_~j~0 := 0; 22374#L36-3 [2019-11-15 23:52:20,625 INFO L793 eck$LassoCheckResult]: Loop: 22374#L36-3 assume !!(main_~j~0 < main_~edgecount~0);call main_#t~mem6 := read~int(main_~#Dest~0.base, main_~#Dest~0.offset + 4 * main_~j~0, 4);main_~x~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#Source~0.base, main_~#Source~0.offset + 4 * main_~j~0, 4);main_~y~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem10 := read~int(main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~x~0, 4);call main_#t~mem8 := read~int(main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~y~0, 4);call main_#t~mem9 := read~int(main_~#Weight~0.base, main_~#Weight~0.offset + 4 * main_~j~0, 4); 22364#L40 assume main_#t~mem10 > main_#t~mem8 + main_#t~mem9;havoc main_#t~mem9;havoc main_#t~mem8;havoc main_#t~mem10;call write~int(-1, main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~x~0, 4); 22365#L36-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 22374#L36-3 [2019-11-15 23:52:20,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:20,626 INFO L82 PathProgramCache]: Analyzing trace with hash 374191984, now seen corresponding path program 1 times [2019-11-15 23:52:20,626 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:20,626 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757727785] [2019-11-15 23:52:20,626 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:20,626 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:20,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:20,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:20,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:20,686 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757727785] [2019-11-15 23:52:20,686 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633160138] [2019-11-15 23:52:20,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7fb7c2f0-0b38-4f63-9fff-74ca34e2482b/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:20,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:52:20,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:20,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:20,839 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:52:20,839 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-11-15 23:52:20,839 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407036053] [2019-11-15 23:52:20,840 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:52:20,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:20,840 INFO L82 PathProgramCache]: Analyzing trace with hash 76562, now seen corresponding path program 3 times [2019-11-15 23:52:20,840 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:20,840 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572155361] [2019-11-15 23:52:20,840 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:20,841 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:20,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:20,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:20,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:20,850 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:52:21,026 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:21,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:52:21,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:52:21,027 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. cyclomatic complexity: 14 Second operand 10 states. [2019-11-15 23:52:21,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:21,214 INFO L93 Difference]: Finished difference Result 86 states and 109 transitions. [2019-11-15 23:52:21,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:52:21,214 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 109 transitions. [2019-11-15 23:52:21,215 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-15 23:52:21,216 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 60 states and 77 transitions. [2019-11-15 23:52:21,216 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-15 23:52:21,216 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-15 23:52:21,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 77 transitions. [2019-11-15 23:52:21,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:52:21,216 INFO L688 BuchiCegarLoop]: Abstraction has 60 states and 77 transitions. [2019-11-15 23:52:21,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 77 transitions. [2019-11-15 23:52:21,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2019-11-15 23:52:21,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-15 23:52:21,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2019-11-15 23:52:21,219 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 48 transitions. [2019-11-15 23:52:21,219 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 48 transitions. [2019-11-15 23:52:21,219 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 23:52:21,219 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 48 transitions. [2019-11-15 23:52:21,221 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 23:52:21,221 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:52:21,221 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:52:21,222 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:21,222 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:52:21,222 INFO L791 eck$LassoCheckResult]: Stem: 22547#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; 22538#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~post3, main_#t~mem6, main_#t~mem7, main_#t~mem10, main_#t~mem8, main_#t~mem9, main_#t~post5, main_#t~post4, main_#t~mem12, main_#t~mem13, main_#t~mem16, main_#t~mem14, main_#t~mem15, main_#t~post11, main_#t~mem18, main_#t~post17, main_~nodecount~0, main_~edgecount~0, main_~source~0, main_~#Source~0.base, main_~#Source~0.offset, main_~#Dest~0.base, main_~#Dest~0.offset, main_~#Weight~0.base, main_~#Weight~0.offset, main_~#distance~0.base, main_~#distance~0.offset, main_~x~0, main_~y~0, main_~i~0, main_~j~0;main_~nodecount~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~edgecount~0 := main_#t~nondet2;havoc main_#t~nondet2; 22523#L15 assume !!(0 <= main_~nodecount~0 && main_~nodecount~0 <= 4); 22524#L16 assume !!(0 <= main_~edgecount~0 && main_~edgecount~0 <= 19);main_~source~0 := 0;call main_~#Source~0.base, main_~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, main_~#Source~0.base, main_~#Source~0.offset, 4);call write~init~int(4, main_~#Source~0.base, 4 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 8 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 12 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 16 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 20 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 24 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 28 + main_~#Source~0.offset, 4);call write~init~int(4, main_~#Source~0.base, 32 + main_~#Source~0.offset, 4);call write~init~int(4, main_~#Source~0.base, 36 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 40 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 44 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 48 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 52 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 56 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 60 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 64 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 68 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 72 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 76 + main_~#Source~0.offset, 4);call main_~#Dest~0.base, main_~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, main_~#Dest~0.base, main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 4 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 8 + main_~#Dest~0.offset, 4);call write~init~int(1, main_~#Dest~0.base, 12 + main_~#Dest~0.offset, 4);call write~init~int(1, main_~#Dest~0.base, 16 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 20 + main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 24 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 28 + main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 32 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 36 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 40 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 44 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 48 + main_~#Dest~0.offset, 4);call write~init~int(2, main_~#Dest~0.base, 52 + main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 56 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 60 + main_~#Dest~0.offset, 4);call write~init~int(2, main_~#Dest~0.base, 64 + main_~#Dest~0.offset, 4);call write~init~int(1, main_~#Dest~0.base, 68 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 72 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 76 + main_~#Dest~0.offset, 4);call main_~#Weight~0.base, main_~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, main_~#Weight~0.base, main_~#Weight~0.offset, 4);call write~init~int(1, main_~#Weight~0.base, 4 + main_~#Weight~0.offset, 4);call write~init~int(2, main_~#Weight~0.base, 8 + main_~#Weight~0.offset, 4);call write~init~int(3, main_~#Weight~0.base, 12 + main_~#Weight~0.offset, 4);call write~init~int(4, main_~#Weight~0.base, 16 + main_~#Weight~0.offset, 4);call write~init~int(5, main_~#Weight~0.base, 20 + main_~#Weight~0.offset, 4);call write~init~int(6, main_~#Weight~0.base, 24 + main_~#Weight~0.offset, 4);call write~init~int(7, main_~#Weight~0.base, 28 + main_~#Weight~0.offset, 4);call write~init~int(8, main_~#Weight~0.base, 32 + main_~#Weight~0.offset, 4);call write~init~int(9, main_~#Weight~0.base, 36 + main_~#Weight~0.offset, 4);call write~init~int(10, main_~#Weight~0.base, 40 + main_~#Weight~0.offset, 4);call write~init~int(11, main_~#Weight~0.base, 44 + main_~#Weight~0.offset, 4);call write~init~int(12, main_~#Weight~0.base, 48 + main_~#Weight~0.offset, 4);call write~init~int(13, main_~#Weight~0.base, 52 + main_~#Weight~0.offset, 4);call write~init~int(14, main_~#Weight~0.base, 56 + main_~#Weight~0.offset, 4);call write~init~int(15, main_~#Weight~0.base, 60 + main_~#Weight~0.offset, 4);call write~init~int(16, main_~#Weight~0.base, 64 + main_~#Weight~0.offset, 4);call write~init~int(17, main_~#Weight~0.base, 68 + main_~#Weight~0.offset, 4);call write~init~int(18, main_~#Weight~0.base, 72 + main_~#Weight~0.offset, 4);call write~init~int(19, main_~#Weight~0.base, 76 + main_~#Weight~0.offset, 4);call main_~#distance~0.base, main_~#distance~0.offset := #Ultimate.allocOnStack(20);havoc main_~x~0;havoc main_~y~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 22527#L25-3 assume !!(main_~i~0 < main_~nodecount~0); 22551#L26 assume main_~i~0 == main_~source~0;call write~int(0, main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~i~0, 4); 22558#L25-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 22552#L25-3 assume !!(main_~i~0 < main_~nodecount~0); 22525#L26 assume !(main_~i~0 == main_~source~0);call write~int(~INFINITY~0, main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~i~0, 4); 22526#L25-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 22554#L25-3 assume !(main_~i~0 < main_~nodecount~0); 22546#L25-4 main_~i~0 := 0; 22539#L34-3 assume !!(main_~i~0 < main_~nodecount~0);main_~j~0 := 0; 22540#L36-3 assume !(main_~j~0 < main_~edgecount~0); 22555#L34-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 22541#L34-3 assume !!(main_~i~0 < main_~nodecount~0);main_~j~0 := 0; 22543#L36-3 [2019-11-15 23:52:21,223 INFO L793 eck$LassoCheckResult]: Loop: 22543#L36-3 assume !!(main_~j~0 < main_~edgecount~0);call main_#t~mem6 := read~int(main_~#Dest~0.base, main_~#Dest~0.offset + 4 * main_~j~0, 4);main_~x~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#Source~0.base, main_~#Source~0.offset + 4 * main_~j~0, 4);main_~y~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem10 := read~int(main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~x~0, 4);call main_#t~mem8 := read~int(main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~y~0, 4);call main_#t~mem9 := read~int(main_~#Weight~0.base, main_~#Weight~0.offset + 4 * main_~j~0, 4); 22532#L40 assume main_#t~mem10 > main_#t~mem8 + main_#t~mem9;havoc main_#t~mem9;havoc main_#t~mem8;havoc main_#t~mem10;call write~int(-1, main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~x~0, 4); 22533#L36-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 22543#L36-3 [2019-11-15 23:52:21,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:21,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1931593466, now seen corresponding path program 1 times [2019-11-15 23:52:21,223 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:21,223 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401306877] [2019-11-15 23:52:21,223 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:21,223 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:21,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:21,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:21,253 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:52:21,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:21,253 INFO L82 PathProgramCache]: Analyzing trace with hash 76562, now seen corresponding path program 4 times [2019-11-15 23:52:21,254 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:21,254 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536445720] [2019-11-15 23:52:21,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:21,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:21,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:21,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:21,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:21,260 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:52:21,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:21,260 INFO L82 PathProgramCache]: Analyzing trace with hash -129067027, now seen corresponding path program 1 times [2019-11-15 23:52:21,260 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:21,261 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296685514] [2019-11-15 23:52:21,261 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:21,261 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:21,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:21,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:21,299 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 23:52:21,300 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296685514] [2019-11-15 23:52:21,300 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:21,300 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:52:21,300 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274851316] [2019-11-15 23:52:21,422 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:21,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:52:21,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:52:21,423 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. cyclomatic complexity: 18 Second operand 5 states. [2019-11-15 23:52:21,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:21,445 INFO L93 Difference]: Finished difference Result 61 states and 82 transitions. [2019-11-15 23:52:21,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:52:21,446 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 82 transitions. [2019-11-15 23:52:21,448 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-11-15 23:52:21,449 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 60 states and 80 transitions. [2019-11-15 23:52:21,449 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-11-15 23:52:21,449 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-11-15 23:52:21,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 80 transitions. [2019-11-15 23:52:21,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:52:21,449 INFO L688 BuchiCegarLoop]: Abstraction has 60 states and 80 transitions. [2019-11-15 23:52:21,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 80 transitions. [2019-11-15 23:52:21,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 43. [2019-11-15 23:52:21,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-15 23:52:21,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2019-11-15 23:52:21,452 INFO L711 BuchiCegarLoop]: Abstraction has 43 states and 58 transitions. [2019-11-15 23:52:21,453 INFO L591 BuchiCegarLoop]: Abstraction has 43 states and 58 transitions. [2019-11-15 23:52:21,453 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-15 23:52:21,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 58 transitions. [2019-11-15 23:52:21,453 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 23:52:21,453 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:52:21,453 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:52:21,454 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:21,454 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:52:21,454 INFO L791 eck$LassoCheckResult]: Stem: 22653#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; 22645#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~post3, main_#t~mem6, main_#t~mem7, main_#t~mem10, main_#t~mem8, main_#t~mem9, main_#t~post5, main_#t~post4, main_#t~mem12, main_#t~mem13, main_#t~mem16, main_#t~mem14, main_#t~mem15, main_#t~post11, main_#t~mem18, main_#t~post17, main_~nodecount~0, main_~edgecount~0, main_~source~0, main_~#Source~0.base, main_~#Source~0.offset, main_~#Dest~0.base, main_~#Dest~0.offset, main_~#Weight~0.base, main_~#Weight~0.offset, main_~#distance~0.base, main_~#distance~0.offset, main_~x~0, main_~y~0, main_~i~0, main_~j~0;main_~nodecount~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~edgecount~0 := main_#t~nondet2;havoc main_#t~nondet2; 22630#L15 assume !!(0 <= main_~nodecount~0 && main_~nodecount~0 <= 4); 22631#L16 assume !!(0 <= main_~edgecount~0 && main_~edgecount~0 <= 19);main_~source~0 := 0;call main_~#Source~0.base, main_~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, main_~#Source~0.base, main_~#Source~0.offset, 4);call write~init~int(4, main_~#Source~0.base, 4 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 8 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 12 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 16 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 20 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 24 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 28 + main_~#Source~0.offset, 4);call write~init~int(4, main_~#Source~0.base, 32 + main_~#Source~0.offset, 4);call write~init~int(4, main_~#Source~0.base, 36 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 40 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 44 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 48 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 52 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 56 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 60 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 64 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 68 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 72 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 76 + main_~#Source~0.offset, 4);call main_~#Dest~0.base, main_~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, main_~#Dest~0.base, main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 4 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 8 + main_~#Dest~0.offset, 4);call write~init~int(1, main_~#Dest~0.base, 12 + main_~#Dest~0.offset, 4);call write~init~int(1, main_~#Dest~0.base, 16 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 20 + main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 24 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 28 + main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 32 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 36 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 40 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 44 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 48 + main_~#Dest~0.offset, 4);call write~init~int(2, main_~#Dest~0.base, 52 + main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 56 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 60 + main_~#Dest~0.offset, 4);call write~init~int(2, main_~#Dest~0.base, 64 + main_~#Dest~0.offset, 4);call write~init~int(1, main_~#Dest~0.base, 68 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 72 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 76 + main_~#Dest~0.offset, 4);call main_~#Weight~0.base, main_~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, main_~#Weight~0.base, main_~#Weight~0.offset, 4);call write~init~int(1, main_~#Weight~0.base, 4 + main_~#Weight~0.offset, 4);call write~init~int(2, main_~#Weight~0.base, 8 + main_~#Weight~0.offset, 4);call write~init~int(3, main_~#Weight~0.base, 12 + main_~#Weight~0.offset, 4);call write~init~int(4, main_~#Weight~0.base, 16 + main_~#Weight~0.offset, 4);call write~init~int(5, main_~#Weight~0.base, 20 + main_~#Weight~0.offset, 4);call write~init~int(6, main_~#Weight~0.base, 24 + main_~#Weight~0.offset, 4);call write~init~int(7, main_~#Weight~0.base, 28 + main_~#Weight~0.offset, 4);call write~init~int(8, main_~#Weight~0.base, 32 + main_~#Weight~0.offset, 4);call write~init~int(9, main_~#Weight~0.base, 36 + main_~#Weight~0.offset, 4);call write~init~int(10, main_~#Weight~0.base, 40 + main_~#Weight~0.offset, 4);call write~init~int(11, main_~#Weight~0.base, 44 + main_~#Weight~0.offset, 4);call write~init~int(12, main_~#Weight~0.base, 48 + main_~#Weight~0.offset, 4);call write~init~int(13, main_~#Weight~0.base, 52 + main_~#Weight~0.offset, 4);call write~init~int(14, main_~#Weight~0.base, 56 + main_~#Weight~0.offset, 4);call write~init~int(15, main_~#Weight~0.base, 60 + main_~#Weight~0.offset, 4);call write~init~int(16, main_~#Weight~0.base, 64 + main_~#Weight~0.offset, 4);call write~init~int(17, main_~#Weight~0.base, 68 + main_~#Weight~0.offset, 4);call write~init~int(18, main_~#Weight~0.base, 72 + main_~#Weight~0.offset, 4);call write~init~int(19, main_~#Weight~0.base, 76 + main_~#Weight~0.offset, 4);call main_~#distance~0.base, main_~#distance~0.offset := #Ultimate.allocOnStack(20);havoc main_~x~0;havoc main_~y~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 22634#L25-3 assume !!(main_~i~0 < main_~nodecount~0); 22632#L26 assume main_~i~0 == main_~source~0;call write~int(0, main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~i~0, 4); 22633#L25-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 22657#L25-3 assume !!(main_~i~0 < main_~nodecount~0); 22658#L26 assume !(main_~i~0 == main_~source~0);call write~int(~INFINITY~0, main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~i~0, 4); 22665#L25-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 22664#L25-3 assume !(main_~i~0 < main_~nodecount~0); 22652#L25-4 main_~i~0 := 0; 22646#L34-3 assume !!(main_~i~0 < main_~nodecount~0);main_~j~0 := 0; 22647#L36-3 assume !!(main_~j~0 < main_~edgecount~0);call main_#t~mem6 := read~int(main_~#Dest~0.base, main_~#Dest~0.offset + 4 * main_~j~0, 4);main_~x~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#Source~0.base, main_~#Source~0.offset + 4 * main_~j~0, 4);main_~y~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem10 := read~int(main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~x~0, 4);call main_#t~mem8 := read~int(main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~y~0, 4);call main_#t~mem9 := read~int(main_~#Weight~0.base, main_~#Weight~0.offset + 4 * main_~j~0, 4); 22641#L40 assume !(main_#t~mem10 > main_#t~mem8 + main_#t~mem9);havoc main_#t~mem9;havoc main_#t~mem8;havoc main_#t~mem10; 22642#L36-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 22671#L36-3 assume !(main_~j~0 < main_~edgecount~0); 22669#L34-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 22666#L34-3 assume !!(main_~i~0 < main_~nodecount~0);main_~j~0 := 0; 22660#L36-3 [2019-11-15 23:52:21,454 INFO L793 eck$LassoCheckResult]: Loop: 22660#L36-3 assume !!(main_~j~0 < main_~edgecount~0);call main_#t~mem6 := read~int(main_~#Dest~0.base, main_~#Dest~0.offset + 4 * main_~j~0, 4);main_~x~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#Source~0.base, main_~#Source~0.offset + 4 * main_~j~0, 4);main_~y~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem10 := read~int(main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~x~0, 4);call main_#t~mem8 := read~int(main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~y~0, 4);call main_#t~mem9 := read~int(main_~#Weight~0.base, main_~#Weight~0.offset + 4 * main_~j~0, 4); 22639#L40 assume main_#t~mem10 > main_#t~mem8 + main_#t~mem9;havoc main_#t~mem9;havoc main_#t~mem8;havoc main_#t~mem10;call write~int(-1, main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~x~0, 4); 22640#L36-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 22660#L36-3 [2019-11-15 23:52:21,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:21,455 INFO L82 PathProgramCache]: Analyzing trace with hash -76904675, now seen corresponding path program 1 times [2019-11-15 23:52:21,455 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:21,455 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405759612] [2019-11-15 23:52:21,455 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:21,455 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:21,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:21,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:21,815 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 47 [2019-11-15 23:52:21,978 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 46 [2019-11-15 23:52:22,101 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 46 [2019-11-15 23:52:22,344 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:22,344 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405759612] [2019-11-15 23:52:22,345 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943274760] [2019-11-15 23:52:22,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7fb7c2f0-0b38-4f63-9fff-74ca34e2482b/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:22,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:22,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-15 23:52:22,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:22,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:22,508 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:22,509 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-11-15 23:52:22,509 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:22,530 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:22,530 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:22,530 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:65, output treesize:55 [2019-11-15 23:52:22,589 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:22,589 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 66 [2019-11-15 23:52:22,590 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:22,647 INFO L567 ElimStorePlain]: treesize reduction 40, result has 62.3 percent of original size [2019-11-15 23:52:22,647 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:22,648 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:70, output treesize:66 [2019-11-15 23:52:22,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:22,750 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:22,751 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 74 [2019-11-15 23:52:22,752 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:22,815 INFO L567 ElimStorePlain]: treesize reduction 40, result has 61.9 percent of original size [2019-11-15 23:52:22,815 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:22,816 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:69, output treesize:62 [2019-11-15 23:52:22,905 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:22,944 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:22,945 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 8 case distinctions, treesize of input 78 treesize of output 115 [2019-11-15 23:52:22,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:22,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:22,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:22,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:22,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:22,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:22,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:22,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:22,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:22,955 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:23,006 INFO L567 ElimStorePlain]: treesize reduction 68, result has 39.8 percent of original size [2019-11-15 23:52:23,007 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:23,007 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:100, output treesize:10 [2019-11-15 23:52:23,029 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:23,029 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:52:23,029 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-11-15 23:52:23,029 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775519996] [2019-11-15 23:52:23,030 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:52:23,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:23,030 INFO L82 PathProgramCache]: Analyzing trace with hash 76562, now seen corresponding path program 5 times [2019-11-15 23:52:23,030 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:23,030 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367523345] [2019-11-15 23:52:23,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:23,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:23,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:23,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:23,040 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:52:23,222 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:23,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 23:52:23,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:52:23,222 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. cyclomatic complexity: 22 Second operand 16 states. [2019-11-15 23:52:23,727 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 47 [2019-11-15 23:52:24,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:24,512 INFO L93 Difference]: Finished difference Result 87 states and 111 transitions. [2019-11-15 23:52:24,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 23:52:24,512 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 111 transitions. [2019-11-15 23:52:24,513 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-11-15 23:52:24,515 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 87 states and 111 transitions. [2019-11-15 23:52:24,515 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2019-11-15 23:52:24,515 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-11-15 23:52:24,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 111 transitions. [2019-11-15 23:52:24,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:52:24,515 INFO L688 BuchiCegarLoop]: Abstraction has 87 states and 111 transitions. [2019-11-15 23:52:24,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 111 transitions. [2019-11-15 23:52:24,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 50. [2019-11-15 23:52:24,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-15 23:52:24,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2019-11-15 23:52:24,519 INFO L711 BuchiCegarLoop]: Abstraction has 50 states and 67 transitions. [2019-11-15 23:52:24,520 INFO L591 BuchiCegarLoop]: Abstraction has 50 states and 67 transitions. [2019-11-15 23:52:24,520 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-15 23:52:24,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 67 transitions. [2019-11-15 23:52:24,520 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 23:52:24,520 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:52:24,520 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:52:24,521 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:24,521 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:52:24,521 INFO L791 eck$LassoCheckResult]: Stem: 22878#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; 22872#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~post3, main_#t~mem6, main_#t~mem7, main_#t~mem10, main_#t~mem8, main_#t~mem9, main_#t~post5, main_#t~post4, main_#t~mem12, main_#t~mem13, main_#t~mem16, main_#t~mem14, main_#t~mem15, main_#t~post11, main_#t~mem18, main_#t~post17, main_~nodecount~0, main_~edgecount~0, main_~source~0, main_~#Source~0.base, main_~#Source~0.offset, main_~#Dest~0.base, main_~#Dest~0.offset, main_~#Weight~0.base, main_~#Weight~0.offset, main_~#distance~0.base, main_~#distance~0.offset, main_~x~0, main_~y~0, main_~i~0, main_~j~0;main_~nodecount~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~edgecount~0 := main_#t~nondet2;havoc main_#t~nondet2; 22853#L15 assume !!(0 <= main_~nodecount~0 && main_~nodecount~0 <= 4); 22854#L16 assume !!(0 <= main_~edgecount~0 && main_~edgecount~0 <= 19);main_~source~0 := 0;call main_~#Source~0.base, main_~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, main_~#Source~0.base, main_~#Source~0.offset, 4);call write~init~int(4, main_~#Source~0.base, 4 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 8 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 12 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 16 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 20 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 24 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 28 + main_~#Source~0.offset, 4);call write~init~int(4, main_~#Source~0.base, 32 + main_~#Source~0.offset, 4);call write~init~int(4, main_~#Source~0.base, 36 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 40 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 44 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 48 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 52 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 56 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 60 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 64 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 68 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 72 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 76 + main_~#Source~0.offset, 4);call main_~#Dest~0.base, main_~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, main_~#Dest~0.base, main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 4 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 8 + main_~#Dest~0.offset, 4);call write~init~int(1, main_~#Dest~0.base, 12 + main_~#Dest~0.offset, 4);call write~init~int(1, main_~#Dest~0.base, 16 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 20 + main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 24 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 28 + main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 32 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 36 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 40 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 44 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 48 + main_~#Dest~0.offset, 4);call write~init~int(2, main_~#Dest~0.base, 52 + main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 56 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 60 + main_~#Dest~0.offset, 4);call write~init~int(2, main_~#Dest~0.base, 64 + main_~#Dest~0.offset, 4);call write~init~int(1, main_~#Dest~0.base, 68 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 72 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 76 + main_~#Dest~0.offset, 4);call main_~#Weight~0.base, main_~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, main_~#Weight~0.base, main_~#Weight~0.offset, 4);call write~init~int(1, main_~#Weight~0.base, 4 + main_~#Weight~0.offset, 4);call write~init~int(2, main_~#Weight~0.base, 8 + main_~#Weight~0.offset, 4);call write~init~int(3, main_~#Weight~0.base, 12 + main_~#Weight~0.offset, 4);call write~init~int(4, main_~#Weight~0.base, 16 + main_~#Weight~0.offset, 4);call write~init~int(5, main_~#Weight~0.base, 20 + main_~#Weight~0.offset, 4);call write~init~int(6, main_~#Weight~0.base, 24 + main_~#Weight~0.offset, 4);call write~init~int(7, main_~#Weight~0.base, 28 + main_~#Weight~0.offset, 4);call write~init~int(8, main_~#Weight~0.base, 32 + main_~#Weight~0.offset, 4);call write~init~int(9, main_~#Weight~0.base, 36 + main_~#Weight~0.offset, 4);call write~init~int(10, main_~#Weight~0.base, 40 + main_~#Weight~0.offset, 4);call write~init~int(11, main_~#Weight~0.base, 44 + main_~#Weight~0.offset, 4);call write~init~int(12, main_~#Weight~0.base, 48 + main_~#Weight~0.offset, 4);call write~init~int(13, main_~#Weight~0.base, 52 + main_~#Weight~0.offset, 4);call write~init~int(14, main_~#Weight~0.base, 56 + main_~#Weight~0.offset, 4);call write~init~int(15, main_~#Weight~0.base, 60 + main_~#Weight~0.offset, 4);call write~init~int(16, main_~#Weight~0.base, 64 + main_~#Weight~0.offset, 4);call write~init~int(17, main_~#Weight~0.base, 68 + main_~#Weight~0.offset, 4);call write~init~int(18, main_~#Weight~0.base, 72 + main_~#Weight~0.offset, 4);call write~init~int(19, main_~#Weight~0.base, 76 + main_~#Weight~0.offset, 4);call main_~#distance~0.base, main_~#distance~0.offset := #Ultimate.allocOnStack(20);havoc main_~x~0;havoc main_~y~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 22857#L25-3 assume !!(main_~i~0 < main_~nodecount~0); 22881#L26 assume main_~i~0 == main_~source~0;call write~int(0, main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~i~0, 4); 22902#L25-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 22882#L25-3 assume !!(main_~i~0 < main_~nodecount~0); 22855#L26 assume !(main_~i~0 == main_~source~0);call write~int(~INFINITY~0, main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~i~0, 4); 22856#L25-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 22885#L25-3 assume !(main_~i~0 < main_~nodecount~0); 22898#L25-4 main_~i~0 := 0; 22868#L34-3 assume !!(main_~i~0 < main_~nodecount~0);main_~j~0 := 0; 22869#L36-3 assume !!(main_~j~0 < main_~edgecount~0);call main_#t~mem6 := read~int(main_~#Dest~0.base, main_~#Dest~0.offset + 4 * main_~j~0, 4);main_~x~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#Source~0.base, main_~#Source~0.offset + 4 * main_~j~0, 4);main_~y~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem10 := read~int(main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~x~0, 4);call main_#t~mem8 := read~int(main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~y~0, 4);call main_#t~mem9 := read~int(main_~#Weight~0.base, main_~#Weight~0.offset + 4 * main_~j~0, 4); 22864#L40 assume main_#t~mem10 > main_#t~mem8 + main_#t~mem9;havoc main_#t~mem9;havoc main_#t~mem8;havoc main_#t~mem10;call write~int(-1, main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~x~0, 4); 22865#L36-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 22886#L36-3 assume !(main_~j~0 < main_~edgecount~0); 22891#L34-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 22887#L34-3 assume !!(main_~i~0 < main_~nodecount~0);main_~j~0 := 0; 22883#L36-3 [2019-11-15 23:52:24,521 INFO L793 eck$LassoCheckResult]: Loop: 22883#L36-3 assume !!(main_~j~0 < main_~edgecount~0);call main_#t~mem6 := read~int(main_~#Dest~0.base, main_~#Dest~0.offset + 4 * main_~j~0, 4);main_~x~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#Source~0.base, main_~#Source~0.offset + 4 * main_~j~0, 4);main_~y~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem10 := read~int(main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~x~0, 4);call main_#t~mem8 := read~int(main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~y~0, 4);call main_#t~mem9 := read~int(main_~#Weight~0.base, main_~#Weight~0.offset + 4 * main_~j~0, 4); 22862#L40 assume main_#t~mem10 > main_#t~mem8 + main_#t~mem9;havoc main_#t~mem9;havoc main_#t~mem8;havoc main_#t~mem10;call write~int(-1, main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~x~0, 4); 22863#L36-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 22883#L36-3 [2019-11-15 23:52:24,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:24,521 INFO L82 PathProgramCache]: Analyzing trace with hash -78751717, now seen corresponding path program 2 times [2019-11-15 23:52:24,522 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:24,522 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416588867] [2019-11-15 23:52:24,522 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:24,522 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:24,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:24,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:24,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:24,578 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:52:24,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:24,579 INFO L82 PathProgramCache]: Analyzing trace with hash 76562, now seen corresponding path program 6 times [2019-11-15 23:52:24,579 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:24,579 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603682687] [2019-11-15 23:52:24,579 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:24,580 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:24,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:24,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:24,587 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:52:24,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:24,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1040210760, now seen corresponding path program 3 times [2019-11-15 23:52:24,588 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:24,588 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406712524] [2019-11-15 23:52:24,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:24,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:24,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:24,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:24,833 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2019-11-15 23:52:24,982 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 39 [2019-11-15 23:52:25,161 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 44 [2019-11-15 23:52:25,432 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 42 [2019-11-15 23:52:25,656 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 52 [2019-11-15 23:52:25,829 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 48 [2019-11-15 23:52:26,097 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 52 [2019-11-15 23:52:26,162 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:26,163 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406712524] [2019-11-15 23:52:26,163 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387834153] [2019-11-15 23:52:26,163 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7fb7c2f0-0b38-4f63-9fff-74ca34e2482b/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:26,286 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-15 23:52:26,286 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:52:26,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-15 23:52:26,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:26,301 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2019-11-15 23:52:26,301 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:26,329 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:26,329 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:26,330 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:51, output treesize:49 [2019-11-15 23:52:26,386 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:26,386 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 66 [2019-11-15 23:52:26,387 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:26,425 INFO L567 ElimStorePlain]: treesize reduction 44, result has 56.0 percent of original size [2019-11-15 23:52:26,425 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:26,425 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:64, output treesize:56 [2019-11-15 23:52:26,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:26,507 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:26,508 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 84 [2019-11-15 23:52:26,509 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:26,549 INFO L567 ElimStorePlain]: treesize reduction 64, result has 49.6 percent of original size [2019-11-15 23:52:26,550 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:26,550 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:67, output treesize:49 [2019-11-15 23:52:26,689 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:26,689 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 127 [2019-11-15 23:52:26,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:26,695 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:26,753 INFO L567 ElimStorePlain]: treesize reduction 269, result has 19.9 percent of original size [2019-11-15 23:52:26,753 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:26,753 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:68, output treesize:66 [2019-11-15 23:52:26,925 INFO L341 Elim1Store]: treesize reduction 24, result has 70.4 percent of original size [2019-11-15 23:52:26,925 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 9 case distinctions, treesize of input 77 treesize of output 93 [2019-11-15 23:52:26,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:26,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:26,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:26,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:26,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:26,930 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:26,962 INFO L567 ElimStorePlain]: treesize reduction 18, result has 67.3 percent of original size [2019-11-15 23:52:26,963 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:26,963 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:85, output treesize:16 [2019-11-15 23:52:26,990 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:26,990 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:52:26,990 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2019-11-15 23:52:26,990 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015569976] [2019-11-15 23:52:27,102 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:27,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-15 23:52:27,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2019-11-15 23:52:27,103 INFO L87 Difference]: Start difference. First operand 50 states and 67 transitions. cyclomatic complexity: 24 Second operand 21 states. [2019-11-15 23:52:30,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:30,177 INFO L93 Difference]: Finished difference Result 322 states and 406 transitions. [2019-11-15 23:52:30,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-15 23:52:30,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 322 states and 406 transitions. [2019-11-15 23:52:30,180 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 51 [2019-11-15 23:52:30,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 322 states to 322 states and 406 transitions. [2019-11-15 23:52:30,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 179 [2019-11-15 23:52:30,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 179 [2019-11-15 23:52:30,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 322 states and 406 transitions. [2019-11-15 23:52:30,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:52:30,184 INFO L688 BuchiCegarLoop]: Abstraction has 322 states and 406 transitions. [2019-11-15 23:52:30,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states and 406 transitions. [2019-11-15 23:52:30,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 77. [2019-11-15 23:52:30,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-15 23:52:30,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 112 transitions. [2019-11-15 23:52:30,191 INFO L711 BuchiCegarLoop]: Abstraction has 77 states and 112 transitions. [2019-11-15 23:52:30,191 INFO L591 BuchiCegarLoop]: Abstraction has 77 states and 112 transitions. [2019-11-15 23:52:30,192 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-15 23:52:30,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 112 transitions. [2019-11-15 23:52:30,192 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 23:52:30,192 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:52:30,193 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:52:30,193 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:30,193 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:52:30,194 INFO L791 eck$LassoCheckResult]: Stem: 23395#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; 23388#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~post3, main_#t~mem6, main_#t~mem7, main_#t~mem10, main_#t~mem8, main_#t~mem9, main_#t~post5, main_#t~post4, main_#t~mem12, main_#t~mem13, main_#t~mem16, main_#t~mem14, main_#t~mem15, main_#t~post11, main_#t~mem18, main_#t~post17, main_~nodecount~0, main_~edgecount~0, main_~source~0, main_~#Source~0.base, main_~#Source~0.offset, main_~#Dest~0.base, main_~#Dest~0.offset, main_~#Weight~0.base, main_~#Weight~0.offset, main_~#distance~0.base, main_~#distance~0.offset, main_~x~0, main_~y~0, main_~i~0, main_~j~0;main_~nodecount~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~edgecount~0 := main_#t~nondet2;havoc main_#t~nondet2; 23368#L15 assume !!(0 <= main_~nodecount~0 && main_~nodecount~0 <= 4); 23369#L16 assume !!(0 <= main_~edgecount~0 && main_~edgecount~0 <= 19);main_~source~0 := 0;call main_~#Source~0.base, main_~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, main_~#Source~0.base, main_~#Source~0.offset, 4);call write~init~int(4, main_~#Source~0.base, 4 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 8 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 12 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 16 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 20 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 24 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 28 + main_~#Source~0.offset, 4);call write~init~int(4, main_~#Source~0.base, 32 + main_~#Source~0.offset, 4);call write~init~int(4, main_~#Source~0.base, 36 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 40 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 44 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 48 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 52 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 56 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 60 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 64 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 68 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 72 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 76 + main_~#Source~0.offset, 4);call main_~#Dest~0.base, main_~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, main_~#Dest~0.base, main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 4 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 8 + main_~#Dest~0.offset, 4);call write~init~int(1, main_~#Dest~0.base, 12 + main_~#Dest~0.offset, 4);call write~init~int(1, main_~#Dest~0.base, 16 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 20 + main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 24 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 28 + main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 32 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 36 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 40 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 44 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 48 + main_~#Dest~0.offset, 4);call write~init~int(2, main_~#Dest~0.base, 52 + main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 56 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 60 + main_~#Dest~0.offset, 4);call write~init~int(2, main_~#Dest~0.base, 64 + main_~#Dest~0.offset, 4);call write~init~int(1, main_~#Dest~0.base, 68 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 72 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 76 + main_~#Dest~0.offset, 4);call main_~#Weight~0.base, main_~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, main_~#Weight~0.base, main_~#Weight~0.offset, 4);call write~init~int(1, main_~#Weight~0.base, 4 + main_~#Weight~0.offset, 4);call write~init~int(2, main_~#Weight~0.base, 8 + main_~#Weight~0.offset, 4);call write~init~int(3, main_~#Weight~0.base, 12 + main_~#Weight~0.offset, 4);call write~init~int(4, main_~#Weight~0.base, 16 + main_~#Weight~0.offset, 4);call write~init~int(5, main_~#Weight~0.base, 20 + main_~#Weight~0.offset, 4);call write~init~int(6, main_~#Weight~0.base, 24 + main_~#Weight~0.offset, 4);call write~init~int(7, main_~#Weight~0.base, 28 + main_~#Weight~0.offset, 4);call write~init~int(8, main_~#Weight~0.base, 32 + main_~#Weight~0.offset, 4);call write~init~int(9, main_~#Weight~0.base, 36 + main_~#Weight~0.offset, 4);call write~init~int(10, main_~#Weight~0.base, 40 + main_~#Weight~0.offset, 4);call write~init~int(11, main_~#Weight~0.base, 44 + main_~#Weight~0.offset, 4);call write~init~int(12, main_~#Weight~0.base, 48 + main_~#Weight~0.offset, 4);call write~init~int(13, main_~#Weight~0.base, 52 + main_~#Weight~0.offset, 4);call write~init~int(14, main_~#Weight~0.base, 56 + main_~#Weight~0.offset, 4);call write~init~int(15, main_~#Weight~0.base, 60 + main_~#Weight~0.offset, 4);call write~init~int(16, main_~#Weight~0.base, 64 + main_~#Weight~0.offset, 4);call write~init~int(17, main_~#Weight~0.base, 68 + main_~#Weight~0.offset, 4);call write~init~int(18, main_~#Weight~0.base, 72 + main_~#Weight~0.offset, 4);call write~init~int(19, main_~#Weight~0.base, 76 + main_~#Weight~0.offset, 4);call main_~#distance~0.base, main_~#distance~0.offset := #Ultimate.allocOnStack(20);havoc main_~x~0;havoc main_~y~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 23372#L25-3 assume !!(main_~i~0 < main_~nodecount~0); 23398#L26 assume main_~i~0 == main_~source~0;call write~int(0, main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~i~0, 4); 23408#L25-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 23399#L25-3 assume !!(main_~i~0 < main_~nodecount~0); 23370#L26 assume !(main_~i~0 == main_~source~0);call write~int(~INFINITY~0, main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~i~0, 4); 23371#L25-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 23405#L25-3 assume !(main_~i~0 < main_~nodecount~0); 23406#L25-4 main_~i~0 := 0; 23384#L34-3 assume !!(main_~i~0 < main_~nodecount~0);main_~j~0 := 0; 23385#L36-3 assume !!(main_~j~0 < main_~edgecount~0);call main_#t~mem6 := read~int(main_~#Dest~0.base, main_~#Dest~0.offset + 4 * main_~j~0, 4);main_~x~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#Source~0.base, main_~#Source~0.offset + 4 * main_~j~0, 4);main_~y~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem10 := read~int(main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~x~0, 4);call main_#t~mem8 := read~int(main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~y~0, 4);call main_#t~mem9 := read~int(main_~#Weight~0.base, main_~#Weight~0.offset + 4 * main_~j~0, 4); 23418#L40 assume main_#t~mem10 > main_#t~mem8 + main_#t~mem9;havoc main_#t~mem9;havoc main_#t~mem8;havoc main_#t~mem10;call write~int(-1, main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~x~0, 4); 23417#L36-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 23415#L36-3 assume !(main_~j~0 < main_~edgecount~0); 23413#L34-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 23410#L34-3 assume !!(main_~i~0 < main_~nodecount~0);main_~j~0 := 0; 23409#L36-3 assume !!(main_~j~0 < main_~edgecount~0);call main_#t~mem6 := read~int(main_~#Dest~0.base, main_~#Dest~0.offset + 4 * main_~j~0, 4);main_~x~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#Source~0.base, main_~#Source~0.offset + 4 * main_~j~0, 4);main_~y~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem10 := read~int(main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~x~0, 4);call main_#t~mem8 := read~int(main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~y~0, 4);call main_#t~mem9 := read~int(main_~#Weight~0.base, main_~#Weight~0.offset + 4 * main_~j~0, 4); 23377#L40 assume !(main_#t~mem10 > main_#t~mem8 + main_#t~mem9);havoc main_#t~mem9;havoc main_#t~mem8;havoc main_#t~mem10; 23378#L36-2 [2019-11-15 23:52:30,194 INFO L793 eck$LassoCheckResult]: Loop: 23378#L36-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 23400#L36-3 assume !!(main_~j~0 < main_~edgecount~0);call main_#t~mem6 := read~int(main_~#Dest~0.base, main_~#Dest~0.offset + 4 * main_~j~0, 4);main_~x~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#Source~0.base, main_~#Source~0.offset + 4 * main_~j~0, 4);main_~y~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem10 := read~int(main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~x~0, 4);call main_#t~mem8 := read~int(main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~y~0, 4);call main_#t~mem9 := read~int(main_~#Weight~0.base, main_~#Weight~0.offset + 4 * main_~j~0, 4); 23401#L40 assume main_#t~mem10 > main_#t~mem8 + main_#t~mem9;havoc main_#t~mem9;havoc main_#t~mem8;havoc main_#t~mem10;call write~int(-1, main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~x~0, 4); 23378#L36-2 [2019-11-15 23:52:30,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:30,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1629012800, now seen corresponding path program 1 times [2019-11-15 23:52:30,194 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:30,195 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994852817] [2019-11-15 23:52:30,195 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:30,195 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:30,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:30,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:30,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:30,259 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:52:30,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:30,260 INFO L82 PathProgramCache]: Analyzing trace with hash 83192, now seen corresponding path program 7 times [2019-11-15 23:52:30,260 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:30,260 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489550037] [2019-11-15 23:52:30,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:30,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:30,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:30,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:30,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:30,268 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:52:30,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:30,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1084900697, now seen corresponding path program 2 times [2019-11-15 23:52:30,268 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:30,269 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062553533] [2019-11-15 23:52:30,269 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:30,269 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:30,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:30,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:30,331 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 23:52:30,331 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062553533] [2019-11-15 23:52:30,331 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059135505] [2019-11-15 23:52:30,331 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7fb7c2f0-0b38-4f63-9fff-74ca34e2482b/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:30,489 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 23:52:30,489 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:52:30,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:52:30,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:30,555 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 23:52:30,556 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:52:30,556 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-11-15 23:52:30,556 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612742793] [2019-11-15 23:52:30,660 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-11-15 23:52:30,749 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:30,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 23:52:30,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:52:30,750 INFO L87 Difference]: Start difference. First operand 77 states and 112 transitions. cyclomatic complexity: 46 Second operand 13 states. [2019-11-15 23:52:30,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:30,940 INFO L93 Difference]: Finished difference Result 163 states and 233 transitions. [2019-11-15 23:52:30,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:52:30,945 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 163 states and 233 transitions. [2019-11-15 23:52:30,946 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 19 [2019-11-15 23:52:30,948 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 163 states to 157 states and 219 transitions. [2019-11-15 23:52:30,948 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2019-11-15 23:52:30,948 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2019-11-15 23:52:30,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 157 states and 219 transitions. [2019-11-15 23:52:30,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:52:30,949 INFO L688 BuchiCegarLoop]: Abstraction has 157 states and 219 transitions. [2019-11-15 23:52:30,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states and 219 transitions. [2019-11-15 23:52:30,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 112. [2019-11-15 23:52:30,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-15 23:52:30,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 161 transitions. [2019-11-15 23:52:30,956 INFO L711 BuchiCegarLoop]: Abstraction has 112 states and 161 transitions. [2019-11-15 23:52:30,956 INFO L591 BuchiCegarLoop]: Abstraction has 112 states and 161 transitions. [2019-11-15 23:52:30,956 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-15 23:52:30,956 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 161 transitions. [2019-11-15 23:52:30,957 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 23:52:30,957 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:52:30,958 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:52:30,958 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:30,958 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:52:30,959 INFO L791 eck$LassoCheckResult]: Stem: 23733#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; 23726#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~post3, main_#t~mem6, main_#t~mem7, main_#t~mem10, main_#t~mem8, main_#t~mem9, main_#t~post5, main_#t~post4, main_#t~mem12, main_#t~mem13, main_#t~mem16, main_#t~mem14, main_#t~mem15, main_#t~post11, main_#t~mem18, main_#t~post17, main_~nodecount~0, main_~edgecount~0, main_~source~0, main_~#Source~0.base, main_~#Source~0.offset, main_~#Dest~0.base, main_~#Dest~0.offset, main_~#Weight~0.base, main_~#Weight~0.offset, main_~#distance~0.base, main_~#distance~0.offset, main_~x~0, main_~y~0, main_~i~0, main_~j~0;main_~nodecount~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~edgecount~0 := main_#t~nondet2;havoc main_#t~nondet2; 23707#L15 assume !!(0 <= main_~nodecount~0 && main_~nodecount~0 <= 4); 23708#L16 assume !!(0 <= main_~edgecount~0 && main_~edgecount~0 <= 19);main_~source~0 := 0;call main_~#Source~0.base, main_~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, main_~#Source~0.base, main_~#Source~0.offset, 4);call write~init~int(4, main_~#Source~0.base, 4 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 8 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 12 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 16 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 20 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 24 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 28 + main_~#Source~0.offset, 4);call write~init~int(4, main_~#Source~0.base, 32 + main_~#Source~0.offset, 4);call write~init~int(4, main_~#Source~0.base, 36 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 40 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 44 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 48 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 52 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 56 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 60 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 64 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 68 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 72 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 76 + main_~#Source~0.offset, 4);call main_~#Dest~0.base, main_~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, main_~#Dest~0.base, main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 4 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 8 + main_~#Dest~0.offset, 4);call write~init~int(1, main_~#Dest~0.base, 12 + main_~#Dest~0.offset, 4);call write~init~int(1, main_~#Dest~0.base, 16 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 20 + main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 24 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 28 + main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 32 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 36 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 40 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 44 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 48 + main_~#Dest~0.offset, 4);call write~init~int(2, main_~#Dest~0.base, 52 + main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 56 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 60 + main_~#Dest~0.offset, 4);call write~init~int(2, main_~#Dest~0.base, 64 + main_~#Dest~0.offset, 4);call write~init~int(1, main_~#Dest~0.base, 68 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 72 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 76 + main_~#Dest~0.offset, 4);call main_~#Weight~0.base, main_~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, main_~#Weight~0.base, main_~#Weight~0.offset, 4);call write~init~int(1, main_~#Weight~0.base, 4 + main_~#Weight~0.offset, 4);call write~init~int(2, main_~#Weight~0.base, 8 + main_~#Weight~0.offset, 4);call write~init~int(3, main_~#Weight~0.base, 12 + main_~#Weight~0.offset, 4);call write~init~int(4, main_~#Weight~0.base, 16 + main_~#Weight~0.offset, 4);call write~init~int(5, main_~#Weight~0.base, 20 + main_~#Weight~0.offset, 4);call write~init~int(6, main_~#Weight~0.base, 24 + main_~#Weight~0.offset, 4);call write~init~int(7, main_~#Weight~0.base, 28 + main_~#Weight~0.offset, 4);call write~init~int(8, main_~#Weight~0.base, 32 + main_~#Weight~0.offset, 4);call write~init~int(9, main_~#Weight~0.base, 36 + main_~#Weight~0.offset, 4);call write~init~int(10, main_~#Weight~0.base, 40 + main_~#Weight~0.offset, 4);call write~init~int(11, main_~#Weight~0.base, 44 + main_~#Weight~0.offset, 4);call write~init~int(12, main_~#Weight~0.base, 48 + main_~#Weight~0.offset, 4);call write~init~int(13, main_~#Weight~0.base, 52 + main_~#Weight~0.offset, 4);call write~init~int(14, main_~#Weight~0.base, 56 + main_~#Weight~0.offset, 4);call write~init~int(15, main_~#Weight~0.base, 60 + main_~#Weight~0.offset, 4);call write~init~int(16, main_~#Weight~0.base, 64 + main_~#Weight~0.offset, 4);call write~init~int(17, main_~#Weight~0.base, 68 + main_~#Weight~0.offset, 4);call write~init~int(18, main_~#Weight~0.base, 72 + main_~#Weight~0.offset, 4);call write~init~int(19, main_~#Weight~0.base, 76 + main_~#Weight~0.offset, 4);call main_~#distance~0.base, main_~#distance~0.offset := #Ultimate.allocOnStack(20);havoc main_~x~0;havoc main_~y~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 23711#L25-3 assume !!(main_~i~0 < main_~nodecount~0); 23736#L26 assume main_~i~0 == main_~source~0;call write~int(0, main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~i~0, 4); 23749#L25-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 23737#L25-3 assume !!(main_~i~0 < main_~nodecount~0); 23709#L26 assume !(main_~i~0 == main_~source~0);call write~int(~INFINITY~0, main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~i~0, 4); 23710#L25-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 23746#L25-3 assume !(main_~i~0 < main_~nodecount~0); 23747#L25-4 main_~i~0 := 0; 23722#L34-3 assume !!(main_~i~0 < main_~nodecount~0);main_~j~0 := 0; 23723#L36-3 assume !(main_~j~0 < main_~edgecount~0); 23801#L34-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 23724#L34-3 assume !!(main_~i~0 < main_~nodecount~0);main_~j~0 := 0; 23725#L36-3 assume !(main_~j~0 < main_~edgecount~0); 23754#L34-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 23753#L34-3 assume !(main_~i~0 < main_~nodecount~0); 23720#L34-4 main_~i~0 := 0; 23721#L46-3 assume !(main_~i~0 < main_~edgecount~0); 23727#L46-4 main_~i~0 := 0; 23728#L56-3 [2019-11-15 23:52:30,959 INFO L793 eck$LassoCheckResult]: Loop: 23728#L56-3 assume !!(main_~i~0 < main_~nodecount~0);call main_#t~mem18 := read~int(main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if main_#t~mem18 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 23712#L6 assume !(0 == __VERIFIER_assert_~cond); 23713#L6-2 havoc main_#t~mem18; 23735#L56-2 main_#t~post17 := main_~i~0;main_~i~0 := 1 + main_#t~post17;havoc main_#t~post17; 23728#L56-3 [2019-11-15 23:52:30,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:30,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1090386247, now seen corresponding path program 1 times [2019-11-15 23:52:30,960 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:30,960 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452900455] [2019-11-15 23:52:30,960 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:30,960 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:30,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:30,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:30,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:30,985 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:52:30,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:30,985 INFO L82 PathProgramCache]: Analyzing trace with hash 3670346, now seen corresponding path program 1 times [2019-11-15 23:52:30,986 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:30,986 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786076689] [2019-11-15 23:52:30,986 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:30,986 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:30,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:30,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:30,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:30,993 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:52:30,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:30,993 INFO L82 PathProgramCache]: Analyzing trace with hash -857215998, now seen corresponding path program 1 times [2019-11-15 23:52:30,993 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:30,994 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625975758] [2019-11-15 23:52:30,994 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:30,994 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:30,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:31,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:31,025 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:52:32,713 WARN L191 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 355 DAG size of output: 327 [2019-11-15 23:52:33,242 WARN L191 SmtUtils]: Spent 525.00 ms on a formula simplification that was a NOOP. DAG size: 293 [2019-11-15 23:52:33,245 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:52:33,245 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:52:33,245 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:52:33,245 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:52:33,246 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:52:33,246 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:52:33,246 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:52:33,246 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:52:33,246 INFO L131 ssoRankerPreferences]: Filename of dumped script: eureka_01-1.c_Iteration12_Lasso [2019-11-15 23:52:33,246 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:52:33,246 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:52:33,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:44,436 WARN L191 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 66 [2019-11-15 23:52:44,767 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 32 [2019-11-15 23:52:44,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:44,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:44,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:44,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:44,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:44,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:44,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:44,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:44,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:44,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:44,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:44,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:44,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:44,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:44,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:44,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:44,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:44,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:44,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:44,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:44,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:44,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:44,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:44,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:44,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:44,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:45,373 WARN L191 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-15 23:52:45,477 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:52:45,477 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:52:45,478 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-11-15 23:52:45,478 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,478 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:45,478 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,479 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,479 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,479 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:45,479 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:45,479 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,480 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-11-15 23:52:45,480 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,480 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:45,480 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,480 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,480 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,481 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:45,481 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:45,481 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,481 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-11-15 23:52:45,481 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,482 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:45,482 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,482 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,482 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,482 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:45,482 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:45,482 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,483 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-11-15 23:52:45,483 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,483 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:45,483 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,483 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,483 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,483 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:45,484 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:45,484 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,484 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-11-15 23:52:45,484 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,484 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:45,485 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,485 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,485 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,485 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:45,485 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:45,485 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,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-11-15 23:52:45,486 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,486 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:45,486 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,486 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,486 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,486 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:45,486 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:45,487 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,487 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-11-15 23:52:45,487 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,487 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:45,487 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,487 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,487 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,488 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:45,488 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:45,488 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,490 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-11-15 23:52:45,491 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,491 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:45,491 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,491 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,491 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,491 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:45,492 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:45,492 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,492 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-11-15 23:52:45,493 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,493 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:45,493 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,493 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,493 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,493 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:45,494 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:45,494 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,494 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-11-15 23:52:45,495 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,495 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,495 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,495 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,496 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:52:45,496 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:52:45,497 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,497 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-11-15 23:52:45,498 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,498 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:45,498 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,498 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,498 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,499 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:45,499 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:45,499 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,499 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-11-15 23:52:45,500 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,500 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:45,500 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,500 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,500 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,501 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:45,501 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:45,501 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,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-11-15 23:52:45,502 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,502 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:45,502 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,502 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,503 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,503 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:45,503 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:45,503 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,503 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-11-15 23:52:45,504 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,504 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:45,504 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,504 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,505 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,505 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:45,505 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:45,505 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,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-11-15 23:52:45,506 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,506 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,506 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,506 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,507 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:52:45,507 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:52:45,508 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,508 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-11-15 23:52:45,509 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,509 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:45,509 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,509 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,509 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,510 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:45,510 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:45,510 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,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-11-15 23:52:45,511 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,511 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:45,511 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,511 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,511 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,512 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:45,512 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:45,512 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,512 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-11-15 23:52:45,513 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,513 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:45,513 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,513 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,513 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,514 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:45,514 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:45,514 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,515 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-11-15 23:52:45,515 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,515 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:45,515 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,515 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,516 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,516 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:45,516 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:45,516 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,517 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-11-15 23:52:45,517 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,517 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:45,517 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,518 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,518 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,518 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:45,518 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:45,518 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,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-11-15 23:52:45,519 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,519 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:45,520 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,520 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,520 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,520 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:45,520 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:45,521 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,521 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-11-15 23:52:45,521 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,522 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:45,522 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,522 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,522 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,522 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:45,522 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:45,523 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,523 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-11-15 23:52:45,523 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,524 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:45,524 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,524 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,524 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,524 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:45,525 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:45,525 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,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-11-15 23:52:45,526 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,526 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:45,526 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,526 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,526 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,526 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:45,527 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:45,527 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,527 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-11-15 23:52:45,528 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,528 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:45,528 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,528 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,528 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,529 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:45,529 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:45,529 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,529 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-11-15 23:52:45,530 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,530 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:45,530 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,530 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,530 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,531 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:45,531 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:45,531 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,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-11-15 23:52:45,532 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,532 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:45,532 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,532 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,533 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,533 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:45,533 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:45,533 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,534 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-11-15 23:52:45,534 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,534 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:45,535 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,535 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,535 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,535 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:45,535 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:45,536 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,536 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-11-15 23:52:45,536 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,537 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:45,537 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,537 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,537 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,537 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:45,538 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:45,538 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,538 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-11-15 23:52:45,539 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,539 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,539 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,539 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,540 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:52:45,540 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:52:45,541 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,542 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-11-15 23:52:45,542 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,542 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,542 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,543 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,543 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:52:45,543 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:52:45,545 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,545 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-11-15 23:52:45,545 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,546 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:45,546 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,546 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,546 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,547 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:45,547 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:45,547 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,547 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-11-15 23:52:45,548 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,548 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:45,548 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,548 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,549 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,549 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:45,549 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:45,550 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,550 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-11-15 23:52:45,550 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,551 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,551 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,551 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,552 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:52:45,552 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:52:45,554 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,554 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-11-15 23:52:45,555 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,555 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:45,555 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,555 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,556 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,556 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:45,556 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:45,556 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,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-11-15 23:52:45,557 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,557 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,558 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,558 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,558 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:52:45,559 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:52:45,560 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,560 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-11-15 23:52:45,561 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,561 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:45,561 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,561 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,562 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,562 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:45,562 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:45,563 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,563 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-11-15 23:52:45,564 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,564 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:45,564 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,564 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,564 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,565 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:45,565 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:45,565 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,566 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-11-15 23:52:45,566 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,566 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:45,566 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,567 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,567 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,567 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:45,567 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:45,568 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,568 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-11-15 23:52:45,568 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,569 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:45,569 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,569 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,569 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,570 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:45,570 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:45,570 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,571 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-11-15 23:52:45,571 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,571 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:45,571 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,572 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,572 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,572 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:45,572 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:45,573 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,573 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-11-15 23:52:45,573 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,574 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:45,574 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,574 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,574 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,574 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:45,575 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:45,575 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,575 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-11-15 23:52:45,576 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,576 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:45,576 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,576 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,577 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,577 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:45,577 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:45,578 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,578 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-11-15 23:52:45,578 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,579 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:45,579 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,579 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,579 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,579 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:45,580 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:45,580 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,580 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-11-15 23:52:45,581 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,581 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:45,581 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,581 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,582 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,582 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:45,582 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:45,583 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,583 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-11-15 23:52:45,583 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,584 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:45,584 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,584 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,584 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,584 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:45,585 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:45,585 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,585 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-11-15 23:52:45,586 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,586 INFO L202 nArgumentSynthesizer]: 16 stem disjuncts [2019-11-15 23:52:45,586 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,587 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,590 INFO L400 nArgumentSynthesizer]: We have 36 Motzkin's Theorem applications. [2019-11-15 23:52:45,590 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:52:45,606 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,607 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-11-15 23:52:45,607 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,608 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,608 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,608 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,609 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:52:45,609 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:52:45,610 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,611 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-11-15 23:52:45,611 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,611 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,612 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,612 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,612 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:52:45,613 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:52:45,614 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,614 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-11-15 23:52:45,615 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,615 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:45,615 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,616 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,616 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,616 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:45,616 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:45,617 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,617 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-11-15 23:52:45,618 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,618 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:45,618 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,618 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,618 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,619 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:45,619 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:45,619 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,620 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-11-15 23:52:45,620 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,621 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:45,621 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,621 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,621 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,621 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:45,622 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:45,622 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,623 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-11-15 23:52:45,623 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,623 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,624 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,624 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,624 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:52:45,624 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:52:45,626 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,626 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-11-15 23:52:45,627 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,627 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:45,627 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,627 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,627 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,628 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:45,628 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:45,628 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,629 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-11-15 23:52:45,629 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,629 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:45,629 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,630 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,630 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,630 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:45,630 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:45,631 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,631 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-11-15 23:52:45,631 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,632 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:45,632 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,632 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,632 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,632 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:45,633 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:45,633 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,634 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-11-15 23:52:45,634 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,634 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:45,634 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,635 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,635 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,635 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:45,635 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:45,636 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:45,636 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-11-15 23:52:45,637 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:45,637 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:45,637 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:45,637 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:45,638 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:52:45,639 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:52:45,650 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:52:45,658 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-15 23:52:45,659 INFO L444 ModelExtractionUtils]: 17 out of 25 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-11-15 23:52:45,659 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:52:45,660 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:52:45,660 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:52:45,660 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~nodecount~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~nodecount~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-11-15 23:53:22,325 INFO L297 tatePredicateManager]: 1780 out of 1780 supporting invariants were superfluous and have been removed [2019-11-15 23:53:22,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:22,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:22,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:53:22,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:53:22,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:22,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:53:22,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:53:22,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:53:22,385 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 23:53:22,385 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 161 transitions. cyclomatic complexity: 63 Second operand 3 states. [2019-11-15 23:53:22,395 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 112 states and 161 transitions. cyclomatic complexity: 63. Second operand 3 states. Result 116 states and 166 transitions. Complement of second has 4 states. [2019-11-15 23:53:22,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 23:53:22,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:53:22,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2019-11-15 23:53:22,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 22 letters. Loop has 4 letters. [2019-11-15 23:53:22,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:53:22,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 26 letters. Loop has 4 letters. [2019-11-15 23:53:22,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:53:22,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 22 letters. Loop has 8 letters. [2019-11-15 23:53:22,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:53:22,399 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 166 transitions. [2019-11-15 23:53:22,400 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:53:22,401 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 73 states and 98 transitions. [2019-11-15 23:53:22,401 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-15 23:53:22,401 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-15 23:53:22,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 98 transitions. [2019-11-15 23:53:22,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:53:22,402 INFO L688 BuchiCegarLoop]: Abstraction has 73 states and 98 transitions. [2019-11-15 23:53:22,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 98 transitions. [2019-11-15 23:53:22,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 52. [2019-11-15 23:53:22,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-15 23:53:22,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2019-11-15 23:53:22,404 INFO L711 BuchiCegarLoop]: Abstraction has 52 states and 67 transitions. [2019-11-15 23:53:22,404 INFO L591 BuchiCegarLoop]: Abstraction has 52 states and 67 transitions. [2019-11-15 23:53:22,405 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-15 23:53:22,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 67 transitions. [2019-11-15 23:53:22,405 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:53:22,405 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:53:22,405 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:53:22,406 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:53:22,406 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:53:22,406 INFO L791 eck$LassoCheckResult]: Stem: 31171#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; 31167#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~post3, main_#t~mem6, main_#t~mem7, main_#t~mem10, main_#t~mem8, main_#t~mem9, main_#t~post5, main_#t~post4, main_#t~mem12, main_#t~mem13, main_#t~mem16, main_#t~mem14, main_#t~mem15, main_#t~post11, main_#t~mem18, main_#t~post17, main_~nodecount~0, main_~edgecount~0, main_~source~0, main_~#Source~0.base, main_~#Source~0.offset, main_~#Dest~0.base, main_~#Dest~0.offset, main_~#Weight~0.base, main_~#Weight~0.offset, main_~#distance~0.base, main_~#distance~0.offset, main_~x~0, main_~y~0, main_~i~0, main_~j~0;main_~nodecount~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~edgecount~0 := main_#t~nondet2;havoc main_#t~nondet2; 31153#L15 assume !!(0 <= main_~nodecount~0 && main_~nodecount~0 <= 4); 31154#L16 assume !!(0 <= main_~edgecount~0 && main_~edgecount~0 <= 19);main_~source~0 := 0;call main_~#Source~0.base, main_~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, main_~#Source~0.base, main_~#Source~0.offset, 4);call write~init~int(4, main_~#Source~0.base, 4 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 8 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 12 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 16 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 20 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 24 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 28 + main_~#Source~0.offset, 4);call write~init~int(4, main_~#Source~0.base, 32 + main_~#Source~0.offset, 4);call write~init~int(4, main_~#Source~0.base, 36 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 40 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 44 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 48 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 52 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 56 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 60 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 64 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 68 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 72 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 76 + main_~#Source~0.offset, 4);call main_~#Dest~0.base, main_~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, main_~#Dest~0.base, main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 4 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 8 + main_~#Dest~0.offset, 4);call write~init~int(1, main_~#Dest~0.base, 12 + main_~#Dest~0.offset, 4);call write~init~int(1, main_~#Dest~0.base, 16 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 20 + main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 24 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 28 + main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 32 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 36 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 40 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 44 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 48 + main_~#Dest~0.offset, 4);call write~init~int(2, main_~#Dest~0.base, 52 + main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 56 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 60 + main_~#Dest~0.offset, 4);call write~init~int(2, main_~#Dest~0.base, 64 + main_~#Dest~0.offset, 4);call write~init~int(1, main_~#Dest~0.base, 68 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 72 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 76 + main_~#Dest~0.offset, 4);call main_~#Weight~0.base, main_~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, main_~#Weight~0.base, main_~#Weight~0.offset, 4);call write~init~int(1, main_~#Weight~0.base, 4 + main_~#Weight~0.offset, 4);call write~init~int(2, main_~#Weight~0.base, 8 + main_~#Weight~0.offset, 4);call write~init~int(3, main_~#Weight~0.base, 12 + main_~#Weight~0.offset, 4);call write~init~int(4, main_~#Weight~0.base, 16 + main_~#Weight~0.offset, 4);call write~init~int(5, main_~#Weight~0.base, 20 + main_~#Weight~0.offset, 4);call write~init~int(6, main_~#Weight~0.base, 24 + main_~#Weight~0.offset, 4);call write~init~int(7, main_~#Weight~0.base, 28 + main_~#Weight~0.offset, 4);call write~init~int(8, main_~#Weight~0.base, 32 + main_~#Weight~0.offset, 4);call write~init~int(9, main_~#Weight~0.base, 36 + main_~#Weight~0.offset, 4);call write~init~int(10, main_~#Weight~0.base, 40 + main_~#Weight~0.offset, 4);call write~init~int(11, main_~#Weight~0.base, 44 + main_~#Weight~0.offset, 4);call write~init~int(12, main_~#Weight~0.base, 48 + main_~#Weight~0.offset, 4);call write~init~int(13, main_~#Weight~0.base, 52 + main_~#Weight~0.offset, 4);call write~init~int(14, main_~#Weight~0.base, 56 + main_~#Weight~0.offset, 4);call write~init~int(15, main_~#Weight~0.base, 60 + main_~#Weight~0.offset, 4);call write~init~int(16, main_~#Weight~0.base, 64 + main_~#Weight~0.offset, 4);call write~init~int(17, main_~#Weight~0.base, 68 + main_~#Weight~0.offset, 4);call write~init~int(18, main_~#Weight~0.base, 72 + main_~#Weight~0.offset, 4);call write~init~int(19, main_~#Weight~0.base, 76 + main_~#Weight~0.offset, 4);call main_~#distance~0.base, main_~#distance~0.offset := #Ultimate.allocOnStack(20);havoc main_~x~0;havoc main_~y~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 31157#L25-3 assume !!(main_~i~0 < main_~nodecount~0); 31155#L26 assume main_~i~0 == main_~source~0;call write~int(0, main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~i~0, 4); 31156#L25-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 31172#L25-3 assume !!(main_~i~0 < main_~nodecount~0); 31173#L26 assume !(main_~i~0 == main_~source~0);call write~int(~INFINITY~0, main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~i~0, 4); 31184#L25-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 31182#L25-3 assume !(main_~i~0 < main_~nodecount~0); 31168#L25-4 main_~i~0 := 0; 31169#L34-3 assume !!(main_~i~0 < main_~nodecount~0);main_~j~0 := 0; 31202#L36-3 assume !!(main_~j~0 < main_~edgecount~0);call main_#t~mem6 := read~int(main_~#Dest~0.base, main_~#Dest~0.offset + 4 * main_~j~0, 4);main_~x~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#Source~0.base, main_~#Source~0.offset + 4 * main_~j~0, 4);main_~y~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem10 := read~int(main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~x~0, 4);call main_#t~mem8 := read~int(main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~y~0, 4);call main_#t~mem9 := read~int(main_~#Weight~0.base, main_~#Weight~0.offset + 4 * main_~j~0, 4); 31193#L40 assume main_#t~mem10 > main_#t~mem8 + main_#t~mem9;havoc main_#t~mem9;havoc main_#t~mem8;havoc main_#t~mem10;call write~int(-1, main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~x~0, 4); 31192#L36-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 31191#L36-3 assume !!(main_~j~0 < main_~edgecount~0);call main_#t~mem6 := read~int(main_~#Dest~0.base, main_~#Dest~0.offset + 4 * main_~j~0, 4);main_~x~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#Source~0.base, main_~#Source~0.offset + 4 * main_~j~0, 4);main_~y~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem10 := read~int(main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~x~0, 4);call main_#t~mem8 := read~int(main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~y~0, 4);call main_#t~mem9 := read~int(main_~#Weight~0.base, main_~#Weight~0.offset + 4 * main_~j~0, 4); 31187#L40 assume main_#t~mem10 > main_#t~mem8 + main_#t~mem9;havoc main_#t~mem9;havoc main_#t~mem8;havoc main_#t~mem10;call write~int(-1, main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~x~0, 4); 31190#L36-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 31197#L36-3 assume !(main_~j~0 < main_~edgecount~0); 31170#L34-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 31164#L34-3 assume !!(main_~i~0 < main_~nodecount~0);main_~j~0 := 0; 31166#L36-3 [2019-11-15 23:53:22,406 INFO L793 eck$LassoCheckResult]: Loop: 31166#L36-3 assume !!(main_~j~0 < main_~edgecount~0);call main_#t~mem6 := read~int(main_~#Dest~0.base, main_~#Dest~0.offset + 4 * main_~j~0, 4);main_~x~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#Source~0.base, main_~#Source~0.offset + 4 * main_~j~0, 4);main_~y~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem10 := read~int(main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~x~0, 4);call main_#t~mem8 := read~int(main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~y~0, 4);call main_#t~mem9 := read~int(main_~#Weight~0.base, main_~#Weight~0.offset + 4 * main_~j~0, 4); 31174#L40 assume main_#t~mem10 > main_#t~mem8 + main_#t~mem9;havoc main_#t~mem9;havoc main_#t~mem8;havoc main_#t~mem10;call write~int(-1, main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~x~0, 4); 31159#L36-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 31166#L36-3 [2019-11-15 23:53:22,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:22,406 INFO L82 PathProgramCache]: Analyzing trace with hash -989895450, now seen corresponding path program 4 times [2019-11-15 23:53:22,407 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:22,407 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909009097] [2019-11-15 23:53:22,407 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:22,407 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:22,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:22,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:53:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:53:22,467 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:53:22,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:22,468 INFO L82 PathProgramCache]: Analyzing trace with hash 76562, now seen corresponding path program 8 times [2019-11-15 23:53:22,468 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:22,468 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163151685] [2019-11-15 23:53:22,468 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:22,468 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:22,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:53:22,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:53:22,483 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:53:22,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:22,484 INFO L82 PathProgramCache]: Analyzing trace with hash -729849843, now seen corresponding path program 5 times [2019-11-15 23:53:22,484 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:22,484 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466981010] [2019-11-15 23:53:22,484 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:22,485 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:22,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:22,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:22,834 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 40 [2019-11-15 23:53:22,946 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 43 [2019-11-15 23:53:23,097 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 45 [2019-11-15 23:53:23,468 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 55 [2019-11-15 23:53:23,768 WARN L191 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 60 [2019-11-15 23:53:24,014 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 59 [2019-11-15 23:53:24,216 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 52 [2019-11-15 23:53:24,408 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 52 [2019-11-15 23:53:24,767 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 62 [2019-11-15 23:53:24,819 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:53:24,819 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466981010] [2019-11-15 23:53:24,819 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403735418] [2019-11-15 23:53:24,819 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7fb7c2f0-0b38-4f63-9fff-74ca34e2482b/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:53:24,972 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-11-15 23:53:24,972 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:53:24,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 49 conjunts are in the unsatisfiable core [2019-11-15 23:53:24,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:53:24,992 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:25,003 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:25,003 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-11-15 23:53:25,003 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:25,023 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:25,024 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:53:25,024 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:71, output treesize:61 [2019-11-15 23:53:25,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:25,098 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:25,099 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 46 treesize of output 78 [2019-11-15 23:53:25,100 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:25,147 INFO L567 ElimStorePlain]: treesize reduction 44, result has 60.7 percent of original size [2019-11-15 23:53:25,147 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:53:25,147 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:76, output treesize:68 [2019-11-15 23:53:25,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:25,254 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:53:25,278 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:25,279 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 51 treesize of output 112 [2019-11-15 23:53:25,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:25,280 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:25,327 INFO L567 ElimStorePlain]: treesize reduction 50, result has 57.3 percent of original size [2019-11-15 23:53:25,328 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:53:25,328 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:71, output treesize:58 [2019-11-15 23:53:25,470 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:53:25,471 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:25,616 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-11-15 23:53:25,616 INFO L341 Elim1Store]: treesize reduction 24, result has 88.0 percent of original size [2019-11-15 23:53:25,616 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 17 case distinctions, treesize of input 61 treesize of output 219 [2019-11-15 23:53:25,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:25,618 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:25,687 INFO L567 ElimStorePlain]: treesize reduction 161, result has 32.1 percent of original size [2019-11-15 23:53:25,688 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:53:25,688 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:84, output treesize:76 [2019-11-15 23:53:25,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:25,850 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:25,850 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:53:25,919 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:25,919 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 73 treesize of output 245 [2019-11-15 23:53:25,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:25,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:25,921 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:26,032 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 48 [2019-11-15 23:53:26,033 INFO L567 ElimStorePlain]: treesize reduction 171, result has 34.0 percent of original size [2019-11-15 23:53:26,033 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:53:26,033 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:93, output treesize:87 [2019-11-15 23:53:26,365 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 74 [2019-11-15 23:53:26,365 INFO L341 Elim1Store]: treesize reduction 76, result has 61.4 percent of original size [2019-11-15 23:53:26,366 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 3 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 25 case distinctions, treesize of input 96 treesize of output 168 [2019-11-15 23:53:26,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:26,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:26,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:26,369 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:26,422 INFO L567 ElimStorePlain]: treesize reduction 20, result has 66.7 percent of original size [2019-11-15 23:53:26,423 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:53:26,423 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:104, output treesize:16 [2019-11-15 23:53:26,490 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:53:26,491 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:53:26,491 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2019-11-15 23:53:26,491 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504748230] [2019-11-15 23:53:26,628 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:26,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-15 23:53:26,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2019-11-15 23:53:26,628 INFO L87 Difference]: Start difference. First operand 52 states and 67 transitions. cyclomatic complexity: 20 Second operand 26 states. [2019-11-15 23:53:27,726 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 64 [2019-11-15 23:53:28,040 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-11-15 23:53:28,235 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 50 [2019-11-15 23:53:28,678 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 61 [2019-11-15 23:53:29,047 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 66 [2019-11-15 23:53:29,249 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 60 [2019-11-15 23:53:29,414 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 73 [2019-11-15 23:53:29,696 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 67 [2019-11-15 23:53:30,285 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 63 [2019-11-15 23:53:30,745 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 69 [2019-11-15 23:53:30,879 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 63 [2019-11-15 23:53:31,591 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 59 [2019-11-15 23:53:31,881 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2019-11-15 23:53:33,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:33,283 INFO L93 Difference]: Finished difference Result 222 states and 296 transitions. [2019-11-15 23:53:33,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-11-15 23:53:33,284 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 222 states and 296 transitions. [2019-11-15 23:53:33,285 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 21 [2019-11-15 23:53:33,287 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 222 states to 222 states and 296 transitions. [2019-11-15 23:53:33,287 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2019-11-15 23:53:33,288 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2019-11-15 23:53:33,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 222 states and 296 transitions. [2019-11-15 23:53:33,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:53:33,288 INFO L688 BuchiCegarLoop]: Abstraction has 222 states and 296 transitions. [2019-11-15 23:53:33,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states and 296 transitions. [2019-11-15 23:53:33,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 77. [2019-11-15 23:53:33,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-15 23:53:33,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 103 transitions. [2019-11-15 23:53:33,293 INFO L711 BuchiCegarLoop]: Abstraction has 77 states and 103 transitions. [2019-11-15 23:53:33,293 INFO L591 BuchiCegarLoop]: Abstraction has 77 states and 103 transitions. [2019-11-15 23:53:33,293 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-15 23:53:33,293 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 103 transitions. [2019-11-15 23:53:33,294 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:53:33,294 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:53:33,294 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:53:33,294 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:53:33,294 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:53:33,295 INFO L791 eck$LassoCheckResult]: Stem: 31651#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; 31643#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~post3, main_#t~mem6, main_#t~mem7, main_#t~mem10, main_#t~mem8, main_#t~mem9, main_#t~post5, main_#t~post4, main_#t~mem12, main_#t~mem13, main_#t~mem16, main_#t~mem14, main_#t~mem15, main_#t~post11, main_#t~mem18, main_#t~post17, main_~nodecount~0, main_~edgecount~0, main_~source~0, main_~#Source~0.base, main_~#Source~0.offset, main_~#Dest~0.base, main_~#Dest~0.offset, main_~#Weight~0.base, main_~#Weight~0.offset, main_~#distance~0.base, main_~#distance~0.offset, main_~x~0, main_~y~0, main_~i~0, main_~j~0;main_~nodecount~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~edgecount~0 := main_#t~nondet2;havoc main_#t~nondet2; 31634#L15 assume !!(0 <= main_~nodecount~0 && main_~nodecount~0 <= 4); 31635#L16 assume !!(0 <= main_~edgecount~0 && main_~edgecount~0 <= 19);main_~source~0 := 0;call main_~#Source~0.base, main_~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, main_~#Source~0.base, main_~#Source~0.offset, 4);call write~init~int(4, main_~#Source~0.base, 4 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 8 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 12 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 16 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 20 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 24 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 28 + main_~#Source~0.offset, 4);call write~init~int(4, main_~#Source~0.base, 32 + main_~#Source~0.offset, 4);call write~init~int(4, main_~#Source~0.base, 36 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 40 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 44 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 48 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 52 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 56 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 60 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 64 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 68 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 72 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 76 + main_~#Source~0.offset, 4);call main_~#Dest~0.base, main_~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, main_~#Dest~0.base, main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 4 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 8 + main_~#Dest~0.offset, 4);call write~init~int(1, main_~#Dest~0.base, 12 + main_~#Dest~0.offset, 4);call write~init~int(1, main_~#Dest~0.base, 16 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 20 + main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 24 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 28 + main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 32 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 36 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 40 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 44 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 48 + main_~#Dest~0.offset, 4);call write~init~int(2, main_~#Dest~0.base, 52 + main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 56 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 60 + main_~#Dest~0.offset, 4);call write~init~int(2, main_~#Dest~0.base, 64 + main_~#Dest~0.offset, 4);call write~init~int(1, main_~#Dest~0.base, 68 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 72 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 76 + main_~#Dest~0.offset, 4);call main_~#Weight~0.base, main_~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, main_~#Weight~0.base, main_~#Weight~0.offset, 4);call write~init~int(1, main_~#Weight~0.base, 4 + main_~#Weight~0.offset, 4);call write~init~int(2, main_~#Weight~0.base, 8 + main_~#Weight~0.offset, 4);call write~init~int(3, main_~#Weight~0.base, 12 + main_~#Weight~0.offset, 4);call write~init~int(4, main_~#Weight~0.base, 16 + main_~#Weight~0.offset, 4);call write~init~int(5, main_~#Weight~0.base, 20 + main_~#Weight~0.offset, 4);call write~init~int(6, main_~#Weight~0.base, 24 + main_~#Weight~0.offset, 4);call write~init~int(7, main_~#Weight~0.base, 28 + main_~#Weight~0.offset, 4);call write~init~int(8, main_~#Weight~0.base, 32 + main_~#Weight~0.offset, 4);call write~init~int(9, main_~#Weight~0.base, 36 + main_~#Weight~0.offset, 4);call write~init~int(10, main_~#Weight~0.base, 40 + main_~#Weight~0.offset, 4);call write~init~int(11, main_~#Weight~0.base, 44 + main_~#Weight~0.offset, 4);call write~init~int(12, main_~#Weight~0.base, 48 + main_~#Weight~0.offset, 4);call write~init~int(13, main_~#Weight~0.base, 52 + main_~#Weight~0.offset, 4);call write~init~int(14, main_~#Weight~0.base, 56 + main_~#Weight~0.offset, 4);call write~init~int(15, main_~#Weight~0.base, 60 + main_~#Weight~0.offset, 4);call write~init~int(16, main_~#Weight~0.base, 64 + main_~#Weight~0.offset, 4);call write~init~int(17, main_~#Weight~0.base, 68 + main_~#Weight~0.offset, 4);call write~init~int(18, main_~#Weight~0.base, 72 + main_~#Weight~0.offset, 4);call write~init~int(19, main_~#Weight~0.base, 76 + main_~#Weight~0.offset, 4);call main_~#distance~0.base, main_~#distance~0.offset := #Ultimate.allocOnStack(20);havoc main_~x~0;havoc main_~y~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 31638#L25-3 assume !!(main_~i~0 < main_~nodecount~0); 31654#L26 assume main_~i~0 == main_~source~0;call write~int(0, main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~i~0, 4); 31664#L25-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 31655#L25-3 assume !!(main_~i~0 < main_~nodecount~0); 31636#L26 assume !(main_~i~0 == main_~source~0);call write~int(~INFINITY~0, main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~i~0, 4); 31637#L25-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 31688#L25-3 assume !(main_~i~0 < main_~nodecount~0); 31687#L25-4 main_~i~0 := 0; 31644#L34-3 assume !!(main_~i~0 < main_~nodecount~0);main_~j~0 := 0; 31645#L36-3 assume !!(main_~j~0 < main_~edgecount~0);call main_#t~mem6 := read~int(main_~#Dest~0.base, main_~#Dest~0.offset + 4 * main_~j~0, 4);main_~x~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#Source~0.base, main_~#Source~0.offset + 4 * main_~j~0, 4);main_~y~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem10 := read~int(main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~x~0, 4);call main_#t~mem8 := read~int(main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~y~0, 4);call main_#t~mem9 := read~int(main_~#Weight~0.base, main_~#Weight~0.offset + 4 * main_~j~0, 4); 31709#L40 assume main_#t~mem10 > main_#t~mem8 + main_#t~mem9;havoc main_#t~mem9;havoc main_#t~mem8;havoc main_#t~mem10;call write~int(-1, main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~x~0, 4); 31660#L36-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 31657#L36-3 assume !!(main_~j~0 < main_~edgecount~0);call main_#t~mem6 := read~int(main_~#Dest~0.base, main_~#Dest~0.offset + 4 * main_~j~0, 4);main_~x~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#Source~0.base, main_~#Source~0.offset + 4 * main_~j~0, 4);main_~y~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem10 := read~int(main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~x~0, 4);call main_#t~mem8 := read~int(main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~y~0, 4);call main_#t~mem9 := read~int(main_~#Weight~0.base, main_~#Weight~0.offset + 4 * main_~j~0, 4); 31641#L40 assume !(main_#t~mem10 > main_#t~mem8 + main_#t~mem9);havoc main_#t~mem9;havoc main_#t~mem8;havoc main_#t~mem10; 31642#L36-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 31691#L36-3 assume !(main_~j~0 < main_~edgecount~0); 31652#L34-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 31653#L34-3 assume !!(main_~i~0 < main_~nodecount~0);main_~j~0 := 0; 31667#L36-3 assume !!(main_~j~0 < main_~edgecount~0);call main_#t~mem6 := read~int(main_~#Dest~0.base, main_~#Dest~0.offset + 4 * main_~j~0, 4);main_~x~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#Source~0.base, main_~#Source~0.offset + 4 * main_~j~0, 4);main_~y~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem10 := read~int(main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~x~0, 4);call main_#t~mem8 := read~int(main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~y~0, 4);call main_#t~mem9 := read~int(main_~#Weight~0.base, main_~#Weight~0.offset + 4 * main_~j~0, 4); 31639#L40 assume !(main_#t~mem10 > main_#t~mem8 + main_#t~mem9);havoc main_#t~mem9;havoc main_#t~mem8;havoc main_#t~mem10; 31640#L36-2 [2019-11-15 23:53:33,295 INFO L793 eck$LassoCheckResult]: Loop: 31640#L36-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 31648#L36-3 assume !!(main_~j~0 < main_~edgecount~0);call main_#t~mem6 := read~int(main_~#Dest~0.base, main_~#Dest~0.offset + 4 * main_~j~0, 4);main_~x~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#Source~0.base, main_~#Source~0.offset + 4 * main_~j~0, 4);main_~y~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem10 := read~int(main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~x~0, 4);call main_#t~mem8 := read~int(main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~y~0, 4);call main_#t~mem9 := read~int(main_~#Weight~0.base, main_~#Weight~0.offset + 4 * main_~j~0, 4); 31656#L40 assume main_#t~mem10 > main_#t~mem8 + main_#t~mem9;havoc main_#t~mem9;havoc main_#t~mem8;havoc main_#t~mem10;call write~int(-1, main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~x~0, 4); 31640#L36-2 [2019-11-15 23:53:33,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:33,295 INFO L82 PathProgramCache]: Analyzing trace with hash -326746163, now seen corresponding path program 3 times [2019-11-15 23:53:33,295 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:33,295 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361540510] [2019-11-15 23:53:33,295 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:33,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:33,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:33,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:53:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:53:33,372 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:53:33,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:33,373 INFO L82 PathProgramCache]: Analyzing trace with hash 83192, now seen corresponding path program 9 times [2019-11-15 23:53:33,373 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:33,373 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795727975] [2019-11-15 23:53:33,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:33,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:33,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:33,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:53:33,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:53:33,381 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:53:33,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:33,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1698995796, now seen corresponding path program 4 times [2019-11-15 23:53:33,381 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:33,381 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335740027] [2019-11-15 23:53:33,382 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:33,382 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:33,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:33,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:33,637 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 45 [2019-11-15 23:53:33,775 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 50 [2019-11-15 23:53:33,911 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 45 [2019-11-15 23:53:34,036 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 44 [2019-11-15 23:53:34,215 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 50 [2019-11-15 23:53:34,497 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 63 [2019-11-15 23:53:34,692 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 58 [2019-11-15 23:53:35,006 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:53:35,006 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335740027] [2019-11-15 23:53:35,006 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015889921] [2019-11-15 23:53:35,006 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7fb7c2f0-0b38-4f63-9fff-74ca34e2482b/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:53:35,153 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 23:53:35,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:53:35,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-15 23:53:35,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:53:35,374 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:35,374 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 83 treesize of output 169 [2019-11-15 23:53:35,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,368 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-11-15 23:53:36,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:36,848 INFO L496 ElimStorePlain]: Start of recursive call 2: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-15 23:53:37,045 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-15 23:53:37,045 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:37,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,370 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-15 23:53:37,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,650 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-11-15 23:53:37,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,873 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-15 23:53:37,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,070 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-15 23:53:38,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:38,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,814 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 13 dim-0 vars, and 1 xjuncts. [2019-11-15 23:53:39,815 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:83, output treesize:187 [2019-11-15 23:53:39,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:39,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:40,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:40,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:40,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:40,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:40,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:40,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:40,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:40,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:40,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:40,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:40,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:52,175 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 23:53:52,175 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:53:52,175 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 18 [2019-11-15 23:53:52,175 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990990659] [2019-11-15 23:53:52,315 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:52,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-15 23:53:52,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=282, Unknown=1, NotChecked=0, Total=342 [2019-11-15 23:53:52,316 INFO L87 Difference]: Start difference. First operand 77 states and 103 transitions. cyclomatic complexity: 34 Second operand 19 states. [2019-11-15 23:54:10,359 WARN L191 SmtUtils]: Spent 12.17 s on a formula simplification. DAG size of input: 148 DAG size of output: 135 [2019-11-15 23:54:10,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:10,424 INFO L93 Difference]: Finished difference Result 174 states and 231 transitions. [2019-11-15 23:54:10,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 23:54:10,425 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 231 transitions. [2019-11-15 23:54:10,426 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 23:54:10,427 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 174 states and 231 transitions. [2019-11-15 23:54:10,427 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-11-15 23:54:10,427 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2019-11-15 23:54:10,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 231 transitions. [2019-11-15 23:54:10,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:54:10,428 INFO L688 BuchiCegarLoop]: Abstraction has 174 states and 231 transitions. [2019-11-15 23:54:10,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 231 transitions. [2019-11-15 23:54:10,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 105. [2019-11-15 23:54:10,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-15 23:54:10,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 138 transitions. [2019-11-15 23:54:10,432 INFO L711 BuchiCegarLoop]: Abstraction has 105 states and 138 transitions. [2019-11-15 23:54:10,432 INFO L591 BuchiCegarLoop]: Abstraction has 105 states and 138 transitions. [2019-11-15 23:54:10,433 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-11-15 23:54:10,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 105 states and 138 transitions. [2019-11-15 23:54:10,433 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:54:10,433 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:54:10,433 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:54:10,434 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:54:10,434 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:54:10,434 INFO L791 eck$LassoCheckResult]: Stem: 32028#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; 32018#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~post3, main_#t~mem6, main_#t~mem7, main_#t~mem10, main_#t~mem8, main_#t~mem9, main_#t~post5, main_#t~post4, main_#t~mem12, main_#t~mem13, main_#t~mem16, main_#t~mem14, main_#t~mem15, main_#t~post11, main_#t~mem18, main_#t~post17, main_~nodecount~0, main_~edgecount~0, main_~source~0, main_~#Source~0.base, main_~#Source~0.offset, main_~#Dest~0.base, main_~#Dest~0.offset, main_~#Weight~0.base, main_~#Weight~0.offset, main_~#distance~0.base, main_~#distance~0.offset, main_~x~0, main_~y~0, main_~i~0, main_~j~0;main_~nodecount~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~edgecount~0 := main_#t~nondet2;havoc main_#t~nondet2; 32009#L15 assume !!(0 <= main_~nodecount~0 && main_~nodecount~0 <= 4); 32010#L16 assume !!(0 <= main_~edgecount~0 && main_~edgecount~0 <= 19);main_~source~0 := 0;call main_~#Source~0.base, main_~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, main_~#Source~0.base, main_~#Source~0.offset, 4);call write~init~int(4, main_~#Source~0.base, 4 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 8 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 12 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 16 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 20 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 24 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 28 + main_~#Source~0.offset, 4);call write~init~int(4, main_~#Source~0.base, 32 + main_~#Source~0.offset, 4);call write~init~int(4, main_~#Source~0.base, 36 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 40 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 44 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 48 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 52 + main_~#Source~0.offset, 4);call write~init~int(0, main_~#Source~0.base, 56 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 60 + main_~#Source~0.offset, 4);call write~init~int(1, main_~#Source~0.base, 64 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 68 + main_~#Source~0.offset, 4);call write~init~int(2, main_~#Source~0.base, 72 + main_~#Source~0.offset, 4);call write~init~int(3, main_~#Source~0.base, 76 + main_~#Source~0.offset, 4);call main_~#Dest~0.base, main_~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, main_~#Dest~0.base, main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 4 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 8 + main_~#Dest~0.offset, 4);call write~init~int(1, main_~#Dest~0.base, 12 + main_~#Dest~0.offset, 4);call write~init~int(1, main_~#Dest~0.base, 16 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 20 + main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 24 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 28 + main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 32 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 36 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 40 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 44 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 48 + main_~#Dest~0.offset, 4);call write~init~int(2, main_~#Dest~0.base, 52 + main_~#Dest~0.offset, 4);call write~init~int(3, main_~#Dest~0.base, 56 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 60 + main_~#Dest~0.offset, 4);call write~init~int(2, main_~#Dest~0.base, 64 + main_~#Dest~0.offset, 4);call write~init~int(1, main_~#Dest~0.base, 68 + main_~#Dest~0.offset, 4);call write~init~int(0, main_~#Dest~0.base, 72 + main_~#Dest~0.offset, 4);call write~init~int(4, main_~#Dest~0.base, 76 + main_~#Dest~0.offset, 4);call main_~#Weight~0.base, main_~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, main_~#Weight~0.base, main_~#Weight~0.offset, 4);call write~init~int(1, main_~#Weight~0.base, 4 + main_~#Weight~0.offset, 4);call write~init~int(2, main_~#Weight~0.base, 8 + main_~#Weight~0.offset, 4);call write~init~int(3, main_~#Weight~0.base, 12 + main_~#Weight~0.offset, 4);call write~init~int(4, main_~#Weight~0.base, 16 + main_~#Weight~0.offset, 4);call write~init~int(5, main_~#Weight~0.base, 20 + main_~#Weight~0.offset, 4);call write~init~int(6, main_~#Weight~0.base, 24 + main_~#Weight~0.offset, 4);call write~init~int(7, main_~#Weight~0.base, 28 + main_~#Weight~0.offset, 4);call write~init~int(8, main_~#Weight~0.base, 32 + main_~#Weight~0.offset, 4);call write~init~int(9, main_~#Weight~0.base, 36 + main_~#Weight~0.offset, 4);call write~init~int(10, main_~#Weight~0.base, 40 + main_~#Weight~0.offset, 4);call write~init~int(11, main_~#Weight~0.base, 44 + main_~#Weight~0.offset, 4);call write~init~int(12, main_~#Weight~0.base, 48 + main_~#Weight~0.offset, 4);call write~init~int(13, main_~#Weight~0.base, 52 + main_~#Weight~0.offset, 4);call write~init~int(14, main_~#Weight~0.base, 56 + main_~#Weight~0.offset, 4);call write~init~int(15, main_~#Weight~0.base, 60 + main_~#Weight~0.offset, 4);call write~init~int(16, main_~#Weight~0.base, 64 + main_~#Weight~0.offset, 4);call write~init~int(17, main_~#Weight~0.base, 68 + main_~#Weight~0.offset, 4);call write~init~int(18, main_~#Weight~0.base, 72 + main_~#Weight~0.offset, 4);call write~init~int(19, main_~#Weight~0.base, 76 + main_~#Weight~0.offset, 4);call main_~#distance~0.base, main_~#distance~0.offset := #Ultimate.allocOnStack(20);havoc main_~x~0;havoc main_~y~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 32013#L25-3 assume !!(main_~i~0 < main_~nodecount~0); 32029#L26 assume main_~i~0 == main_~source~0;call write~int(0, main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~i~0, 4); 32038#L25-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 32030#L25-3 assume !!(main_~i~0 < main_~nodecount~0); 32011#L26 assume !(main_~i~0 == main_~source~0);call write~int(~INFINITY~0, main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~i~0, 4); 32012#L25-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 32034#L25-3 assume !(main_~i~0 < main_~nodecount~0); 32036#L25-4 main_~i~0 := 0; 32068#L34-3 assume !!(main_~i~0 < main_~nodecount~0);main_~j~0 := 0; 32069#L36-3 assume !!(main_~j~0 < main_~edgecount~0);call main_#t~mem6 := read~int(main_~#Dest~0.base, main_~#Dest~0.offset + 4 * main_~j~0, 4);main_~x~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#Source~0.base, main_~#Source~0.offset + 4 * main_~j~0, 4);main_~y~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem10 := read~int(main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~x~0, 4);call main_#t~mem8 := read~int(main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~y~0, 4);call main_#t~mem9 := read~int(main_~#Weight~0.base, main_~#Weight~0.offset + 4 * main_~j~0, 4); 32064#L40 assume main_#t~mem10 > main_#t~mem8 + main_#t~mem9;havoc main_#t~mem9;havoc main_#t~mem8;havoc main_#t~mem10;call write~int(-1, main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~x~0, 4); 32063#L36-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 32062#L36-3 assume !!(main_~j~0 < main_~edgecount~0);call main_#t~mem6 := read~int(main_~#Dest~0.base, main_~#Dest~0.offset + 4 * main_~j~0, 4);main_~x~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#Source~0.base, main_~#Source~0.offset + 4 * main_~j~0, 4);main_~y~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem10 := read~int(main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~x~0, 4);call main_#t~mem8 := read~int(main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~y~0, 4);call main_#t~mem9 := read~int(main_~#Weight~0.base, main_~#Weight~0.offset + 4 * main_~j~0, 4); 32061#L40 assume main_#t~mem10 > main_#t~mem8 + main_#t~mem9;havoc main_#t~mem9;havoc main_#t~mem8;havoc main_#t~mem10;call write~int(-1, main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~x~0, 4); 32059#L36-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 32055#L36-3 assume !(main_~j~0 < main_~edgecount~0); 32052#L34-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 32042#L34-3 assume !!(main_~i~0 < main_~nodecount~0);main_~j~0 := 0; 32040#L36-3 assume !!(main_~j~0 < main_~edgecount~0);call main_#t~mem6 := read~int(main_~#Dest~0.base, main_~#Dest~0.offset + 4 * main_~j~0, 4);main_~x~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#Source~0.base, main_~#Source~0.offset + 4 * main_~j~0, 4);main_~y~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem10 := read~int(main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~x~0, 4);call main_#t~mem8 := read~int(main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~y~0, 4);call main_#t~mem9 := read~int(main_~#Weight~0.base, main_~#Weight~0.offset + 4 * main_~j~0, 4); 32014#L40 assume !(main_#t~mem10 > main_#t~mem8 + main_#t~mem9);havoc main_#t~mem9;havoc main_#t~mem8;havoc main_#t~mem10; 32015#L36-2 [2019-11-15 23:54:10,434 INFO L793 eck$LassoCheckResult]: Loop: 32015#L36-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 32023#L36-3 assume !!(main_~j~0 < main_~edgecount~0);call main_#t~mem6 := read~int(main_~#Dest~0.base, main_~#Dest~0.offset + 4 * main_~j~0, 4);main_~x~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#Source~0.base, main_~#Source~0.offset + 4 * main_~j~0, 4);main_~y~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem10 := read~int(main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~x~0, 4);call main_#t~mem8 := read~int(main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~y~0, 4);call main_#t~mem9 := read~int(main_~#Weight~0.base, main_~#Weight~0.offset + 4 * main_~j~0, 4); 32031#L40 assume main_#t~mem10 > main_#t~mem8 + main_#t~mem9;havoc main_#t~mem9;havoc main_#t~mem8;havoc main_#t~mem10;call write~int(-1, main_~#distance~0.base, main_~#distance~0.offset + 4 * main_~x~0, 4); 32015#L36-2 [2019-11-15 23:54:10,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:10,435 INFO L82 PathProgramCache]: Analyzing trace with hash -2101753525, now seen corresponding path program 5 times [2019-11-15 23:54:10,435 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:10,435 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889935197] [2019-11-15 23:54:10,435 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:10,435 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:10,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:10,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:54:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:54:10,514 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:54:10,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:10,515 INFO L82 PathProgramCache]: Analyzing trace with hash 83192, now seen corresponding path program 10 times [2019-11-15 23:54:10,515 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:10,515 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281348223] [2019-11-15 23:54:10,515 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:10,515 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:10,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:10,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:54:10,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:54:10,523 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:54:10,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:10,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1305968786, now seen corresponding path program 6 times [2019-11-15 23:54:10,523 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:10,524 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241448825] [2019-11-15 23:54:10,524 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:10,524 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:10,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:10,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:54:10,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:54:10,634 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:54:14,128 WARN L191 SmtUtils]: Spent 3.32 s on a formula simplification. DAG size of input: 526 DAG size of output: 418 [2019-11-15 23:54:15,159 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 329 [2019-11-15 23:54:15,163 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:54:15,163 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:54:15,163 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:54:15,163 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:54:15,163 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:54:15,163 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:54:15,163 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:54:15,163 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:54:15,163 INFO L131 ssoRankerPreferences]: Filename of dumped script: eureka_01-1.c_Iteration15_Lasso [2019-11-15 23:54:15,163 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:54:15,163 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:54:15,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-11-15 23:54:15,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:54:15,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:54:15,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:54:15,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:54:15,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-11-15 23:54:15,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:54:15,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:54:15,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:54:15,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:54:15,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:54:15,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:54:15,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:54:15,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:54:15,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:54:15,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:54:15,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:54:15,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:54:32,556 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:536) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:951) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-15 23:54:32,559 INFO L168 Benchmark]: Toolchain (without parser) took 296930.86 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 478.7 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -259.6 MB). Peak memory consumption was 701.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:54:32,559 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:54:32,559 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 183.5 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -229.6 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:54:32,560 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:54:32,560 INFO L168 Benchmark]: Boogie Preprocessor took 34.40 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:54:32,560 INFO L168 Benchmark]: RCFGBuilder took 513.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:54:32,560 INFO L168 Benchmark]: BuchiAutomizer took 296008.70 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 295.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -64.5 MB). Peak memory consumption was 713.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:54:32,562 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 319.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 183.5 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -229.6 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.40 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 513.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 296008.70 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 295.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -64.5 MB). Peak memory consumption was 713.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...