./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/twisted-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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_7d6675dc-eff7-461f-97bb-78d30b6dba9c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7d6675dc-eff7-461f-97bb-78d30b6dba9c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7d6675dc-eff7-461f-97bb-78d30b6dba9c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7d6675dc-eff7-461f-97bb-78d30b6dba9c/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/twisted-alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_7d6675dc-eff7-461f-97bb-78d30b6dba9c/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7d6675dc-eff7-461f-97bb-78d30b6dba9c/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 64bit --witnessprinter.graph.data.programhash 1a7013a4cfa859e3e95189f90d363983a25fcd0e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:44:12,768 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:44:12,770 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:44:12,784 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:44:12,784 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:44:12,785 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:44:12,786 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:44:12,795 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:44:12,798 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:44:12,803 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:44:12,803 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:44:12,805 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:44:12,805 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:44:12,807 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:44:12,808 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:44:12,808 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:44:12,809 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:44:12,810 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:44:12,812 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:44:12,815 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:44:12,817 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:44:12,819 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:44:12,821 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:44:12,822 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:44:12,825 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:44:12,826 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:44:12,826 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:44:12,827 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:44:12,828 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:44:12,828 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:44:12,828 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:44:12,829 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:44:12,829 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:44:12,830 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:44:12,831 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:44:12,832 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:44:12,832 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:44:12,833 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:44:12,833 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:44:12,833 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:44:12,834 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:44:12,835 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7d6675dc-eff7-461f-97bb-78d30b6dba9c/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-16 00:44:12,859 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:44:12,859 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:44:12,860 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:44:12,860 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:44:12,861 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:44:12,861 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:44:12,861 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:44:12,861 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:44:12,861 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:44:12,862 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:44:12,862 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:44:12,862 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:44:12,862 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:44:12,862 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:44:12,863 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:44:12,863 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:44:12,863 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:44:12,863 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:44:12,863 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:44:12,864 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:44:12,864 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:44:12,864 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:44:12,864 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:44:12,864 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:44:12,865 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:44:12,865 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:44:12,865 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:44:12,865 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:44:12,866 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:44:12,866 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_7d6675dc-eff7-461f-97bb-78d30b6dba9c/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1a7013a4cfa859e3e95189f90d363983a25fcd0e [2019-11-16 00:44:12,908 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:44:12,921 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:44:12,925 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:44:12,926 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:44:12,927 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:44:12,928 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7d6675dc-eff7-461f-97bb-78d30b6dba9c/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/twisted-alloca.i [2019-11-16 00:44:12,990 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7d6675dc-eff7-461f-97bb-78d30b6dba9c/bin/uautomizer/data/67144aca6/fbda81ade43b4129a59488b9404ec83d/FLAGabe473aa9 [2019-11-16 00:44:13,464 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:44:13,465 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7d6675dc-eff7-461f-97bb-78d30b6dba9c/sv-benchmarks/c/termination-memory-alloca/twisted-alloca.i [2019-11-16 00:44:13,474 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7d6675dc-eff7-461f-97bb-78d30b6dba9c/bin/uautomizer/data/67144aca6/fbda81ade43b4129a59488b9404ec83d/FLAGabe473aa9 [2019-11-16 00:44:13,484 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7d6675dc-eff7-461f-97bb-78d30b6dba9c/bin/uautomizer/data/67144aca6/fbda81ade43b4129a59488b9404ec83d [2019-11-16 00:44:13,485 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:44:13,486 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:44:13,487 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:44:13,487 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:44:13,490 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:44:13,491 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:44:13" (1/1) ... [2019-11-16 00:44:13,493 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1aa2f979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:13, skipping insertion in model container [2019-11-16 00:44:13,493 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:44:13" (1/1) ... [2019-11-16 00:44:13,500 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:44:13,541 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:44:13,886 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:44:13,896 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:44:13,951 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:44:14,003 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:44:14,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:14 WrapperNode [2019-11-16 00:44:14,004 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:44:14,005 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:44:14,005 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:44:14,005 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:44:14,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:14" (1/1) ... [2019-11-16 00:44:14,023 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:14" (1/1) ... [2019-11-16 00:44:14,041 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:44:14,041 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:44:14,041 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:44:14,041 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:44:14,048 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:14" (1/1) ... [2019-11-16 00:44:14,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:14" (1/1) ... [2019-11-16 00:44:14,054 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:14" (1/1) ... [2019-11-16 00:44:14,054 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:14" (1/1) ... [2019-11-16 00:44:14,059 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:14" (1/1) ... [2019-11-16 00:44:14,063 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:14" (1/1) ... [2019-11-16 00:44:14,064 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:14" (1/1) ... [2019-11-16 00:44:14,067 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:44:14,068 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:44:14,068 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:44:14,068 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:44:14,070 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d6675dc-eff7-461f-97bb-78d30b6dba9c/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-16 00:44:14,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:44:14,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:44:14,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:44:14,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:44:14,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:44:14,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:44:14,472 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:44:14,473 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-16 00:44:14,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:44:14 BoogieIcfgContainer [2019-11-16 00:44:14,474 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:44:14,474 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:44:14,474 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:44:14,477 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:44:14,478 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:44:14,478 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:44:13" (1/3) ... [2019-11-16 00:44:14,479 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3bce68b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:44:14, skipping insertion in model container [2019-11-16 00:44:14,479 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:44:14,479 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:14" (2/3) ... [2019-11-16 00:44:14,480 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3bce68b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:44:14, skipping insertion in model container [2019-11-16 00:44:14,480 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:44:14,480 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:44:14" (3/3) ... [2019-11-16 00:44:14,481 INFO L371 chiAutomizerObserver]: Analyzing ICFG twisted-alloca.i [2019-11-16 00:44:14,521 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:44:14,521 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:44:14,521 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:44:14,522 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:44:14,522 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:44:14,522 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:44:14,522 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:44:14,522 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:44:14,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-16 00:44:14,553 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-16 00:44:14,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:44:14,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:44:14,559 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:44:14,559 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-16 00:44:14,559 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:44:14,560 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-16 00:44:14,561 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-16 00:44:14,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:44:14,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:44:14,562 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:44:14,562 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-16 00:44:14,568 INFO L791 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 3#L569true [2019-11-16 00:44:14,569 INFO L793 eck$LassoCheckResult]: Loop: 3#L569true assume !true; 8#L564true goto; 4#L567true call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 11#L564-1true assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 6#L566true assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; 3#L569true [2019-11-16 00:44:14,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:14,574 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-16 00:44:14,580 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:14,580 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456646593] [2019-11-16 00:44:14,580 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:14,581 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:14,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:14,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:14,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:14,736 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:44:14,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:14,738 INFO L82 PathProgramCache]: Analyzing trace with hash 46885240, now seen corresponding path program 1 times [2019-11-16 00:44:14,738 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:14,738 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655957222] [2019-11-16 00:44:14,738 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:14,738 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:14,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:14,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:14,762 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-16 00:44:14,763 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655957222] [2019-11-16 00:44:14,763 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:14,763 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-16 00:44:14,764 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543041783] [2019-11-16 00:44:14,767 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:44:14,768 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:14,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-16 00:44:14,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-16 00:44:14,779 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2019-11-16 00:44:14,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:14,784 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2019-11-16 00:44:14,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-16 00:44:14,785 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2019-11-16 00:44:14,786 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-16 00:44:14,789 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 10 states and 13 transitions. [2019-11-16 00:44:14,790 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-16 00:44:14,790 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-16 00:44:14,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2019-11-16 00:44:14,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:44:14,791 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-16 00:44:14,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2019-11-16 00:44:14,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-11-16 00:44:14,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-16 00:44:14,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-11-16 00:44:14,810 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-16 00:44:14,810 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-16 00:44:14,810 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:44:14,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-11-16 00:44:14,811 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-16 00:44:14,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:44:14,811 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:44:14,812 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:44:14,812 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:44:14,812 INFO L791 eck$LassoCheckResult]: Stem: 43#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 38#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 39#L569 [2019-11-16 00:44:14,812 INFO L793 eck$LassoCheckResult]: Loop: 39#L569 goto; 42#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 46#L557-1 assume !(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7; 40#L564 goto; 41#L567 call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 44#L564-1 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 45#L566 assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; 39#L569 [2019-11-16 00:44:14,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:14,813 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-11-16 00:44:14,813 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:14,813 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66717435] [2019-11-16 00:44:14,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:14,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:14,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:14,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:14,868 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:44:14,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:14,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1311753714, now seen corresponding path program 1 times [2019-11-16 00:44:14,868 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:14,868 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924313932] [2019-11-16 00:44:14,869 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:14,869 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:14,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:14,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:14,906 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:44:14,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:14,907 INFO L82 PathProgramCache]: Analyzing trace with hash 234543116, now seen corresponding path program 1 times [2019-11-16 00:44:14,907 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:14,907 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449124135] [2019-11-16 00:44:14,907 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:14,907 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:14,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:15,037 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:44:15,147 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-16 00:44:15,284 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-11-16 00:44:16,051 WARN L191 SmtUtils]: Spent 764.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 105 [2019-11-16 00:44:16,414 WARN L191 SmtUtils]: Spent 360.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-11-16 00:44:16,427 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:44:16,428 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:44:16,428 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:44:16,428 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:44:16,435 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:44:16,435 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:44:16,435 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:44:16,435 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:44:16,436 INFO L131 ssoRankerPreferences]: Filename of dumped script: twisted-alloca.i_Iteration2_Lasso [2019-11-16 00:44:16,436 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:44:16,436 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:44:16,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:16,482 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-16 00:44:16,487 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-16 00:44:16,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:16,495 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-16 00:44:16,499 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-16 00:44:16,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:16,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:16,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:16,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:16,513 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-16 00:44:16,516 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-16 00:44:16,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:16,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:16,524 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-16 00:44:16,527 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-16 00:44:16,529 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-16 00:44:16,532 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-16 00:44:16,538 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-16 00:44:17,239 WARN L191 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 95 [2019-11-16 00:44:17,436 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-11-16 00:44:17,437 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-16 00:44:17,439 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-16 00:44:17,675 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-11-16 00:44:19,020 WARN L191 SmtUtils]: Spent 962.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-11-16 00:44:19,085 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:44:19,088 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:44:19,090 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:44:19,091 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:19,091 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:19,091 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:19,092 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:19,092 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:19,094 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:19,094 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:19,095 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:19,096 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:44:19,096 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:19,097 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:19,097 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:19,097 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:19,097 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:19,098 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:19,098 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:19,099 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:19,099 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:44:19,100 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:19,100 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:19,100 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:19,100 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:19,101 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:19,101 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:19,101 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:19,102 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:19,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-16 00:44:19,103 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:19,103 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:19,103 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:19,103 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:19,106 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:44:19,106 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:19,108 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:19,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-16 00:44:19,110 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:19,110 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:19,110 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:19,110 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:19,112 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:44:19,112 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:19,114 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:19,115 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:44:19,115 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:19,116 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:19,116 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:19,116 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:19,118 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:44:19,118 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:19,122 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:19,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:44:19,123 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:19,123 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:19,123 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:19,123 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:19,123 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:19,124 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:19,124 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:19,125 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:19,125 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:44:19,126 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:19,126 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:19,126 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:19,126 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:19,128 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:44:19,128 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:19,130 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:19,131 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:44:19,131 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:19,132 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:19,132 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:19,132 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:19,132 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:19,133 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:19,133 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:19,134 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:19,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-16 00:44:19,134 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:19,135 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:19,135 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:19,135 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:19,135 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:19,136 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:19,136 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:19,136 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:19,137 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:44:19,137 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:19,138 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:19,138 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:19,138 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:19,138 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:19,139 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:19,139 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:19,139 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:19,140 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:44:19,140 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:19,140 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:19,141 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:19,141 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:19,141 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:19,141 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:19,142 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:19,142 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:19,143 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:44:19,143 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:19,143 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:19,143 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:19,144 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:19,144 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:19,144 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:19,144 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:19,145 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:19,145 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:44:19,146 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:19,146 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:19,146 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:19,147 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:19,148 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:44:19,148 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:19,150 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:19,151 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:44:19,151 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:19,151 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:19,152 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:19,152 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:19,152 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:19,152 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:19,153 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:19,153 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:19,154 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:44:19,154 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:19,154 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:19,155 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:19,155 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:19,155 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:19,155 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:19,155 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:19,156 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:19,157 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:44:19,157 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:19,157 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:19,157 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:19,158 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:19,158 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:19,158 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:19,158 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:19,159 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:19,159 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:44:19,160 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:19,160 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:19,160 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:19,160 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:19,162 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:44:19,162 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:19,165 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:19,165 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:44:19,166 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:19,166 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:19,166 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:19,166 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:19,169 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:44:19,169 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:19,177 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:19,178 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:44:19,178 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:19,178 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:19,179 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:19,179 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:19,180 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:44:19,180 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:19,182 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:19,182 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:44:19,183 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:19,183 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:19,183 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:19,183 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:19,185 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:44:19,185 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:19,188 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:19,188 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:44:19,189 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:19,189 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:19,189 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:19,189 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:19,194 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:44:19,194 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:19,227 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:19,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-16 00:44:19,228 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:19,229 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:19,229 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:19,229 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:19,230 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:44:19,230 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:19,233 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:19,234 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:44:19,234 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:19,235 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:19,235 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:19,235 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:19,236 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:44:19,236 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:19,242 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:44:19,250 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-16 00:44:19,250 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-16 00:44:19,252 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:44:19,253 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:44:19,254 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:44:19,254 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)_1 + 1 Supporting invariants [] [2019-11-16 00:44:19,403 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2019-11-16 00:44:19,410 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:44:19,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:19,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:19,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:44:19,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:19,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:19,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:44:19,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:19,533 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 36 treesize of output 20 [2019-11-16 00:44:19,534 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:19,543 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:19,544 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:44:19,544 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:19 [2019-11-16 00:44:19,567 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-16 00:44:19,570 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-16 00:44:19,571 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 5 states. [2019-11-16 00:44:19,619 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4. Second operand 5 states. Result 20 states and 27 transitions. Complement of second has 6 states. [2019-11-16 00:44:19,620 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-16 00:44:19,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-16 00:44:19,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-11-16 00:44:19,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 2 letters. Loop has 7 letters. [2019-11-16 00:44:19,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:44:19,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 7 letters. [2019-11-16 00:44:19,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:44:19,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 2 letters. Loop has 14 letters. [2019-11-16 00:44:19,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:44:19,624 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 27 transitions. [2019-11-16 00:44:19,625 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:44:19,626 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 16 states and 21 transitions. [2019-11-16 00:44:19,626 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-16 00:44:19,626 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-16 00:44:19,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2019-11-16 00:44:19,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:44:19,626 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-11-16 00:44:19,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2019-11-16 00:44:19,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-11-16 00:44:19,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-16 00:44:19,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-11-16 00:44:19,628 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-16 00:44:19,628 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-16 00:44:19,628 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:44:19,628 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2019-11-16 00:44:19,629 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:44:19,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:44:19,629 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:44:19,629 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-16 00:44:19,629 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:44:19,630 INFO L791 eck$LassoCheckResult]: Stem: 277#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 267#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 268#L569 goto; 272#L560 [2019-11-16 00:44:19,630 INFO L793 eck$LassoCheckResult]: Loop: 272#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 278#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 279#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 272#L560 [2019-11-16 00:44:19,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:19,630 INFO L82 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2019-11-16 00:44:19,630 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:19,630 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749966178] [2019-11-16 00:44:19,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:19,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:19,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:19,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:19,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:19,683 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:44:19,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:19,688 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2019-11-16 00:44:19,688 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:19,689 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782428562] [2019-11-16 00:44:19,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:19,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:19,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:19,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:19,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:19,702 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:44:19,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:19,702 INFO L82 PathProgramCache]: Analyzing trace with hash 889536583, now seen corresponding path program 1 times [2019-11-16 00:44:19,702 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:19,703 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908041201] [2019-11-16 00:44:19,703 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:19,703 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:19,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:19,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:19,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:19,739 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:44:20,337 WARN L191 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 108 [2019-11-16 00:44:20,607 WARN L191 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2019-11-16 00:44:20,610 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:44:20,610 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:44:20,610 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:44:20,610 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:44:20,610 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:44:20,610 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:44:20,611 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:44:20,611 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:44:20,611 INFO L131 ssoRankerPreferences]: Filename of dumped script: twisted-alloca.i_Iteration3_Lasso [2019-11-16 00:44:20,611 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:44:20,611 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:44:20,616 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-16 00:44:20,625 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-16 00:44:20,648 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-16 00:44:20,650 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-16 00:44:20,653 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-16 00:44:21,176 WARN L191 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 89 [2019-11-16 00:44:21,301 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-11-16 00:44:21,302 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-16 00:44:21,306 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-16 00:44:21,307 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-16 00:44:21,309 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-16 00:44:21,311 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-16 00:44:21,314 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-16 00:44:21,321 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-16 00:44:21,322 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-16 00:44:21,324 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-16 00:44:21,333 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-16 00:44:21,335 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-16 00:44:21,337 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-16 00:44:21,339 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-16 00:44:21,341 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-16 00:44:21,343 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-16 00:44:21,346 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-16 00:44:21,348 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-16 00:44:22,622 WARN L191 SmtUtils]: Spent 905.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-11-16 00:44:22,793 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:44:22,793 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:44:22,794 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:44:22,794 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:22,794 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:22,795 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:22,795 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:22,795 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:22,795 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:22,795 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:22,796 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:22,796 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:44:22,796 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:22,796 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:22,797 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:22,797 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:22,797 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:22,797 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:22,797 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:22,798 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:22,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-16 00:44:22,798 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:22,798 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:22,799 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:22,799 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:22,799 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:22,799 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:22,799 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:22,800 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:22,800 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:44:22,800 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:22,800 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:22,801 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:22,801 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:22,802 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:44:22,802 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:22,803 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:22,803 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:44:22,804 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:22,804 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:22,804 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:22,804 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:22,806 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:44:22,806 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:22,809 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:22,809 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:44:22,809 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:22,810 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:22,810 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:22,810 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:22,811 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:44:22,811 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:22,813 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:22,813 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:44:22,814 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:22,814 INFO L202 nArgumentSynthesizer]: 16 stem disjuncts [2019-11-16 00:44:22,814 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:22,814 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:22,824 INFO L400 nArgumentSynthesizer]: We have 36 Motzkin's Theorem applications. [2019-11-16 00:44:22,824 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:22,870 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:22,871 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:44:22,871 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:22,871 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:22,871 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:22,872 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:22,872 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:44:22,872 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:22,874 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:22,875 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:44:22,875 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:22,875 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:22,875 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:22,875 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:22,876 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:44:22,876 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:22,877 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:22,878 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:44:22,878 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:22,878 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:22,879 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:22,879 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:22,879 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:44:22,879 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:22,881 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:22,881 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:44:22,881 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:22,882 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:22,882 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:22,882 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:22,883 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:44:22,883 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:22,886 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:22,887 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:44:22,887 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:22,887 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:22,887 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:22,888 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:22,888 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:44:22,888 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:22,890 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:22,890 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:44:22,891 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:22,891 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:22,891 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:22,891 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:22,892 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:44:22,892 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:22,896 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:22,896 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:44:22,897 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:22,897 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:22,897 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:22,897 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:22,900 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:44:22,900 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:22,913 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:22,913 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:44:22,914 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:22,914 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:22,914 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:22,914 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:22,915 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:44:22,915 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:22,917 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:22,917 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:44:22,918 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:22,918 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:22,918 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:22,918 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:22,920 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:44:22,920 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:22,939 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:44:22,953 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-16 00:44:22,953 INFO L444 ModelExtractionUtils]: 15 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:44:22,953 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:44:22,954 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:44:22,954 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:44:22,955 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)_2 - 1*v_rep(select (select #memory_int ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)_2 Supporting invariants [] [2019-11-16 00:44:23,063 INFO L297 tatePredicateManager]: 36 out of 36 supporting invariants were superfluous and have been removed [2019-11-16 00:44:23,064 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:44:23,065 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:44:23,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:23,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:23,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:44:23,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:23,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:23,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:44:23,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:23,156 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:23,157 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 65 [2019-11-16 00:44:23,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:23,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:23,162 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:23,192 INFO L567 ElimStorePlain]: treesize reduction 54, result has 39.3 percent of original size [2019-11-16 00:44:23,192 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:44:23,193 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:35 [2019-11-16 00:44:23,212 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-16 00:44:23,212 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-16 00:44:23,213 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-11-16 00:44:23,242 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 34 states and 43 transitions. Complement of second has 7 states. [2019-11-16 00:44:23,243 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-16 00:44:23,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:44:23,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-11-16 00:44:23,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 3 letters. [2019-11-16 00:44:23,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:44:23,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 3 letters. [2019-11-16 00:44:23,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:44:23,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 6 letters. [2019-11-16 00:44:23,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:44:23,244 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 43 transitions. [2019-11-16 00:44:23,246 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:44:23,247 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 24 states and 31 transitions. [2019-11-16 00:44:23,247 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-16 00:44:23,248 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-16 00:44:23,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 31 transitions. [2019-11-16 00:44:23,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:44:23,248 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2019-11-16 00:44:23,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 31 transitions. [2019-11-16 00:44:23,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-11-16 00:44:23,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-16 00:44:23,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2019-11-16 00:44:23,251 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-11-16 00:44:23,251 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-11-16 00:44:23,251 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-16 00:44:23,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2019-11-16 00:44:23,252 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:44:23,252 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:44:23,252 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:44:23,254 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:44:23,254 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:44:23,255 INFO L791 eck$LassoCheckResult]: Stem: 512#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 505#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 506#L569 goto; 507#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 515#L557-1 assume !(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7; 503#L564 goto; 504#L567 call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 510#L564-1 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 511#L566 assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; 516#L569 goto; 517#L560 [2019-11-16 00:44:23,255 INFO L793 eck$LassoCheckResult]: Loop: 517#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 513#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 514#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 517#L560 [2019-11-16 00:44:23,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:23,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1319097990, now seen corresponding path program 2 times [2019-11-16 00:44:23,255 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:23,256 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235168985] [2019-11-16 00:44:23,256 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:23,256 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:23,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:23,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:23,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:23,290 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:44:23,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:23,291 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 2 times [2019-11-16 00:44:23,291 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:23,292 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946178762] [2019-11-16 00:44:23,292 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:23,292 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:23,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:23,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:23,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:23,301 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:44:23,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:23,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1702545424, now seen corresponding path program 1 times [2019-11-16 00:44:23,306 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:23,306 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710226651] [2019-11-16 00:44:23,306 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:23,306 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:23,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:23,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:23,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:44:23,461 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710226651] [2019-11-16 00:44:23,461 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503828836] [2019-11-16 00:44:23,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d6675dc-eff7-461f-97bb-78d30b6dba9c/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:44:23,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:23,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-16 00:44:23,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:23,568 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-16 00:44:23,568 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:23,600 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:23,732 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-11-16 00:44:23,732 INFO L341 Elim1Store]: treesize reduction 39, result has 70.9 percent of original size [2019-11-16 00:44:23,733 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 123 treesize of output 102 [2019-11-16 00:44:23,734 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:23,811 INFO L567 ElimStorePlain]: treesize reduction 47, result has 61.8 percent of original size [2019-11-16 00:44:23,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:44:23,813 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:44:23,813 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:147, output treesize:28 [2019-11-16 00:44:23,928 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:23,929 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 67 [2019-11-16 00:44:23,930 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:23,965 INFO L567 ElimStorePlain]: treesize reduction 46, result has 41.0 percent of original size [2019-11-16 00:44:23,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:23,967 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-16 00:44:23,967 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:32 [2019-11-16 00:44:23,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:24,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:24,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:24,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:24,106 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:24,107 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 29 treesize of output 21 [2019-11-16 00:44:24,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:24,108 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:24,122 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:24,123 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 40 [2019-11-16 00:44:24,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:24,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:24,124 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:24,159 INFO L567 ElimStorePlain]: treesize reduction 13, result has 68.3 percent of original size [2019-11-16 00:44:24,160 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-16 00:44:24,160 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:66, output treesize:15 [2019-11-16 00:44:24,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:44:24,182 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:44:24,182 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-11-16 00:44:24,182 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084154384] [2019-11-16 00:44:24,298 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:24,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-16 00:44:24,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:44:24,298 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. cyclomatic complexity: 10 Second operand 13 states. [2019-11-16 00:44:24,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:24,686 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2019-11-16 00:44:24,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:44:24,687 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 55 transitions. [2019-11-16 00:44:24,688 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:44:24,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 20 states and 24 transitions. [2019-11-16 00:44:24,689 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-16 00:44:24,689 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-16 00:44:24,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2019-11-16 00:44:24,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:44:24,690 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-11-16 00:44:24,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2019-11-16 00:44:24,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2019-11-16 00:44:24,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-16 00:44:24,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2019-11-16 00:44:24,691 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-11-16 00:44:24,691 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-11-16 00:44:24,692 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-16 00:44:24,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2019-11-16 00:44:24,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:44:24,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:44:24,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:44:24,693 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:44:24,693 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:44:24,693 INFO L791 eck$LassoCheckResult]: Stem: 646#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 640#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 641#L569 goto; 644#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 651#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 652#L559 assume !(0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2));havoc f_#t~mem10; 642#L564 goto; 643#L567 call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 647#L564-1 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 648#L566 assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; 653#L569 goto; 654#L560 [2019-11-16 00:44:24,693 INFO L793 eck$LassoCheckResult]: Loop: 654#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 649#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 650#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 654#L560 [2019-11-16 00:44:24,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:24,693 INFO L82 PathProgramCache]: Analyzing trace with hash -635175977, now seen corresponding path program 1 times [2019-11-16 00:44:24,694 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:24,694 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826310821] [2019-11-16 00:44:24,694 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:24,694 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:24,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:24,775 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-16 00:44:24,775 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826310821] [2019-11-16 00:44:24,775 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:24,775 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:44:24,775 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913130985] [2019-11-16 00:44:24,776 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:44:24,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:24,776 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 3 times [2019-11-16 00:44:24,776 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:24,776 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635582744] [2019-11-16 00:44:24,777 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:24,777 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:24,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:24,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:24,786 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:44:24,896 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:24,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:44:24,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:44:24,896 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 5 states. [2019-11-16 00:44:24,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:24,917 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2019-11-16 00:44:24,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:44:24,918 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2019-11-16 00:44:24,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:44:24,919 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 21 transitions. [2019-11-16 00:44:24,919 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-16 00:44:24,919 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-16 00:44:24,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2019-11-16 00:44:24,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:44:24,920 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-11-16 00:44:24,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2019-11-16 00:44:24,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-16 00:44:24,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-16 00:44:24,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2019-11-16 00:44:24,921 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-11-16 00:44:24,922 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-11-16 00:44:24,922 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-16 00:44:24,922 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2019-11-16 00:44:24,922 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:44:24,922 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:44:24,922 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:44:24,923 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:44:24,923 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:44:24,923 INFO L791 eck$LassoCheckResult]: Stem: 690#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 683#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 684#L569 goto; 685#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 693#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 694#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 687#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 698#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 697#L559 assume !(0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2));havoc f_#t~mem10; 681#L564 goto; 682#L567 call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 688#L564-1 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 689#L566 assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; 695#L569 goto; 696#L560 [2019-11-16 00:44:24,923 INFO L793 eck$LassoCheckResult]: Loop: 696#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 691#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 692#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 696#L560 [2019-11-16 00:44:24,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:24,923 INFO L82 PathProgramCache]: Analyzing trace with hash 184869755, now seen corresponding path program 1 times [2019-11-16 00:44:24,924 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:24,924 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194006573] [2019-11-16 00:44:24,924 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:24,924 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:24,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:24,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:24,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:24,966 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:44:24,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:24,967 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 4 times [2019-11-16 00:44:24,967 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:24,967 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054070086] [2019-11-16 00:44:24,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:24,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:24,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:24,975 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:44:24,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:24,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1306804847, now seen corresponding path program 2 times [2019-11-16 00:44:24,976 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:24,976 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948614971] [2019-11-16 00:44:24,976 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:24,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:24,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:25,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:25,028 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:44:27,139 WARN L191 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 198 DAG size of output: 154 [2019-11-16 00:44:27,606 WARN L191 SmtUtils]: Spent 464.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-11-16 00:44:27,609 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:44:27,610 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:44:27,610 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:44:27,610 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:44:27,610 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:44:27,610 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:44:27,610 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:44:27,610 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:44:27,610 INFO L131 ssoRankerPreferences]: Filename of dumped script: twisted-alloca.i_Iteration6_Lasso [2019-11-16 00:44:27,610 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:44:27,610 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:44:27,613 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-16 00:44:27,620 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-16 00:44:27,623 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-16 00:44:28,237 WARN L191 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 98 [2019-11-16 00:44:28,379 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-11-16 00:44:28,379 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-16 00:44:28,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-16 00:44:28,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-16 00:44:28,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-16 00:44:28,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-16 00:44:28,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-16 00:44:28,393 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-16 00:44:28,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-16 00:44:28,404 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-16 00:44:28,406 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-16 00:44:28,409 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-16 00:44:28,411 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-16 00:44:28,413 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-16 00:44:28,415 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-16 00:44:28,417 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-16 00:44:28,419 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-16 00:44:28,421 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-16 00:44:29,755 WARN L191 SmtUtils]: Spent 969.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-11-16 00:44:29,920 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:44:29,921 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:44:29,921 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:44:29,922 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:29,922 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:29,922 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:29,922 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:29,922 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:29,924 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:29,924 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:29,925 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:29,925 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:44:29,926 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:29,926 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:29,926 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:29,926 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:29,927 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:44:29,927 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:29,928 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:29,931 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:44:29,931 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:29,932 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:29,932 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:29,932 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:29,932 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:44:29,934 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:29,938 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:29,938 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:44:29,940 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:29,940 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:29,940 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:29,940 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:29,941 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:44:29,943 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:29,946 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:29,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-16 00:44:29,948 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:29,948 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:29,948 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:29,948 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:29,949 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:44:29,950 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:29,951 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:29,952 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:44:29,952 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:29,953 INFO L202 nArgumentSynthesizer]: 16 stem disjuncts [2019-11-16 00:44:29,953 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:29,953 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:29,960 INFO L400 nArgumentSynthesizer]: We have 36 Motzkin's Theorem applications. [2019-11-16 00:44:29,960 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:29,997 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:29,997 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:44:29,998 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:29,998 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:29,998 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:29,998 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:29,999 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:44:29,999 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:30,001 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:30,002 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:44:30,002 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:30,003 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:30,003 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:30,003 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:30,004 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:44:30,004 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:30,005 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:30,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-16 00:44:30,007 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:30,007 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:30,007 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:30,007 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:30,008 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:44:30,008 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:30,010 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:30,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-16 00:44:30,012 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:30,012 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:30,012 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:30,012 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:30,013 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:44:30,013 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:30,015 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:30,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-16 00:44:30,017 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:30,017 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:30,017 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:30,018 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:30,018 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:44:30,018 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:30,021 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:30,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-16 00:44:30,023 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:30,023 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:30,023 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:30,023 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:30,025 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:44:30,025 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:30,034 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:44:30,043 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-16 00:44:30,043 INFO L444 ModelExtractionUtils]: 15 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:44:30,043 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:44:30,044 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:44:30,044 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:44:30,044 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)_3, v_rep(select (select #memory_int ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)_3) = -1*v_rep(select (select #memory_int ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)_3 + 1*v_rep(select (select #memory_int ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)_3 Supporting invariants [] [2019-11-16 00:44:30,190 INFO L297 tatePredicateManager]: 40 out of 40 supporting invariants were superfluous and have been removed [2019-11-16 00:44:30,191 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:44:30,191 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:44:30,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:30,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:30,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:44:30,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:30,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:30,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:44:30,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:30,270 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:30,270 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 65 [2019-11-16 00:44:30,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:30,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:30,273 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:30,293 INFO L567 ElimStorePlain]: treesize reduction 31, result has 53.7 percent of original size [2019-11-16 00:44:30,294 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:44:30,294 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:35 [2019-11-16 00:44:30,308 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-16 00:44:30,309 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-16 00:44:30,309 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-11-16 00:44:30,325 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 30 states and 35 transitions. Complement of second has 7 states. [2019-11-16 00:44:30,328 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-16 00:44:30,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:44:30,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-11-16 00:44:30,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-16 00:44:30,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:44:30,329 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:44:30,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:30,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:30,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:44:30,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:30,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:44:30,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:30,408 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:30,408 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 65 [2019-11-16 00:44:30,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:30,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:30,411 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:30,433 INFO L567 ElimStorePlain]: treesize reduction 31, result has 53.7 percent of original size [2019-11-16 00:44:30,434 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:44:30,434 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:35 [2019-11-16 00:44:30,449 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-16 00:44:30,450 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-16 00:44:30,450 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-11-16 00:44:30,491 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 51 states and 59 transitions. Complement of second has 9 states. [2019-11-16 00:44:30,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-16 00:44:30,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:44:30,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2019-11-16 00:44:30,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-16 00:44:30,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:44:30,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 17 letters. Loop has 3 letters. [2019-11-16 00:44:30,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:44:30,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 14 letters. Loop has 6 letters. [2019-11-16 00:44:30,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:44:30,495 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 59 transitions. [2019-11-16 00:44:30,496 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:44:30,497 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 37 states and 43 transitions. [2019-11-16 00:44:30,497 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-16 00:44:30,497 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-16 00:44:30,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 43 transitions. [2019-11-16 00:44:30,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:44:30,498 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 43 transitions. [2019-11-16 00:44:30,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 43 transitions. [2019-11-16 00:44:30,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2019-11-16 00:44:30,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-16 00:44:30,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2019-11-16 00:44:30,501 INFO L711 BuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2019-11-16 00:44:30,501 INFO L591 BuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2019-11-16 00:44:30,501 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-16 00:44:30,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 41 transitions. [2019-11-16 00:44:30,502 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:44:30,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:44:30,502 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:44:30,503 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:44:30,503 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:44:30,503 INFO L791 eck$LassoCheckResult]: Stem: 1089#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1082#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 1083#L569 goto; 1084#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 1106#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 1099#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 1100#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 1114#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 1113#L559 assume !(0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2));havoc f_#t~mem10; 1112#L564 goto; 1110#L567 call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 1087#L564-1 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 1088#L566 assume 0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2);havoc f_#t~mem14; 1103#L567 call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 1105#L564-1 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 1102#L566 assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; 1101#L569 goto; 1097#L560 [2019-11-16 00:44:30,504 INFO L793 eck$LassoCheckResult]: Loop: 1097#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 1091#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 1092#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 1097#L560 [2019-11-16 00:44:30,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:30,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1305515858, now seen corresponding path program 1 times [2019-11-16 00:44:30,504 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:30,504 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858306240] [2019-11-16 00:44:30,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:30,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:30,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:30,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:30,565 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:44:30,565 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858306240] [2019-11-16 00:44:30,565 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193687922] [2019-11-16 00:44:30,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d6675dc-eff7-461f-97bb-78d30b6dba9c/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:44:30,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:30,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-16 00:44:30,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:30,811 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-11-16 00:44:30,811 INFO L341 Elim1Store]: treesize reduction 92, result has 49.7 percent of original size [2019-11-16 00:44:30,811 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 123 treesize of output 98 [2019-11-16 00:44:30,812 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:30,905 INFO L567 ElimStorePlain]: treesize reduction 32, result has 69.2 percent of original size [2019-11-16 00:44:30,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:44:30,907 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-16 00:44:30,907 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:130, output treesize:21 [2019-11-16 00:44:30,953 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:30,954 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 49 [2019-11-16 00:44:30,954 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:30,983 INFO L567 ElimStorePlain]: treesize reduction 12, result has 67.6 percent of original size [2019-11-16 00:44:30,983 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:44:30,984 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:25 [2019-11-16 00:44:31,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:31,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:44:31,038 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:31,039 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 62 [2019-11-16 00:44:31,040 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:31,045 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 41 treesize of output 29 [2019-11-16 00:44:31,046 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:31,113 INFO L567 ElimStorePlain]: treesize reduction 34, result has 60.9 percent of original size [2019-11-16 00:44:31,113 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-16 00:44:31,113 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:87, output treesize:53 [2019-11-16 00:44:31,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:31,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:31,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:31,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:31,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:31,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:31,264 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:44:31,265 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:44:31,266 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 32 [2019-11-16 00:44:31,267 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:31,297 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:31,297 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 65 [2019-11-16 00:44:31,298 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:31,341 INFO L567 ElimStorePlain]: treesize reduction 52, result has 35.0 percent of original size [2019-11-16 00:44:31,342 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:44:31,342 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:101, output treesize:28 [2019-11-16 00:44:31,371 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:44:31,371 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:44:31,371 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-11-16 00:44:31,371 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60558791] [2019-11-16 00:44:31,372 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:44:31,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:31,372 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 5 times [2019-11-16 00:44:31,372 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:31,372 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268172834] [2019-11-16 00:44:31,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:31,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:31,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:31,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:31,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:31,390 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:44:31,503 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:31,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-16 00:44:31,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:44:31,504 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. cyclomatic complexity: 10 Second operand 13 states. [2019-11-16 00:44:31,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:31,739 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2019-11-16 00:44:31,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:44:31,740 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 35 transitions. [2019-11-16 00:44:31,740 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:44:31,740 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 0 states and 0 transitions. [2019-11-16 00:44:31,740 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:44:31,740 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:44:31,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:44:31,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:44:31,741 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:44:31,741 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:44:31,741 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:44:31,741 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-16 00:44:31,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:44:31,741 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:44:31,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-16 00:44:31,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:44:31 BoogieIcfgContainer [2019-11-16 00:44:31,747 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:44:31,747 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:44:31,747 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:44:31,748 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:44:31,748 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:44:14" (3/4) ... [2019-11-16 00:44:31,751 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:44:31,751 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:44:31,753 INFO L168 Benchmark]: Toolchain (without parser) took 18266.66 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 265.8 MB). Free memory was 938.0 MB in the beginning and 907.9 MB in the end (delta: 30.1 MB). Peak memory consumption was 295.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:31,754 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:44:31,754 INFO L168 Benchmark]: CACSL2BoogieTranslator took 517.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.8 MB). Free memory was 938.0 MB in the beginning and 1.2 GB in the end (delta: -212.5 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:31,755 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.09 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-16 00:44:31,755 INFO L168 Benchmark]: Boogie Preprocessor took 26.74 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:31,756 INFO L168 Benchmark]: RCFGBuilder took 405.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:31,756 INFO L168 Benchmark]: BuchiAutomizer took 17272.73 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 98.0 MB). Free memory was 1.1 GB in the beginning and 907.9 MB in the end (delta: 213.5 MB). Peak memory consumption was 311.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:31,757 INFO L168 Benchmark]: Witness Printer took 3.97 ms. Allocated memory is still 1.3 GB. Free memory is still 907.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:44:31,759 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.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 517.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.8 MB). Free memory was 938.0 MB in the beginning and 1.2 GB in the end (delta: -212.5 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.09 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. * Boogie Preprocessor took 26.74 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 405.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 17272.73 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 98.0 MB). Free memory was 1.1 GB in the beginning and 907.9 MB in the end (delta: 213.5 MB). Peak memory consumption was 311.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.97 ms. Allocated memory is still 1.3 GB. Free memory is still 907.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[j][j] + 1 and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[k_ref][k_ref] + -1 * unknown-#memory_int-unknown[i][i] and consists of 4 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[i][i] + unknown-#memory_int-unknown[k_ref][k_ref] and consists of 5 locations. 4 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 17.2s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 15.7s. Construction of modules took 0.2s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 11 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 35 states and ocurred in iteration 6. Nontrivial modules had stage [2, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 74 SDtfs, 70 SDslu, 162 SDs, 0 SdLazy, 242 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU2 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital891 mio100 ax103 hnf100 lsp94 ukn42 mio100 lsp34 div100 bol100 ite100 ukn100 eq183 hnf88 smp93 dnf755 smp90 tf100 neg91 sie127 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 57ms VariablesStem: 9 VariablesLoop: 6 DisjunctsStem: 16 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 36 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...