./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/working_dir_ee36ec24-5b16-4d7c-896f-00faef2ea813/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ee36ec24-5b16-4d7c-896f-00faef2ea813/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ee36ec24-5b16-4d7c-896f-00faef2ea813/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ee36ec24-5b16-4d7c-896f-00faef2ea813/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/twisted-alloca.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ee36ec24-5b16-4d7c-896f-00faef2ea813/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ee36ec24-5b16-4d7c-896f-00faef2ea813/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-10-22 08:57:54,268 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:57:54,270 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:57:54,279 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:57:54,279 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:57:54,280 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:57:54,281 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:57:54,282 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:57:54,284 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:57:54,285 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:57:54,286 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:57:54,287 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:57:54,287 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:57:54,288 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:57:54,288 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:57:54,289 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:57:54,290 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:57:54,291 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:57:54,292 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:57:54,293 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:57:54,294 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:57:54,295 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:57:54,296 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:57:54,297 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:57:54,299 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:57:54,299 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:57:54,299 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:57:54,300 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:57:54,300 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:57:54,301 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:57:54,301 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:57:54,302 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:57:54,303 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:57:54,303 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:57:54,304 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:57:54,304 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:57:54,305 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:57:54,305 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:57:54,305 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:57:54,306 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:57:54,306 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:57:54,307 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ee36ec24-5b16-4d7c-896f-00faef2ea813/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:57:54,320 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:57:54,320 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:57:54,321 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:57:54,321 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:57:54,322 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:57:54,322 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:57:54,322 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:57:54,322 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:57:54,322 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:57:54,323 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:57:54,323 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:57:54,323 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:57:54,323 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:57:54,323 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:57:54,324 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:57:54,324 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:57:54,324 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:57:54,324 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:57:54,325 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:57:54,325 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:57:54,325 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:57:54,325 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:57:54,325 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:57:54,326 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:57:54,326 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:57:54,326 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:57:54,326 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:57:54,326 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:57:54,327 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:57:54,327 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_ee36ec24-5b16-4d7c-896f-00faef2ea813/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-10-22 08:57:54,351 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:57:54,362 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:57:54,365 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:57:54,369 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:57:54,370 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:57:54,372 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ee36ec24-5b16-4d7c-896f-00faef2ea813/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/twisted-alloca.i [2019-10-22 08:57:54,421 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ee36ec24-5b16-4d7c-896f-00faef2ea813/bin/uautomizer/data/23eef1615/871520a8af884c3dbab889f651878b03/FLAG57f1c9e51 [2019-10-22 08:57:54,865 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:57:54,868 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ee36ec24-5b16-4d7c-896f-00faef2ea813/sv-benchmarks/c/termination-memory-alloca/twisted-alloca.i [2019-10-22 08:57:54,879 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ee36ec24-5b16-4d7c-896f-00faef2ea813/bin/uautomizer/data/23eef1615/871520a8af884c3dbab889f651878b03/FLAG57f1c9e51 [2019-10-22 08:57:54,894 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ee36ec24-5b16-4d7c-896f-00faef2ea813/bin/uautomizer/data/23eef1615/871520a8af884c3dbab889f651878b03 [2019-10-22 08:57:54,897 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:57:54,899 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:57:54,900 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:54,900 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:57:54,904 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:57:54,905 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:54" (1/1) ... [2019-10-22 08:57:54,909 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4544c513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:54, skipping insertion in model container [2019-10-22 08:57:54,909 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:54" (1/1) ... [2019-10-22 08:57:54,918 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:57:54,967 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:57:55,313 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:55,324 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:57:55,386 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:55,429 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:57:55,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:55 WrapperNode [2019-10-22 08:57:55,430 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:55,431 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:55,431 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:57:55,431 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:57:55,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:55" (1/1) ... [2019-10-22 08:57:55,455 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:55" (1/1) ... [2019-10-22 08:57:55,473 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:55,474 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:57:55,474 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:57:55,474 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:57:55,484 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:55" (1/1) ... [2019-10-22 08:57:55,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:55" (1/1) ... [2019-10-22 08:57:55,487 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:55" (1/1) ... [2019-10-22 08:57:55,487 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:55" (1/1) ... [2019-10-22 08:57:55,492 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:55" (1/1) ... [2019-10-22 08:57:55,496 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:55" (1/1) ... [2019-10-22 08:57:55,498 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:55" (1/1) ... [2019-10-22 08:57:55,500 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:57:55,501 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:57:55,501 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:57:55,501 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:57:55,502 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ee36ec24-5b16-4d7c-896f-00faef2ea813/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:55,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:57:55,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:57:55,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:57:55,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:57:55,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:57:55,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:57:55,862 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:57:55,862 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 08:57:55,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:55 BoogieIcfgContainer [2019-10-22 08:57:55,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:57:55,864 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:57:55,864 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:57:55,868 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:57:55,870 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:57:55,870 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:57:54" (1/3) ... [2019-10-22 08:57:55,871 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a45c0c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:57:55, skipping insertion in model container [2019-10-22 08:57:55,871 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:57:55,871 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:55" (2/3) ... [2019-10-22 08:57:55,872 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a45c0c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:57:55, skipping insertion in model container [2019-10-22 08:57:55,872 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:57:55,872 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:55" (3/3) ... [2019-10-22 08:57:55,874 INFO L371 chiAutomizerObserver]: Analyzing ICFG twisted-alloca.i [2019-10-22 08:57:55,942 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:57:55,942 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:57:55,943 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:57:55,943 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:57:55,943 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:57:55,943 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:57:55,943 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:57:55,943 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:57:55,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-10-22 08:57:55,991 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 08:57:55,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:55,993 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:56,003 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:57:56,003 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:57:56,003 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:57:56,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-10-22 08:57:56,005 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 08:57:56,005 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:56,005 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:56,005 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:57:56,006 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:57:56,015 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-10-22 08:57:56,015 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-10-22 08:57:56,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:56,021 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-10-22 08:57:56,030 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:56,031 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624115726] [2019-10-22 08:57:56,031 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:56,031 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:56,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:56,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:56,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:56,242 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:56,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:56,243 INFO L82 PathProgramCache]: Analyzing trace with hash 46885240, now seen corresponding path program 1 times [2019-10-22 08:57:56,244 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:56,244 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458065936] [2019-10-22 08:57:56,244 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:56,245 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:56,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:56,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:56,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:56,285 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458065936] [2019-10-22 08:57:56,285 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:56,286 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-10-22 08:57:56,286 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643287424] [2019-10-22 08:57:56,293 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:57:56,294 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:56,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 08:57:56,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 08:57:56,314 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2019-10-22 08:57:56,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:56,322 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2019-10-22 08:57:56,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 08:57:56,325 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2019-10-22 08:57:56,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 08:57:56,331 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 10 states and 13 transitions. [2019-10-22 08:57:56,333 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 08:57:56,333 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 08:57:56,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2019-10-22 08:57:56,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:57:56,335 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-10-22 08:57:56,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2019-10-22 08:57:56,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-10-22 08:57:56,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-10-22 08:57:56,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-10-22 08:57:56,367 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-10-22 08:57:56,367 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-10-22 08:57:56,367 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:57:56,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-10-22 08:57:56,370 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 08:57:56,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:56,370 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:56,370 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:57:56,371 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:56,371 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-10-22 08:57:56,371 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~mem7;havoc f_#t~mem6; 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-10-22 08:57:56,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:56,371 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-10-22 08:57:56,372 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:56,372 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153316795] [2019-10-22 08:57:56,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:56,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:56,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:56,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:56,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:56,475 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:56,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:56,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1311753714, now seen corresponding path program 1 times [2019-10-22 08:57:56,476 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:56,476 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433348820] [2019-10-22 08:57:56,479 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:56,480 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:56,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:56,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:56,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:56,547 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:56,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:56,547 INFO L82 PathProgramCache]: Analyzing trace with hash 234543116, now seen corresponding path program 1 times [2019-10-22 08:57:56,548 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:56,548 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406262447] [2019-10-22 08:57:56,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:56,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:56,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:56,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:56,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:56,667 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:56,792 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-10-22 08:57:56,947 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-10-22 08:57:57,631 WARN L191 SmtUtils]: Spent 680.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 105 [2019-10-22 08:57:57,916 WARN L191 SmtUtils]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-10-22 08:57:57,930 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:57:57,931 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:57:57,931 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:57:57,931 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:57:57,931 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:57:57,931 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:57,932 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:57:57,932 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:57:57,933 INFO L131 ssoRankerPreferences]: Filename of dumped script: twisted-alloca.i_Iteration2_Lasso [2019-10-22 08:57:57,933 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:57:57,933 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:57:57,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:57,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:57,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:57,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:57,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:57,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:57,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:57,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:57,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:57,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:57,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:58,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:58,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:58,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:58,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:58,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:58,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:58,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:58,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:58,586 WARN L191 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 95 [2019-10-22 08:57:58,763 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-10-22 08:57:58,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:58,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:00,186 WARN L191 SmtUtils]: Spent 833.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-10-22 08:58:00,219 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:00,225 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:58:00,227 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:00,229 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,229 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:00,230 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,230 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,230 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,231 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:00,231 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:00,234 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,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-10-22 08:58:00,235 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,235 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:00,235 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,235 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,235 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,236 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:00,236 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:00,237 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,238 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:00,238 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,238 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:00,238 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,239 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,239 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,239 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:00,239 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:00,240 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:00,241 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,241 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,241 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,242 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,243 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:00,244 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:00,246 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,247 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:00,247 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,248 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,248 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,248 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,250 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:00,250 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:00,252 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,253 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:00,253 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,254 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,254 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,254 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,255 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:00,255 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:00,259 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,260 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:00,260 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,261 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:00,261 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,261 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,261 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,261 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:00,262 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:00,262 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,263 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:00,263 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,263 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,264 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,264 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,265 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:00,265 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:00,268 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,268 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:00,269 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,269 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:00,269 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,269 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,269 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,270 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:00,270 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:00,270 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,271 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:00,271 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,272 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:00,272 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,272 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,272 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,273 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:00,273 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:00,274 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,274 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:00,274 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,275 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:00,275 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,275 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,275 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,275 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:00,276 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:00,276 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,277 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:00,277 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,277 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:00,278 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,278 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,278 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,278 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:00,278 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:00,279 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,279 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:00,280 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,281 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:00,281 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,281 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,281 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,281 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:00,281 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:00,282 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,283 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:00,283 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,283 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,283 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,283 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,285 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:00,285 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:00,288 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:00,289 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,289 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:00,289 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,289 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,289 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,290 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:00,290 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:00,291 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,291 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:00,292 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,292 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:00,292 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,292 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,293 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,293 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:00,293 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:00,294 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,294 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:00,295 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,295 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:00,295 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,295 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,295 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,295 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:00,296 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:00,297 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,297 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:00,298 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,298 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,298 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,298 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,299 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:00,299 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:00,303 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,303 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:00,304 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,304 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,304 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,304 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,307 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:00,308 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:00,316 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,317 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:00,317 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,318 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,318 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,318 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,319 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:00,319 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:00,321 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,322 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:00,322 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,323 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,323 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,323 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,324 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:00,324 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:00,327 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,328 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:00,329 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,329 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,329 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,329 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,334 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:00,334 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:00,364 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,365 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:00,365 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,365 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,366 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,366 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,367 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:00,367 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:00,373 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:58:00,380 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:58:00,380 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:58:00,382 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:58:00,383 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:58:00,384 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:58:00,384 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-10-22 08:58:00,514 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2019-10-22 08:58:00,523 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:58:00,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:00,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:00,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:00,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:00,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:00,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:58:00,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:00,622 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-10-22 08:58:00,623 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:00,632 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:00,632 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:58:00,632 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:19 [2019-10-22 08:58:00,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:00,647 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-10-22 08:58:00,648 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 5 states. [2019-10-22 08:58:00,686 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-10-22 08:58:00,687 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-10-22 08:58:00,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 08:58:00,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-10-22 08:58:00,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 2 letters. Loop has 7 letters. [2019-10-22 08:58:00,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:00,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 7 letters. [2019-10-22 08:58:00,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:00,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 2 letters. Loop has 14 letters. [2019-10-22 08:58:00,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:00,692 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 27 transitions. [2019-10-22 08:58:00,694 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:58:00,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 16 states and 21 transitions. [2019-10-22 08:58:00,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-10-22 08:58:00,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-10-22 08:58:00,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2019-10-22 08:58:00,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:58:00,695 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-10-22 08:58:00,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2019-10-22 08:58:00,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-10-22 08:58:00,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-22 08:58:00,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-10-22 08:58:00,697 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-10-22 08:58:00,697 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-10-22 08:58:00,697 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:58:00,697 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2019-10-22 08:58:00,698 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:58:00,698 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:00,698 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:00,698 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 08:58:00,698 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:58:00,698 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-10-22 08:58:00,699 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~mem7;havoc f_#t~mem6;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-10-22 08:58:00,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:00,699 INFO L82 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2019-10-22 08:58:00,699 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:00,699 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274509279] [2019-10-22 08:58:00,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:00,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:00,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:00,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:00,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:00,725 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:00,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:00,726 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2019-10-22 08:58:00,726 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:00,726 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156490499] [2019-10-22 08:58:00,726 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:00,726 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:00,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:00,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:00,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:00,738 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:00,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:00,738 INFO L82 PathProgramCache]: Analyzing trace with hash 889536583, now seen corresponding path program 1 times [2019-10-22 08:58:00,738 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:00,738 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12917380] [2019-10-22 08:58:00,738 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:00,739 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:00,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:00,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:00,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:00,779 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:01,331 WARN L191 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 108 [2019-10-22 08:58:01,547 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2019-10-22 08:58:01,551 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:01,551 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:01,551 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:01,551 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:01,551 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:58:01,551 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:01,552 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:01,552 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:01,552 INFO L131 ssoRankerPreferences]: Filename of dumped script: twisted-alloca.i_Iteration3_Lasso [2019-10-22 08:58:01,552 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:01,552 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:01,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:01,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:01,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:01,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:01,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:02,025 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 89 [2019-10-22 08:58:02,140 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-10-22 08:58:02,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:02,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:02,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:02,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:02,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:02,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:02,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:02,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:02,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:02,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:02,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:02,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:02,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:02,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:02,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:02,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:02,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:03,274 WARN L191 SmtUtils]: Spent 796.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-10-22 08:58:03,415 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:03,415 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:58:03,415 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:03,416 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:03,416 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:03,416 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:03,416 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:03,417 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:03,417 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:03,417 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:03,418 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:03,418 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:03,418 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:03,419 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:03,419 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:03,419 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:03,419 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:03,419 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:03,419 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:03,420 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:03,420 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:03,421 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:03,421 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:03,421 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:03,421 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:03,421 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:03,422 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:03,422 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:03,422 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:03,423 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:03,423 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:03,423 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:03,423 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:03,424 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:03,424 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:03,424 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:03,426 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:03,426 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:03,427 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:03,427 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:03,427 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:03,427 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:03,429 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:03,429 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:03,432 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:03,432 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:03,433 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:03,433 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:03,433 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:03,433 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:03,434 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:03,434 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:03,437 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:03,437 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:03,438 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:03,438 INFO L202 nArgumentSynthesizer]: 16 stem disjuncts [2019-10-22 08:58:03,438 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:03,438 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:03,446 INFO L400 nArgumentSynthesizer]: We have 36 Motzkin's Theorem applications. [2019-10-22 08:58:03,446 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:03,500 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:03,500 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:03,501 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:03,501 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:03,501 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:03,501 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:03,502 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:03,502 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:03,503 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:03,504 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:03,505 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:03,505 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:03,505 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:03,505 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:03,506 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:03,506 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:03,508 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:03,509 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:03,509 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:03,509 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:03,509 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:03,509 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:03,510 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:03,510 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:03,515 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:03,516 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:03,516 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:03,516 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:03,517 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:03,517 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:03,517 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:03,517 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:03,519 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:03,519 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:03,520 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:03,520 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:03,520 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:03,521 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:03,521 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:03,521 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:03,523 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:03,524 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:03,524 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:03,525 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:03,525 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:03,525 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:03,526 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:03,526 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:03,530 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:03,531 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:03,531 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:03,531 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:03,532 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:03,532 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:03,534 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:03,535 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:03,549 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:03,550 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:03,550 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:03,550 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:03,550 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:03,551 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:03,551 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:03,551 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:03,554 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:03,554 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:03,554 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:03,555 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:03,555 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:03,555 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:03,557 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:03,557 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:03,568 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:58:03,578 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:58:03,578 INFO L444 ModelExtractionUtils]: 15 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:58:03,578 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:58:03,579 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:58:03,579 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:58:03,579 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)_2, 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 + 1*v_rep(select (select #memory_int ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)_2 Supporting invariants [] [2019-10-22 08:58:03,705 INFO L297 tatePredicateManager]: 36 out of 36 supporting invariants were superfluous and have been removed [2019-10-22 08:58:03,706 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:58:03,707 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:58:03,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:03,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:03,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:03,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:03,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:58:03,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:03,800 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:03,800 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-10-22 08:58:03,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:58:03,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:58:03,806 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:03,839 INFO L567 ElimStorePlain]: treesize reduction 54, result has 39.3 percent of original size [2019-10-22 08:58:03,840 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:58:03,840 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:35 [2019-10-22 08:58:03,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:03,862 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-10-22 08:58:03,862 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-10-22 08:58:03,890 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-10-22 08:58:03,891 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-10-22 08:58:03,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:58:03,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-10-22 08:58:03,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 3 letters. [2019-10-22 08:58:03,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:03,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 3 letters. [2019-10-22 08:58:03,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:03,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 6 letters. [2019-10-22 08:58:03,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:03,892 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 43 transitions. [2019-10-22 08:58:03,894 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:58:03,894 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 24 states and 31 transitions. [2019-10-22 08:58:03,894 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-10-22 08:58:03,895 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-10-22 08:58:03,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 31 transitions. [2019-10-22 08:58:03,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:58:03,895 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2019-10-22 08:58:03,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 31 transitions. [2019-10-22 08:58:03,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-10-22 08:58:03,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-22 08:58:03,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2019-10-22 08:58:03,898 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-10-22 08:58:03,898 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-10-22 08:58:03,898 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:58:03,898 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2019-10-22 08:58:03,899 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:58:03,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:03,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:03,901 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:03,901 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:58:03,901 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~mem7;havoc f_#t~mem6; 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-10-22 08:58:03,901 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~mem7;havoc f_#t~mem6;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-10-22 08:58:03,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:03,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1319097990, now seen corresponding path program 2 times [2019-10-22 08:58:03,902 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:03,902 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935844020] [2019-10-22 08:58:03,902 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:03,902 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:03,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:03,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:03,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:03,946 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:03,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:03,949 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 2 times [2019-10-22 08:58:03,949 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:03,950 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244500460] [2019-10-22 08:58:03,950 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:03,950 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:03,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:03,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:03,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:03,963 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:03,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:03,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1702545424, now seen corresponding path program 1 times [2019-10-22 08:58:03,965 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:03,965 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957637189] [2019-10-22 08:58:03,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:03,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:03,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:03,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:04,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:04,111 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957637189] [2019-10-22 08:58:04,111 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106857729] [2019-10-22 08:58:04,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ee36ec24-5b16-4d7c-896f-00faef2ea813/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-10-22 08:58:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:04,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-22 08:58:04,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:04,223 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-10-22 08:58:04,223 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:04,250 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:04,382 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-10-22 08:58:04,383 INFO L341 Elim1Store]: treesize reduction 39, result has 70.9 percent of original size [2019-10-22 08:58:04,383 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-10-22 08:58:04,384 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:04,459 INFO L567 ElimStorePlain]: treesize reduction 47, result has 61.8 percent of original size [2019-10-22 08:58:04,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 08:58:04,461 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-10-22 08:58:04,461 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:147, output treesize:28 [2019-10-22 08:58:04,552 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:04,552 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-10-22 08:58:04,553 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:04,579 INFO L567 ElimStorePlain]: treesize reduction 46, result has 41.0 percent of original size [2019-10-22 08:58:04,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:58:04,580 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-10-22 08:58:04,581 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:32 [2019-10-22 08:58:04,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:58:04,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:58:04,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:58:04,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:58:04,662 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:04,663 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-10-22 08:58:04,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:58:04,664 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:04,677 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:04,677 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-10-22 08:58:04,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:58:04,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:58:04,679 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:04,717 INFO L567 ElimStorePlain]: treesize reduction 13, result has 68.3 percent of original size [2019-10-22 08:58:04,717 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-22 08:58:04,718 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:66, output treesize:15 [2019-10-22 08:58:04,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:04,735 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:58:04,735 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-10-22 08:58:04,736 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993448705] [2019-10-22 08:58:04,830 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:04,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-22 08:58:04,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-10-22 08:58:04,831 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. cyclomatic complexity: 10 Second operand 13 states. [2019-10-22 08:58:05,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:05,252 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2019-10-22 08:58:05,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-22 08:58:05,253 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 55 transitions. [2019-10-22 08:58:05,254 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:58:05,255 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 20 states and 24 transitions. [2019-10-22 08:58:05,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-10-22 08:58:05,255 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-10-22 08:58:05,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2019-10-22 08:58:05,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:58:05,256 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-10-22 08:58:05,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2019-10-22 08:58:05,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2019-10-22 08:58:05,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-22 08:58:05,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2019-10-22 08:58:05,257 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-10-22 08:58:05,257 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-10-22 08:58:05,258 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:58:05,258 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2019-10-22 08:58:05,258 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:58:05,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:05,258 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:05,259 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:05,259 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:58:05,259 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~mem7;havoc f_#t~mem6;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-10-22 08:58:05,259 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~mem7;havoc f_#t~mem6;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-10-22 08:58:05,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:05,260 INFO L82 PathProgramCache]: Analyzing trace with hash -635175977, now seen corresponding path program 1 times [2019-10-22 08:58:05,260 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:05,260 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358407626] [2019-10-22 08:58:05,261 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:05,261 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:05,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:05,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:05,366 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358407626] [2019-10-22 08:58:05,366 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:05,366 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:58:05,366 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955488024] [2019-10-22 08:58:05,367 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:58:05,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:05,367 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 3 times [2019-10-22 08:58:05,367 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:05,367 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862943363] [2019-10-22 08:58:05,367 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:05,368 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:05,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:05,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:05,381 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:05,486 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:05,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:58:05,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:58:05,486 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 5 states. [2019-10-22 08:58:05,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:05,506 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2019-10-22 08:58:05,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:58:05,508 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2019-10-22 08:58:05,509 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:58:05,509 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 21 transitions. [2019-10-22 08:58:05,510 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-10-22 08:58:05,510 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-10-22 08:58:05,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2019-10-22 08:58:05,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:58:05,510 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-10-22 08:58:05,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2019-10-22 08:58:05,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-22 08:58:05,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-22 08:58:05,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2019-10-22 08:58:05,512 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-10-22 08:58:05,516 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-10-22 08:58:05,516 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:58:05,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2019-10-22 08:58:05,517 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:58:05,517 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:05,517 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:05,517 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:05,518 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:58:05,518 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~mem7;havoc f_#t~mem6;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~mem7;havoc f_#t~mem6;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-10-22 08:58:05,518 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~mem7;havoc f_#t~mem6;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-10-22 08:58:05,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:05,518 INFO L82 PathProgramCache]: Analyzing trace with hash 184869755, now seen corresponding path program 1 times [2019-10-22 08:58:05,518 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:05,518 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110809586] [2019-10-22 08:58:05,519 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:05,519 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:05,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:05,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:05,569 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:05,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:05,571 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 4 times [2019-10-22 08:58:05,572 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:05,572 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762523978] [2019-10-22 08:58:05,572 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:05,572 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:05,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:05,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:05,581 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:05,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:05,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1306804847, now seen corresponding path program 2 times [2019-10-22 08:58:05,583 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:05,583 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016235680] [2019-10-22 08:58:05,584 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:05,584 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:05,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:05,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:05,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:05,642 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:07,296 WARN L191 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 198 DAG size of output: 154 [2019-10-22 08:58:07,682 WARN L191 SmtUtils]: Spent 383.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-10-22 08:58:07,685 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:07,685 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:07,685 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:07,685 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:07,686 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:58:07,686 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:07,686 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:07,686 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:07,686 INFO L131 ssoRankerPreferences]: Filename of dumped script: twisted-alloca.i_Iteration6_Lasso [2019-10-22 08:58:07,686 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:07,686 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:07,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:07,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:07,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:08,278 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 98 [2019-10-22 08:58:08,391 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-10-22 08:58:08,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:08,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-10-22 08:58:08,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:08,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:08,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:08,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:08,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:08,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-10-22 08:58:08,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:08,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-10-22 08:58:08,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:08,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:08,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:08,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-10-22 08:58:08,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:08,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-10-22 08:58:08,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:09,459 WARN L191 SmtUtils]: Spent 736.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-10-22 08:58:09,587 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:09,587 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:58:09,587 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:09,588 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:09,588 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:09,588 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:09,588 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:09,588 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:09,589 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:09,589 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:09,589 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:09,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:09,590 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:09,590 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:09,590 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:09,590 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:09,591 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:09,591 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:09,592 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:09,593 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:09,593 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:09,593 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:09,593 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:09,594 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:09,594 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:09,594 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:09,598 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:09,598 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:09,599 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:09,599 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:09,599 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:09,599 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:09,600 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:09,600 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:09,603 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:09,603 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:09,604 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:09,604 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:09,604 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:09,604 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:09,605 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:09,605 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:09,606 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:09,607 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:09,607 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:09,607 INFO L202 nArgumentSynthesizer]: 16 stem disjuncts [2019-10-22 08:58:09,607 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:09,608 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:09,613 INFO L400 nArgumentSynthesizer]: We have 36 Motzkin's Theorem applications. [2019-10-22 08:58:09,614 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:09,648 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:09,649 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:09,649 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:09,649 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:09,649 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:09,650 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:09,650 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:09,650 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:09,652 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:09,653 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:09,653 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:09,653 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:09,653 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:09,654 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:09,654 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:09,654 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:09,655 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:09,655 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:09,656 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:09,656 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:09,656 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:09,657 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:09,657 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:09,657 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:09,659 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:09,660 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:09,660 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:09,661 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:09,661 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:09,661 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:09,661 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:09,662 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:09,664 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:09,665 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:09,665 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:09,665 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:09,665 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:09,666 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:09,666 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:09,666 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:09,669 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:09,669 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:09,669 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:09,670 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:09,670 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:09,670 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:09,671 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:09,671 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:09,684 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:58:09,693 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:58:09,693 INFO L444 ModelExtractionUtils]: 15 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:58:09,694 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:58:09,694 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:58:09,694 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:58:09,694 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)_3, 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 - 1*v_rep(select (select #memory_int ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)_3 Supporting invariants [] [2019-10-22 08:58:09,819 INFO L297 tatePredicateManager]: 40 out of 40 supporting invariants were superfluous and have been removed [2019-10-22 08:58:09,820 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:58:09,821 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:58:09,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:09,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:09,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:09,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:09,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:58:09,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:09,906 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:09,906 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-10-22 08:58:09,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:58:09,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:58:09,909 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:09,930 INFO L567 ElimStorePlain]: treesize reduction 31, result has 53.7 percent of original size [2019-10-22 08:58:09,930 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:58:09,931 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:35 [2019-10-22 08:58:09,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:09,945 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-10-22 08:58:09,946 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-10-22 08:58:09,965 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-10-22 08:58:09,968 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-10-22 08:58:09,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:58:09,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-10-22 08:58:09,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 14 letters. Loop has 3 letters. [2019-10-22 08:58:09,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:09,969 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:58:09,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:09,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:09,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:09,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:10,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:10,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:58:10,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:10,060 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:10,060 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-10-22 08:58:10,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:58:10,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:58:10,063 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:10,092 INFO L567 ElimStorePlain]: treesize reduction 31, result has 53.7 percent of original size [2019-10-22 08:58:10,093 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:58:10,093 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:35 [2019-10-22 08:58:10,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:10,114 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-10-22 08:58:10,114 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-10-22 08:58:10,155 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-10-22 08:58:10,158 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-10-22 08:58:10,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:58:10,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2019-10-22 08:58:10,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2019-10-22 08:58:10,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:10,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 17 letters. Loop has 3 letters. [2019-10-22 08:58:10,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:10,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 14 letters. Loop has 6 letters. [2019-10-22 08:58:10,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:10,160 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 59 transitions. [2019-10-22 08:58:10,161 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:58:10,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 37 states and 43 transitions. [2019-10-22 08:58:10,162 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-10-22 08:58:10,162 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-10-22 08:58:10,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 43 transitions. [2019-10-22 08:58:10,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:58:10,163 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 43 transitions. [2019-10-22 08:58:10,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 43 transitions. [2019-10-22 08:58:10,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2019-10-22 08:58:10,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-22 08:58:10,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2019-10-22 08:58:10,166 INFO L711 BuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2019-10-22 08:58:10,166 INFO L591 BuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2019-10-22 08:58:10,166 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 08:58:10,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 41 transitions. [2019-10-22 08:58:10,167 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:58:10,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:10,167 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:10,168 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:10,168 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:58:10,168 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~mem7;havoc f_#t~mem6;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~mem7;havoc f_#t~mem6;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-10-22 08:58:10,168 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~mem7;havoc f_#t~mem6;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-10-22 08:58:10,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:10,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1305515858, now seen corresponding path program 1 times [2019-10-22 08:58:10,169 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:10,169 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415144220] [2019-10-22 08:58:10,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:10,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:10,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:10,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:10,242 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 08:58:10,242 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415144220] [2019-10-22 08:58:10,242 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101498887] [2019-10-22 08:58:10,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ee36ec24-5b16-4d7c-896f-00faef2ea813/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-10-22 08:58:10,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:10,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-22 08:58:10,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:10,466 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-10-22 08:58:10,467 INFO L341 Elim1Store]: treesize reduction 92, result has 49.7 percent of original size [2019-10-22 08:58:10,467 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-10-22 08:58:10,468 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:10,542 INFO L567 ElimStorePlain]: treesize reduction 32, result has 69.2 percent of original size [2019-10-22 08:58:10,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-22 08:58:10,545 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:58:10,545 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:130, output treesize:21 [2019-10-22 08:58:10,580 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:10,581 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-10-22 08:58:10,581 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:10,602 INFO L567 ElimStorePlain]: treesize reduction 12, result has 67.6 percent of original size [2019-10-22 08:58:10,603 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:58:10,603 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:25 [2019-10-22 08:58:10,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:58:10,635 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:58:10,650 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:10,651 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-10-22 08:58:10,651 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:10,656 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-10-22 08:58:10,656 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:10,706 INFO L567 ElimStorePlain]: treesize reduction 34, result has 60.9 percent of original size [2019-10-22 08:58:10,706 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-22 08:58:10,706 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:87, output treesize:53 [2019-10-22 08:58:10,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:58:10,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:58:10,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:58:10,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:58:10,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:58:10,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:58:10,866 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-22 08:58:10,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:58:10,868 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-10-22 08:58:10,869 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:10,889 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:10,890 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-10-22 08:58:10,890 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:10,929 INFO L567 ElimStorePlain]: treesize reduction 52, result has 35.0 percent of original size [2019-10-22 08:58:10,930 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:58:10,930 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:101, output treesize:28 [2019-10-22 08:58:10,956 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:10,957 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:58:10,957 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-10-22 08:58:10,957 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805957358] [2019-10-22 08:58:10,957 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:58:10,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:10,958 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 5 times [2019-10-22 08:58:10,958 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:10,958 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053323865] [2019-10-22 08:58:10,958 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:10,958 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:10,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:10,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:10,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:10,968 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:11,082 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:11,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-22 08:58:11,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-10-22 08:58:11,082 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. cyclomatic complexity: 10 Second operand 13 states. [2019-10-22 08:58:11,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:11,369 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2019-10-22 08:58:11,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 08:58:11,370 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 35 transitions. [2019-10-22 08:58:11,370 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:58:11,371 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 0 states and 0 transitions. [2019-10-22 08:58:11,371 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:58:11,371 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:58:11,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:58:11,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:58:11,371 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:11,371 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:11,371 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:11,371 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 08:58:11,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:58:11,372 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:58:11,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:58:11,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:58:11 BoogieIcfgContainer [2019-10-22 08:58:11,377 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:58:11,377 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:58:11,377 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:58:11,378 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:58:11,378 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:55" (3/4) ... [2019-10-22 08:58:11,382 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:58:11,382 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:58:11,383 INFO L168 Benchmark]: Toolchain (without parser) took 16485.19 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 282.6 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -149.0 MB). Peak memory consumption was 133.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:11,384 INFO L168 Benchmark]: CDTParser took 0.59 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:11,384 INFO L168 Benchmark]: CACSL2BoogieTranslator took 530.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -174.3 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:11,385 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.00 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:11,385 INFO L168 Benchmark]: Boogie Preprocessor took 26.46 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:11,386 INFO L168 Benchmark]: RCFGBuilder took 362.84 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-10-22 08:58:11,386 INFO L168 Benchmark]: BuchiAutomizer took 15513.00 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 146.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -3.7 MB). Peak memory consumption was 142.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:11,386 INFO L168 Benchmark]: Witness Printer took 4.78 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:11,389 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.59 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 530.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -174.3 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.00 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.46 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 362.84 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 15513.00 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 146.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -3.7 MB). Peak memory consumption was 142.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.78 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. 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 -1 * unknown-#memory_int-unknown[i][i] + unknown-#memory_int-unknown[k_ref][k_ref] 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 5 locations. 4 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.4s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 13.8s. Construction of modules took 0.2s. Büchi inclusion checks took 1.1s. 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: 62ms 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...