./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/subseq-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a78dda67-b9f6-486a-b7a5-67f79fc2993c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a78dda67-b9f6-486a-b7a5-67f79fc2993c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a78dda67-b9f6-486a-b7a5-67f79fc2993c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a78dda67-b9f6-486a-b7a5-67f79fc2993c/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/subseq-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_a78dda67-b9f6-486a-b7a5-67f79fc2993c/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a78dda67-b9f6-486a-b7a5-67f79fc2993c/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 20f541ceeb4d88c1ded29d751212bcde5b7dc0f0 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:22:13,444 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:22:13,445 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:22:13,461 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:22:13,461 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:22:13,462 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:22:13,464 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:22:13,468 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:22:13,470 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:22:13,471 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:22:13,471 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:22:13,472 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:22:13,473 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:22:13,473 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:22:13,474 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:22:13,475 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:22:13,476 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:22:13,477 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:22:13,478 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:22:13,480 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:22:13,482 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:22:13,483 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:22:13,484 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:22:13,484 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:22:13,487 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:22:13,487 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:22:13,488 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:22:13,488 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:22:13,489 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:22:13,490 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:22:13,490 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:22:13,491 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:22:13,491 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:22:13,492 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:22:13,493 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:22:13,493 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:22:13,494 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:22:13,494 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:22:13,494 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:22:13,495 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:22:13,495 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:22:13,496 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a78dda67-b9f6-486a-b7a5-67f79fc2993c/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 22:22:13,524 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:22:13,528 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:22:13,530 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:22:13,530 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:22:13,531 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:22:13,531 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 22:22:13,531 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 22:22:13,531 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 22:22:13,532 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 22:22:13,532 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 22:22:13,533 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 22:22:13,533 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:22:13,534 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:22:13,534 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:22:13,534 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:22:13,534 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:22:13,535 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:22:13,535 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 22:22:13,535 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 22:22:13,535 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 22:22:13,535 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:22:13,536 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:22:13,536 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 22:22:13,536 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:22:13,537 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 22:22:13,537 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:22:13,538 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:22:13,538 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 22:22:13,538 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:22:13,538 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:22:13,539 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 22:22:13,540 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 22:22:13,541 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_a78dda67-b9f6-486a-b7a5-67f79fc2993c/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 20f541ceeb4d88c1ded29d751212bcde5b7dc0f0 [2019-11-15 22:22:13,580 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:22:13,596 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:22:13,601 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:22:13,602 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:22:13,603 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:22:13,603 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a78dda67-b9f6-486a-b7a5-67f79fc2993c/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/subseq-alloca-2.i [2019-11-15 22:22:13,662 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a78dda67-b9f6-486a-b7a5-67f79fc2993c/bin/uautomizer/data/e66fe3f22/60f4eaf528f74de69be72226a5e0f13a/FLAGa58cf17e9 [2019-11-15 22:22:14,125 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:22:14,126 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a78dda67-b9f6-486a-b7a5-67f79fc2993c/sv-benchmarks/c/array-memsafety/subseq-alloca-2.i [2019-11-15 22:22:14,140 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a78dda67-b9f6-486a-b7a5-67f79fc2993c/bin/uautomizer/data/e66fe3f22/60f4eaf528f74de69be72226a5e0f13a/FLAGa58cf17e9 [2019-11-15 22:22:14,429 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a78dda67-b9f6-486a-b7a5-67f79fc2993c/bin/uautomizer/data/e66fe3f22/60f4eaf528f74de69be72226a5e0f13a [2019-11-15 22:22:14,431 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:22:14,432 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:22:14,433 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:22:14,434 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:22:14,437 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:22:14,437 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:22:14" (1/1) ... [2019-11-15 22:22:14,440 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dfdaaa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:22:14, skipping insertion in model container [2019-11-15 22:22:14,440 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:22:14" (1/1) ... [2019-11-15 22:22:14,447 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:22:14,480 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:22:14,823 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:22:14,832 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:22:14,870 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:22:14,913 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:22:14,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:22:14 WrapperNode [2019-11-15 22:22:14,914 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:22:14,915 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:22:14,915 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:22:14,915 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:22:14,923 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:22:14" (1/1) ... [2019-11-15 22:22:14,936 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:22:14" (1/1) ... [2019-11-15 22:22:14,957 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:22:14,958 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:22:14,958 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:22:14,958 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:22:14,967 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:22:14" (1/1) ... [2019-11-15 22:22:14,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:22:14" (1/1) ... [2019-11-15 22:22:14,970 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:22:14" (1/1) ... [2019-11-15 22:22:14,971 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:22:14" (1/1) ... [2019-11-15 22:22:14,977 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:22:14" (1/1) ... [2019-11-15 22:22:14,981 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:22:14" (1/1) ... [2019-11-15 22:22:14,983 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:22:14" (1/1) ... [2019-11-15 22:22:14,989 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:22:14,990 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:22:14,993 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:22:14,993 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:22:14,996 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:22:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a78dda67-b9f6-486a-b7a5-67f79fc2993c/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:22:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:22:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:22:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:22:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:22:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:22:15,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:22:15,381 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:22:15,382 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-15 22:22:15,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:22:15 BoogieIcfgContainer [2019-11-15 22:22:15,383 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:22:15,383 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 22:22:15,384 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 22:22:15,387 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 22:22:15,387 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:22:15,387 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 10:22:14" (1/3) ... [2019-11-15 22:22:15,388 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@426304f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:22:15, skipping insertion in model container [2019-11-15 22:22:15,388 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:22:15,388 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:22:14" (2/3) ... [2019-11-15 22:22:15,389 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@426304f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:22:15, skipping insertion in model container [2019-11-15 22:22:15,389 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:22:15,389 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:22:15" (3/3) ... [2019-11-15 22:22:15,391 INFO L371 chiAutomizerObserver]: Analyzing ICFG subseq-alloca-2.i [2019-11-15 22:22:15,431 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 22:22:15,431 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 22:22:15,431 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 22:22:15,432 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:22:15,432 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:22:15,432 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 22:22:15,432 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:22:15,432 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 22:22:15,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2019-11-15 22:22:15,461 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-15 22:22:15,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:22:15,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:22:15,467 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 22:22:15,467 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:22:15,467 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 22:22:15,467 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2019-11-15 22:22:15,469 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-15 22:22:15,469 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:22:15,469 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:22:15,470 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 22:22:15,470 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:22:15,475 INFO L791 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 18#L530true assume !(main_~length1~0 < 1); 21#L530-2true assume !(main_~length2~0 < 1); 13#L533-1true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 5#L539-3true [2019-11-15 22:22:15,475 INFO L793 eck$LassoCheckResult]: Loop: 5#L539-3true assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 3#L539-2true main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 5#L539-3true [2019-11-15 22:22:15,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:15,479 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-11-15 22:22:15,485 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:22:15,486 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140550956] [2019-11-15 22:22:15,486 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:15,486 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:15,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:22:15,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:22:15,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:22:15,600 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:22:15,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:15,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2019-11-15 22:22:15,602 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:22:15,602 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342266008] [2019-11-15 22:22:15,602 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:15,602 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:15,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:22:15,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:22:15,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:22:15,620 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:22:15,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:15,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2019-11-15 22:22:15,622 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:22:15,622 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584350858] [2019-11-15 22:22:15,622 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:15,622 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:15,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:22:15,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:22:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:22:15,665 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:22:15,848 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-15 22:22:15,945 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:22:15,946 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:22:15,946 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:22:15,946 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:22:15,946 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:22:15,947 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:22:15,947 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:22:15,948 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:22:15,948 INFO L131 ssoRankerPreferences]: Filename of dumped script: subseq-alloca-2.i_Iteration1_Lasso [2019-11-15 22:22:15,948 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:22:15,948 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:22:15,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-11-15 22:22:15,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-11-15 22:22:15,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-11-15 22:22:16,156 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-11-15 22:22:16,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:22:16,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:22:16,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:22:16,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:22:16,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:22:16,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:22:16,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:22:16,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:22:16,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:22:16,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:22:16,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:22:16,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:22:16,644 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 22:22:16,775 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:22:16,780 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:22:16,782 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:22:16,783 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:16,783 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:22:16,783 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:16,784 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:16,784 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:16,785 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:22:16,785 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:22:16,787 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:16,787 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:22:16,788 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:16,788 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:22:16,788 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:16,789 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:16,789 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:16,789 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:22:16,789 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:22:16,790 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:16,791 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:22:16,791 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:16,792 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:16,792 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:16,792 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:16,795 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:22:16,795 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:22:16,812 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:16,813 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:22:16,814 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:16,814 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:16,814 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:16,814 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:16,816 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:22:16,816 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:22:16,838 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:16,839 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:22:16,839 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:16,840 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:22:16,840 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:16,847 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:16,847 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:16,848 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:22:16,848 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:22:16,850 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:16,851 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:22:16,851 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:16,852 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 22:22:16,852 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:16,852 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:16,859 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 22:22:16,860 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:22:16,925 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:16,927 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:22:16,928 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:16,929 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:16,929 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:16,929 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:16,940 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:22:16,941 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:22:17,035 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:22:17,076 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-15 22:22:17,079 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-15 22:22:17,081 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:22:17,083 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:22:17,083 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:22:17,084 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~length1~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-11-15 22:22:17,102 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-15 22:22:17,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:17,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:17,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:22:17,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:22:17,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:17,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:22:17,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:22:17,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:22:17,211 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:22:17,212 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states. Second operand 3 states. [2019-11-15 22:22:17,287 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states.. Second operand 3 states. Result 54 states and 79 transitions. Complement of second has 7 states. [2019-11-15 22:22:17,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 22:22:17,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:22:17,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2019-11-15 22:22:17,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-15 22:22:17,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:22:17,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-15 22:22:17,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:22:17,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-15 22:22:17,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:22:17,305 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 79 transitions. [2019-11-15 22:22:17,309 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 22:22:17,316 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 17 states and 24 transitions. [2019-11-15 22:22:17,317 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-15 22:22:17,318 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-15 22:22:17,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2019-11-15 22:22:17,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:22:17,319 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-11-15 22:22:17,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2019-11-15 22:22:17,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-15 22:22:17,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-15 22:22:17,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2019-11-15 22:22:17,349 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-11-15 22:22:17,349 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-11-15 22:22:17,349 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 22:22:17,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2019-11-15 22:22:17,351 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 22:22:17,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:22:17,351 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:22:17,351 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:22:17,352 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:22:17,352 INFO L791 eck$LassoCheckResult]: Stem: 162#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 158#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 159#L530 assume !(main_~length1~0 < 1); 163#L530-2 assume !(main_~length2~0 < 1); 160#L533-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 152#L539-3 assume !(main_~i~0 < main_~length1~0 - 1); 153#L539-4 main_~i~1 := 0; 154#L545-3 [2019-11-15 22:22:17,352 INFO L793 eck$LassoCheckResult]: Loop: 154#L545-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 157#L545-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 154#L545-3 [2019-11-15 22:22:17,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:17,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2019-11-15 22:22:17,353 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:22:17,353 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180979916] [2019-11-15 22:22:17,353 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:17,354 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:17,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:22:17,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:22:17,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:22:17,396 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:22:17,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:17,399 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2019-11-15 22:22:17,400 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:22:17,400 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183497224] [2019-11-15 22:22:17,400 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:17,401 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:17,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:22:17,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:22:17,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:22:17,417 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:22:17,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:17,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2019-11-15 22:22:17,423 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:22:17,423 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718028944] [2019-11-15 22:22:17,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:17,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:17,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:22:17,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:22:17,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:22:17,453 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:22:17,625 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-11-15 22:22:17,738 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-15 22:22:17,740 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:22:17,740 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:22:17,740 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:22:17,740 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:22:17,740 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:22:17,741 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:22:17,741 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:22:17,741 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:22:17,741 INFO L131 ssoRankerPreferences]: Filename of dumped script: subseq-alloca-2.i_Iteration2_Lasso [2019-11-15 22:22:17,741 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:22:17,741 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:22:17,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:22:17,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:22:17,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:22:17,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:22:17,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-11-15 22:22:17,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:22:17,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:22:17,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:22:17,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:22:17,979 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-11-15 22:22:18,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-11-15 22:22:18,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-11-15 22:22:18,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:22:18,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:22:18,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:22:18,483 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 22:22:18,524 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:22:18,525 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:22:18,525 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:22:18,526 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:18,526 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:22:18,527 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:18,527 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:18,527 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:18,528 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:22:18,528 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:22:18,529 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:18,530 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:22:18,530 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:18,531 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:22:18,531 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:18,531 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:18,531 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:18,532 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:22:18,532 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:22:18,533 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:18,533 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:22:18,534 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:18,534 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:22:18,534 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:18,535 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:18,535 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:18,535 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:22:18,535 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:22:18,536 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:18,537 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:22:18,538 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:18,538 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:18,539 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:18,539 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:18,540 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:22:18,540 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:22:18,543 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:18,543 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:22:18,544 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:18,544 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:22:18,545 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:18,545 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:18,545 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:18,545 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:22:18,546 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:22:18,546 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:18,547 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:22:18,548 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:18,548 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:18,548 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:18,548 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:18,550 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:22:18,550 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:22:18,553 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:18,554 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:22:18,555 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:18,555 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:18,555 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:18,555 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:18,557 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:22:18,557 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:22:18,559 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:18,560 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:22:18,561 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:18,561 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:22:18,561 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:18,562 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:18,562 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:18,562 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:22:18,562 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:22:18,563 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:18,564 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:22:18,564 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:18,565 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:18,565 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:18,565 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:18,567 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:22:18,567 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:22:18,572 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:18,573 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:22:18,574 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:18,574 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:18,574 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:18,575 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:18,578 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:22:18,578 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:22:18,604 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:22:18,616 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:22:18,616 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:22:18,617 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:22:18,618 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:22:18,619 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:22:18,619 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1, ULTIMATE.start_main_~nondetString2~0.offset) = -1*ULTIMATE.start_main_~i~1 + 1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1 - 1*ULTIMATE.start_main_~nondetString2~0.offset Supporting invariants [] [2019-11-15 22:22:18,640 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-15 22:22:18,642 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 22:22:18,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:18,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:18,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:22:18,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:22:18,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:18,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:22:18,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:22:18,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:22:18,710 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:22:18,710 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-11-15 22:22:18,756 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 25 states and 38 transitions. Complement of second has 6 states. [2019-11-15 22:22:18,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 22:22:18,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:22:18,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2019-11-15 22:22:18,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-15 22:22:18,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:22:18,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 9 letters. Loop has 2 letters. [2019-11-15 22:22:18,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:22:18,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 7 letters. Loop has 4 letters. [2019-11-15 22:22:18,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:22:18,760 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 38 transitions. [2019-11-15 22:22:18,762 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 22:22:18,763 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 18 states and 26 transitions. [2019-11-15 22:22:18,763 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-15 22:22:18,763 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-15 22:22:18,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2019-11-15 22:22:18,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:22:18,764 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-11-15 22:22:18,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2019-11-15 22:22:18,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-15 22:22:18,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-15 22:22:18,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2019-11-15 22:22:18,770 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-11-15 22:22:18,770 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-11-15 22:22:18,770 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 22:22:18,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. [2019-11-15 22:22:18,773 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 22:22:18,773 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:22:18,773 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:22:18,774 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:22:18,775 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 22:22:18,775 INFO L791 eck$LassoCheckResult]: Stem: 279#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 275#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 276#L530 assume !(main_~length1~0 < 1); 280#L530-2 assume !(main_~length2~0 < 1); 277#L533-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 268#L539-3 assume !(main_~i~0 < main_~length1~0 - 1); 269#L539-4 main_~i~1 := 0; 270#L545-3 assume !(main_~i~1 < main_~length2~0 - 1); 278#L545-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);subseq_#in~s.base, subseq_#in~s.offset, subseq_#in~t.base, subseq_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc subseq_#res;havoc subseq_#t~mem5, subseq_#t~mem6, subseq_#t~post7.base, subseq_#t~post7.offset, subseq_#t~post8.base, subseq_#t~post8.offset, subseq_#t~mem2, subseq_#t~mem3, subseq_#t~short4, subseq_#t~mem9, subseq_~s.base, subseq_~s.offset, subseq_~t.base, subseq_~t.offset, subseq_~ps~0.base, subseq_~ps~0.offset, subseq_~pt~0.base, subseq_~pt~0.offset;subseq_~s.base, subseq_~s.offset := subseq_#in~s.base, subseq_#in~s.offset;subseq_~t.base, subseq_~t.offset := subseq_#in~t.base, subseq_#in~t.offset;subseq_~ps~0.base, subseq_~ps~0.offset := subseq_~s.base, subseq_~s.offset;subseq_~pt~0.base, subseq_~pt~0.offset := subseq_~t.base, subseq_~t.offset; 271#L518-5 [2019-11-15 22:22:18,775 INFO L793 eck$LassoCheckResult]: Loop: 271#L518-5 call subseq_#t~mem2 := read~int(subseq_~ps~0.base, subseq_~ps~0.offset, 1);subseq_#t~short4 := 0 != subseq_#t~mem2; 272#L518-1 assume subseq_#t~short4;call subseq_#t~mem3 := read~int(subseq_~pt~0.base, subseq_~pt~0.offset, 1);subseq_#t~short4 := 0 != subseq_#t~mem3; 266#L518-3 assume !!subseq_#t~short4;havoc subseq_#t~short4;havoc subseq_#t~mem2;havoc subseq_#t~mem3;call subseq_#t~mem5 := read~int(subseq_~ps~0.base, subseq_~ps~0.offset, 1);call subseq_#t~mem6 := read~int(subseq_~pt~0.base, subseq_~pt~0.offset, 1); 267#L519 assume !(subseq_#t~mem5 == subseq_#t~mem6);havoc subseq_#t~mem6;havoc subseq_#t~mem5; 281#L519-2 subseq_#t~post8.base, subseq_#t~post8.offset := subseq_~pt~0.base, subseq_~pt~0.offset;subseq_~pt~0.base, subseq_~pt~0.offset := subseq_#t~post8.base, 1 + subseq_#t~post8.offset;havoc subseq_#t~post8.base, subseq_#t~post8.offset; 271#L518-5 [2019-11-15 22:22:18,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:18,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384726, now seen corresponding path program 1 times [2019-11-15 22:22:18,776 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:22:18,777 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728802158] [2019-11-15 22:22:18,777 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:18,777 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:18,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:22:18,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:22:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:22:18,841 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:22:18,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:18,846 INFO L82 PathProgramCache]: Analyzing trace with hash 74536249, now seen corresponding path program 1 times [2019-11-15 22:22:18,846 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:22:18,847 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541921500] [2019-11-15 22:22:18,847 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:18,847 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:18,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:22:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:22:18,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:22:18,876 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:22:18,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:18,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1034036476, now seen corresponding path program 1 times [2019-11-15 22:22:18,878 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:22:18,878 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446618330] [2019-11-15 22:22:18,879 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:18,879 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:18,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:22:18,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:19,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:22:19,243 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446618330] [2019-11-15 22:22:19,243 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:22:19,243 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 22:22:19,244 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206268929] [2019-11-15 22:22:19,420 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-11-15 22:22:19,476 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:22:19,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:22:19,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:22:19,481 INFO L87 Difference]: Start difference. First operand 18 states and 26 transitions. cyclomatic complexity: 11 Second operand 9 states. [2019-11-15 22:22:19,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:22:19,824 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2019-11-15 22:22:19,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 22:22:19,825 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 50 transitions. [2019-11-15 22:22:19,827 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2019-11-15 22:22:19,828 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 50 transitions. [2019-11-15 22:22:19,829 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-15 22:22:19,829 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-15 22:22:19,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 50 transitions. [2019-11-15 22:22:19,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:22:19,829 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 50 transitions. [2019-11-15 22:22:19,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 50 transitions. [2019-11-15 22:22:19,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2019-11-15 22:22:19,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-15 22:22:19,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 38 transitions. [2019-11-15 22:22:19,833 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 38 transitions. [2019-11-15 22:22:19,833 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 38 transitions. [2019-11-15 22:22:19,833 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 22:22:19,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 38 transitions. [2019-11-15 22:22:19,834 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 22:22:19,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:22:19,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:22:19,835 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:22:19,835 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 22:22:19,836 INFO L791 eck$LassoCheckResult]: Stem: 364#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 359#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 360#L530 assume !(main_~length1~0 < 1); 366#L530-2 assume !(main_~length2~0 < 1); 361#L533-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 351#L539-3 assume !(main_~i~0 < main_~length1~0 - 1); 352#L539-4 main_~i~1 := 0; 362#L545-3 assume !(main_~i~1 < main_~length2~0 - 1); 363#L545-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);subseq_#in~s.base, subseq_#in~s.offset, subseq_#in~t.base, subseq_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc subseq_#res;havoc subseq_#t~mem5, subseq_#t~mem6, subseq_#t~post7.base, subseq_#t~post7.offset, subseq_#t~post8.base, subseq_#t~post8.offset, subseq_#t~mem2, subseq_#t~mem3, subseq_#t~short4, subseq_#t~mem9, subseq_~s.base, subseq_~s.offset, subseq_~t.base, subseq_~t.offset, subseq_~ps~0.base, subseq_~ps~0.offset, subseq_~pt~0.base, subseq_~pt~0.offset;subseq_~s.base, subseq_~s.offset := subseq_#in~s.base, subseq_#in~s.offset;subseq_~t.base, subseq_~t.offset := subseq_#in~t.base, subseq_#in~t.offset;subseq_~ps~0.base, subseq_~ps~0.offset := subseq_~s.base, subseq_~s.offset;subseq_~pt~0.base, subseq_~pt~0.offset := subseq_~t.base, subseq_~t.offset; 371#L518-5 call subseq_#t~mem2 := read~int(subseq_~ps~0.base, subseq_~ps~0.offset, 1);subseq_#t~short4 := 0 != subseq_#t~mem2; 368#L518-1 assume !subseq_#t~short4; 349#L518-3 [2019-11-15 22:22:19,836 INFO L793 eck$LassoCheckResult]: Loop: 349#L518-3 assume !!subseq_#t~short4;havoc subseq_#t~short4;havoc subseq_#t~mem2;havoc subseq_#t~mem3;call subseq_#t~mem5 := read~int(subseq_~ps~0.base, subseq_~ps~0.offset, 1);call subseq_#t~mem6 := read~int(subseq_~pt~0.base, subseq_~pt~0.offset, 1); 350#L519 assume subseq_#t~mem5 == subseq_#t~mem6;havoc subseq_#t~mem6;havoc subseq_#t~mem5;subseq_#t~post7.base, subseq_#t~post7.offset := subseq_~ps~0.base, subseq_~ps~0.offset;subseq_~ps~0.base, subseq_~ps~0.offset := subseq_#t~post7.base, 1 + subseq_#t~post7.offset;havoc subseq_#t~post7.base, subseq_#t~post7.offset; 367#L519-2 subseq_#t~post8.base, subseq_#t~post8.offset := subseq_~pt~0.base, subseq_~pt~0.offset;subseq_~pt~0.base, subseq_~pt~0.offset := subseq_#t~post8.base, 1 + subseq_#t~post8.offset;havoc subseq_#t~post8.base, subseq_#t~post8.offset; 355#L518-5 call subseq_#t~mem2 := read~int(subseq_~ps~0.base, subseq_~ps~0.offset, 1);subseq_#t~short4 := 0 != subseq_#t~mem2; 356#L518-1 assume !subseq_#t~short4; 349#L518-3 [2019-11-15 22:22:19,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:19,836 INFO L82 PathProgramCache]: Analyzing trace with hash -2087759909, now seen corresponding path program 1 times [2019-11-15 22:22:19,836 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:22:19,837 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865203527] [2019-11-15 22:22:19,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:19,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:19,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:22:19,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:22:19,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:22:19,862 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:22:19,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:19,863 INFO L82 PathProgramCache]: Analyzing trace with hash 85028899, now seen corresponding path program 1 times [2019-11-15 22:22:19,863 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:22:19,864 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214189786] [2019-11-15 22:22:19,864 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:19,864 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:19,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:22:19,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:22:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:22:19,875 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:22:19,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:19,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1514407799, now seen corresponding path program 1 times [2019-11-15 22:22:19,876 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:22:19,876 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169938981] [2019-11-15 22:22:19,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:19,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:19,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:22:19,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:19,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:22:19,896 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169938981] [2019-11-15 22:22:19,896 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:22:19,896 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:22:19,897 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939489411] [2019-11-15 22:22:20,009 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-11-15 22:22:20,055 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:22:20,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:22:20,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:22:20,055 INFO L87 Difference]: Start difference. First operand 27 states and 38 transitions. cyclomatic complexity: 15 Second operand 3 states. [2019-11-15 22:22:20,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:22:20,066 INFO L93 Difference]: Finished difference Result 28 states and 38 transitions. [2019-11-15 22:22:20,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:22:20,066 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 38 transitions. [2019-11-15 22:22:20,067 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 22:22:20,068 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 27 states and 36 transitions. [2019-11-15 22:22:20,068 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-11-15 22:22:20,068 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-11-15 22:22:20,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2019-11-15 22:22:20,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:22:20,069 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2019-11-15 22:22:20,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2019-11-15 22:22:20,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-15 22:22:20,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-15 22:22:20,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2019-11-15 22:22:20,071 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2019-11-15 22:22:20,072 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2019-11-15 22:22:20,072 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 22:22:20,072 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 36 transitions. [2019-11-15 22:22:20,073 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 22:22:20,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:22:20,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:22:20,074 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:22:20,074 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 22:22:20,074 INFO L791 eck$LassoCheckResult]: Stem: 428#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 423#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 424#L530 assume !(main_~length1~0 < 1); 430#L530-2 assume !(main_~length2~0 < 1); 422#L533-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 414#L539-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 410#L539-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 411#L539-3 assume !(main_~i~0 < main_~length1~0 - 1); 416#L539-4 main_~i~1 := 0; 436#L545-3 assume !(main_~i~1 < main_~length2~0 - 1); 429#L545-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);subseq_#in~s.base, subseq_#in~s.offset, subseq_#in~t.base, subseq_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc subseq_#res;havoc subseq_#t~mem5, subseq_#t~mem6, subseq_#t~post7.base, subseq_#t~post7.offset, subseq_#t~post8.base, subseq_#t~post8.offset, subseq_#t~mem2, subseq_#t~mem3, subseq_#t~short4, subseq_#t~mem9, subseq_~s.base, subseq_~s.offset, subseq_~t.base, subseq_~t.offset, subseq_~ps~0.base, subseq_~ps~0.offset, subseq_~pt~0.base, subseq_~pt~0.offset;subseq_~s.base, subseq_~s.offset := subseq_#in~s.base, subseq_#in~s.offset;subseq_~t.base, subseq_~t.offset := subseq_#in~t.base, subseq_#in~t.offset;subseq_~ps~0.base, subseq_~ps~0.offset := subseq_~s.base, subseq_~s.offset;subseq_~pt~0.base, subseq_~pt~0.offset := subseq_~t.base, subseq_~t.offset; 418#L518-5 [2019-11-15 22:22:20,074 INFO L793 eck$LassoCheckResult]: Loop: 418#L518-5 call subseq_#t~mem2 := read~int(subseq_~ps~0.base, subseq_~ps~0.offset, 1);subseq_#t~short4 := 0 != subseq_#t~mem2; 419#L518-1 assume subseq_#t~short4;call subseq_#t~mem3 := read~int(subseq_~pt~0.base, subseq_~pt~0.offset, 1);subseq_#t~short4 := 0 != subseq_#t~mem3; 412#L518-3 assume !!subseq_#t~short4;havoc subseq_#t~short4;havoc subseq_#t~mem2;havoc subseq_#t~mem3;call subseq_#t~mem5 := read~int(subseq_~ps~0.base, subseq_~ps~0.offset, 1);call subseq_#t~mem6 := read~int(subseq_~pt~0.base, subseq_~pt~0.offset, 1); 413#L519 assume !(subseq_#t~mem5 == subseq_#t~mem6);havoc subseq_#t~mem6;havoc subseq_#t~mem5; 432#L519-2 subseq_#t~post8.base, subseq_#t~post8.offset := subseq_~pt~0.base, subseq_~pt~0.offset;subseq_~pt~0.base, subseq_~pt~0.offset := subseq_#t~post8.base, 1 + subseq_#t~post8.offset;havoc subseq_#t~post8.base, subseq_#t~post8.offset; 418#L518-5 [2019-11-15 22:22:20,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:20,075 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 1 times [2019-11-15 22:22:20,075 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:22:20,075 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643584554] [2019-11-15 22:22:20,075 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:20,076 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:20,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:22:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:22:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:22:20,094 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:22:20,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:20,095 INFO L82 PathProgramCache]: Analyzing trace with hash 74536249, now seen corresponding path program 2 times [2019-11-15 22:22:20,095 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:22:20,096 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133327801] [2019-11-15 22:22:20,096 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:20,096 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:20,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:22:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:22:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:22:20,104 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:22:20,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:20,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1928298466, now seen corresponding path program 1 times [2019-11-15 22:22:20,105 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:22:20,105 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222500264] [2019-11-15 22:22:20,105 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:20,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:20,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:22:20,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:20,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:22:20,257 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222500264] [2019-11-15 22:22:20,257 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:22:20,257 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 22:22:20,257 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908062220] [2019-11-15 22:22:20,371 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:22:20,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:22:20,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:22:20,371 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. cyclomatic complexity: 13 Second operand 8 states. [2019-11-15 22:22:20,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:22:20,450 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2019-11-15 22:22:20,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:22:20,450 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 44 transitions. [2019-11-15 22:22:20,451 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 22:22:20,452 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 29 states and 36 transitions. [2019-11-15 22:22:20,452 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-11-15 22:22:20,452 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-11-15 22:22:20,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 36 transitions. [2019-11-15 22:22:20,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:22:20,453 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-11-15 22:22:20,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 36 transitions. [2019-11-15 22:22:20,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2019-11-15 22:22:20,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-15 22:22:20,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2019-11-15 22:22:20,454 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-11-15 22:22:20,455 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-11-15 22:22:20,455 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 22:22:20,455 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2019-11-15 22:22:20,455 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 22:22:20,455 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:22:20,455 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:22:20,456 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:22:20,456 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 22:22:20,456 INFO L791 eck$LassoCheckResult]: Stem: 511#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 505#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 506#L530 assume !(main_~length1~0 < 1); 513#L530-2 assume !(main_~length2~0 < 1); 507#L533-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 497#L539-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 493#L539-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 494#L539-3 assume !(main_~i~0 < main_~length1~0 - 1); 499#L539-4 main_~i~1 := 0; 508#L545-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 509#L545-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 519#L545-3 assume !(main_~i~1 < main_~length2~0 - 1); 512#L545-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);subseq_#in~s.base, subseq_#in~s.offset, subseq_#in~t.base, subseq_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc subseq_#res;havoc subseq_#t~mem5, subseq_#t~mem6, subseq_#t~post7.base, subseq_#t~post7.offset, subseq_#t~post8.base, subseq_#t~post8.offset, subseq_#t~mem2, subseq_#t~mem3, subseq_#t~short4, subseq_#t~mem9, subseq_~s.base, subseq_~s.offset, subseq_~t.base, subseq_~t.offset, subseq_~ps~0.base, subseq_~ps~0.offset, subseq_~pt~0.base, subseq_~pt~0.offset;subseq_~s.base, subseq_~s.offset := subseq_#in~s.base, subseq_#in~s.offset;subseq_~t.base, subseq_~t.offset := subseq_#in~t.base, subseq_#in~t.offset;subseq_~ps~0.base, subseq_~ps~0.offset := subseq_~s.base, subseq_~s.offset;subseq_~pt~0.base, subseq_~pt~0.offset := subseq_~t.base, subseq_~t.offset; 501#L518-5 [2019-11-15 22:22:20,456 INFO L793 eck$LassoCheckResult]: Loop: 501#L518-5 call subseq_#t~mem2 := read~int(subseq_~ps~0.base, subseq_~ps~0.offset, 1);subseq_#t~short4 := 0 != subseq_#t~mem2; 502#L518-1 assume subseq_#t~short4;call subseq_#t~mem3 := read~int(subseq_~pt~0.base, subseq_~pt~0.offset, 1);subseq_#t~short4 := 0 != subseq_#t~mem3; 495#L518-3 assume !!subseq_#t~short4;havoc subseq_#t~short4;havoc subseq_#t~mem2;havoc subseq_#t~mem3;call subseq_#t~mem5 := read~int(subseq_~ps~0.base, subseq_~ps~0.offset, 1);call subseq_#t~mem6 := read~int(subseq_~pt~0.base, subseq_~pt~0.offset, 1); 496#L519 assume !(subseq_#t~mem5 == subseq_#t~mem6);havoc subseq_#t~mem6;havoc subseq_#t~mem5; 515#L519-2 subseq_#t~post8.base, subseq_#t~post8.offset := subseq_~pt~0.base, subseq_~pt~0.offset;subseq_~pt~0.base, subseq_~pt~0.offset := subseq_#t~post8.base, 1 + subseq_#t~post8.offset;havoc subseq_#t~post8.base, subseq_#t~post8.offset; 501#L518-5 [2019-11-15 22:22:20,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:20,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 1 times [2019-11-15 22:22:20,456 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:22:20,456 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587578812] [2019-11-15 22:22:20,456 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:20,456 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:20,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:22:20,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:22:20,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:22:20,476 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:22:20,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:20,477 INFO L82 PathProgramCache]: Analyzing trace with hash 74536249, now seen corresponding path program 3 times [2019-11-15 22:22:20,477 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:22:20,477 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330232718] [2019-11-15 22:22:20,477 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:20,478 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:20,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:22:20,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:22:20,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:22:20,486 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:22:20,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:20,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1075475712, now seen corresponding path program 1 times [2019-11-15 22:22:20,486 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:22:20,487 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593150958] [2019-11-15 22:22:20,487 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:20,487 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:20,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:22:20,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:22:20,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:22:20,524 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:22:20,636 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-11-15 22:22:21,094 WARN L191 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 119 [2019-11-15 22:22:21,283 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-11-15 22:22:21,285 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:22:21,285 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:22:21,285 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:22:21,285 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:22:21,285 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:22:21,285 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:22:21,285 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:22:21,285 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:22:21,285 INFO L131 ssoRankerPreferences]: Filename of dumped script: subseq-alloca-2.i_Iteration6_Lasso [2019-11-15 22:22:21,285 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:22:21,285 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:22:21,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:22:21,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:22:21,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:22:21,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:22:21,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:22:21,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:22:21,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:22:21,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:22:21,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:22:21,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:22:21,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:22:21,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:22:21,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:22:21,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:22:21,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:22:21,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:22:21,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:22:21,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:22:21,773 WARN L191 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 94 [2019-11-15 22:22:21,913 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-11-15 22:22:21,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:22:21,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:22:21,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:22:21,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:22:21,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:22:21,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:22:21,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:22:22,587 WARN L191 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-15 22:22:22,716 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-15 22:22:22,867 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-11-15 22:22:22,907 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:22:22,907 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:22:22,907 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:22:22,908 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:22,908 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:22:22,909 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:22,909 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:22,909 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:22,909 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:22:22,909 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:22:22,910 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:22,910 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:22:22,911 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:22,911 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:22:22,911 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:22,911 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:22,912 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:22,912 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:22:22,912 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:22:22,913 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:22,913 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:22:22,913 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:22,914 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:22:22,914 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:22,914 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:22,914 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:22,914 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:22:22,914 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:22:22,915 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:22,915 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:22:22,916 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:22,916 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:22,916 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:22,916 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:22,917 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:22:22,917 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:22:22,918 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:22,919 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:22:22,919 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:22,919 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:22:22,919 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:22,920 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:22,920 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:22,920 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:22:22,920 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:22:22,921 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:22,921 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:22:22,921 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:22,922 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:22:22,922 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:22,922 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:22,922 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:22,922 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:22:22,922 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:22:22,923 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:22,923 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:22:22,924 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:22,924 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:22:22,924 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:22,924 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:22,924 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:22,925 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:22:22,925 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:22:22,925 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:22,925 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:22:22,926 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:22,926 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:22:22,926 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:22,926 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:22,927 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:22,927 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:22:22,927 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:22:22,927 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:22,928 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:22:22,928 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:22,928 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:22:22,929 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:22,929 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:22,929 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:22,929 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:22:22,929 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:22:22,930 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:22,930 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:22:22,931 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:22,931 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:22:22,931 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:22,931 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:22,931 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:22,932 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:22:22,932 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:22:22,932 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:22,933 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:22:22,933 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:22,933 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:22,933 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:22,934 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:22,934 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:22:22,934 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:22:22,936 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:22,936 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:22:22,937 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:22,937 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:22:22,937 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:22,938 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:22,938 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:22,938 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:22:22,938 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:22:22,939 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:22,939 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:22:22,939 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:22,940 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:22:22,940 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:22,940 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:22,940 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:22,940 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:22:22,941 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:22:22,941 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:22,942 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:22:22,942 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:22,942 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:22,942 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:22,942 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:22,943 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:22:22,943 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:22:22,944 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:22,945 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:22:22,945 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:22,946 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:22:22,946 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:22,946 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:22,946 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:22,946 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:22:22,946 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:22:22,947 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:22,947 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:22:22,948 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:22,948 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:22:22,948 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:22,948 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:22,948 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:22,949 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:22:22,949 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:22:22,949 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:22,950 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:22:22,950 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:22,950 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:22:22,950 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:22,951 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:22,951 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:22,951 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:22:22,951 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:22:22,952 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:22,952 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:22:22,952 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:22,953 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 22:22:22,953 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:22,953 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:22,958 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 22:22:22,958 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:22:22,976 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:22,976 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:22:22,977 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:22,977 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:22,977 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:22,978 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:22,979 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:22:22,979 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:22:22,980 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:22,981 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:22:22,981 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:22,981 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:22,982 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:22,982 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:22,982 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:22:22,983 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:22:22,984 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:22:22,984 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:22:22,985 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:22:22,985 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:22:22,985 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:22:22,985 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:22:22,989 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:22:22,989 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:22:23,016 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:22:23,035 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 22:22:23,035 INFO L444 ModelExtractionUtils]: 51 out of 55 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:22:23,036 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:22:23,036 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:22:23,037 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:22:23,037 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_subseq_~pt~0.offset, v_rep(select #length ULTIMATE.start_subseq_~pt~0.base)_1) = -1*ULTIMATE.start_subseq_~pt~0.offset + 1*v_rep(select #length ULTIMATE.start_subseq_~pt~0.base)_1 Supporting invariants [] [2019-11-15 22:22:23,119 INFO L297 tatePredicateManager]: 25 out of 25 supporting invariants were superfluous and have been removed [2019-11-15 22:22:23,120 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 22:22:23,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:23,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:23,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:22:23,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:22:23,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:23,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:22:23,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:22:23,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:22:23,188 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:22:23,188 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-11-15 22:22:23,203 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 35 states and 45 transitions. Complement of second has 6 states. [2019-11-15 22:22:23,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 22:22:23,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 22:22:23,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2019-11-15 22:22:23,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 13 letters. Loop has 5 letters. [2019-11-15 22:22:23,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:22:23,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 18 letters. Loop has 5 letters. [2019-11-15 22:22:23,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:22:23,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 13 letters. Loop has 10 letters. [2019-11-15 22:22:23,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:22:23,206 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 45 transitions. [2019-11-15 22:22:23,207 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:22:23,207 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 0 states and 0 transitions. [2019-11-15 22:22:23,207 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 22:22:23,207 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 22:22:23,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 22:22:23,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:22:23,208 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:22:23,208 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:22:23,208 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:22:23,208 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 22:22:23,208 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:22:23,208 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:22:23,208 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 22:22:23,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 10:22:23 BoogieIcfgContainer [2019-11-15 22:22:23,213 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 22:22:23,214 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:22:23,214 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:22:23,214 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:22:23,214 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:22:15" (3/4) ... [2019-11-15 22:22:23,217 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 22:22:23,218 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:22:23,219 INFO L168 Benchmark]: Toolchain (without parser) took 8786.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 191.9 MB). Free memory was 934.3 MB in the beginning and 907.9 MB in the end (delta: 26.4 MB). Peak memory consumption was 218.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:22:23,220 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 957.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:22:23,220 INFO L168 Benchmark]: CACSL2BoogieTranslator took 480.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 934.3 MB in the beginning and 1.1 GB in the end (delta: -186.7 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:22:23,221 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.92 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-11-15 22:22:23,221 INFO L168 Benchmark]: Boogie Preprocessor took 31.88 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-11-15 22:22:23,222 INFO L168 Benchmark]: RCFGBuilder took 392.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:22:23,222 INFO L168 Benchmark]: BuchiAutomizer took 7829.81 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.5 MB). Free memory was 1.1 GB in the beginning and 907.9 MB in the end (delta: 183.9 MB). Peak memory consumption was 237.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:22:23,223 INFO L168 Benchmark]: Witness Printer took 4.14 ms. Allocated memory is still 1.2 GB. Free memory is still 907.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:22:23,226 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 957.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 480.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 934.3 MB in the beginning and 1.1 GB in the end (delta: -186.7 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.92 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. * Boogie Preprocessor took 31.88 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. * RCFGBuilder took 392.91 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 7829.81 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.5 MB). Free memory was 1.1 GB in the beginning and 907.9 MB in the end (delta: 183.9 MB). Peak memory consumption was 237.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.14 ms. Allocated memory is still 1.2 GB. Free memory is still 907.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function length1 + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * i + unknown-#length-unknown[nondetString2] + -1 * nondetString2 and consists of 4 locations. One deterministic module has affine ranking function -1 * pt + unknown-#length-unknown[pt] and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.7s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 6.8s. Construction of modules took 0.2s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 3. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 105 SDtfs, 176 SDslu, 156 SDs, 0 SdLazy, 144 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital207 mio100 ax110 hnf98 lsp84 ukn74 mio100 lsp47 div100 bol100 ite100 ukn100 eq177 hnf89 smp100 dnf162 smp95 tf100 neg94 sie121 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 73ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 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...