./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/cstrncat-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/working_dir_3884ca7e-68f6-438f-b750-d7c604467bb1/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3884ca7e-68f6-438f-b750-d7c604467bb1/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3884ca7e-68f6-438f-b750-d7c604467bb1/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3884ca7e-68f6-438f-b750-d7c604467bb1/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/cstrncat-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3884ca7e-68f6-438f-b750-d7c604467bb1/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3884ca7e-68f6-438f-b750-d7c604467bb1/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 170d05f666fe960395aa4fb943b7fdfa4284d519 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:54:54,340 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:54:54,342 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:54:54,349 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:54:54,349 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:54:54,350 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:54:54,351 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:54:54,352 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:54:54,354 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:54:54,354 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:54:54,355 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:54:54,356 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:54:54,356 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:54:54,357 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:54:54,357 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:54:54,358 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:54:54,359 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:54:54,359 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:54:54,361 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:54:54,362 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:54:54,363 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:54:54,364 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:54:54,365 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:54:54,366 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:54:54,368 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:54:54,368 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:54:54,368 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:54:54,369 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:54:54,369 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:54:54,370 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:54:54,370 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:54:54,371 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:54:54,371 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:54:54,372 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:54:54,372 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:54:54,373 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:54:54,373 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:54:54,374 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:54:54,374 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:54:54,374 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:54:54,375 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:54:54,375 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3884ca7e-68f6-438f-b750-d7c604467bb1/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 08:54:54,388 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:54:54,388 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:54:54,389 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:54:54,389 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:54:54,389 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:54:54,390 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:54:54,390 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:54:54,390 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:54:54,390 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:54:54,390 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:54:54,390 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:54:54,391 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:54:54,391 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:54:54,391 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:54:54,391 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:54:54,391 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:54:54,391 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:54:54,392 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:54:54,392 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:54:54,392 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:54:54,392 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:54:54,392 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:54:54,392 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:54:54,393 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:54:54,393 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:54:54,393 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:54:54,393 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:54:54,394 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:54:54,394 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:54:54,394 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:54:54,394 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:54:54,395 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:54:54,395 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_3884ca7e-68f6-438f-b750-d7c604467bb1/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 -> 170d05f666fe960395aa4fb943b7fdfa4284d519 [2019-10-22 08:54:54,421 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:54:54,432 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:54:54,435 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:54:54,439 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:54:54,440 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:54:54,440 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3884ca7e-68f6-438f-b750-d7c604467bb1/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrncat-alloca-2.i [2019-10-22 08:54:54,482 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3884ca7e-68f6-438f-b750-d7c604467bb1/bin/uautomizer/data/6f7ce9c95/99f9abfd0d6e43c0b3904ab7fe8fb7bd/FLAG54bf3e1dd [2019-10-22 08:54:54,872 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:54:54,875 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3884ca7e-68f6-438f-b750-d7c604467bb1/sv-benchmarks/c/array-memsafety/cstrncat-alloca-2.i [2019-10-22 08:54:54,886 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3884ca7e-68f6-438f-b750-d7c604467bb1/bin/uautomizer/data/6f7ce9c95/99f9abfd0d6e43c0b3904ab7fe8fb7bd/FLAG54bf3e1dd [2019-10-22 08:54:54,895 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3884ca7e-68f6-438f-b750-d7c604467bb1/bin/uautomizer/data/6f7ce9c95/99f9abfd0d6e43c0b3904ab7fe8fb7bd [2019-10-22 08:54:54,897 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:54:54,898 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:54:54,898 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:54,899 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:54:54,901 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:54:54,902 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:54" (1/1) ... [2019-10-22 08:54:54,904 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14aebc60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:54, skipping insertion in model container [2019-10-22 08:54:54,905 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:54" (1/1) ... [2019-10-22 08:54:54,912 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:54:54,955 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:54:55,296 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:55,308 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:54:55,358 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:55,395 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:54:55,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:55 WrapperNode [2019-10-22 08:54:55,396 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:55,396 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:55,396 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:54:55,397 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:54:55,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:55" (1/1) ... [2019-10-22 08:54:55,416 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:55" (1/1) ... [2019-10-22 08:54:55,436 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:55,436 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:54:55,436 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:54:55,436 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:54:55,444 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:55" (1/1) ... [2019-10-22 08:54:55,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:55" (1/1) ... [2019-10-22 08:54:55,447 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:55" (1/1) ... [2019-10-22 08:54:55,448 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:55" (1/1) ... [2019-10-22 08:54:55,453 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:55" (1/1) ... [2019-10-22 08:54:55,458 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:55" (1/1) ... [2019-10-22 08:54:55,459 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:55" (1/1) ... [2019-10-22 08:54:55,461 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:54:55,461 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:54:55,461 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:54:55,461 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:54:55,462 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3884ca7e-68f6-438f-b750-d7c604467bb1/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:55,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:54:55,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:54:55,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:54:55,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:54:55,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:54:55,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:54:55,934 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:54:55,934 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-22 08:54:55,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:55 BoogieIcfgContainer [2019-10-22 08:54:55,935 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:54:55,935 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:54:55,936 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:54:55,939 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:54:55,940 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:55,941 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:54:54" (1/3) ... [2019-10-22 08:54:55,942 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2bbd8ea1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:54:55, skipping insertion in model container [2019-10-22 08:54:55,942 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:55,942 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:55" (2/3) ... [2019-10-22 08:54:55,942 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2bbd8ea1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:54:55, skipping insertion in model container [2019-10-22 08:54:55,943 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:55,943 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:55" (3/3) ... [2019-10-22 08:54:55,944 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrncat-alloca-2.i [2019-10-22 08:54:55,989 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:54:55,989 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:54:55,989 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:54:55,990 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:54:55,990 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:54:55,990 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:54:55,990 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:54:55,990 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:54:56,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-10-22 08:54:56,028 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 9 [2019-10-22 08:54:56,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:56,028 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:56,035 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:54:56,035 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:54:56,035 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:54:56,035 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-10-22 08:54:56,037 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 9 [2019-10-22 08:54:56,038 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:56,038 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:56,038 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:54:56,039 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:54:56,046 INFO L791 eck$LassoCheckResult]: Stem: 18#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 15#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19.base, main_#t~ret19.offset, main_~length1~0, main_~length2~0, main_~n~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;main_~n~0 := main_#t~nondet12;havoc main_#t~nondet12; 19#L531true assume !(main_~length1~0 < 1); 24#L531-2true assume !(main_~length2~0 < 1); 14#L534-1true assume !(main_~n~0 < 1); 6#L537-1true assume !(main_~length1~0 < main_~n~0 || main_~length1~0 - main_~n~0 < main_~length2~0);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 20#L544-3true [2019-10-22 08:54:56,046 INFO L793 eck$LassoCheckResult]: Loop: 20#L544-3true assume !!(main_~i~0 < main_~length1~0 - main_~n~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 17#L544-2true main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 20#L544-3true [2019-10-22 08:54:56,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:56,050 INFO L82 PathProgramCache]: Analyzing trace with hash 889572367, now seen corresponding path program 1 times [2019-10-22 08:54:56,055 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:56,055 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741182223] [2019-10-22 08:54:56,055 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:56,055 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:56,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:56,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:56,165 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:56,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:56,166 INFO L82 PathProgramCache]: Analyzing trace with hash 2019, now seen corresponding path program 1 times [2019-10-22 08:54:56,167 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:56,167 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008632178] [2019-10-22 08:54:56,167 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:56,167 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:56,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:56,180 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:56,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:56,182 INFO L82 PathProgramCache]: Analyzing trace with hash 180553841, now seen corresponding path program 1 times [2019-10-22 08:54:56,182 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:56,182 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698811785] [2019-10-22 08:54:56,183 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:56,183 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:56,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:56,226 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:56,493 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-10-22 08:54:56,580 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:56,581 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:56,581 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:56,581 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:56,581 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:56,581 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:56,581 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:56,582 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:56,582 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncat-alloca-2.i_Iteration1_Lasso [2019-10-22 08:54:56,582 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:56,582 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:56,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:56,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:56,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:56,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:56,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:56,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:56,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:56,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:56,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:56,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:56,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:56,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:56,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:56,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:56,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:56,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:56,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:57,135 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-10-22 08:54:57,231 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:57,236 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:57,238 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:57,239 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:57,240 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:57,241 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:57,242 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:57,242 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:57,244 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:57,245 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:57,247 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:57,247 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:57,248 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:57,248 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:57,248 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:57,248 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:57,249 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:57,251 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:57,251 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:57,253 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:57,256 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:57,258 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:57,258 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:57,258 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:57,258 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:57,260 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:57,262 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:57,267 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:57,271 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:57,277 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:57,278 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:57,278 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:57,278 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:57,279 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:57,280 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:57,297 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:57,297 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:57,298 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:57,298 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:57,298 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:57,299 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:57,301 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:57,301 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:57,313 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:57,313 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:57,314 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:57,314 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:54:57,314 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:57,314 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:57,318 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:54:57,319 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:57,341 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:57,342 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:57,342 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:57,342 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:57,343 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:57,343 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:57,343 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:57,343 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:57,343 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:57,344 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:57,349 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:57,350 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:57,350 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:57,350 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:57,350 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:57,356 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:57,357 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:57,425 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:57,483 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 08:54:57,483 INFO L444 ModelExtractionUtils]: 25 out of 31 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-10-22 08:54:57,485 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:57,486 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:54:57,487 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:57,487 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_1, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~i~0) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_1 - 1*ULTIMATE.start_main_~nondetString1~0.offset - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-10-22 08:54:57,507 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-10-22 08:54:57,513 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:54:57,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:57,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:57,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:57,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:57,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:57,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:54:57,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:57,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:57,591 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-10-22 08:54:57,592 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states. Second operand 3 states. [2019-10-22 08:54:57,652 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states.. Second operand 3 states. Result 61 states and 89 transitions. Complement of second has 7 states. [2019-10-22 08:54:57,653 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-10-22 08:54:57,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:54:57,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2019-10-22 08:54:57,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 62 transitions. Stem has 6 letters. Loop has 2 letters. [2019-10-22 08:54:57,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:57,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 62 transitions. Stem has 8 letters. Loop has 2 letters. [2019-10-22 08:54:57,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:57,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 62 transitions. Stem has 6 letters. Loop has 4 letters. [2019-10-22 08:54:57,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:57,658 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 89 transitions. [2019-10-22 08:54:57,662 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2019-10-22 08:54:57,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 18 states and 26 transitions. [2019-10-22 08:54:57,667 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-10-22 08:54:57,667 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-10-22 08:54:57,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2019-10-22 08:54:57,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:57,668 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-10-22 08:54:57,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2019-10-22 08:54:57,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-22 08:54:57,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-22 08:54:57,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2019-10-22 08:54:57,690 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-10-22 08:54:57,690 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-10-22 08:54:57,690 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:54:57,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. [2019-10-22 08:54:57,691 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2019-10-22 08:54:57,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:57,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:57,691 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:57,691 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:54:57,692 INFO L791 eck$LassoCheckResult]: Stem: 174#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 170#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19.base, main_#t~ret19.offset, main_~length1~0, main_~length2~0, main_~n~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;main_~n~0 := main_#t~nondet12;havoc main_#t~nondet12; 171#L531 assume !(main_~length1~0 < 1); 175#L531-2 assume !(main_~length2~0 < 1); 169#L534-1 assume !(main_~n~0 < 1); 166#L537-1 assume !(main_~length1~0 < main_~n~0 || main_~length1~0 - main_~n~0 < main_~length2~0);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 167#L544-3 assume !(main_~i~0 < main_~length1~0 - main_~n~0 - 1); 176#L544-4 main_~i~1 := 0; 165#L549-3 [2019-10-22 08:54:57,692 INFO L793 eck$LassoCheckResult]: Loop: 165#L549-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; 164#L549-2 main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; 165#L549-3 [2019-10-22 08:54:57,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:57,692 INFO L82 PathProgramCache]: Analyzing trace with hash 180553783, now seen corresponding path program 1 times [2019-10-22 08:54:57,692 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:57,692 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045482884] [2019-10-22 08:54:57,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:57,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:57,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:57,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:57,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:57,713 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:57,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:57,713 INFO L82 PathProgramCache]: Analyzing trace with hash 2467, now seen corresponding path program 1 times [2019-10-22 08:54:57,714 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:57,714 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358731210] [2019-10-22 08:54:57,714 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:57,714 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:57,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:57,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:57,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:57,723 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:57,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:57,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1713495129, now seen corresponding path program 1 times [2019-10-22 08:54:57,723 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:57,723 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453780027] [2019-10-22 08:54:57,724 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:57,724 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:57,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:57,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:57,779 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453780027] [2019-10-22 08:54:57,779 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:57,780 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:54:57,780 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034531310] [2019-10-22 08:54:57,805 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:57,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:54:57,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:54:57,808 INFO L87 Difference]: Start difference. First operand 18 states and 26 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-10-22 08:54:57,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:57,854 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2019-10-22 08:54:57,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:54:57,855 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 37 transitions. [2019-10-22 08:54:57,856 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 12 [2019-10-22 08:54:57,857 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 37 transitions. [2019-10-22 08:54:57,857 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-10-22 08:54:57,857 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-10-22 08:54:57,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 37 transitions. [2019-10-22 08:54:57,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:57,858 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 37 transitions. [2019-10-22 08:54:57,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 37 transitions. [2019-10-22 08:54:57,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2019-10-22 08:54:57,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-22 08:54:57,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2019-10-22 08:54:57,859 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2019-10-22 08:54:57,859 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2019-10-22 08:54:57,860 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:54:57,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 28 transitions. [2019-10-22 08:54:57,860 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2019-10-22 08:54:57,860 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:57,860 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:57,861 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:57,861 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:54:57,861 INFO L791 eck$LassoCheckResult]: Stem: 231#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 227#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19.base, main_#t~ret19.offset, main_~length1~0, main_~length2~0, main_~n~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;main_~n~0 := main_#t~nondet12;havoc main_#t~nondet12; 228#L531 assume !(main_~length1~0 < 1); 232#L531-2 assume !(main_~length2~0 < 1); 226#L534-1 assume !(main_~n~0 < 1); 222#L537-1 assume !(main_~length1~0 < main_~n~0 || main_~length1~0 - main_~n~0 < main_~length2~0);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 223#L544-3 assume !!(main_~i~0 < main_~length1~0 - main_~n~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 229#L544-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 230#L544-3 assume !(main_~i~0 < main_~length1~0 - main_~n~0 - 1); 234#L544-4 main_~i~1 := 0; 220#L549-3 [2019-10-22 08:54:57,861 INFO L793 eck$LassoCheckResult]: Loop: 220#L549-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; 219#L549-2 main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; 220#L549-3 [2019-10-22 08:54:57,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:57,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1713550361, now seen corresponding path program 1 times [2019-10-22 08:54:57,861 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:57,862 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381720041] [2019-10-22 08:54:57,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:57,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:57,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:57,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:57,883 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:57,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:57,883 INFO L82 PathProgramCache]: Analyzing trace with hash 2467, now seen corresponding path program 2 times [2019-10-22 08:54:57,884 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:57,884 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675014840] [2019-10-22 08:54:57,884 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:57,884 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:57,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:57,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:57,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:57,890 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:57,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:57,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1749424059, now seen corresponding path program 1 times [2019-10-22 08:54:57,891 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:57,891 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894471631] [2019-10-22 08:54:57,891 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:57,891 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:57,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:57,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:57,915 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:58,147 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2019-10-22 08:54:58,258 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:58,258 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:58,259 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:58,259 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:58,259 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:58,259 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:58,259 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:58,259 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:58,259 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncat-alloca-2.i_Iteration3_Lasso [2019-10-22 08:54:58,259 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:58,259 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:58,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:58,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:58,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:58,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:58,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:58,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:58,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:58,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:58,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:58,417 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-10-22 08:54:58,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:58,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:58,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:58,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:58,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:58,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:58,806 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-10-22 08:54:58,824 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:58,824 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:58,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:58,825 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:58,825 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:58,825 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:58,826 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:58,826 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:58,826 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:58,826 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:58,827 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:58,827 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:58,827 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:58,827 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:58,827 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:58,828 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:58,828 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:58,828 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:58,828 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:58,828 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:58,829 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:58,830 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:58,830 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:58,830 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:58,830 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:58,831 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:58,831 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:58,832 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:58,832 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:58,833 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:58,833 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:58,834 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:58,834 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:58,834 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:58,834 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:58,834 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:58,834 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:58,835 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:58,835 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:58,835 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:58,835 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:58,835 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:58,836 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:58,836 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:58,839 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:58,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-10-22 08:54:58,839 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:58,840 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:58,840 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:58,840 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:58,841 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:58,841 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:58,842 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:58,843 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:58,843 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:58,843 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:58,843 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:58,844 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:58,844 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:58,844 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:58,844 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:58,844 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:58,845 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:58,846 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:58,846 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:58,846 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:58,846 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:58,846 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:58,846 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:58,846 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:58,847 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:58,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:58,847 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:58,848 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:58,848 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:58,848 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:58,851 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:58,851 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:58,897 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:58,943 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-10-22 08:54:58,944 INFO L444 ModelExtractionUtils]: 27 out of 34 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 08:54:58,944 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:58,948 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:54:58,948 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:58,948 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-10-22 08:54:58,964 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2019-10-22 08:54:58,965 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:54:58,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:58,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:58,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:58,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:58,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:58,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:54:58,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:59,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:59,011 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-10-22 08:54:59,011 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-10-22 08:54:59,034 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 28 states and 43 transitions. Complement of second has 6 states. [2019-10-22 08:54:59,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:54:59,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:54:59,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2019-10-22 08:54:59,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 10 letters. Loop has 2 letters. [2019-10-22 08:54:59,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:59,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 12 letters. Loop has 2 letters. [2019-10-22 08:54:59,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:59,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 10 letters. Loop has 4 letters. [2019-10-22 08:54:59,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:59,036 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 43 transitions. [2019-10-22 08:54:59,037 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-10-22 08:54:59,037 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 21 states and 30 transitions. [2019-10-22 08:54:59,038 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-10-22 08:54:59,038 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-10-22 08:54:59,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 30 transitions. [2019-10-22 08:54:59,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:59,038 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-10-22 08:54:59,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 30 transitions. [2019-10-22 08:54:59,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-22 08:54:59,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-22 08:54:59,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2019-10-22 08:54:59,040 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-10-22 08:54:59,040 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-10-22 08:54:59,040 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:54:59,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2019-10-22 08:54:59,040 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-10-22 08:54:59,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:59,040 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:59,044 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:59,045 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:54:59,045 INFO L791 eck$LassoCheckResult]: Stem: 366#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 362#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19.base, main_#t~ret19.offset, main_~length1~0, main_~length2~0, main_~n~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;main_~n~0 := main_#t~nondet12;havoc main_#t~nondet12; 363#L531 assume !(main_~length1~0 < 1); 367#L531-2 assume !(main_~length2~0 < 1); 361#L534-1 assume !(main_~n~0 < 1); 357#L537-1 assume !(main_~length1~0 < main_~n~0 || main_~length1~0 - main_~n~0 < main_~length2~0);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 358#L544-3 assume !(main_~i~0 < main_~length1~0 - main_~n~0 - 1); 368#L544-4 main_~i~1 := 0; 359#L549-3 assume !(main_~i~1 < main_~length2~0 - 1); 360#L549-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - main_~n~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrncat_#in~s1.base, cstrncat_#in~s1.offset, cstrncat_#in~s2.base, cstrncat_#in~s2.offset, cstrncat_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~0;havoc cstrncat_#res.base, cstrncat_#res.offset;havoc cstrncat_#t~post3.base, cstrncat_#t~post3.offset, cstrncat_#t~mem2, cstrncat_#t~post7, cstrncat_#t~post8.base, cstrncat_#t~post8.offset, cstrncat_#t~post4.base, cstrncat_#t~post4.offset, cstrncat_#t~mem5, cstrncat_#t~short6, cstrncat_#t~mem9, cstrncat_~s1.base, cstrncat_~s1.offset, cstrncat_~s2.base, cstrncat_~s2.offset, cstrncat_~n, cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s1.base, cstrncat_~s1.offset := cstrncat_#in~s1.base, cstrncat_#in~s1.offset;cstrncat_~s2.base, cstrncat_~s2.offset := cstrncat_#in~s2.base, cstrncat_#in~s2.offset;cstrncat_~n := cstrncat_#in~n;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_~s1.base, cstrncat_~s1.offset; 353#L517-3 [2019-10-22 08:54:59,045 INFO L793 eck$LassoCheckResult]: Loop: 353#L517-3 call cstrncat_#t~mem2 := read~int(cstrncat_~s~0.base, cstrncat_~s~0.offset, 1); 351#L517-1 assume !!(0 != cstrncat_#t~mem2);havoc cstrncat_#t~mem2;cstrncat_#t~post3.base, cstrncat_#t~post3.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post3.base, 1 + cstrncat_#t~post3.offset;havoc cstrncat_#t~post3.base, cstrncat_#t~post3.offset; 353#L517-3 [2019-10-22 08:54:59,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:59,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1713495071, now seen corresponding path program 1 times [2019-10-22 08:54:59,045 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:59,046 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204929726] [2019-10-22 08:54:59,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:59,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:59,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:59,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:59,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:59,075 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:59,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:59,078 INFO L82 PathProgramCache]: Analyzing trace with hash 2822, now seen corresponding path program 1 times [2019-10-22 08:54:59,078 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:59,078 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001309067] [2019-10-22 08:54:59,079 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:59,079 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:59,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:59,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:59,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:59,083 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:59,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:59,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1696290724, now seen corresponding path program 1 times [2019-10-22 08:54:59,084 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:59,084 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676158505] [2019-10-22 08:54:59,084 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:59,084 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:59,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:59,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:59,286 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 30 [2019-10-22 08:54:59,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:59,362 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676158505] [2019-10-22 08:54:59,362 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:59,362 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:54:59,362 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889225527] [2019-10-22 08:54:59,386 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:59,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:54:59,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:54:59,387 INFO L87 Difference]: Start difference. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 7 states. [2019-10-22 08:54:59,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:59,685 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2019-10-22 08:54:59,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:54:59,689 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 42 transitions. [2019-10-22 08:54:59,690 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-10-22 08:54:59,691 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 42 transitions. [2019-10-22 08:54:59,691 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-10-22 08:54:59,691 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-10-22 08:54:59,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 42 transitions. [2019-10-22 08:54:59,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:59,691 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-10-22 08:54:59,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 42 transitions. [2019-10-22 08:54:59,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2019-10-22 08:54:59,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-22 08:54:59,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-10-22 08:54:59,700 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-10-22 08:54:59,700 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-10-22 08:54:59,700 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:54:59,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2019-10-22 08:54:59,701 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-10-22 08:54:59,701 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:59,701 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:59,701 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:59,701 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:54:59,701 INFO L791 eck$LassoCheckResult]: Stem: 440#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 436#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19.base, main_#t~ret19.offset, main_~length1~0, main_~length2~0, main_~n~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;main_~n~0 := main_#t~nondet12;havoc main_#t~nondet12; 437#L531 assume !(main_~length1~0 < 1); 441#L531-2 assume !(main_~length2~0 < 1); 435#L534-1 assume !(main_~n~0 < 1); 428#L537-1 assume !(main_~length1~0 < main_~n~0 || main_~length1~0 - main_~n~0 < main_~length2~0);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 429#L544-3 assume !!(main_~i~0 < main_~length1~0 - main_~n~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 438#L544-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 439#L544-3 assume !(main_~i~0 < main_~length1~0 - main_~n~0 - 1); 443#L544-4 main_~i~1 := 0; 445#L549-3 assume !(main_~i~1 < main_~length2~0 - 1); 432#L549-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - main_~n~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrncat_#in~s1.base, cstrncat_#in~s1.offset, cstrncat_#in~s2.base, cstrncat_#in~s2.offset, cstrncat_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~0;havoc cstrncat_#res.base, cstrncat_#res.offset;havoc cstrncat_#t~post3.base, cstrncat_#t~post3.offset, cstrncat_#t~mem2, cstrncat_#t~post7, cstrncat_#t~post8.base, cstrncat_#t~post8.offset, cstrncat_#t~post4.base, cstrncat_#t~post4.offset, cstrncat_#t~mem5, cstrncat_#t~short6, cstrncat_#t~mem9, cstrncat_~s1.base, cstrncat_~s1.offset, cstrncat_~s2.base, cstrncat_~s2.offset, cstrncat_~n, cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s1.base, cstrncat_~s1.offset := cstrncat_#in~s1.base, cstrncat_#in~s1.offset;cstrncat_~s2.base, cstrncat_~s2.offset := cstrncat_#in~s2.base, cstrncat_#in~s2.offset;cstrncat_~n := cstrncat_#in~n;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_~s1.base, cstrncat_~s1.offset; 433#L517-3 [2019-10-22 08:54:59,701 INFO L793 eck$LassoCheckResult]: Loop: 433#L517-3 call cstrncat_#t~mem2 := read~int(cstrncat_~s~0.base, cstrncat_~s~0.offset, 1); 434#L517-1 assume !!(0 != cstrncat_#t~mem2);havoc cstrncat_#t~mem2;cstrncat_#t~post3.base, cstrncat_#t~post3.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post3.base, 1 + cstrncat_#t~post3.offset;havoc cstrncat_#t~post3.base, cstrncat_#t~post3.offset; 433#L517-3 [2019-10-22 08:54:59,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:59,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1749424001, now seen corresponding path program 1 times [2019-10-22 08:54:59,702 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:59,702 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773570191] [2019-10-22 08:54:59,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:59,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:59,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:59,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:59,718 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:59,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:59,718 INFO L82 PathProgramCache]: Analyzing trace with hash 2822, now seen corresponding path program 2 times [2019-10-22 08:54:59,718 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:59,719 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168109653] [2019-10-22 08:54:59,719 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:59,719 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:59,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:59,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:59,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:59,723 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:59,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:59,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1864254086, now seen corresponding path program 1 times [2019-10-22 08:54:59,724 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:59,724 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910364735] [2019-10-22 08:54:59,724 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:59,724 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:59,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:59,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:59,743 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:00,120 WARN L191 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 117 [2019-10-22 08:55:00,274 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-10-22 08:55:00,280 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:00,280 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:00,280 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:00,280 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:00,280 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:55:00,280 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:00,280 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:00,280 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:00,281 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncat-alloca-2.i_Iteration5_Lasso [2019-10-22 08:55:00,281 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:00,281 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:00,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:00,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:00,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:00,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-10-22 08:55:00,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-10-22 08:55:00,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-10-22 08:55:00,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:00,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:00,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-10-22 08:55:00,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-10-22 08:55:00,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:00,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-10-22 08:55:00,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:00,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:00,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:00,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:00,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:00,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:00,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:00,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:00,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:00,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:00,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:00,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:00,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:00,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:00,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:00,537 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2019-10-22 08:55:00,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:00,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:00,769 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-10-22 08:55:01,021 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-10-22 08:55:01,109 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:01,109 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:55:01,109 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:01,110 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:01,110 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:01,110 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:01,110 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:01,111 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:01,111 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:01,112 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:01,113 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:01,113 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:01,113 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:01,113 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:01,113 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:01,113 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:01,114 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:01,114 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:01,114 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:01,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:01,115 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:01,115 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:01,115 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:01,115 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:01,115 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:01,115 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:01,115 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:01,116 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:01,116 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:01,116 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:01,116 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:01,116 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:01,117 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:01,117 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:01,117 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:01,119 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:01,119 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:01,119 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:01,119 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:01,119 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:01,120 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:01,120 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:01,120 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:01,120 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:01,120 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:01,120 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:01,121 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:01,121 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:01,121 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:01,121 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:01,122 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:01,122 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:01,122 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:01,122 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:01,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:01,123 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:01,123 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:01,123 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:01,123 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:01,123 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:01,123 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:01,123 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:01,124 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:01,124 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:01,124 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:01,124 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:01,125 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:01,125 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:01,125 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:01,125 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:01,126 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:01,126 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:01,126 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:01,126 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:01,126 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:01,127 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:01,127 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:01,127 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:01,127 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:01,127 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:01,127 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:01,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:01,128 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:01,128 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:01,128 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:01,128 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:01,129 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:01,129 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:01,130 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:01,131 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:01,131 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:01,131 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:01,131 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:01,131 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:01,131 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:01,131 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:01,132 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:01,132 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:01,132 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:01,133 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:01,133 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:01,133 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:01,133 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:01,133 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:01,134 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:01,134 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:01,134 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:01,134 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:01,135 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:01,135 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:01,135 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:01,135 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:01,135 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:01,135 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:01,135 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:01,136 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:01,136 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:01,136 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:01,136 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:01,136 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:01,136 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:01,136 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:01,137 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:01,137 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:01,138 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:01,138 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:01,138 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:01,138 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:01,138 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:01,138 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:01,138 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:01,139 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:01,139 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:01,139 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:01,139 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:01,140 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:01,140 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:01,140 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:01,140 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:01,140 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:01,140 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:01,140 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:01,141 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:01,141 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:01,142 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:01,142 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:01,142 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:01,142 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:01,142 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:01,142 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:01,142 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:01,143 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:01,143 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:01,143 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:01,143 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:01,143 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:01,144 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:01,144 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:01,144 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:01,144 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:01,144 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:01,145 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:01,145 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:01,145 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:01,146 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:01,146 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:01,146 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:01,146 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:01,146 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:01,146 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:01,147 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:01,147 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:01,147 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:01,147 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:01,147 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:01,147 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:01,148 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:01,148 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:01,148 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:01,148 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:01,149 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:01,149 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:01,149 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:01,149 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:01,150 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:01,150 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:01,151 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:01,151 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:01,152 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:01,152 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:01,152 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:01,152 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:01,152 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:01,152 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:01,152 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:01,153 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:01,153 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:01,154 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:01,154 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:01,154 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:01,154 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:01,154 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:01,154 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:01,154 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:01,155 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:01,155 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:01,155 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:01,155 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:01,155 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:01,155 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:01,156 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:01,156 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:01,156 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:01,156 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:01,156 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:01,157 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:01,157 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:01,157 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:01,158 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:01,158 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:01,158 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:01,158 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:01,158 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:01,159 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:01,159 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:01,159 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:01,159 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:01,159 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:01,159 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:01,160 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:01,160 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:01,160 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:01,160 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:01,160 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:01,161 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:01,161 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:01,161 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:01,162 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:01,162 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:01,163 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:01,163 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:01,164 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:01,164 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:01,164 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:01,164 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:01,165 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:01,165 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:01,166 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:01,166 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:01,167 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:01,167 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:55:01,167 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:01,167 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:01,170 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:55:01,170 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:01,183 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:01,184 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:01,184 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:01,184 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:01,184 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:01,184 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:01,186 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:01,186 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:01,189 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:01,190 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:01,190 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:01,190 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:01,190 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:01,190 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:01,191 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:01,191 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:01,192 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:01,192 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:01,192 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:01,193 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:01,193 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:01,193 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:55:01,193 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:01,194 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:55:01,194 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:01,195 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:01,195 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:01,195 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:01,195 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:01,195 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:01,196 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:01,196 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:01,196 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:01,197 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:01,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:01,198 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:01,198 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:01,198 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:01,198 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:01,201 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:01,201 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:01,228 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:55:01,245 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 08:55:01,245 INFO L444 ModelExtractionUtils]: 51 out of 58 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 08:55:01,246 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:55:01,246 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:55:01,247 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:55:01,247 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrncat_~s~0.base)_1, ULTIMATE.start_cstrncat_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrncat_~s~0.base)_1 - 1*ULTIMATE.start_cstrncat_~s~0.offset Supporting invariants [] [2019-10-22 08:55:01,269 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2019-10-22 08:55:01,270 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:55:01,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:01,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:01,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:01,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:01,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:01,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:55:01,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:01,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:01,311 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-10-22 08:55:01,311 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 33 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-10-22 08:55:01,330 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 33 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 38 states and 54 transitions. Complement of second has 6 states. [2019-10-22 08:55:01,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:55:01,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:55:01,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2019-10-22 08:55:01,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 12 letters. Loop has 2 letters. [2019-10-22 08:55:01,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:01,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 14 letters. Loop has 2 letters. [2019-10-22 08:55:01,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:01,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 12 letters. Loop has 4 letters. [2019-10-22 08:55:01,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:01,332 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 54 transitions. [2019-10-22 08:55:01,333 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:55:01,333 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 33 states and 44 transitions. [2019-10-22 08:55:01,333 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-10-22 08:55:01,333 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-10-22 08:55:01,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 44 transitions. [2019-10-22 08:55:01,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:01,334 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2019-10-22 08:55:01,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 44 transitions. [2019-10-22 08:55:01,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-10-22 08:55:01,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-22 08:55:01,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2019-10-22 08:55:01,336 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2019-10-22 08:55:01,337 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2019-10-22 08:55:01,337 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:55:01,337 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 43 transitions. [2019-10-22 08:55:01,337 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:55:01,337 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:01,337 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:01,338 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:01,338 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:55:01,338 INFO L791 eck$LassoCheckResult]: Stem: 598#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 594#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19.base, main_#t~ret19.offset, main_~length1~0, main_~length2~0, main_~n~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;main_~n~0 := main_#t~nondet12;havoc main_#t~nondet12; 595#L531 assume !(main_~length1~0 < 1); 599#L531-2 assume !(main_~length2~0 < 1); 593#L534-1 assume !(main_~n~0 < 1); 585#L537-1 assume !(main_~length1~0 < main_~n~0 || main_~length1~0 - main_~n~0 < main_~length2~0);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 586#L544-3 assume !(main_~i~0 < main_~length1~0 - main_~n~0 - 1); 600#L544-4 main_~i~1 := 0; 587#L549-3 assume !(main_~i~1 < main_~length2~0 - 1); 588#L549-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - main_~n~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrncat_#in~s1.base, cstrncat_#in~s1.offset, cstrncat_#in~s2.base, cstrncat_#in~s2.offset, cstrncat_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~0;havoc cstrncat_#res.base, cstrncat_#res.offset;havoc cstrncat_#t~post3.base, cstrncat_#t~post3.offset, cstrncat_#t~mem2, cstrncat_#t~post7, cstrncat_#t~post8.base, cstrncat_#t~post8.offset, cstrncat_#t~post4.base, cstrncat_#t~post4.offset, cstrncat_#t~mem5, cstrncat_#t~short6, cstrncat_#t~mem9, cstrncat_~s1.base, cstrncat_~s1.offset, cstrncat_~s2.base, cstrncat_~s2.offset, cstrncat_~n, cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s1.base, cstrncat_~s1.offset := cstrncat_#in~s1.base, cstrncat_#in~s1.offset;cstrncat_~s2.base, cstrncat_~s2.offset := cstrncat_#in~s2.base, cstrncat_#in~s2.offset;cstrncat_~n := cstrncat_#in~n;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_~s1.base, cstrncat_~s1.offset; 590#L517-3 call cstrncat_#t~mem2 := read~int(cstrncat_~s~0.base, cstrncat_~s~0.offset, 1); 578#L517-1 assume !(0 != cstrncat_#t~mem2);havoc cstrncat_#t~mem2; 579#L519-4 cstrncat_#t~short6 := 0 != cstrncat_~n; 582#L519 assume !cstrncat_#t~short6; 603#L519-2 assume !!cstrncat_#t~short6;havoc cstrncat_#t~post4.base, cstrncat_#t~post4.offset;havoc cstrncat_#t~mem5;havoc cstrncat_#t~short6;cstrncat_#t~post7 := cstrncat_~n;cstrncat_~n := cstrncat_#t~post7 - 1;havoc cstrncat_#t~post7;cstrncat_#t~post8.base, cstrncat_#t~post8.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post8.base, 1 + cstrncat_#t~post8.offset;havoc cstrncat_#t~post8.base, cstrncat_#t~post8.offset; 608#L519-4 cstrncat_#t~short6 := 0 != cstrncat_~n; 581#L519 [2019-10-22 08:55:01,338 INFO L793 eck$LassoCheckResult]: Loop: 581#L519 assume !cstrncat_#t~short6; 602#L519-2 assume !!cstrncat_#t~short6;havoc cstrncat_#t~post4.base, cstrncat_#t~post4.offset;havoc cstrncat_#t~mem5;havoc cstrncat_#t~short6;cstrncat_#t~post7 := cstrncat_~n;cstrncat_~n := cstrncat_#t~post7 - 1;havoc cstrncat_#t~post7;cstrncat_#t~post8.base, cstrncat_#t~post8.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post8.base, 1 + cstrncat_#t~post8.offset;havoc cstrncat_#t~post8.base, cstrncat_#t~post8.offset; 580#L519-4 cstrncat_#t~short6 := 0 != cstrncat_~n; 581#L519 [2019-10-22 08:55:01,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:01,338 INFO L82 PathProgramCache]: Analyzing trace with hash 849587260, now seen corresponding path program 1 times [2019-10-22 08:55:01,338 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:01,339 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713897555] [2019-10-22 08:55:01,339 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:01,339 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:01,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:01,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:01,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:01,380 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713897555] [2019-10-22 08:55:01,380 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:01,380 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:55:01,380 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845494923] [2019-10-22 08:55:01,380 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:55:01,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:01,381 INFO L82 PathProgramCache]: Analyzing trace with hash 104447, now seen corresponding path program 1 times [2019-10-22 08:55:01,381 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:01,381 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45895378] [2019-10-22 08:55:01,381 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:01,381 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:01,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:01,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:01,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:01,388 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45895378] [2019-10-22 08:55:01,389 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:01,389 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:01,389 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424105543] [2019-10-22 08:55:01,389 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:55:01,389 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:01,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:01,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:01,390 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. cyclomatic complexity: 16 Second operand 3 states. [2019-10-22 08:55:01,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:01,399 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2019-10-22 08:55:01,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:01,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 39 transitions. [2019-10-22 08:55:01,401 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:55:01,401 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 0 states and 0 transitions. [2019-10-22 08:55:01,401 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:55:01,401 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:55:01,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:55:01,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:01,401 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:55:01,401 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:55:01,401 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:55:01,401 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 08:55:01,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:55:01,401 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:55:01,402 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:55:01,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:55:01 BoogieIcfgContainer [2019-10-22 08:55:01,407 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:55:01,407 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:55:01,407 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:55:01,408 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:55:01,408 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:55" (3/4) ... [2019-10-22 08:55:01,411 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:55:01,411 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:55:01,412 INFO L168 Benchmark]: Toolchain (without parser) took 6514.47 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 339.7 MB). Free memory was 940.5 MB in the beginning and 1.0 GB in the end (delta: -67.5 MB). Peak memory consumption was 272.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:01,413 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:01,413 INFO L168 Benchmark]: CACSL2BoogieTranslator took 497.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 940.5 MB in the beginning and 1.1 GB in the end (delta: -208.8 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:01,414 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:01,414 INFO L168 Benchmark]: Boogie Preprocessor took 24.90 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:01,414 INFO L168 Benchmark]: RCFGBuilder took 473.82 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: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:01,415 INFO L168 Benchmark]: BuchiAutomizer took 5471.54 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 168.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 111.7 MB). Peak memory consumption was 279.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:01,415 INFO L168 Benchmark]: Witness Printer took 3.88 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:01,418 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 497.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 940.5 MB in the beginning and 1.1 GB in the end (delta: -208.8 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.90 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 473.82 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: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5471.54 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 168.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 111.7 MB). Peak memory consumption was 279.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.88 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 unknown-#length-unknown[nondetString1] + -1 * nondetString1 + -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 unknown-#length-unknown[s] + -1 * s and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.4s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 4.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 15 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 32 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 121 SDtfs, 151 SDslu, 138 SDs, 0 SdLazy, 141 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI1 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital176 mio100 ax110 hnf98 lsp85 ukn76 mio100 lsp56 div100 bol100 ite100 ukn100 eq169 hnf90 smp98 dnf142 smp95 tf100 neg94 sie122 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms 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...