./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/cstrcspn-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a6061d78-5c19-4ac1-b9ad-2eec36647fa1/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a6061d78-5c19-4ac1-b9ad-2eec36647fa1/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a6061d78-5c19-4ac1-b9ad-2eec36647fa1/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a6061d78-5c19-4ac1-b9ad-2eec36647fa1/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/cstrcspn-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_a6061d78-5c19-4ac1-b9ad-2eec36647fa1/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a6061d78-5c19-4ac1-b9ad-2eec36647fa1/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 dd713315a01a83d82c28c42f2ad6c72c3349a374 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:03:27,046 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:03:27,047 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:03:27,058 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:03:27,058 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:03:27,059 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:03:27,060 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:03:27,062 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:03:27,064 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:03:27,065 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:03:27,066 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:03:27,067 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:03:27,067 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:03:27,068 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:03:27,069 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:03:27,070 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:03:27,071 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:03:27,071 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:03:27,073 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:03:27,075 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:03:27,076 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:03:27,077 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:03:27,078 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:03:27,079 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:03:27,081 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:03:27,081 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:03:27,082 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:03:27,082 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:03:27,083 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:03:27,084 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:03:27,084 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:03:27,085 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:03:27,085 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:03:27,086 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:03:27,087 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:03:27,087 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:03:27,088 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:03:27,088 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:03:27,088 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:03:27,089 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:03:27,090 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:03:27,090 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a6061d78-5c19-4ac1-b9ad-2eec36647fa1/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-16 00:03:27,105 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:03:27,106 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:03:27,107 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:03:27,107 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:03:27,107 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:03:27,107 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:03:27,108 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:03:27,108 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:03:27,108 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:03:27,108 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:03:27,109 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:03:27,109 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:03:27,109 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:03:27,109 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:03:27,110 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:03:27,110 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:03:27,110 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:03:27,110 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:03:27,111 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:03:27,111 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:03:27,111 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:03:27,111 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:03:27,111 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:03:27,112 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:03:27,112 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:03:27,112 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:03:27,112 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:03:27,113 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:03:27,113 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:03:27,113 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:03:27,113 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:03:27,114 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:03:27,115 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_a6061d78-5c19-4ac1-b9ad-2eec36647fa1/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 -> dd713315a01a83d82c28c42f2ad6c72c3349a374 [2019-11-16 00:03:27,139 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:03:27,148 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:03:27,151 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:03:27,153 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:03:27,153 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:03:27,154 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a6061d78-5c19-4ac1-b9ad-2eec36647fa1/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrcspn-alloca-1.i [2019-11-16 00:03:27,204 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a6061d78-5c19-4ac1-b9ad-2eec36647fa1/bin/uautomizer/data/e71365612/315622e8399742d0a42b5982b2555b24/FLAG336bd40e1 [2019-11-16 00:03:27,643 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:03:27,643 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a6061d78-5c19-4ac1-b9ad-2eec36647fa1/sv-benchmarks/c/array-memsafety/cstrcspn-alloca-1.i [2019-11-16 00:03:27,657 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a6061d78-5c19-4ac1-b9ad-2eec36647fa1/bin/uautomizer/data/e71365612/315622e8399742d0a42b5982b2555b24/FLAG336bd40e1 [2019-11-16 00:03:27,667 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a6061d78-5c19-4ac1-b9ad-2eec36647fa1/bin/uautomizer/data/e71365612/315622e8399742d0a42b5982b2555b24 [2019-11-16 00:03:27,669 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:03:27,670 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:03:27,671 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:03:27,671 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:03:27,674 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:03:27,675 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:03:27" (1/1) ... [2019-11-16 00:03:27,677 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@305b88f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:27, skipping insertion in model container [2019-11-16 00:03:27,677 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:03:27" (1/1) ... [2019-11-16 00:03:27,683 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:03:27,725 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:03:28,036 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:03:28,047 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:03:28,120 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:03:28,177 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:03:28,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:28 WrapperNode [2019-11-16 00:03:28,177 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:03:28,178 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:03:28,178 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:03:28,178 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:03:28,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:28" (1/1) ... [2019-11-16 00:03:28,199 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:28" (1/1) ... [2019-11-16 00:03:28,222 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:03:28,223 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:03:28,223 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:03:28,223 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:03:28,230 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:28" (1/1) ... [2019-11-16 00:03:28,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:28" (1/1) ... [2019-11-16 00:03:28,234 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:28" (1/1) ... [2019-11-16 00:03:28,234 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:28" (1/1) ... [2019-11-16 00:03:28,242 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:28" (1/1) ... [2019-11-16 00:03:28,246 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:28" (1/1) ... [2019-11-16 00:03:28,255 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:28" (1/1) ... [2019-11-16 00:03:28,265 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:03:28,265 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:03:28,265 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:03:28,265 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:03:28,266 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a6061d78-5c19-4ac1-b9ad-2eec36647fa1/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:28,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:03:28,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:03:28,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:03:28,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:03:28,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:03:28,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:03:28,726 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:03:28,726 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-11-16 00:03:28,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:03:28 BoogieIcfgContainer [2019-11-16 00:03:28,727 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:03:28,728 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:03:28,728 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:03:28,732 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:03:28,732 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:03:28,733 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:03:27" (1/3) ... [2019-11-16 00:03:28,734 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@33385c65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:03:28, skipping insertion in model container [2019-11-16 00:03:28,734 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:03:28,734 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:28" (2/3) ... [2019-11-16 00:03:28,735 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@33385c65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:03:28, skipping insertion in model container [2019-11-16 00:03:28,735 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:03:28,735 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:03:28" (3/3) ... [2019-11-16 00:03:28,737 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrcspn-alloca-1.i [2019-11-16 00:03:28,774 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:03:28,774 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:03:28,774 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:03:28,775 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:03:28,776 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:03:28,776 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:03:28,776 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:03:28,776 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:03:28,789 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-11-16 00:03:28,810 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-11-16 00:03:28,810 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:03:28,810 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:03:28,816 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:03:28,817 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:03:28,817 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:03:28,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-11-16 00:03:28,819 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-11-16 00:03:28,820 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:03:28,820 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:03:28,820 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:03:28,820 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:03:28,828 INFO L791 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 14#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 15#L532true assume !(main_~length1~0 < 1); 18#L532-2true assume !(main_~length2~0 < 1); 10#L535-1true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 25#L541-3true [2019-11-16 00:03:28,828 INFO L793 eck$LassoCheckResult]: Loop: 25#L541-3true assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 22#L541-2true main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 25#L541-3true [2019-11-16 00:03:28,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:28,834 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-11-16 00:03:28,841 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:28,841 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143608077] [2019-11-16 00:03:28,842 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:28,842 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:28,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:28,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:28,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:28,963 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:28,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:28,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2019-11-16 00:03:28,965 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:28,965 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587658265] [2019-11-16 00:03:28,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:28,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:28,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:28,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:28,981 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:28,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:28,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2019-11-16 00:03:28,982 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:28,983 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958530878] [2019-11-16 00:03:28,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:28,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:28,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:29,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:29,046 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:29,258 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-16 00:03:29,347 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:03:29,348 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:03:29,348 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:03:29,348 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:03:29,348 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:03:29,348 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:29,348 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:03:29,349 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:03:29,349 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca-1.i_Iteration1_Lasso [2019-11-16 00:03:29,349 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:03:29,349 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:03:29,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:29,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:29,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:29,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:29,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:29,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:29,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:29,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:29,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:29,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:29,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:29,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-11-16 00:03:29,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:29,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:29,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:29,932 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-16 00:03:30,056 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:03:30,061 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:03:30,063 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:30,064 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:30,064 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:30,065 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:30,065 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:30,065 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:30,067 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:30,067 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:30,070 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:30,070 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:30,071 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:30,071 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:30,071 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:30,071 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:30,071 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:30,072 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:30,072 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:30,073 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:30,073 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:30,074 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:30,074 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:30,074 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:30,074 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:30,075 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:30,075 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:30,075 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:30,076 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:30,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:30,077 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:30,077 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:30,077 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:30,078 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:30,080 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:30,080 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:30,084 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:30,084 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:30,085 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:30,085 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:30,085 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:30,085 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:30,087 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:30,087 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:30,090 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:30,091 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:30,091 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:30,091 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:30,092 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:30,092 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:30,094 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:30,094 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:30,111 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:30,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:30,112 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:30,112 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:30,112 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:30,112 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:30,114 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:30,114 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:30,119 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:30,119 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:30,120 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:30,120 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:30,120 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:30,120 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:30,120 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:30,121 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:30,121 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:30,124 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:30,125 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:30,126 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:30,126 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-16 00:03:30,126 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:30,126 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:30,143 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-16 00:03:30,144 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:30,193 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:30,193 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:30,197 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:30,198 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:30,198 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:30,198 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:30,203 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:30,203 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:30,289 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:03:30,375 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-16 00:03:30,375 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-16 00:03:30,378 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:03:30,381 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:03:30,381 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:03:30,381 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~length1~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-11-16 00:03:30,400 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-16 00:03:30,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:30,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:03:30,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:30,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:30,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:03:30,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:30,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:30,494 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:03:30,495 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states. Second operand 3 states. [2019-11-16 00:03:30,565 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states.. Second operand 3 states. Result 60 states and 87 transitions. Complement of second has 7 states. [2019-11-16 00:03:30,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:03:30,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:03:30,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2019-11-16 00:03:30,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-16 00:03:30,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:30,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-16 00:03:30,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:30,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-16 00:03:30,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:30,572 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 87 transitions. [2019-11-16 00:03:30,583 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-16 00:03:30,590 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 20 states and 27 transitions. [2019-11-16 00:03:30,591 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-16 00:03:30,591 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-16 00:03:30,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2019-11-16 00:03:30,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:03:30,592 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-11-16 00:03:30,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2019-11-16 00:03:30,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-16 00:03:30,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-16 00:03:30,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2019-11-16 00:03:30,611 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-11-16 00:03:30,611 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-11-16 00:03:30,612 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:03:30,612 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2019-11-16 00:03:30,613 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-16 00:03:30,613 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:03:30,613 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:03:30,613 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:30,613 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:03:30,614 INFO L791 eck$LassoCheckResult]: Stem: 172#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 167#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 168#L532 assume !(main_~length1~0 < 1); 169#L532-2 assume !(main_~length2~0 < 1); 164#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 165#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 160#L541-4 main_~i~1 := 0; 161#L547-3 [2019-11-16 00:03:30,614 INFO L793 eck$LassoCheckResult]: Loop: 161#L547-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 163#L547-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 161#L547-3 [2019-11-16 00:03:30,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:30,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2019-11-16 00:03:30,615 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:30,615 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662226067] [2019-11-16 00:03:30,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:30,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:30,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:30,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:30,664 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:30,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:30,665 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2019-11-16 00:03:30,665 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:30,665 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850481665] [2019-11-16 00:03:30,665 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:30,666 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:30,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:30,680 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:30,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:30,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2019-11-16 00:03:30,681 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:30,681 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82183403] [2019-11-16 00:03:30,681 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:30,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:30,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:30,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:30,702 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:30,912 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:03:30,912 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:03:30,912 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:03:30,912 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:03:30,913 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:03:30,913 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:30,913 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:03:30,913 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:03:30,913 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca-1.i_Iteration2_Lasso [2019-11-16 00:03:30,913 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:03:30,913 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:03:30,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:30,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:30,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:30,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:30,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:30,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:30,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:30,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:30,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:30,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:31,103 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-11-16 00:03:31,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:31,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:31,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:31,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:31,466 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-16 00:03:31,506 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:03:31,506 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:03:31,506 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:31,507 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:31,507 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:31,507 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:31,507 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:31,508 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:31,508 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:31,508 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:31,508 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:31,509 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:31,509 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:31,509 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:31,509 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:31,509 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:31,510 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:31,510 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:31,510 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:31,510 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:31,511 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:31,511 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:31,511 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:31,511 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:31,511 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:31,511 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:31,512 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:31,512 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:31,512 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:31,512 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:31,513 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:31,513 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:31,513 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:31,513 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:31,515 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:31,515 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:31,517 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:31,517 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:31,517 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:31,518 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:31,518 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:31,518 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:31,518 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:31,518 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:31,519 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:31,519 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:31,519 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:31,520 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:31,520 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:31,520 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:31,520 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:31,522 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:31,522 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:31,524 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:31,524 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:31,524 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:31,525 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:31,525 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:31,525 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:31,526 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:31,526 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:31,527 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:31,527 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:31,528 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:31,528 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:31,528 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:31,528 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:31,529 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:31,529 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:31,529 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:31,530 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:31,530 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:31,530 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:31,531 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:31,531 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:31,531 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:31,532 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:31,532 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:31,534 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:31,535 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:31,535 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:31,535 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:31,535 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:31,536 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:31,537 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:31,537 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:31,539 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:31,540 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:31,540 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:31,540 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:31,541 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:31,541 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:31,543 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:31,543 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:31,573 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:03:31,597 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-16 00:03:31,597 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-16 00:03:31,598 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:03:31,598 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:03:31,599 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:03:31,599 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1, ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~nondetString2~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1 - 1*ULTIMATE.start_main_~i~1 - 1*ULTIMATE.start_main_~nondetString2~0.offset Supporting invariants [] [2019-11-16 00:03:31,626 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-16 00:03:31,628 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-16 00:03:31,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:31,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:31,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:03:31,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:31,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:31,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:03:31,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:31,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:31,688 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:03:31,688 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-11-16 00:03:31,751 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 31 states and 44 transitions. Complement of second has 6 states. [2019-11-16 00:03:31,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:03:31,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:03:31,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2019-11-16 00:03:31,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-16 00:03:31,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:31,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 9 letters. Loop has 2 letters. [2019-11-16 00:03:31,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:31,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 7 letters. Loop has 4 letters. [2019-11-16 00:03:31,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:31,754 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 44 transitions. [2019-11-16 00:03:31,756 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-16 00:03:31,756 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 21 states and 29 transitions. [2019-11-16 00:03:31,756 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-16 00:03:31,757 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-16 00:03:31,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 29 transitions. [2019-11-16 00:03:31,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:03:31,757 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2019-11-16 00:03:31,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 29 transitions. [2019-11-16 00:03:31,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-16 00:03:31,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-16 00:03:31,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2019-11-16 00:03:31,759 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2019-11-16 00:03:31,759 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2019-11-16 00:03:31,760 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:03:31,760 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. [2019-11-16 00:03:31,760 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-16 00:03:31,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:03:31,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:03:31,761 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:31,761 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:31,761 INFO L791 eck$LassoCheckResult]: Stem: 298#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 293#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 294#L532 assume !(main_~length1~0 < 1); 295#L532-2 assume !(main_~length2~0 < 1); 290#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 291#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 285#L541-4 main_~i~1 := 0; 286#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 292#L547-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 284#L519-4 [2019-11-16 00:03:31,762 INFO L793 eck$LassoCheckResult]: Loop: 284#L519-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 287#L519-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 299#L522-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 296#L522-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 297#L522-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~short7; 281#L522-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 282#L524 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 283#L519-3 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 284#L519-4 [2019-11-16 00:03:31,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:31,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384726, now seen corresponding path program 1 times [2019-11-16 00:03:31,762 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:31,762 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629066846] [2019-11-16 00:03:31,763 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:31,763 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:31,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:31,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:31,812 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:31,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:31,813 INFO L82 PathProgramCache]: Analyzing trace with hash -904885455, now seen corresponding path program 1 times [2019-11-16 00:03:31,813 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:31,813 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481360440] [2019-11-16 00:03:31,813 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:31,813 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:31,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:31,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:31,841 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:31,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:31,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1903570310, now seen corresponding path program 1 times [2019-11-16 00:03:31,841 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:31,841 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951574748] [2019-11-16 00:03:31,842 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:31,842 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:31,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:31,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:32,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:32,098 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951574748] [2019-11-16 00:03:32,099 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:32,099 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-16 00:03:32,099 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754797460] [2019-11-16 00:03:32,270 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-11-16 00:03:32,509 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-11-16 00:03:32,510 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:32,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:03:32,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:03:32,513 INFO L87 Difference]: Start difference. First operand 21 states and 29 transitions. cyclomatic complexity: 11 Second operand 9 states. [2019-11-16 00:03:32,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:32,806 INFO L93 Difference]: Finished difference Result 48 states and 63 transitions. [2019-11-16 00:03:32,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:03:32,807 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 63 transitions. [2019-11-16 00:03:32,808 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2019-11-16 00:03:32,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 46 states and 61 transitions. [2019-11-16 00:03:32,810 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2019-11-16 00:03:32,810 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2019-11-16 00:03:32,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 61 transitions. [2019-11-16 00:03:32,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:03:32,810 INFO L688 BuchiCegarLoop]: Abstraction has 46 states and 61 transitions. [2019-11-16 00:03:32,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 61 transitions. [2019-11-16 00:03:32,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2019-11-16 00:03:32,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-16 00:03:32,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-11-16 00:03:32,815 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-11-16 00:03:32,815 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-11-16 00:03:32,815 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-16 00:03:32,815 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 42 transitions. [2019-11-16 00:03:32,816 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-16 00:03:32,816 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:03:32,816 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:03:32,817 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:32,817 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:32,817 INFO L791 eck$LassoCheckResult]: Stem: 391#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 386#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 387#L532 assume !(main_~length1~0 < 1); 388#L532-2 assume !(main_~length2~0 < 1); 381#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 382#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 394#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 395#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 376#L541-4 main_~i~1 := 0; 377#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 385#L547-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 375#L519-4 [2019-11-16 00:03:32,817 INFO L793 eck$LassoCheckResult]: Loop: 375#L519-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 378#L519-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 393#L522-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 389#L522-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 390#L522-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~short7; 372#L522-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 373#L524 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 374#L519-3 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 375#L519-4 [2019-11-16 00:03:32,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:32,818 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 1 times [2019-11-16 00:03:32,818 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:32,818 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810196549] [2019-11-16 00:03:32,818 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:32,818 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:32,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:32,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:32,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:32,835 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:32,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:32,836 INFO L82 PathProgramCache]: Analyzing trace with hash -904885455, now seen corresponding path program 2 times [2019-11-16 00:03:32,836 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:32,836 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270458353] [2019-11-16 00:03:32,836 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:32,836 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:32,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:32,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:32,845 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:32,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:32,846 INFO L82 PathProgramCache]: Analyzing trace with hash -164170776, now seen corresponding path program 1 times [2019-11-16 00:03:32,846 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:32,846 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140968966] [2019-11-16 00:03:32,846 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:32,846 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:32,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:32,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:32,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:03:32,964 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140968966] [2019-11-16 00:03:32,965 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:32,965 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-16 00:03:32,965 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182470612] [2019-11-16 00:03:33,073 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-11-16 00:03:33,242 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-11-16 00:03:33,242 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:33,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:03:33,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:03:33,243 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. cyclomatic complexity: 15 Second operand 9 states. [2019-11-16 00:03:33,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:33,369 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2019-11-16 00:03:33,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:03:33,370 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 61 transitions. [2019-11-16 00:03:33,371 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-11-16 00:03:33,372 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 45 states and 54 transitions. [2019-11-16 00:03:33,372 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2019-11-16 00:03:33,372 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2019-11-16 00:03:33,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 54 transitions. [2019-11-16 00:03:33,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:03:33,373 INFO L688 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2019-11-16 00:03:33,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 54 transitions. [2019-11-16 00:03:33,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2019-11-16 00:03:33,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-16 00:03:33,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2019-11-16 00:03:33,376 INFO L711 BuchiCegarLoop]: Abstraction has 41 states and 50 transitions. [2019-11-16 00:03:33,376 INFO L591 BuchiCegarLoop]: Abstraction has 41 states and 50 transitions. [2019-11-16 00:03:33,376 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-16 00:03:33,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 50 transitions. [2019-11-16 00:03:33,377 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-11-16 00:03:33,377 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:03:33,378 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:03:33,378 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:33,378 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:33,378 INFO L791 eck$LassoCheckResult]: Stem: 499#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 494#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 495#L532 assume !(main_~length1~0 < 1); 496#L532-2 assume !(main_~length2~0 < 1); 490#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 491#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 502#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 503#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 483#L541-4 main_~i~1 := 0; 484#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 519#L547-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 482#L519-4 [2019-11-16 00:03:33,378 INFO L793 eck$LassoCheckResult]: Loop: 482#L519-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 518#L519-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 517#L522-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 516#L522-1 assume !cstrcspn_#t~short7; 505#L522-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~short7; 506#L522-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 515#L524 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 481#L519-3 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 482#L519-4 [2019-11-16 00:03:33,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:33,379 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 2 times [2019-11-16 00:03:33,379 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:33,379 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953177883] [2019-11-16 00:03:33,379 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:33,379 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:33,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:33,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:33,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:33,396 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:33,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:33,397 INFO L82 PathProgramCache]: Analyzing trace with hash -903038413, now seen corresponding path program 1 times [2019-11-16 00:03:33,397 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:33,397 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499908525] [2019-11-16 00:03:33,397 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:33,397 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:33,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:33,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:33,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:33,408 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:33,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:33,409 INFO L82 PathProgramCache]: Analyzing trace with hash -162323734, now seen corresponding path program 1 times [2019-11-16 00:03:33,409 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:33,409 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171896077] [2019-11-16 00:03:33,409 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:33,409 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:33,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:33,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:33,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:33,432 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:33,938 WARN L191 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 110 [2019-11-16 00:03:34,082 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-11-16 00:03:34,084 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:03:34,084 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:03:34,084 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:03:34,084 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:03:34,084 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:03:34,084 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:34,084 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:03:34,084 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:03:34,084 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca-1.i_Iteration5_Lasso [2019-11-16 00:03:34,084 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:03:34,085 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:03:34,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:34,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:34,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:34,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:34,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:34,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:34,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:34,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:34,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:34,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:34,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:34,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:34,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:34,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:34,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:34,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:34,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:34,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:34,436 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2019-11-16 00:03:34,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:34,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:34,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:34,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:34,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:34,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:34,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:34,803 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-11-16 00:03:35,363 WARN L191 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-11-16 00:03:35,392 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:03:35,392 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:03:35,392 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:35,393 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:35,393 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:35,393 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:35,393 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:35,393 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:35,394 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:35,394 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:35,395 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:35,395 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:35,396 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:35,396 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:35,396 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:35,396 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:35,396 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:35,396 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:35,396 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:35,397 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:35,397 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:35,397 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:35,397 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:35,397 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:35,398 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:35,399 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:35,399 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:35,400 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:35,401 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:35,401 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:35,401 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:35,401 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:35,402 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:35,402 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:35,402 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:35,402 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:35,402 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:35,403 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:35,403 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:35,403 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:35,404 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:35,404 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:35,404 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:35,404 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:35,404 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:35,405 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:35,405 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:35,405 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:35,406 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:35,406 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:35,406 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:35,406 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:35,406 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:35,406 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:35,407 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:35,407 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:35,408 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:35,408 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:35,408 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:35,408 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:35,408 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:35,409 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:35,409 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:35,409 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:35,409 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:35,409 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:35,410 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:35,410 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:35,410 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:35,410 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:35,410 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:35,410 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:35,410 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:35,411 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:35,411 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:35,411 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:35,411 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:35,412 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:35,412 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:35,412 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:35,412 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:35,413 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:35,413 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:35,413 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:35,413 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:35,414 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:35,414 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:35,414 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:35,414 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:35,414 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:35,415 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:35,415 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:35,416 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:35,416 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:35,416 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:35,416 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:35,417 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:35,417 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:35,418 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:35,419 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:35,419 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:35,419 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:35,420 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:35,420 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:35,420 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:35,420 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:35,420 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:35,421 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:35,421 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:35,421 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:35,422 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:35,422 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:35,422 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:35,422 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:35,422 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:35,423 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:35,423 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:35,423 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:35,424 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:35,424 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:35,424 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:35,424 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:35,424 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:35,425 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:35,425 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:35,425 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:35,425 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:35,426 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:35,426 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:35,426 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:35,426 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:35,427 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:35,427 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:35,428 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:35,429 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:35,429 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:35,429 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:35,429 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:35,430 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:35,430 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:35,430 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:35,430 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:35,431 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:35,431 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:35,431 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:35,431 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:35,432 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:35,432 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:35,432 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:35,432 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:35,432 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:35,433 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:35,433 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:35,434 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:35,434 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:35,434 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:35,434 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:03:35,434 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:35,435 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-16 00:03:35,435 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:35,437 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:35,438 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:35,438 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:35,438 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:35,438 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:35,438 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:35,439 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:35,439 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:35,440 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:35,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:35,441 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:35,441 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:35,441 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:35,441 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:35,442 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:35,442 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:35,444 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:35,444 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:35,445 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:35,445 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:35,445 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:35,445 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:35,449 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:35,449 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:35,484 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:03:35,514 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-16 00:03:35,515 INFO L444 ModelExtractionUtils]: 57 out of 64 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-16 00:03:35,515 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:03:35,516 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:03:35,516 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:03:35,516 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrcspn_~sc1~0.base)_1, ULTIMATE.start_cstrcspn_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrcspn_~sc1~0.base)_1 - 1*ULTIMATE.start_cstrcspn_~sc1~0.offset Supporting invariants [] [2019-11-16 00:03:35,570 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2019-11-16 00:03:35,571 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-16 00:03:35,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:35,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:35,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:03:35,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:35,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:35,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:03:35,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:35,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:35,636 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:03:35,636 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 50 transitions. cyclomatic complexity: 14 Second operand 3 states. [2019-11-16 00:03:35,658 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 50 transitions. cyclomatic complexity: 14. Second operand 3 states. Result 62 states and 76 transitions. Complement of second has 4 states. [2019-11-16 00:03:35,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:03:35,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:03:35,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2019-11-16 00:03:35,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 11 letters. Loop has 8 letters. [2019-11-16 00:03:35,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:35,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 19 letters. Loop has 8 letters. [2019-11-16 00:03:35,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:35,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 11 letters. Loop has 16 letters. [2019-11-16 00:03:35,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:35,660 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 76 transitions. [2019-11-16 00:03:35,662 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:03:35,662 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 41 states and 52 transitions. [2019-11-16 00:03:35,662 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-16 00:03:35,662 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-16 00:03:35,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 52 transitions. [2019-11-16 00:03:35,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:03:35,663 INFO L688 BuchiCegarLoop]: Abstraction has 41 states and 52 transitions. [2019-11-16 00:03:35,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 52 transitions. [2019-11-16 00:03:35,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2019-11-16 00:03:35,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-16 00:03:35,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2019-11-16 00:03:35,665 INFO L711 BuchiCegarLoop]: Abstraction has 37 states and 48 transitions. [2019-11-16 00:03:35,666 INFO L591 BuchiCegarLoop]: Abstraction has 37 states and 48 transitions. [2019-11-16 00:03:35,666 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-16 00:03:35,666 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 48 transitions. [2019-11-16 00:03:35,671 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:03:35,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:03:35,672 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:03:35,673 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:35,673 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:03:35,673 INFO L791 eck$LassoCheckResult]: Stem: 734#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 726#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 727#L532 assume !(main_~length1~0 < 1); 728#L532-2 assume !(main_~length2~0 < 1); 722#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 723#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 715#L541-4 main_~i~1 := 0; 716#L547-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 720#L547-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 721#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 724#L547-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 725#L519-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 719#L519-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 735#L522-5 [2019-11-16 00:03:35,674 INFO L793 eck$LassoCheckResult]: Loop: 735#L522-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 729#L522-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 730#L522-3 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~short7;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, 1 + cstrcspn_#t~post8.offset;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 735#L522-5 [2019-11-16 00:03:35,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:35,674 INFO L82 PathProgramCache]: Analyzing trace with hash -534376483, now seen corresponding path program 1 times [2019-11-16 00:03:35,674 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:35,674 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306085943] [2019-11-16 00:03:35,674 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:35,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:35,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:35,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:03:35,785 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306085943] [2019-11-16 00:03:35,785 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:35,786 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:03:35,786 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631243068] [2019-11-16 00:03:35,786 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:03:35,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:35,786 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 1 times [2019-11-16 00:03:35,786 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:35,786 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823979601] [2019-11-16 00:03:35,787 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:35,787 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:35,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:35,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:35,793 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:35,962 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:35,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:03:35,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:03:35,963 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. cyclomatic complexity: 16 Second operand 7 states. [2019-11-16 00:03:36,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:36,027 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2019-11-16 00:03:36,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:03:36,028 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 45 transitions. [2019-11-16 00:03:36,028 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:03:36,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 28 states and 36 transitions. [2019-11-16 00:03:36,029 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-16 00:03:36,029 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-16 00:03:36,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 36 transitions. [2019-11-16 00:03:36,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:03:36,029 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-11-16 00:03:36,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 36 transitions. [2019-11-16 00:03:36,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-11-16 00:03:36,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-16 00:03:36,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2019-11-16 00:03:36,031 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-11-16 00:03:36,031 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-11-16 00:03:36,031 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-16 00:03:36,031 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. [2019-11-16 00:03:36,032 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:03:36,032 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:03:36,032 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:03:36,033 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:36,033 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:03:36,033 INFO L791 eck$LassoCheckResult]: Stem: 820#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 812#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 813#L532 assume !(main_~length1~0 < 1); 814#L532-2 assume !(main_~length2~0 < 1); 809#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 810#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 823#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 824#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 802#L541-4 main_~i~1 := 0; 803#L547-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 807#L547-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 808#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 811#L547-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 804#L519-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 806#L519-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 821#L522-5 [2019-11-16 00:03:36,033 INFO L793 eck$LassoCheckResult]: Loop: 821#L522-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 815#L522-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 816#L522-3 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~short7;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, 1 + cstrcspn_#t~post8.offset;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 821#L522-5 [2019-11-16 00:03:36,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:36,033 INFO L82 PathProgramCache]: Analyzing trace with hash 2055034687, now seen corresponding path program 1 times [2019-11-16 00:03:36,033 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:36,033 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096458282] [2019-11-16 00:03:36,034 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:36,034 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:36,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:36,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:36,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:36,056 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:36,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:36,056 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 2 times [2019-11-16 00:03:36,057 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:36,057 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158566837] [2019-11-16 00:03:36,057 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:36,057 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:36,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:36,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:36,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:36,063 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:36,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:36,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1074579938, now seen corresponding path program 1 times [2019-11-16 00:03:36,064 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:36,064 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212017115] [2019-11-16 00:03:36,064 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:36,064 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:36,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:36,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:36,094 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:36,203 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-11-16 00:03:36,325 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-11-16 00:03:36,942 WARN L191 SmtUtils]: Spent 614.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 129 [2019-11-16 00:03:37,118 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-11-16 00:03:37,120 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:03:37,120 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:03:37,120 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:03:37,121 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:03:37,121 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:03:37,121 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:37,121 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:03:37,121 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:03:37,121 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca-1.i_Iteration7_Lasso [2019-11-16 00:03:37,121 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:03:37,121 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:03:37,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:37,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:37,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:37,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:37,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:37,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:37,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:37,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:37,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:37,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:37,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:37,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:37,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:37,560 WARN L191 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 95 [2019-11-16 00:03:37,704 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-11-16 00:03:37,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:37,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:37,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:37,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:37,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:37,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:37,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:37,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:37,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:37,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:37,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:37,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:38,015 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-11-16 00:03:38,475 WARN L191 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-16 00:03:38,753 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2019-11-16 00:03:38,877 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:03:38,878 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:03:38,878 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:38,878 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:38,879 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:38,879 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:38,879 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:38,879 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:38,879 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:38,879 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:38,880 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:38,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:38,880 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:38,880 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:38,880 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:38,880 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:38,881 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:38,881 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:38,881 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:38,881 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:38,881 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:38,881 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:38,882 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:38,882 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:38,882 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:38,882 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:38,882 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:38,883 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:38,884 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:38,884 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:38,884 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:38,884 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:38,884 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:38,884 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:38,890 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:38,890 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:38,891 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:38,891 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:38,891 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:38,892 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:38,892 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:38,892 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:38,893 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:38,893 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:38,893 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:38,893 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:38,894 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:38,894 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:38,894 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:38,894 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:38,895 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:38,895 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:38,895 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:38,895 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:38,895 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:38,896 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:38,896 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:38,896 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:38,896 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:38,896 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:38,896 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:38,897 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:38,897 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:38,897 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:38,897 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:38,898 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:38,898 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:38,899 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:38,899 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:38,899 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:38,899 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:38,899 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:38,899 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:38,900 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:38,900 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:38,900 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:38,900 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:38,900 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:38,900 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:38,900 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:38,901 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:38,901 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:38,901 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:38,902 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:38,902 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:38,902 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:38,902 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:38,902 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:38,904 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:38,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:38,904 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:38,905 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:38,905 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:38,905 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:38,905 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:38,905 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:38,906 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:38,906 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:38,906 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:38,907 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:38,907 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:38,907 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:38,907 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:38,907 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:38,907 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:38,908 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:38,908 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:38,908 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:38,909 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:38,909 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-16 00:03:38,909 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:38,909 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:38,913 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-16 00:03:38,913 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:38,927 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:38,928 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:38,928 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:38,928 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:38,928 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:38,929 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:38,929 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:38,930 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:38,930 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:38,931 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:38,931 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:38,931 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:38,931 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:38,932 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:38,932 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:38,932 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:38,933 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:38,934 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:38,934 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:38,934 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-16 00:03:38,935 INFO L203 nArgumentSynthesizer]: 6 loop disjuncts [2019-11-16 00:03:38,935 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:38,965 INFO L400 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2019-11-16 00:03:38,965 INFO L401 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2019-11-16 00:03:39,120 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:39,121 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:39,121 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:39,122 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:39,122 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:39,122 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:39,122 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:39,123 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:39,124 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:39,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-11-16 00:03:39,125 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:39,125 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:39,125 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:39,125 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:39,128 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:39,128 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:39,153 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:03:39,176 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-16 00:03:39,177 INFO L444 ModelExtractionUtils]: 43 out of 52 variables were initially zero. Simplification set additionally 6 variables to zero. [2019-11-16 00:03:39,177 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:03:39,178 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:03:39,178 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:03:39,178 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~s~0.offset, v_rep(select #length ULTIMATE.start_cstrcspn_~s~0.base)_2) = -1*ULTIMATE.start_cstrcspn_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrcspn_~s~0.base)_2 Supporting invariants [] [2019-11-16 00:03:39,288 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2019-11-16 00:03:39,290 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-16 00:03:39,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:39,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:39,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:03:39,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:39,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:39,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:03:39,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:39,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:39,353 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:03:39,353 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-11-16 00:03:39,383 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 54 states and 67 transitions. Complement of second has 5 states. [2019-11-16 00:03:39,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:03:39,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:03:39,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2019-11-16 00:03:39,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-16 00:03:39,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:39,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 18 letters. Loop has 3 letters. [2019-11-16 00:03:39,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:39,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 15 letters. Loop has 6 letters. [2019-11-16 00:03:39,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:39,386 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 67 transitions. [2019-11-16 00:03:39,386 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:03:39,387 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 40 states and 50 transitions. [2019-11-16 00:03:39,387 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-16 00:03:39,387 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-16 00:03:39,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 50 transitions. [2019-11-16 00:03:39,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:03:39,390 INFO L688 BuchiCegarLoop]: Abstraction has 40 states and 50 transitions. [2019-11-16 00:03:39,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 50 transitions. [2019-11-16 00:03:39,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2019-11-16 00:03:39,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-16 00:03:39,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2019-11-16 00:03:39,394 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2019-11-16 00:03:39,394 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2019-11-16 00:03:39,394 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-16 00:03:39,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 41 transitions. [2019-11-16 00:03:39,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:03:39,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:03:39,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:03:39,396 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:39,397 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:03:39,397 INFO L791 eck$LassoCheckResult]: Stem: 1072#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1065#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 1066#L532 assume !(main_~length1~0 < 1); 1067#L532-2 assume !(main_~length2~0 < 1); 1062#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 1063#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 1075#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 1076#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 1054#L541-4 main_~i~1 := 0; 1055#L547-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 1060#L547-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 1061#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 1064#L547-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 1056#L519-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 1057#L519-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 1074#L522-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 1070#L522-1 assume !cstrcspn_#t~short7; 1071#L522-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~short7; 1050#L522-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 1051#L524 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 1052#L519-3 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 1053#L519-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 1059#L519-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 1073#L522-5 [2019-11-16 00:03:39,397 INFO L793 eck$LassoCheckResult]: Loop: 1073#L522-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 1068#L522-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 1069#L522-3 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~short7;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, 1 + cstrcspn_#t~post8.offset;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 1073#L522-5 [2019-11-16 00:03:39,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:39,398 INFO L82 PathProgramCache]: Analyzing trace with hash -777149455, now seen corresponding path program 1 times [2019-11-16 00:03:39,398 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:39,398 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413150802] [2019-11-16 00:03:39,398 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:39,399 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:39,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:39,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:39,841 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:03:39,841 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413150802] [2019-11-16 00:03:39,841 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667422393] [2019-11-16 00:03:39,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a6061d78-5c19-4ac1-b9ad-2eec36647fa1/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:39,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 52 conjunts are in the unsatisfiable core [2019-11-16 00:03:39,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:40,059 INFO L341 Elim1Store]: treesize reduction 37, result has 19.6 percent of original size [2019-11-16 00:03:40,059 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 20 [2019-11-16 00:03:40,060 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:03:40,084 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:03:40,085 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:03:40,085 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:32 [2019-11-16 00:03:40,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:40,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:03:40,496 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:03:40,566 INFO L341 Elim1Store]: treesize reduction 14, result has 78.8 percent of original size [2019-11-16 00:03:40,566 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 41 treesize of output 68 [2019-11-16 00:03:40,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:40,568 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:03:40,596 INFO L567 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2019-11-16 00:03:40,596 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:03:40,597 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:47, output treesize:3 [2019-11-16 00:03:40,640 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:03:40,640 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:03:40,640 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2019-11-16 00:03:40,641 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022476684] [2019-11-16 00:03:40,642 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:03:40,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:40,642 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 3 times [2019-11-16 00:03:40,642 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:40,647 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368415424] [2019-11-16 00:03:40,647 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:40,647 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:40,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:40,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:40,659 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:40,872 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-11-16 00:03:40,873 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:40,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-16 00:03:40,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2019-11-16 00:03:40,874 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. cyclomatic complexity: 14 Second operand 24 states. [2019-11-16 00:03:41,326 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-11-16 00:03:41,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:41,655 INFO L93 Difference]: Finished difference Result 68 states and 81 transitions. [2019-11-16 00:03:41,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-16 00:03:41,656 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 81 transitions. [2019-11-16 00:03:41,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:03:41,659 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 35 states and 44 transitions. [2019-11-16 00:03:41,660 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-16 00:03:41,660 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-16 00:03:41,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 44 transitions. [2019-11-16 00:03:41,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:03:41,660 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2019-11-16 00:03:41,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 44 transitions. [2019-11-16 00:03:41,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-11-16 00:03:41,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-16 00:03:41,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2019-11-16 00:03:41,662 INFO L711 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2019-11-16 00:03:41,662 INFO L591 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2019-11-16 00:03:41,662 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-16 00:03:41,662 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2019-11-16 00:03:41,663 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:03:41,663 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:03:41,663 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:03:41,664 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:41,664 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:03:41,664 INFO L791 eck$LassoCheckResult]: Stem: 1285#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1278#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 1279#L532 assume !(main_~length1~0 < 1); 1280#L532-2 assume !(main_~length2~0 < 1); 1275#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 1276#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 1290#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 1291#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 1293#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 1295#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 1267#L541-4 main_~i~1 := 0; 1268#L547-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 1273#L547-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 1274#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 1277#L547-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 1269#L519-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 1270#L519-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 1288#L522-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 1283#L522-1 assume !cstrcspn_#t~short7; 1284#L522-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~short7; 1263#L522-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 1264#L524 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 1265#L519-3 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 1266#L519-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 1272#L519-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 1286#L522-5 [2019-11-16 00:03:41,664 INFO L793 eck$LassoCheckResult]: Loop: 1286#L522-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 1281#L522-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 1282#L522-3 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~short7;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, 1 + cstrcspn_#t~post8.offset;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 1286#L522-5 [2019-11-16 00:03:41,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:41,664 INFO L82 PathProgramCache]: Analyzing trace with hash 409245907, now seen corresponding path program 2 times [2019-11-16 00:03:41,664 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:41,665 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017745159] [2019-11-16 00:03:41,665 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:41,665 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:41,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:41,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:41,720 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:41,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:41,721 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 4 times [2019-11-16 00:03:41,721 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:41,721 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829254609] [2019-11-16 00:03:41,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:41,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:41,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:41,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:41,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:41,728 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:41,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:41,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1567281202, now seen corresponding path program 1 times [2019-11-16 00:03:41,729 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:41,729 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756896941] [2019-11-16 00:03:41,729 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:41,729 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:41,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:41,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:41,816 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-16 00:03:41,816 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756896941] [2019-11-16 00:03:41,816 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632504704] [2019-11-16 00:03:41,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a6061d78-5c19-4ac1-b9ad-2eec36647fa1/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:41,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-16 00:03:41,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:41,949 INFO L341 Elim1Store]: treesize reduction 40, result has 20.0 percent of original size [2019-11-16 00:03:41,950 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 21 [2019-11-16 00:03:41,950 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:03:41,955 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:03:41,956 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-16 00:03:41,956 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:36, output treesize:21 [2019-11-16 00:04:25,140 WARN L191 SmtUtils]: Spent 3.60 s on a formula simplification that was a NOOP. DAG size: 20 [2019-11-16 00:04:50,758 WARN L191 SmtUtils]: Spent 1.60 s on a formula simplification that was a NOOP. DAG size: 15 [2019-11-16 00:05:06,719 WARN L191 SmtUtils]: Spent 1.31 s on a formula simplification that was a NOOP. DAG size: 15 [2019-11-16 00:05:06,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:06,733 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-16 00:05:06,734 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:05:06,734 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-11-16 00:05:06,734 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440952443] [2019-11-16 00:05:06,899 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:05:06,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-16 00:05:06,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=115, Unknown=8, NotChecked=0, Total=156 [2019-11-16 00:05:06,899 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. cyclomatic complexity: 14 Second operand 13 states. [2019-11-16 00:05:07,835 WARN L191 SmtUtils]: Spent 877.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 25 [2019-11-16 00:05:10,416 WARN L191 SmtUtils]: Spent 2.57 s on a formula simplification. DAG size of input: 31 DAG size of output: 21 [2019-11-16 00:05:13,541 WARN L191 SmtUtils]: Spent 3.12 s on a formula simplification. DAG size of input: 25 DAG size of output: 19 [2019-11-16 00:05:13,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:05:13,607 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2019-11-16 00:05:13,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:05:13,609 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 77 transitions. [2019-11-16 00:05:13,610 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:05:13,611 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 52 states and 64 transitions. [2019-11-16 00:05:13,611 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-16 00:05:13,611 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-16 00:05:13,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 64 transitions. [2019-11-16 00:05:13,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:05:13,611 INFO L688 BuchiCegarLoop]: Abstraction has 52 states and 64 transitions. [2019-11-16 00:05:13,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 64 transitions. [2019-11-16 00:05:13,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 38. [2019-11-16 00:05:13,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-16 00:05:13,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2019-11-16 00:05:13,615 INFO L711 BuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2019-11-16 00:05:13,615 INFO L591 BuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2019-11-16 00:05:13,616 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-16 00:05:13,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 48 transitions. [2019-11-16 00:05:13,616 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:05:13,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:05:13,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:05:13,622 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:05:13,622 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:05:13,623 INFO L791 eck$LassoCheckResult]: Stem: 1490#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1483#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 1484#L532 assume !(main_~length1~0 < 1); 1485#L532-2 assume !(main_~length2~0 < 1); 1480#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 1481#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 1495#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 1496#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 1498#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 1499#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 1472#L541-4 main_~i~1 := 0; 1473#L547-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 1478#L547-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 1479#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 1482#L547-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 1474#L519-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 1475#L519-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 1504#L522-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 1488#L522-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 1489#L522-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~short7; 1468#L522-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 1469#L524 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 1470#L519-3 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 1471#L519-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 1477#L519-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 1491#L522-5 [2019-11-16 00:05:13,623 INFO L793 eck$LassoCheckResult]: Loop: 1491#L522-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 1486#L522-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 1487#L522-3 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~short7;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, 1 + cstrcspn_#t~post8.offset;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 1491#L522-5 [2019-11-16 00:05:13,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:13,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1365761455, now seen corresponding path program 1 times [2019-11-16 00:05:13,623 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:05:13,623 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670939201] [2019-11-16 00:05:13,623 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:13,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:13,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:05:13,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:05:13,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:05:13,666 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:05:13,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:13,668 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 5 times [2019-11-16 00:05:13,668 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:05:13,668 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234059036] [2019-11-16 00:05:13,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:13,669 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:13,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:05:13,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:05:13,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:05:13,676 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:05:13,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:13,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1174254192, now seen corresponding path program 1 times [2019-11-16 00:05:13,677 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:05:13,677 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759721981] [2019-11-16 00:05:13,677 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:13,677 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:13,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:05:13,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:05:13,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:05:13,711 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:05:13,938 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-11-16 00:05:15,138 WARN L191 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 228 DAG size of output: 179 [2019-11-16 00:05:16,823 WARN L191 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 137 DAG size of output: 137 [2019-11-16 00:05:16,825 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:05:16,825 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:05:16,825 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:05:16,825 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:05:16,826 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:05:16,826 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:05:16,826 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:05:16,826 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:05:16,826 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca-1.i_Iteration10_Lasso [2019-11-16 00:05:16,826 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:05:16,826 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:05:16,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:16,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:16,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:16,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:16,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:16,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:16,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:16,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:16,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:16,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:16,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:16,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:16,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:17,078 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-16 00:05:18,104 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 130 DAG size of output: 110 [2019-11-16 00:05:18,243 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-11-16 00:05:18,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:18,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:18,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:18,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:18,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:18,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:18,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:18,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:18,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:18,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:18,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-11-16 00:05:18,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:18,590 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-11-16 00:05:19,038 WARN L191 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-16 00:05:19,912 WARN L191 SmtUtils]: Spent 766.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 52 [2019-11-16 00:05:20,125 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2019-11-16 00:05:20,151 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:05:20,151 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:05:20,151 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:05:20,152 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:20,152 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:05:20,152 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:20,152 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:20,152 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:20,152 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:05:20,152 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:05:20,153 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:20,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-11-16 00:05:20,153 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:20,153 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:05:20,154 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:20,154 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:20,154 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:20,154 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:05:20,154 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:05:20,154 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:20,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-11-16 00:05:20,155 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:20,155 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:05:20,155 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:20,155 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:20,155 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:20,155 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:05:20,155 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:05:20,156 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:20,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-11-16 00:05:20,156 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:20,156 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:20,156 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:20,157 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:20,157 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:05:20,157 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:05:20,158 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:20,158 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:05:20,159 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:20,159 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:05:20,159 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:20,159 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:20,159 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:20,159 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:05:20,159 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:05:20,160 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:20,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-11-16 00:05:20,160 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:20,160 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:05:20,160 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:20,160 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:20,161 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:20,161 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:05:20,161 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:05:20,161 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:20,161 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:05:20,162 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:20,162 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:20,164 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:20,164 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:20,164 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:05:20,164 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:05:20,166 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:20,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-11-16 00:05:20,166 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:20,167 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:05:20,167 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:20,167 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:20,167 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:20,167 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:05:20,167 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:05:20,168 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:20,168 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:05:20,169 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:20,169 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:05:20,169 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:20,169 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:20,169 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:20,170 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:05:20,170 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:05:20,170 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:20,170 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:05:20,171 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:20,171 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:05:20,171 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:20,171 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:20,171 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:20,172 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:05:20,172 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:05:20,172 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:20,172 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:05:20,173 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:20,173 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:05:20,173 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:20,173 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:20,173 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:20,174 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:05:20,174 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:05:20,174 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:20,175 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:05:20,175 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:20,175 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:05:20,175 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:20,175 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:20,176 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:20,176 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:05:20,176 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:05:20,176 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:20,177 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:05:20,177 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:20,177 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:20,177 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:20,177 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:20,178 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:05:20,178 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:05:20,179 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:20,180 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:05:20,180 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:20,180 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:20,180 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:20,181 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:20,181 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:05:20,181 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:05:20,182 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:20,182 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:05:20,183 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:20,183 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:20,183 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:20,183 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:20,184 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:05:20,184 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:05:20,187 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:20,188 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:05:20,188 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:20,188 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-16 00:05:20,188 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:20,189 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:20,191 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-16 00:05:20,191 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:05:20,205 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:20,205 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:05:20,206 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:20,206 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:20,206 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:20,206 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:20,208 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:05:20,209 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:05:20,227 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:05:20,248 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-16 00:05:20,248 INFO L444 ModelExtractionUtils]: 34 out of 43 variables were initially zero. Simplification set additionally 6 variables to zero. [2019-11-16 00:05:20,249 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:05:20,249 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:05:20,250 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:05:20,250 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrcspn_~s~0.base)_3, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrcspn_~s~0.base)_3 - 1*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2019-11-16 00:05:20,408 INFO L297 tatePredicateManager]: 33 out of 33 supporting invariants were superfluous and have been removed [2019-11-16 00:05:20,408 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-16 00:05:20,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:20,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:05:20,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:05:20,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:05:20,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:05:20,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:05:20,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:05:20,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:05:20,464 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:05:20,465 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 48 transitions. cyclomatic complexity: 15 Second operand 3 states. [2019-11-16 00:05:20,492 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 48 transitions. cyclomatic complexity: 15. Second operand 3 states. Result 56 states and 70 transitions. Complement of second has 5 states. [2019-11-16 00:05:20,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:05:20,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:05:20,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2019-11-16 00:05:20,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 25 letters. Loop has 3 letters. [2019-11-16 00:05:20,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:05:20,494 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:05:20,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:20,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:05:20,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:05:20,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:05:20,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:05:20,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:05:20,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:05:20,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:05:20,550 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:05:20,550 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 48 transitions. cyclomatic complexity: 15 Second operand 3 states. [2019-11-16 00:05:20,579 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 48 transitions. cyclomatic complexity: 15. Second operand 3 states. Result 56 states and 70 transitions. Complement of second has 5 states. [2019-11-16 00:05:20,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:05:20,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:05:20,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2019-11-16 00:05:20,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 25 letters. Loop has 3 letters. [2019-11-16 00:05:20,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:05:20,580 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:05:20,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:20,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:05:20,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:05:20,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:05:20,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:05:20,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:05:20,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:05:20,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:05:20,648 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:05:20,648 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 48 transitions. cyclomatic complexity: 15 Second operand 3 states. [2019-11-16 00:05:20,662 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 48 transitions. cyclomatic complexity: 15. Second operand 3 states. Result 55 states and 72 transitions. Complement of second has 4 states. [2019-11-16 00:05:20,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:05:20,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:05:20,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2019-11-16 00:05:20,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 35 transitions. Stem has 25 letters. Loop has 3 letters. [2019-11-16 00:05:20,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:05:20,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 35 transitions. Stem has 28 letters. Loop has 3 letters. [2019-11-16 00:05:20,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:05:20,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 35 transitions. Stem has 25 letters. Loop has 6 letters. [2019-11-16 00:05:20,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:05:20,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 72 transitions. [2019-11-16 00:05:20,666 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:05:20,667 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 0 states and 0 transitions. [2019-11-16 00:05:20,667 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:05:20,667 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:05:20,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:05:20,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:05:20,667 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:05:20,667 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:05:20,667 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:05:20,667 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-16 00:05:20,667 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:05:20,667 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:05:20,667 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-16 00:05:20,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:05:20 BoogieIcfgContainer [2019-11-16 00:05:20,672 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:05:20,673 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:05:20,673 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:05:20,673 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:05:20,673 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:03:28" (3/4) ... [2019-11-16 00:05:20,676 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:05:20,677 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:05:20,678 INFO L168 Benchmark]: Toolchain (without parser) took 113007.68 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 341.8 MB). Free memory was 936.9 MB in the beginning and 1.2 GB in the end (delta: -235.1 MB). Peak memory consumption was 106.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:05:20,678 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:05:20,679 INFO L168 Benchmark]: CACSL2BoogieTranslator took 506.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 936.9 MB in the beginning and 1.1 GB in the end (delta: -173.4 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:05:20,679 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.53 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:05:20,680 INFO L168 Benchmark]: Boogie Preprocessor took 42.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:05:20,680 INFO L168 Benchmark]: RCFGBuilder took 462.22 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:05:20,681 INFO L168 Benchmark]: BuchiAutomizer took 111944.52 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 215.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -90.8 MB). Peak memory consumption was 124.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:05:20,681 INFO L168 Benchmark]: Witness Printer took 4.13 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:05:20,683 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 506.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 936.9 MB in the beginning and 1.1 GB in the end (delta: -173.4 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.53 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 462.22 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 111944.52 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 215.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -90.8 MB). Peak memory consumption was 124.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.13 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 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 - 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 10 terminating modules (5 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function length1 + -1 * i and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[nondetString2] + -1 * i + -1 * nondetString2 and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[sc1] + -1 * sc1 and consists of 3 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[s] and consists of 3 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 3 locations. 5 modules have a trivial ranking function, the largest among these consists of 24 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 111.9s and 11 iterations. TraceHistogramMax:2. Analysis of lassos took 103.0s. Construction of modules took 0.7s. Büchi inclusion checks took 7.9s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 47 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 41 states and ocurred in iteration 4. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 234 SDtfs, 595 SDslu, 556 SDs, 0 SdLazy, 592 SolverSat, 98 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU2 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital369 mio100 ax108 hnf98 lsp82 ukn72 mio100 lsp44 div108 bol100 ite100 ukn100 eq175 hnf86 smp92 dnf566 smp69 tf100 neg94 sie117 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 186ms VariablesStem: 7 VariablesLoop: 6 DisjunctsStem: 2 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 108 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...