./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/run_dir_129c8422-04ff-478e-8a92-20ca67e8db90/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_129c8422-04ff-478e-8a92-20ca67e8db90/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_129c8422-04ff-478e-8a92-20ca67e8db90/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_129c8422-04ff-478e-8a92-20ca67e8db90/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/cstrncmp-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_129c8422-04ff-478e-8a92-20ca67e8db90/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_129c8422-04ff-478e-8a92-20ca67e8db90/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-11-15 20:11:50,573 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:11:50,575 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:11:50,584 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:11:50,584 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:11:50,585 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:11:50,586 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:11:50,588 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:11:50,590 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:11:50,591 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:11:50,591 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:11:50,592 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:11:50,593 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:11:50,594 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:11:50,594 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:11:50,595 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:11:50,596 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:11:50,597 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:11:50,599 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:11:50,601 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:11:50,603 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:11:50,604 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:11:50,605 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:11:50,606 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:11:50,609 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:11:50,609 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:11:50,609 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:11:50,610 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:11:50,610 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:11:50,611 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:11:50,612 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:11:50,612 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:11:50,613 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:11:50,614 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:11:50,615 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:11:50,615 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:11:50,616 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:11:50,616 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:11:50,616 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:11:50,617 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:11:50,618 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:11:50,619 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_129c8422-04ff-478e-8a92-20ca67e8db90/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 20:11:50,639 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:11:50,640 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:11:50,641 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:11:50,641 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:11:50,641 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:11:50,641 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 20:11:50,641 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 20:11:50,642 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 20:11:50,642 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 20:11:50,642 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 20:11:50,642 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 20:11:50,643 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:11:50,643 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:11:50,643 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 20:11:50,645 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:11:50,645 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:11:50,645 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:11:50,646 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 20:11:50,646 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 20:11:50,646 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 20:11:50,646 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:11:50,646 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:11:50,647 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 20:11:50,647 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:11:50,647 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 20:11:50,648 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:11:50,648 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:11:50,648 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 20:11:50,649 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:11:50,649 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:11:50,649 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 20:11:50,650 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 20:11:50,650 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_129c8422-04ff-478e-8a92-20ca67e8db90/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-11-15 20:11:50,692 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:11:50,701 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:11:50,704 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:11:50,706 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:11:50,706 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:11:50,707 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_129c8422-04ff-478e-8a92-20ca67e8db90/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrncmp-alloca-1.i [2019-11-15 20:11:50,757 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_129c8422-04ff-478e-8a92-20ca67e8db90/bin/uautomizer/data/06efaae1b/9f9e4c5aacdc4912acb1330ca8e26c83/FLAG7e9e0bdc0 [2019-11-15 20:11:51,273 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:11:51,274 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_129c8422-04ff-478e-8a92-20ca67e8db90/sv-benchmarks/c/array-memsafety/cstrncmp-alloca-1.i [2019-11-15 20:11:51,294 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_129c8422-04ff-478e-8a92-20ca67e8db90/bin/uautomizer/data/06efaae1b/9f9e4c5aacdc4912acb1330ca8e26c83/FLAG7e9e0bdc0 [2019-11-15 20:11:51,546 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_129c8422-04ff-478e-8a92-20ca67e8db90/bin/uautomizer/data/06efaae1b/9f9e4c5aacdc4912acb1330ca8e26c83 [2019-11-15 20:11:51,549 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:11:51,550 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:11:51,551 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:11:51,551 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:11:51,555 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:11:51,556 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:11:51" (1/1) ... [2019-11-15 20:11:51,558 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40b5808b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:11:51, skipping insertion in model container [2019-11-15 20:11:51,559 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:11:51" (1/1) ... [2019-11-15 20:11:51,566 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:11:51,599 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:11:52,001 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:11:52,009 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:11:52,067 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:11:52,113 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:11:52,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:11:52 WrapperNode [2019-11-15 20:11:52,114 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:11:52,115 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:11:52,115 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:11:52,115 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:11:52,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:11:52" (1/1) ... [2019-11-15 20:11:52,142 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:11:52" (1/1) ... [2019-11-15 20:11:52,165 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:11:52,165 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:11:52,165 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:11:52,165 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:11:52,174 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:11:52" (1/1) ... [2019-11-15 20:11:52,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:11:52" (1/1) ... [2019-11-15 20:11:52,177 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:11:52" (1/1) ... [2019-11-15 20:11:52,177 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:11:52" (1/1) ... [2019-11-15 20:11:52,183 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:11:52" (1/1) ... [2019-11-15 20:11:52,197 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:11:52" (1/1) ... [2019-11-15 20:11:52,199 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:11:52" (1/1) ... [2019-11-15 20:11:52,202 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:11:52,202 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:11:52,202 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:11:52,202 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:11:52,205 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:11:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_129c8422-04ff-478e-8a92-20ca67e8db90/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:11:52,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 20:11:52,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 20:11:52,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 20:11:52,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 20:11:52,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:11:52,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:11:52,592 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:11:52,593 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-15 20:11:52,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:11:52 BoogieIcfgContainer [2019-11-15 20:11:52,594 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:11:52,594 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 20:11:52,594 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 20:11:52,597 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 20:11:52,598 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:11:52,598 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 08:11:51" (1/3) ... [2019-11-15 20:11:52,599 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@f3877fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:11:52, skipping insertion in model container [2019-11-15 20:11:52,599 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:11:52,599 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:11:52" (2/3) ... [2019-11-15 20:11:52,599 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@f3877fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:11:52, skipping insertion in model container [2019-11-15 20:11:52,599 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:11:52,599 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:11:52" (3/3) ... [2019-11-15 20:11:52,601 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrncmp-alloca-1.i [2019-11-15 20:11:52,653 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 20:11:52,653 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 20:11:52,653 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 20:11:52,653 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:11:52,653 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:11:52,654 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 20:11:52,654 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:11:52,654 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 20:11:52,666 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-11-15 20:11:52,686 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-15 20:11:52,687 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:11:52,687 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:11:52,692 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 20:11:52,692 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 20:11:52,692 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 20:11:52,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-11-15 20:11:52,694 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-15 20:11:52,694 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:11:52,694 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:11:52,695 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 20:11:52,695 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 20:11:52,700 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-11-15 20:11:52,700 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-11-15 20:11:52,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:11:52,704 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-11-15 20:11:52,709 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:11:52,710 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725247389] [2019-11-15 20:11:52,710 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:52,710 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:52,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:11:52,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:11:52,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:11:52,818 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:11:52,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:11:52,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2019-11-15 20:11:52,819 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:11:52,820 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651509546] [2019-11-15 20:11:52,820 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:52,820 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:52,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:11:52,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:11:52,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:11:52,836 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:11:52,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:11:52,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2019-11-15 20:11:52,838 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:11:52,838 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077755251] [2019-11-15 20:11:52,838 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:52,838 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:52,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:11:52,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:11:52,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:11:52,883 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:11:53,077 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-15 20:11:53,169 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:11:53,171 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:11:53,171 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:11:53,171 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:11:53,171 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:11:53,172 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:11:53,172 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:11:53,172 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:11:53,172 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncmp-alloca-1.i_Iteration1_Lasso [2019-11-15 20:11:53,172 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:11:53,172 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:11:53,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:53,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:53,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:53,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:53,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:53,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:53,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:53,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:53,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:53,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:53,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:53,389 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-11-15 20:11: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-11-15 20:11: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-11-15 20:11:53,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:53,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:53,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:53,847 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 20:11:53,984 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:11:53,989 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:11:53,991 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:11:53,994 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:11:53,994 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:11:53,995 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:11:53,995 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:11:53,995 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:11:53,997 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:11:53,997 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:11:54,002 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:11:54,004 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:11:54,005 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:11:54,006 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:11:54,006 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:11:54,007 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:11:54,007 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:11:54,010 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:11:54,010 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:11:54,012 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:11:54,013 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:11:54,017 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:11:54,017 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:11:54,018 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:11:54,018 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:11:54,019 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:11:54,019 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:11:54,019 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:11:54,020 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:11:54,026 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:11:54,027 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:11:54,028 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:11:54,028 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:11:54,028 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:11:54,028 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:11:54,029 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:11:54,029 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:11:54,030 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:11:54,030 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:11:54,031 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:11:54,031 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:11:54,032 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:11:54,032 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:11:54,037 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:11:54,037 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:11:54,061 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:11:54,061 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:11:54,062 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:11:54,062 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:11:54,063 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:11:54,063 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:11:54,065 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:11:54,065 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:11:54,069 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:11:54,070 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:11:54,071 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:11:54,071 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:11:54,071 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:11:54,071 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:11:54,073 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:11:54,073 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:11:54,076 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:11:54,077 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:11:54,078 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:11:54,078 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:11:54,078 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:11:54,078 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:11:54,078 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:11:54,079 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:11:54,079 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:11:54,080 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:11:54,080 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:11:54,081 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:11:54,081 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:11:54,081 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:11:54,082 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:11:54,084 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:11:54,084 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:11:54,091 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:11:54,093 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:11:54,094 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:11:54,094 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:11:54,094 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:11:54,095 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:11:54,095 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:11:54,096 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:11:54,096 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:11:54,099 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:11:54,100 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:11:54,101 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:11:54,101 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 20:11:54,101 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:11:54,101 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:11:54,116 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 20:11:54,117 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:11:54,162 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:11:54,163 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:11:54,163 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:11:54,164 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:11:54,164 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:11:54,164 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:11:54,164 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:11:54,165 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:11:54,165 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:11:54,166 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:11:54,166 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:11:54,166 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:11:54,167 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:11:54,167 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:11:54,167 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:11:54,168 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:11:54,168 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:11:54,183 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:11:54,184 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:11:54,184 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:11:54,185 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:11:54,185 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:11:54,185 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:11:54,185 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:11:54,186 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:11:54,186 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:11:54,187 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:11:54,187 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:11:54,187 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:11:54,188 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:11:54,188 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:11:54,188 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:11:54,189 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:11:54,190 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:11:54,198 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:11:54,199 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:11:54,200 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:11:54,200 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:11:54,200 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:11:54,200 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:11:54,202 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:11:54,203 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:11:54,231 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:11:54,231 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:11:54,232 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:11:54,232 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:11:54,232 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:11:54,233 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:11:54,234 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:11:54,234 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:11:54,236 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:11:54,237 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:11:54,237 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:11:54,238 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:11:54,238 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:11:54,238 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:11:54,241 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:11:54,257 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:11:54,301 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:11:54,334 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 20:11:54,334 INFO L444 ModelExtractionUtils]: 18 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 20:11:54,337 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:11:54,345 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:11:54,345 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:11:54,346 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~length1~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-11-15 20:11:54,377 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-15 20:11:54,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:11:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:11:54,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:11:54,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:11:54,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:11:54,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:11:54,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:11:54,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:11:54,478 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 20:11:54,480 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states. Second operand 3 states. [2019-11-15 20:11:54,537 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-11-15 20:11:54,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 20:11:54,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:11:54,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2019-11-15 20:11:54,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-15 20:11:54,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:11:54,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-15 20:11:54,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:11:54,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-15 20:11:54,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:11:54,549 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 91 transitions. [2019-11-15 20:11:54,562 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 20:11:54,569 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 18 states and 25 transitions. [2019-11-15 20:11:54,570 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-15 20:11:54,571 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-15 20:11:54,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-11-15 20:11:54,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:11:54,572 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-15 20:11:54,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-11-15 20:11:54,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-15 20:11:54,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-15 20:11:54,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-11-15 20:11:54,595 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-15 20:11:54,595 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-15 20:11:54,595 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 20:11:54,595 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-11-15 20:11:54,596 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 20:11:54,596 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:11:54,596 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:11:54,597 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:11:54,597 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 20:11:54,597 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-11-15 20:11:54,597 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-11-15 20:11:54,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:11:54,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2019-11-15 20:11:54,598 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:11:54,598 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712923991] [2019-11-15 20:11:54,598 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:54,598 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:54,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:11:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:11:54,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:11:54,621 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:11:54,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:11:54,622 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2019-11-15 20:11:54,622 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:11:54,622 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052121573] [2019-11-15 20:11:54,622 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:54,623 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:54,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:11:54,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:11:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:11:54,633 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:11:54,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:11:54,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2019-11-15 20:11:54,633 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:11:54,634 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804076061] [2019-11-15 20:11:54,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:54,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:54,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:11:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:11:54,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:11:54,659 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:11:54,883 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:11:54,883 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:11:54,883 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:11:54,884 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:11:54,884 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:11:54,884 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:11:54,884 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:11:54,884 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:11:54,884 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncmp-alloca-1.i_Iteration2_Lasso [2019-11-15 20:11:54,884 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:11:54,884 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:11:54,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:54,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:54,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:54,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:55,036 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-11-15 20:11:55,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:55,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:55,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:55,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:55,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:55,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:55,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:55,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:55,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:55,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:55,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:55,471 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 20:11:55,529 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:11:55,529 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:11:55,530 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:11:55,531 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:11:55,531 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:11:55,531 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:11:55,531 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:11:55,531 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:11:55,531 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:11:55,531 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:11:55,532 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:11:55,532 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:11:55,533 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:11:55,533 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:11:55,533 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:11:55,539 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:11:55,539 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:11:55,539 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:11:55,539 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:11:55,540 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:11:55,549 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:11:55,550 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:11:55,550 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:11:55,551 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:11:55,551 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:11:55,551 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:11:55,551 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:11:55,551 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:11:55,552 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:11:55,552 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:11:55,553 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:11:55,553 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:11:55,553 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:11:55,553 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:11:55,555 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:11:55,555 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:11:55,559 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:11:55,571 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:11:55,572 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:11:55,572 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:11:55,572 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:11:55,573 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:11:55,573 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:11:55,573 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:11:55,573 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:11:55,575 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:11:55,575 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:11:55,575 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:11:55,575 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:11:55,576 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:11:55,576 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:11:55,577 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:11:55,577 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:11:55,579 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:11:55,580 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:11:55,580 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:11:55,584 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:11:55,585 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:11:55,585 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:11:55,586 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:11:55,586 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:11:55,588 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:11:55,588 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:11:55,588 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:11:55,588 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:11:55,589 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:11:55,589 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:11:55,589 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:11:55,589 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:11:55,589 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:11:55,590 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:11:55,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:11:55,591 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:11:55,591 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:11:55,591 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:11:55,591 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:11:55,593 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:11:55,593 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:11:55,604 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:11:55,606 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:11:55,607 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:11:55,608 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:11:55,608 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:11:55,608 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:11:55,611 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:11:55,616 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:11:55,662 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:11:55,677 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 20:11:55,681 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 20:11:55,682 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:11:55,687 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:11:55,687 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:11:55,687 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~nondetString2~0.offset, v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1) = -1*ULTIMATE.start_main_~i~1 - 1*ULTIMATE.start_main_~nondetString2~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1 Supporting invariants [] [2019-11-15 20:11:55,699 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-15 20:11:55,701 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 20:11:55,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:11:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:11:55,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:11:55,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:11:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:11:55,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:11:55,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:11:55,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:11:55,753 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 20:11:55,754 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-11-15 20:11:55,781 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-11-15 20:11:55,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 20:11:55,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:11:55,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2019-11-15 20:11:55,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-15 20:11:55,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:11:55,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 9 letters. Loop has 2 letters. [2019-11-15 20:11:55,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:11:55,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 7 letters. Loop has 4 letters. [2019-11-15 20:11:55,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:11:55,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 40 transitions. [2019-11-15 20:11:55,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 20:11:55,785 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 19 states and 27 transitions. [2019-11-15 20:11:55,785 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-15 20:11:55,786 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-15 20:11:55,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 27 transitions. [2019-11-15 20:11:55,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:11:55,786 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2019-11-15 20:11:55,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 27 transitions. [2019-11-15 20:11:55,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-11-15 20:11:55,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-15 20:11:55,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2019-11-15 20:11:55,788 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2019-11-15 20:11:55,788 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2019-11-15 20:11:55,788 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 20:11:55,788 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 27 transitions. [2019-11-15 20:11:55,789 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 20:11:55,789 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:11:55,789 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:11:55,789 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:11:55,789 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 20:11:55,790 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-11-15 20:11:55,790 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~short5;havoc cstrncmp_#t~post2;havoc cstrncmp_#t~mem3;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-11-15 20:11:55,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:11:55,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1595220890, now seen corresponding path program 1 times [2019-11-15 20:11:55,790 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:11:55,791 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893771257] [2019-11-15 20:11:55,791 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:55,791 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:55,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:11:55,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:11:55,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:11:55,819 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:11:55,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:11:55,827 INFO L82 PathProgramCache]: Analyzing trace with hash 79307716, now seen corresponding path program 1 times [2019-11-15 20:11:55,827 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:11:55,829 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778012918] [2019-11-15 20:11:55,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:55,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:55,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:11:55,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:11:55,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:11:55,878 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778012918] [2019-11-15 20:11:55,879 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:11:55,879 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:11:55,879 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426680480] [2019-11-15 20:11:55,881 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:11:55,881 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:11:55,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:11:55,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:11:55,884 INFO L87 Difference]: Start difference. First operand 19 states and 27 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-15 20:11:55,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:11:55,901 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2019-11-15 20:11:55,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:11:55,902 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 27 transitions. [2019-11-15 20:11:55,903 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 20:11:55,903 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 19 states and 26 transitions. [2019-11-15 20:11:55,903 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-15 20:11:55,903 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-15 20:11:55,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2019-11-15 20:11:55,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:11:55,904 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-11-15 20:11:55,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2019-11-15 20:11:55,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-11-15 20:11:55,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-15 20:11:55,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2019-11-15 20:11:55,906 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-11-15 20:11:55,906 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-11-15 20:11:55,906 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 20:11:55,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2019-11-15 20:11:55,906 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 20:11:55,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:11:55,906 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:11:55,907 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:11:55,907 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 20:11:55,907 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-11-15 20:11:55,907 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~short5;havoc cstrncmp_#t~post2;havoc cstrncmp_#t~mem3;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-11-15 20:11:55,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:11:55,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1595220890, now seen corresponding path program 2 times [2019-11-15 20:11:55,907 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:11:55,908 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016800140] [2019-11-15 20:11:55,908 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:55,908 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:55,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:11:55,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:11:55,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:11:55,961 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:11:55,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:11:55,964 INFO L82 PathProgramCache]: Analyzing trace with hash 79307778, now seen corresponding path program 1 times [2019-11-15 20:11:55,964 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:11:55,964 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695776510] [2019-11-15 20:11:55,964 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:55,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:55,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:11:55,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:11:55,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:11:55,989 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:11:55,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:11:55,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1988601847, now seen corresponding path program 1 times [2019-11-15 20:11:55,990 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:11:55,990 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119846998] [2019-11-15 20:11:55,991 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:55,991 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:55,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:11:56,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:11:56,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:11:56,161 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119846998] [2019-11-15 20:11:56,162 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:11:56,162 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:11:56,162 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785121505] [2019-11-15 20:11:56,355 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2019-11-15 20:11:56,414 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:11:56,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:11:56,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:11:56,415 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand 7 states. [2019-11-15 20:11:56,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:11:56,515 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2019-11-15 20:11:56,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:11:56,515 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2019-11-15 20:11:56,516 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 20:11:56,517 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 20 states and 26 transitions. [2019-11-15 20:11:56,517 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-15 20:11:56,517 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-15 20:11:56,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2019-11-15 20:11:56,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:11:56,518 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-11-15 20:11:56,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2019-11-15 20:11:56,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-11-15 20:11:56,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-15 20:11:56,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-11-15 20:11:56,519 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-11-15 20:11:56,520 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-11-15 20:11:56,520 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 20:11:56,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2019-11-15 20:11:56,520 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 20:11:56,520 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:11:56,520 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:11:56,521 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:11:56,521 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 20:11:56,521 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-11-15 20:11:56,521 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~short5;havoc cstrncmp_#t~post2;havoc cstrncmp_#t~mem3;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-11-15 20:11:56,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:11:56,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1351083896, now seen corresponding path program 1 times [2019-11-15 20:11:56,522 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:11:56,522 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978193768] [2019-11-15 20:11:56,522 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:56,522 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:56,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:11:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:11:56,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:11:56,550 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:11:56,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:11:56,551 INFO L82 PathProgramCache]: Analyzing trace with hash 79307778, now seen corresponding path program 2 times [2019-11-15 20:11:56,551 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:11:56,551 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400629228] [2019-11-15 20:11:56,552 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:56,552 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:56,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:11:56,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:11:56,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:11:56,565 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:11:56,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:11:56,566 INFO L82 PathProgramCache]: Analyzing trace with hash -350531861, now seen corresponding path program 1 times [2019-11-15 20:11:56,566 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:11:56,566 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052113564] [2019-11-15 20:11:56,566 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:56,566 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:56,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:11:56,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:11:56,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 20:11:56,738 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052113564] [2019-11-15 20:11:56,739 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:11:56,739 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 20:11:56,739 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669255507] [2019-11-15 20:11:56,929 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2019-11-15 20:11:56,974 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:11:56,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 20:11:56,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:11:56,975 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. cyclomatic complexity: 9 Second operand 10 states. [2019-11-15 20:11:57,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:11:57,200 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2019-11-15 20:11:57,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 20:11:57,200 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. [2019-11-15 20:11:57,201 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 20:11:57,201 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 20 states and 24 transitions. [2019-11-15 20:11:57,202 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-15 20:11:57,202 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-15 20:11:57,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2019-11-15 20:11:57,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:11:57,202 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-11-15 20:11:57,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2019-11-15 20:11:57,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-11-15 20:11:57,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-15 20:11:57,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-11-15 20:11:57,204 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-11-15 20:11:57,204 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-11-15 20:11:57,204 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 20:11:57,204 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2019-11-15 20:11:57,204 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 20:11:57,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:11:57,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:11:57,205 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:11:57,205 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 20:11:57,205 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-11-15 20:11:57,205 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~short5;havoc cstrncmp_#t~post2;havoc cstrncmp_#t~mem3;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-11-15 20:11:57,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:11:57,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1313217430, now seen corresponding path program 1 times [2019-11-15 20:11:57,206 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:11:57,206 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070247435] [2019-11-15 20:11:57,206 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:57,206 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:57,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:11:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:11:57,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:11:57,253 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:11:57,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:11:57,255 INFO L82 PathProgramCache]: Analyzing trace with hash 79307778, now seen corresponding path program 3 times [2019-11-15 20:11:57,255 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:11:57,255 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656008960] [2019-11-15 20:11:57,255 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:57,255 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:57,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:11:57,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:11:57,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:11:57,272 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:11:57,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:11:57,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1018233459, now seen corresponding path program 1 times [2019-11-15 20:11:57,273 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:11:57,273 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615543154] [2019-11-15 20:11:57,273 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:57,273 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:57,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:11:57,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:11:57,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:11:57,326 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:11:57,519 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2019-11-15 20:11:58,162 WARN L191 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 121 [2019-11-15 20:11:58,382 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-11-15 20:11:58,384 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:11:58,384 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:11:58,385 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:11:58,385 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:11:58,385 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:11:58,385 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:11:58,385 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:11:58,385 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:11:58,385 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncmp-alloca-1.i_Iteration6_Lasso [2019-11-15 20:11:58,385 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:11:58,385 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:11:58,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:58,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:58,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:58,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:58,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:58,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:58,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:58,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:58,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:58,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:58,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-11-15 20:11:58,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-11-15 20:11:58,907 WARN L191 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 90 [2019-11-15 20:11:59,087 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-11-15 20:11:59,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:59,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:59,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:59,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:59,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:59,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:59,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:59,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:59,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:59,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:59,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:59,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:59,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:59,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:59,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:59,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:59,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:59,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:59,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:11:59,306 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-11-15 20:11:59,935 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-11-15 20:12:00,023 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:12:00,023 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:12:00,023 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:12:00,024 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:12:00,024 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:12:00,024 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:12:00,024 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:12:00,024 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:12:00,025 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:12:00,025 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:12:00,025 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:12:00,026 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:12:00,026 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:12:00,026 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:12:00,026 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:12:00,026 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:12:00,026 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:12:00,027 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:12:00,027 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:12:00,027 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:12:00,027 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:12:00,028 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:12:00,028 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:12:00,028 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:12:00,028 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:12:00,028 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:12:00,028 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:12:00,028 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:12:00,029 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:12:00,038 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:12:00,039 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:12:00,039 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:12:00,039 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:12:00,039 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:12:00,049 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:12:00,049 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:12:00,049 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:12:00,049 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:12:00,050 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:12:00,050 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:12:00,051 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:12:00,051 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:12:00,051 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:12:00,051 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:12:00,052 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:12:00,053 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:12:00,053 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:12:00,054 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:12:00,054 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:12:00,054 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:12:00,054 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:12:00,055 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:12:00,055 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:12:00,055 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:12:00,056 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:12:00,056 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:12:00,057 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:12:00,057 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:12:00,057 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:12:00,057 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:12:00,057 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:12:00,057 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:12:00,058 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:12:00,058 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:12:00,058 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:12:00,059 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:12:00,059 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:12:00,059 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:12:00,059 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:12:00,060 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:12:00,060 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:12:00,061 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:12:00,061 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:12:00,065 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:12:00,066 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:12:00,066 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:12:00,066 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:12:00,067 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:12:00,067 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:12:00,067 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:12:00,067 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:12:00,068 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:12:00,068 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:12:00,069 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:12:00,069 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:12:00,069 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:12:00,069 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:12:00,070 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:12:00,071 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:12:00,072 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:12:00,073 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:12:00,073 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:12:00,073 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:12:00,074 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:12:00,074 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:12:00,075 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:12:00,075 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:12:00,075 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:12:00,075 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:12:00,077 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:12:00,077 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:12:00,077 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:12:00,077 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:12:00,078 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:12:00,078 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:12:00,079 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:12:00,083 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:12:00,084 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:12:00,084 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:12:00,085 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:12:00,085 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:12:00,085 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:12:00,085 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:12:00,086 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:12:00,087 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:12:00,088 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:12:00,089 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:12:00,089 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:12:00,089 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:12:00,089 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:12:00,102 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:12:00,102 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:12:00,170 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:12:00,240 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-11-15 20:12:00,240 INFO L444 ModelExtractionUtils]: 40 out of 52 variables were initially zero. Simplification set additionally 9 variables to zero. [2019-11-15 20:12:00,241 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:12:00,242 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:12:00,242 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:12:00,242 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-11-15 20:12:00,337 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2019-11-15 20:12:00,339 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 20:12:00,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:12:00,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:12:00,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:12:00,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:12:00,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:12:00,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 20:12:00,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:12:00,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:12:00,395 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 20:12:00,395 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 23 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-11-15 20:12:00,410 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-11-15 20:12:00,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 20:12:00,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 20:12:00,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2019-11-15 20:12:00,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 14 letters. Loop has 5 letters. [2019-11-15 20:12:00,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:12:00,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 19 letters. Loop has 5 letters. [2019-11-15 20:12:00,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:12:00,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 14 letters. Loop has 10 letters. [2019-11-15 20:12:00,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:12:00,412 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2019-11-15 20:12:00,413 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 20:12:00,413 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2019-11-15 20:12:00,413 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 20:12:00,413 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 20:12:00,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 20:12:00,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:12:00,414 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:12:00,414 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:12:00,414 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:12:00,414 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 20:12:00,414 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 20:12:00,414 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 20:12:00,414 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 20:12:00,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 08:12:00 BoogieIcfgContainer [2019-11-15 20:12:00,418 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 20:12:00,419 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:12:00,419 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:12:00,419 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:12:00,419 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:11:52" (3/4) ... [2019-11-15 20:12:00,421 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 20:12:00,421 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:12:00,422 INFO L168 Benchmark]: Toolchain (without parser) took 8872.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 189.3 MB). Free memory was 937.1 MB in the beginning and 876.8 MB in the end (delta: 60.3 MB). Peak memory consumption was 249.5 MB. Max. memory is 11.5 GB. [2019-11-15 20:12:00,423 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:12:00,424 INFO L168 Benchmark]: CACSL2BoogieTranslator took 563.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -185.6 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-15 20:12:00,424 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:12:00,424 INFO L168 Benchmark]: Boogie Preprocessor took 36.68 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:12:00,425 INFO L168 Benchmark]: RCFGBuilder took 391.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:12:00,425 INFO L168 Benchmark]: BuchiAutomizer took 7824.25 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 49.3 MB). Free memory was 1.1 GB in the beginning and 876.8 MB in the end (delta: 216.7 MB). Peak memory consumption was 266.0 MB. Max. memory is 11.5 GB. [2019-11-15 20:12:00,426 INFO L168 Benchmark]: Witness Printer took 2.67 ms. Allocated memory is still 1.2 GB. Free memory is still 876.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:12:00,428 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 563.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -185.6 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.68 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 391.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7824.25 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 49.3 MB). Free memory was 1.1 GB in the beginning and 876.8 MB in the end (delta: 216.7 MB). Peak memory consumption was 266.0 MB. Max. memory is 11.5 GB. * Witness Printer took 2.67 ms. Allocated memory is still 1.2 GB. Free memory is still 876.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function length1 + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * i + -1 * nondetString2 + unknown-#length-unknown[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 7.7s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 6.9s. 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: 62ms 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...