./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/cstrncmp-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/working_dir_24c8be79-df2c-4f4d-95a6-8a9b5639acce/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_24c8be79-df2c-4f4d-95a6-8a9b5639acce/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_24c8be79-df2c-4f4d-95a6-8a9b5639acce/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_24c8be79-df2c-4f4d-95a6-8a9b5639acce/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/cstrncmp-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_24c8be79-df2c-4f4d-95a6-8a9b5639acce/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_24c8be79-df2c-4f4d-95a6-8a9b5639acce/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 2d5a995d825785bc5dc95f3825623b1e4ecd07fe .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 09:00:49,250 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:00:49,253 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:00:49,263 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:00:49,265 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:00:49,266 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:00:49,267 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:00:49,269 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:00:49,270 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:00:49,271 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:00:49,273 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:00:49,274 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:00:49,274 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:00:49,275 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:00:49,276 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:00:49,277 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:00:49,277 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:00:49,278 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:00:49,279 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:00:49,287 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:00:49,288 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:00:49,289 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:00:49,290 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:00:49,291 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:00:49,295 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:00:49,296 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:00:49,296 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:00:49,296 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:00:49,297 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:00:49,297 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:00:49,297 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:00:49,298 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:00:49,298 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:00:49,299 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:00:49,301 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:00:49,302 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:00:49,302 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:00:49,302 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:00:49,302 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:00:49,303 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:00:49,304 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:00:49,304 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_24c8be79-df2c-4f4d-95a6-8a9b5639acce/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 09:00:49,320 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:00:49,320 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:00:49,321 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:00:49,321 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:00:49,322 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:00:49,322 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:00:49,322 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:00:49,322 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:00:49,322 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:00:49,322 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:00:49,322 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:00:49,323 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:00:49,323 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:00:49,323 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:00:49,323 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:00:49,333 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:00:49,333 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:00:49,333 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:00:49,333 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:00:49,334 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:00:49,334 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:00:49,334 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:00:49,334 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:00:49,334 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:00:49,334 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:00:49,334 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:00:49,335 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:00:49,335 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:00:49,335 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:00:49,335 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:00:49,335 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:00:49,336 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:00:49,336 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_24c8be79-df2c-4f4d-95a6-8a9b5639acce/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 -> 2d5a995d825785bc5dc95f3825623b1e4ecd07fe [2019-10-22 09:00:49,368 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:00:49,381 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:00:49,384 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:00:49,385 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:00:49,385 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:00:49,386 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_24c8be79-df2c-4f4d-95a6-8a9b5639acce/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrncmp-alloca-1.i [2019-10-22 09:00:49,436 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_24c8be79-df2c-4f4d-95a6-8a9b5639acce/bin/uautomizer/data/fd6d614c3/152f506928924984a27a5805da02f016/FLAG3a3fd5854 [2019-10-22 09:00:49,922 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:00:49,923 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_24c8be79-df2c-4f4d-95a6-8a9b5639acce/sv-benchmarks/c/array-memsafety/cstrncmp-alloca-1.i [2019-10-22 09:00:49,940 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_24c8be79-df2c-4f4d-95a6-8a9b5639acce/bin/uautomizer/data/fd6d614c3/152f506928924984a27a5805da02f016/FLAG3a3fd5854 [2019-10-22 09:00:50,410 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_24c8be79-df2c-4f4d-95a6-8a9b5639acce/bin/uautomizer/data/fd6d614c3/152f506928924984a27a5805da02f016 [2019-10-22 09:00:50,413 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:00:50,414 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:00:50,415 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:00:50,415 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:00:50,418 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:00:50,419 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:00:50" (1/1) ... [2019-10-22 09:00:50,422 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9b3d066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:50, skipping insertion in model container [2019-10-22 09:00:50,422 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:00:50" (1/1) ... [2019-10-22 09:00:50,429 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:00:50,473 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:00:50,866 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:00:50,881 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:00:50,943 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:00:50,991 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:00:50,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:50 WrapperNode [2019-10-22 09:00:50,992 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:00:50,993 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:00:50,993 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:00:50,993 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:00:51,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:50" (1/1) ... [2019-10-22 09:00:51,014 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:50" (1/1) ... [2019-10-22 09:00:51,037 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:00:51,037 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:00:51,037 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:00:51,037 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:00:51,045 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:50" (1/1) ... [2019-10-22 09:00:51,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:50" (1/1) ... [2019-10-22 09:00:51,048 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:50" (1/1) ... [2019-10-22 09:00:51,049 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:50" (1/1) ... [2019-10-22 09:00:51,054 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:50" (1/1) ... [2019-10-22 09:00:51,074 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:50" (1/1) ... [2019-10-22 09:00:51,076 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:50" (1/1) ... [2019-10-22 09:00:51,078 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:00:51,078 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:00:51,079 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:00:51,079 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:00:51,079 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24c8be79-df2c-4f4d-95a6-8a9b5639acce/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:51,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 09:00:51,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 09:00:51,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 09:00:51,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 09:00:51,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:00:51,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:00:51,445 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:00:51,445 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-10-22 09:00:51,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:51 BoogieIcfgContainer [2019-10-22 09:00:51,446 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:00:51,447 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:00:51,447 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:00:51,450 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:00:51,451 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:51,456 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:00:50" (1/3) ... [2019-10-22 09:00:51,457 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5bd72d69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:00:51, skipping insertion in model container [2019-10-22 09:00:51,457 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:51,457 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:50" (2/3) ... [2019-10-22 09:00:51,457 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5bd72d69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:00:51, skipping insertion in model container [2019-10-22 09:00:51,458 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:51,458 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:51" (3/3) ... [2019-10-22 09:00:51,459 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrncmp-alloca-1.i [2019-10-22 09:00:51,515 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:00:51,517 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:00:51,517 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:00:51,517 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:00:51,517 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:00:51,517 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:00:51,517 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:00:51,518 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:00:51,532 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-10-22 09:00:51,554 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-10-22 09:00:51,558 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:51,558 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:51,564 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 09:00:51,565 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:00:51,565 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:00:51,565 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-10-22 09:00:51,567 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-10-22 09:00:51,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:51,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:51,568 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 09:00:51,568 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:00:51,575 INFO L791 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~nondet18, main_#t~post17, main_~i~0, main_#t~nondet20, main_#t~post19, main_~i~1, main_#t~nondet21, main_#t~ret22, 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~nondet13;havoc main_#t~nondet13;main_~length2~0 := main_#t~nondet14;havoc main_#t~nondet14; 13#L532true assume !(main_~length1~0 < 1); 18#L532-2true assume !(main_~length2~0 < 1); 9#L535-1true call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;call main_#t~malloc16.base, main_#t~malloc16.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc16.base, main_#t~malloc16.offset;main_~i~0 := 0; 25#L541-3true [2019-10-22 09:00:51,575 INFO L793 eck$LassoCheckResult]: Loop: 25#L541-3true assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet18, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet18; 22#L541-2true main_#t~post17 := main_~i~0;main_~i~0 := 1 + main_#t~post17;havoc main_#t~post17; 25#L541-3true [2019-10-22 09:00:51,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:51,581 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-10-22 09:00:51,588 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:51,588 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470504723] [2019-10-22 09:00:51,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:51,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:51,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:51,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:51,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:51,714 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:51,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:51,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2019-10-22 09:00:51,716 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:51,716 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507210515] [2019-10-22 09:00:51,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:51,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:51,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:51,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:51,730 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:51,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:51,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2019-10-22 09:00:51,731 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:51,732 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554764674] [2019-10-22 09:00:51,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:51,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:51,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:51,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:51,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:51,770 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:51,996 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:51,996 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:51,996 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:51,997 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:51,997 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:51,997 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:51,997 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:51,997 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:51,997 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncmp-alloca-1.i_Iteration1_Lasso [2019-10-22 09:00:51,997 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:51,998 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:52,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:52,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:52,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:52,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:52,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:52,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:52,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:52,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:52,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:52,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:52,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:52,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:52,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:52,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:52,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:52,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:52,539 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-10-22 09:00:52,638 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:52,643 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:52,645 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:52,647 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:52,647 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:52,648 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:52,648 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:52,648 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:52,650 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:52,650 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:52,653 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:52,653 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:52,654 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:52,654 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:52,654 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:52,654 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:52,655 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:52,655 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:52,656 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:52,656 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:52,657 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:52,658 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:52,658 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:52,658 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:52,658 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:52,658 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:52,659 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:52,659 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:52,660 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:52,660 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:52,661 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:52,661 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:52,661 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:52,662 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:52,662 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:52,662 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:52,662 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:52,663 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:52,664 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:52,664 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:52,665 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:52,665 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:52,665 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:52,667 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:52,668 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:52,676 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:52,676 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:52,677 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:52,677 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:52,677 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:52,677 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:52,680 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:52,681 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:52,687 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:52,687 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:52,688 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:52,688 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:52,688 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:52,688 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:52,690 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:52,690 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:52,695 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:52,696 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:52,696 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:52,696 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:52,697 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:52,697 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:52,697 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:52,697 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:52,697 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:52,698 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:52,699 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:52,702 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:52,703 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:52,703 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:52,703 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:52,705 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:52,705 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:52,715 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:52,715 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:52,716 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:52,716 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:52,716 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:52,717 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:52,717 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:52,717 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:52,717 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:52,718 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:52,718 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:52,719 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:52,719 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 09:00:52,722 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:52,722 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:52,726 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 09:00:52,726 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:52,768 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:52,768 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:52,769 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:52,769 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:52,769 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:52,770 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:52,770 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:52,770 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:52,770 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:52,771 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:52,778 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:52,778 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:52,778 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:52,779 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:52,779 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:52,780 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:52,780 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:52,786 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:52,787 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:52,787 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:52,788 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:52,788 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:52,788 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:52,788 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:52,788 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:52,789 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:52,789 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:52,790 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:52,790 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:52,791 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:52,791 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:52,791 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:52,795 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:52,796 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:52,806 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:52,807 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:52,807 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:52,807 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:52,808 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:52,808 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:52,809 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:52,809 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:52,819 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:52,822 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:52,823 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:52,823 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:52,823 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:52,824 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:52,825 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:52,825 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:52,827 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:52,829 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:52,829 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:52,830 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:52,830 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:52,830 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:52,832 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:52,833 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:52,880 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:52,896 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 09:00:52,897 INFO L444 ModelExtractionUtils]: 18 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:00:52,899 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:52,905 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:00:52,905 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:52,906 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-10-22 09:00:52,927 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-10-22 09:00:52,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:52,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:52,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:52,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:52,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:00:52,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:53,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:53,023 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:00:53,025 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states. Second operand 3 states. [2019-10-22 09:00:53,087 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states.. Second operand 3 states. Result 60 states and 91 transitions. Complement of second has 7 states. [2019-10-22 09:00:53,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 09:00:53,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:00:53,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2019-10-22 09:00:53,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 5 letters. Loop has 2 letters. [2019-10-22 09:00:53,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:53,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 7 letters. Loop has 2 letters. [2019-10-22 09:00:53,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:53,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 5 letters. Loop has 4 letters. [2019-10-22 09:00:53,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:53,098 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 91 transitions. [2019-10-22 09:00:53,101 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 09:00:53,108 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 18 states and 25 transitions. [2019-10-22 09:00:53,109 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-10-22 09:00:53,110 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-10-22 09:00:53,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-10-22 09:00:53,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:53,111 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-10-22 09:00:53,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-10-22 09:00:53,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-22 09:00:53,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-22 09:00:53,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-10-22 09:00:53,141 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-10-22 09:00:53,141 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-10-22 09:00:53,141 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:00:53,141 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-10-22 09:00:53,142 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 09:00:53,142 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:53,142 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:53,142 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:53,143 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:00:53,143 INFO L791 eck$LassoCheckResult]: Stem: 170#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 166#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~nondet18, main_#t~post17, main_~i~0, main_#t~nondet20, main_#t~post19, main_~i~1, main_#t~nondet21, main_#t~ret22, 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~nondet13;havoc main_#t~nondet13;main_~length2~0 := main_#t~nondet14;havoc main_#t~nondet14; 167#L532 assume !(main_~length1~0 < 1); 168#L532-2 assume !(main_~length2~0 < 1); 162#L535-1 call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;call main_#t~malloc16.base, main_#t~malloc16.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc16.base, main_#t~malloc16.offset;main_~i~0 := 0; 163#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 158#L541-4 main_~i~1 := 0; 159#L546-3 [2019-10-22 09:00:53,143 INFO L793 eck$LassoCheckResult]: Loop: 159#L546-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet20, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 164#L546-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 159#L546-3 [2019-10-22 09:00:53,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:53,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2019-10-22 09:00:53,146 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:53,146 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230976138] [2019-10-22 09:00:53,146 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:53,146 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:53,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:53,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:53,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:53,177 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:53,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:53,178 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2019-10-22 09:00:53,178 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:53,178 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099077225] [2019-10-22 09:00:53,178 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:53,179 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:53,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:53,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:53,199 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:53,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:53,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2019-10-22 09:00:53,200 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:53,200 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878351921] [2019-10-22 09:00:53,201 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:53,201 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:53,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:53,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:53,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:53,242 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:53,407 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:53,407 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:53,407 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:53,407 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:53,407 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:53,407 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:53,407 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:53,407 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:53,408 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncmp-alloca-1.i_Iteration2_Lasso [2019-10-22 09:00:53,408 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:53,408 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:53,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:53,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:53,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:53,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:53,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:53,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-10-22 09:00:53,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:53,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:53,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:53,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:53,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:53,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-10-22 09:00:53,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:53,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:53,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:53,884 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-10-22 09:00:53,919 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:53,919 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:53,919 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:53,920 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:53,920 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:53,920 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:53,921 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:53,921 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:53,921 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:53,921 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:53,922 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:53,922 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:53,922 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:53,923 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:53,923 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:53,923 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:53,923 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:53,923 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:53,923 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:53,924 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:53,924 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:53,925 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:53,925 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:53,925 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:53,925 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:53,925 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:53,926 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:53,926 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:53,926 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:53,926 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:53,927 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:53,927 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:53,927 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:53,928 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:53,929 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:53,929 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:53,932 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:53,933 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:53,933 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:53,933 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:53,934 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:53,934 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:53,934 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:53,934 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:53,934 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:53,935 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:53,935 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:53,936 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:53,936 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:53,936 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:53,936 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:53,937 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:53,937 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:53,939 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:53,940 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:53,940 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:53,941 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:53,941 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:53,941 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:53,941 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:53,942 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:53,943 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:53,944 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:53,944 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:53,944 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:53,944 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:53,945 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:53,945 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:53,945 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:53,945 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:53,946 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:53,946 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:53,946 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:53,947 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:53,947 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:53,947 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:53,948 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:53,949 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:53,954 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:53,954 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:53,955 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:53,955 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:53,955 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:53,955 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:53,957 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:53,957 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:53,990 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:53,999 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 09:00:54,007 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:00:54,008 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:54,009 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:00:54,009 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:54,009 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-10-22 09:00:54,031 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-10-22 09:00:54,032 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 09:00:54,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:54,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:54,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:54,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:54,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:54,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:00:54,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:54,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:54,077 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:00:54,077 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-10-22 09:00:54,113 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 27 states and 40 transitions. Complement of second has 6 states. [2019-10-22 09:00:54,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 09:00:54,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:00:54,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2019-10-22 09:00:54,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 7 letters. Loop has 2 letters. [2019-10-22 09:00:54,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:54,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 9 letters. Loop has 2 letters. [2019-10-22 09:00:54,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:54,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 7 letters. Loop has 4 letters. [2019-10-22 09:00:54,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:54,116 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 40 transitions. [2019-10-22 09:00:54,117 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 09:00:54,117 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 19 states and 27 transitions. [2019-10-22 09:00:54,117 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-10-22 09:00:54,118 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-10-22 09:00:54,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 27 transitions. [2019-10-22 09:00:54,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:54,118 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2019-10-22 09:00:54,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 27 transitions. [2019-10-22 09:00:54,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-10-22 09:00:54,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-22 09:00:54,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2019-10-22 09:00:54,122 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2019-10-22 09:00:54,122 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2019-10-22 09:00:54,122 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 09:00:54,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 27 transitions. [2019-10-22 09:00:54,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 09:00:54,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:54,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:54,126 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:54,126 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 09:00:54,126 INFO L791 eck$LassoCheckResult]: Stem: 290#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 286#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~nondet18, main_#t~post17, main_~i~0, main_#t~nondet20, main_#t~post19, main_~i~1, main_#t~nondet21, main_#t~ret22, 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~nondet13;havoc main_#t~nondet13;main_~length2~0 := main_#t~nondet14;havoc main_#t~nondet14; 287#L532 assume !(main_~length1~0 < 1); 288#L532-2 assume !(main_~length2~0 < 1); 281#L535-1 call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;call main_#t~malloc16.base, main_#t~malloc16.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc16.base, main_#t~malloc16.offset;main_~i~0 := 0; 282#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 277#L541-4 main_~i~1 := 0; 278#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 285#L546-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);cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_#t~nondet21;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~short7, cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset, cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset, cstrncmp_#t~post2, cstrncmp_#t~mem3, cstrncmp_#t~mem4, cstrncmp_#t~short5, cstrncmp_#t~mem10, cstrncmp_#t~mem11, cstrncmp_#t~ite12, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n, cstrncmp_~uc1~0, cstrncmp_~uc2~0;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n;havoc cstrncmp_~uc1~0;havoc cstrncmp_~uc2~0; 289#L517 assume !(0 == cstrncmp_~n); 279#L519-5 [2019-10-22 09:00:54,126 INFO L793 eck$LassoCheckResult]: Loop: 279#L519-5 cstrncmp_#t~post2 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post2 - 1;cstrncmp_#t~short5 := cstrncmp_#t~post2 > 0; 280#L519-1 assume cstrncmp_#t~short5;call cstrncmp_#t~mem3 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);call cstrncmp_#t~mem4 := read~int(cstrncmp_~s2.base, cstrncmp_~s2.offset, 1);cstrncmp_#t~short5 := cstrncmp_#t~mem3 == cstrncmp_#t~mem4; 275#L519-3 assume !!cstrncmp_#t~short5;havoc cstrncmp_#t~mem3;havoc cstrncmp_#t~short5;havoc cstrncmp_#t~post2;havoc cstrncmp_#t~mem4;cstrncmp_#t~short7 := 0 == cstrncmp_~n; 276#L520 assume cstrncmp_#t~short7; 291#L520-2 assume !cstrncmp_#t~short7;havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~short7;cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post8.base, 1 + cstrncmp_#t~post8.offset;havoc cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset;cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post9.base, 1 + cstrncmp_#t~post9.offset;havoc cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset; 279#L519-5 [2019-10-22 09:00:54,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:54,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1595220890, now seen corresponding path program 1 times [2019-10-22 09:00:54,127 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:54,127 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581079522] [2019-10-22 09:00:54,127 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:54,127 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:54,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:54,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:54,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:54,162 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:54,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:54,164 INFO L82 PathProgramCache]: Analyzing trace with hash 79307716, now seen corresponding path program 1 times [2019-10-22 09:00:54,164 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:54,164 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468234955] [2019-10-22 09:00:54,164 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:54,164 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:54,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:54,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:54,199 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468234955] [2019-10-22 09:00:54,200 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:54,200 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:00:54,200 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961148771] [2019-10-22 09:00:54,202 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:54,202 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:54,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:54,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:54,206 INFO L87 Difference]: Start difference. First operand 19 states and 27 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-10-22 09:00:54,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:54,219 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2019-10-22 09:00:54,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:54,219 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 27 transitions. [2019-10-22 09:00:54,220 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 09:00:54,220 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 19 states and 26 transitions. [2019-10-22 09:00:54,221 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-10-22 09:00:54,221 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-10-22 09:00:54,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2019-10-22 09:00:54,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:54,221 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-10-22 09:00:54,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2019-10-22 09:00:54,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-10-22 09:00:54,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-22 09:00:54,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2019-10-22 09:00:54,222 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-10-22 09:00:54,222 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-10-22 09:00:54,223 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 09:00:54,223 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2019-10-22 09:00:54,223 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 09:00:54,223 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:54,223 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:54,225 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:54,225 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 09:00:54,225 INFO L791 eck$LassoCheckResult]: Stem: 335#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 331#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~nondet18, main_#t~post17, main_~i~0, main_#t~nondet20, main_#t~post19, main_~i~1, main_#t~nondet21, main_#t~ret22, 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~nondet13;havoc main_#t~nondet13;main_~length2~0 := main_#t~nondet14;havoc main_#t~nondet14; 332#L532 assume !(main_~length1~0 < 1); 333#L532-2 assume !(main_~length2~0 < 1); 326#L535-1 call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;call main_#t~malloc16.base, main_#t~malloc16.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc16.base, main_#t~malloc16.offset;main_~i~0 := 0; 327#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 322#L541-4 main_~i~1 := 0; 323#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 330#L546-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);cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_#t~nondet21;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~short7, cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset, cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset, cstrncmp_#t~post2, cstrncmp_#t~mem3, cstrncmp_#t~mem4, cstrncmp_#t~short5, cstrncmp_#t~mem10, cstrncmp_#t~mem11, cstrncmp_#t~ite12, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n, cstrncmp_~uc1~0, cstrncmp_~uc2~0;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n;havoc cstrncmp_~uc1~0;havoc cstrncmp_~uc2~0; 334#L517 assume !(0 == cstrncmp_~n); 324#L519-5 [2019-10-22 09:00:54,226 INFO L793 eck$LassoCheckResult]: Loop: 324#L519-5 cstrncmp_#t~post2 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post2 - 1;cstrncmp_#t~short5 := cstrncmp_#t~post2 > 0; 325#L519-1 assume cstrncmp_#t~short5;call cstrncmp_#t~mem3 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);call cstrncmp_#t~mem4 := read~int(cstrncmp_~s2.base, cstrncmp_~s2.offset, 1);cstrncmp_#t~short5 := cstrncmp_#t~mem3 == cstrncmp_#t~mem4; 320#L519-3 assume !!cstrncmp_#t~short5;havoc cstrncmp_#t~mem3;havoc cstrncmp_#t~short5;havoc cstrncmp_#t~post2;havoc cstrncmp_#t~mem4;cstrncmp_#t~short7 := 0 == cstrncmp_~n; 321#L520 assume !cstrncmp_#t~short7;call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~short7 := 0 == cstrncmp_#t~mem6; 336#L520-2 assume !cstrncmp_#t~short7;havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~short7;cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post8.base, 1 + cstrncmp_#t~post8.offset;havoc cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset;cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post9.base, 1 + cstrncmp_#t~post9.offset;havoc cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset; 324#L519-5 [2019-10-22 09:00:54,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:54,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1595220890, now seen corresponding path program 2 times [2019-10-22 09:00:54,226 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:54,226 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372624873] [2019-10-22 09:00:54,226 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:54,226 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:54,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:54,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:54,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:54,250 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:54,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:54,251 INFO L82 PathProgramCache]: Analyzing trace with hash 79307778, now seen corresponding path program 1 times [2019-10-22 09:00:54,251 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:54,251 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71987167] [2019-10-22 09:00:54,251 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:54,251 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:54,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:54,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:54,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:54,273 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:54,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:54,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1988601847, now seen corresponding path program 1 times [2019-10-22 09:00:54,273 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:54,273 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137688734] [2019-10-22 09:00:54,273 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:54,274 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:54,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:54,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:54,413 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137688734] [2019-10-22 09:00:54,413 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:54,413 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:00:54,414 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552941267] [2019-10-22 09:00:54,556 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2019-10-22 09:00:54,608 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:54,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 09:00:54,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:00:54,608 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand 7 states. [2019-10-22 09:00:54,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:54,701 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2019-10-22 09:00:54,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 09:00:54,702 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2019-10-22 09:00:54,703 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 09:00:54,703 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 20 states and 26 transitions. [2019-10-22 09:00:54,703 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-10-22 09:00:54,704 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-10-22 09:00:54,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2019-10-22 09:00:54,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:54,704 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-10-22 09:00:54,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2019-10-22 09:00:54,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-10-22 09:00:54,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-22 09:00:54,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-10-22 09:00:54,706 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-10-22 09:00:54,706 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-10-22 09:00:54,706 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 09:00:54,706 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2019-10-22 09:00:54,706 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 09:00:54,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:54,706 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:54,707 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:54,707 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 09:00:54,707 INFO L791 eck$LassoCheckResult]: Stem: 401#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 397#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~nondet18, main_#t~post17, main_~i~0, main_#t~nondet20, main_#t~post19, main_~i~1, main_#t~nondet21, main_#t~ret22, 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~nondet13;havoc main_#t~nondet13;main_~length2~0 := main_#t~nondet14;havoc main_#t~nondet14; 398#L532 assume !(main_~length1~0 < 1); 399#L532-2 assume !(main_~length2~0 < 1); 392#L535-1 call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;call main_#t~malloc16.base, main_#t~malloc16.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc16.base, main_#t~malloc16.offset;main_~i~0 := 0; 393#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet18, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet18; 403#L541-2 main_#t~post17 := main_~i~0;main_~i~0 := 1 + main_#t~post17;havoc main_#t~post17; 404#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 388#L541-4 main_~i~1 := 0; 389#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 396#L546-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);cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_#t~nondet21;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~short7, cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset, cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset, cstrncmp_#t~post2, cstrncmp_#t~mem3, cstrncmp_#t~mem4, cstrncmp_#t~short5, cstrncmp_#t~mem10, cstrncmp_#t~mem11, cstrncmp_#t~ite12, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n, cstrncmp_~uc1~0, cstrncmp_~uc2~0;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n;havoc cstrncmp_~uc1~0;havoc cstrncmp_~uc2~0; 400#L517 assume !(0 == cstrncmp_~n); 390#L519-5 [2019-10-22 09:00:54,707 INFO L793 eck$LassoCheckResult]: Loop: 390#L519-5 cstrncmp_#t~post2 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post2 - 1;cstrncmp_#t~short5 := cstrncmp_#t~post2 > 0; 391#L519-1 assume cstrncmp_#t~short5;call cstrncmp_#t~mem3 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);call cstrncmp_#t~mem4 := read~int(cstrncmp_~s2.base, cstrncmp_~s2.offset, 1);cstrncmp_#t~short5 := cstrncmp_#t~mem3 == cstrncmp_#t~mem4; 386#L519-3 assume !!cstrncmp_#t~short5;havoc cstrncmp_#t~mem3;havoc cstrncmp_#t~short5;havoc cstrncmp_#t~post2;havoc cstrncmp_#t~mem4;cstrncmp_#t~short7 := 0 == cstrncmp_~n; 387#L520 assume !cstrncmp_#t~short7;call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~short7 := 0 == cstrncmp_#t~mem6; 402#L520-2 assume !cstrncmp_#t~short7;havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~short7;cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post8.base, 1 + cstrncmp_#t~post8.offset;havoc cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset;cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post9.base, 1 + cstrncmp_#t~post9.offset;havoc cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset; 390#L519-5 [2019-10-22 09:00:54,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:54,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1351083896, now seen corresponding path program 1 times [2019-10-22 09:00:54,710 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:54,710 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477665633] [2019-10-22 09:00:54,711 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:54,711 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:54,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:54,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:54,733 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:54,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:54,736 INFO L82 PathProgramCache]: Analyzing trace with hash 79307778, now seen corresponding path program 2 times [2019-10-22 09:00:54,736 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:54,736 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017760641] [2019-10-22 09:00:54,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:54,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:54,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:54,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:54,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:54,748 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:54,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:54,749 INFO L82 PathProgramCache]: Analyzing trace with hash -350531861, now seen corresponding path program 1 times [2019-10-22 09:00:54,749 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:54,749 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601743412] [2019-10-22 09:00:54,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:54,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:54,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:54,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:54,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 09:00:54,868 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601743412] [2019-10-22 09:00:54,869 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:54,869 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 09:00:54,869 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334004713] [2019-10-22 09:00:55,001 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2019-10-22 09:00:55,035 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:55,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 09:00:55,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-22 09:00:55,035 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. cyclomatic complexity: 9 Second operand 10 states. [2019-10-22 09:00:55,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:55,209 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2019-10-22 09:00:55,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-22 09:00:55,210 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. [2019-10-22 09:00:55,210 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 09:00:55,211 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 20 states and 24 transitions. [2019-10-22 09:00:55,211 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-10-22 09:00:55,211 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-10-22 09:00:55,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2019-10-22 09:00:55,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:55,211 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-10-22 09:00:55,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2019-10-22 09:00:55,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-10-22 09:00:55,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-22 09:00:55,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-10-22 09:00:55,213 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-10-22 09:00:55,213 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-10-22 09:00:55,213 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 09:00:55,213 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2019-10-22 09:00:55,213 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 09:00:55,213 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:55,213 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:55,214 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:55,214 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 09:00:55,214 INFO L791 eck$LassoCheckResult]: Stem: 481#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 477#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~nondet18, main_#t~post17, main_~i~0, main_#t~nondet20, main_#t~post19, main_~i~1, main_#t~nondet21, main_#t~ret22, 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~nondet13;havoc main_#t~nondet13;main_~length2~0 := main_#t~nondet14;havoc main_#t~nondet14; 478#L532 assume !(main_~length1~0 < 1); 479#L532-2 assume !(main_~length2~0 < 1); 472#L535-1 call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;call main_#t~malloc16.base, main_#t~malloc16.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc16.base, main_#t~malloc16.offset;main_~i~0 := 0; 473#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet18, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet18; 483#L541-2 main_#t~post17 := main_~i~0;main_~i~0 := 1 + main_#t~post17;havoc main_#t~post17; 484#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 468#L541-4 main_~i~1 := 0; 469#L546-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet20, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 474#L546-2 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 475#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 476#L546-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);cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_#t~nondet21;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~short7, cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset, cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset, cstrncmp_#t~post2, cstrncmp_#t~mem3, cstrncmp_#t~mem4, cstrncmp_#t~short5, cstrncmp_#t~mem10, cstrncmp_#t~mem11, cstrncmp_#t~ite12, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n, cstrncmp_~uc1~0, cstrncmp_~uc2~0;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n;havoc cstrncmp_~uc1~0;havoc cstrncmp_~uc2~0; 480#L517 assume !(0 == cstrncmp_~n); 470#L519-5 [2019-10-22 09:00:55,214 INFO L793 eck$LassoCheckResult]: Loop: 470#L519-5 cstrncmp_#t~post2 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post2 - 1;cstrncmp_#t~short5 := cstrncmp_#t~post2 > 0; 471#L519-1 assume cstrncmp_#t~short5;call cstrncmp_#t~mem3 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);call cstrncmp_#t~mem4 := read~int(cstrncmp_~s2.base, cstrncmp_~s2.offset, 1);cstrncmp_#t~short5 := cstrncmp_#t~mem3 == cstrncmp_#t~mem4; 466#L519-3 assume !!cstrncmp_#t~short5;havoc cstrncmp_#t~mem3;havoc cstrncmp_#t~short5;havoc cstrncmp_#t~post2;havoc cstrncmp_#t~mem4;cstrncmp_#t~short7 := 0 == cstrncmp_~n; 467#L520 assume !cstrncmp_#t~short7;call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~short7 := 0 == cstrncmp_#t~mem6; 482#L520-2 assume !cstrncmp_#t~short7;havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~short7;cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post8.base, 1 + cstrncmp_#t~post8.offset;havoc cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset;cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post9.base, 1 + cstrncmp_#t~post9.offset;havoc cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset; 470#L519-5 [2019-10-22 09:00:55,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:55,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1313217430, now seen corresponding path program 1 times [2019-10-22 09:00:55,215 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:55,215 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198061275] [2019-10-22 09:00:55,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:55,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:55,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:55,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:55,262 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:55,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:55,262 INFO L82 PathProgramCache]: Analyzing trace with hash 79307778, now seen corresponding path program 3 times [2019-10-22 09:00:55,263 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:55,263 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182899877] [2019-10-22 09:00:55,263 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:55,263 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:55,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:55,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:55,274 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:55,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:55,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1018233459, now seen corresponding path program 1 times [2019-10-22 09:00:55,278 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:55,279 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964554977] [2019-10-22 09:00:55,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:55,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:55,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:55,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:55,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:55,316 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:55,421 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2019-10-22 09:00:55,831 WARN L191 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 121 [2019-10-22 09:00:56,007 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-10-22 09:00:56,010 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:56,010 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:56,010 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:56,010 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:56,010 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:56,010 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:56,010 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:56,010 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:56,011 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncmp-alloca-1.i_Iteration6_Lasso [2019-10-22 09:00:56,011 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:56,011 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:56,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:56,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:56,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:56,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:56,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:56,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:56,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:56,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:56,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:56,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:56,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:56,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:56,446 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 90 [2019-10-22 09:00:56,575 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-10-22 09:00:56,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:56,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:56,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:56,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:56,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:56,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:56,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:56,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:56,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:56,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:56,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:56,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:56,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:56,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:56,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:56,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:56,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:56,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:56,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:56,758 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-10-22 09:00:57,220 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-10-22 09:00:57,301 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:57,301 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:57,301 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:57,302 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:57,302 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:57,302 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:57,303 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:57,303 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:57,303 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:57,303 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:57,304 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:57,305 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:57,305 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:57,305 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:57,305 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:57,305 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:57,305 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:57,306 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:57,306 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:57,307 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:57,307 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:57,308 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:57,308 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:57,308 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:57,308 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:57,308 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:57,308 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:57,308 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:57,309 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:57,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:57,310 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:57,310 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:57,310 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:57,310 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:57,310 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:57,310 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:57,310 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:57,311 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:57,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:57,312 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:57,312 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:57,312 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:57,312 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:57,313 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:57,313 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:57,314 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:57,315 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:57,315 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:57,316 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:57,316 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:57,316 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:57,316 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:57,316 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:57,316 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:57,317 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:57,317 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:57,317 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:57,317 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:57,318 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:57,318 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:57,318 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:57,318 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:57,318 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:57,318 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:57,319 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:57,319 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:57,319 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:57,320 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:57,320 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:57,320 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:57,320 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:57,320 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:57,321 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:57,321 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:57,322 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:57,322 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:57,322 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:57,322 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:57,322 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:57,322 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:57,323 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:57,323 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:57,324 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:57,324 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:57,324 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:57,324 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:57,324 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:57,325 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:57,325 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:57,326 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:57,327 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:57,327 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:57,327 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:57,327 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:57,328 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:57,328 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:57,328 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:57,328 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:57,329 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:57,329 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:57,329 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:57,329 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:57,329 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:57,330 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:57,330 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:57,330 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:57,335 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:57,335 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:57,335 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:57,336 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:57,336 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:57,336 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:57,336 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:57,336 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:57,338 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:57,339 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:57,339 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:57,339 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:57,339 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:57,339 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:57,342 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:57,343 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:57,409 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:57,522 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-10-22 09:00:57,523 INFO L444 ModelExtractionUtils]: 40 out of 52 variables were initially zero. Simplification set additionally 9 variables to zero. [2019-10-22 09:00:57,523 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:57,524 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:00:57,525 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:57,525 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrncmp_~s1.base)_1, ULTIMATE.start_cstrncmp_~s1.offset) = 1*v_rep(select #length ULTIMATE.start_cstrncmp_~s1.base)_1 - 1*ULTIMATE.start_cstrncmp_~s1.offset Supporting invariants [] [2019-10-22 09:00:57,601 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2019-10-22 09:00:57,602 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 09:00:57,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:57,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:57,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:57,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:57,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:00:57,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:57,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:57,647 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:00:57,647 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 23 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-10-22 09:00:57,657 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 23 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 24 states and 29 transitions. Complement of second has 6 states. [2019-10-22 09:00:57,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 09:00:57,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 09:00:57,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2019-10-22 09:00:57,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 14 letters. Loop has 5 letters. [2019-10-22 09:00:57,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:57,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 19 letters. Loop has 5 letters. [2019-10-22 09:00:57,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:57,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 14 letters. Loop has 10 letters. [2019-10-22 09:00:57,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:57,659 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2019-10-22 09:00:57,659 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:00:57,659 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2019-10-22 09:00:57,659 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 09:00:57,659 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 09:00:57,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 09:00:57,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:57,660 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:57,660 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:57,660 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:57,660 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 09:00:57,660 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:00:57,660 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:00:57,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 09:00:57,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:00:57 BoogieIcfgContainer [2019-10-22 09:00:57,666 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:00:57,666 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:00:57,666 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:00:57,666 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:00:57,667 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:51" (3/4) ... [2019-10-22 09:00:57,673 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 09:00:57,673 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:00:57,675 INFO L168 Benchmark]: Toolchain (without parser) took 7260.87 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 270.0 MB). Free memory was 941.0 MB in the beginning and 912.6 MB in the end (delta: 28.4 MB). Peak memory consumption was 298.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:57,675 INFO L168 Benchmark]: CDTParser took 0.18 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-10-22 09:00:57,676 INFO L168 Benchmark]: CACSL2BoogieTranslator took 577.80 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -143.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:57,677 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:57,678 INFO L168 Benchmark]: Boogie Preprocessor took 41.18 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:57,678 INFO L168 Benchmark]: RCFGBuilder took 367.97 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 29.9 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:57,679 INFO L168 Benchmark]: BuchiAutomizer took 6219.24 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 166.2 MB). Free memory was 1.0 GB in the beginning and 912.6 MB in the end (delta: 135.2 MB). Peak memory consumption was 301.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:57,679 INFO L168 Benchmark]: Witness Printer took 7.15 ms. Allocated memory is still 1.3 GB. Free memory is still 912.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:57,681 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.18 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 577.80 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -143.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.18 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 367.97 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 29.9 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6219.24 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 166.2 MB). Free memory was 1.0 GB in the beginning and 912.6 MB in the end (delta: 135.2 MB). Peak memory consumption was 301.4 MB. Max. memory is 11.5 GB. * Witness Printer took 7.15 ms. Allocated memory is still 1.3 GB. Free memory is still 912.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function length1 + -1 * i and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[nondetString2] + -1 * i + -1 * nondetString2 and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[s1] + -1 * s1 and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.1s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 5.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 19 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 115 SDtfs, 188 SDslu, 176 SDs, 0 SdLazy, 127 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital213 mio100 ax110 hnf98 lsp82 ukn75 mio100 lsp48 div100 bol100 ite100 ukn100 eq176 hnf90 smp99 dnf152 smp95 tf100 neg94 sie122 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 49ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...