./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/cstrncmp-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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_1ea92017-8eb7-4682-b42c-d0647338bab4/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1ea92017-8eb7-4682-b42c-d0647338bab4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1ea92017-8eb7-4682-b42c-d0647338bab4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1ea92017-8eb7-4682-b42c-d0647338bab4/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/cstrncmp-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_1ea92017-8eb7-4682-b42c-d0647338bab4/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1ea92017-8eb7-4682-b42c-d0647338bab4/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 64bit --witnessprinter.graph.data.programhash 68c0bffd453ebe82049c8a49e9fddf725cfb9d95 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:24:42,896 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:24:42,898 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:24:42,909 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:24:42,910 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:24:42,911 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:24:42,913 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:24:42,915 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:24:42,917 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:24:42,918 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:24:42,919 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:24:42,920 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:24:42,920 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:24:42,921 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:24:42,922 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:24:42,923 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:24:42,924 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:24:42,925 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:24:42,926 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:24:42,928 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:24:42,930 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:24:42,931 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:24:42,932 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:24:42,933 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:24:42,936 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:24:42,936 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:24:42,936 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:24:42,937 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:24:42,938 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:24:42,939 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:24:42,939 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:24:42,940 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:24:42,940 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:24:42,941 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:24:42,942 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:24:42,942 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:24:42,943 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:24:42,943 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:24:42,943 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:24:42,944 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:24:42,945 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:24:42,946 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1ea92017-8eb7-4682-b42c-d0647338bab4/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 22:24:42,962 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:24:42,962 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:24:42,963 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:24:42,965 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:24:42,966 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:24:42,966 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 22:24:42,966 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 22:24:42,966 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 22:24:42,967 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 22:24:42,967 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 22:24:42,968 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 22:24:42,968 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:24:42,969 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:24:42,969 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:24:42,969 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:24:42,969 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 22:24:42,970 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 22:24:42,970 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 22:24:42,970 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:24:42,970 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 22:24:42,971 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:24:42,971 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 22:24:42,971 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:24:42,972 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:24:42,972 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 22:24:42,973 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:24:42,973 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:24:42,973 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 22:24:42,974 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 22:24:42,976 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_1ea92017-8eb7-4682-b42c-d0647338bab4/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 68c0bffd453ebe82049c8a49e9fddf725cfb9d95 [2019-11-15 22:24:43,002 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:24:43,011 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:24:43,014 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:24:43,016 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:24:43,016 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:24:43,016 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1ea92017-8eb7-4682-b42c-d0647338bab4/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/cstrncmp-alloca-2.i [2019-11-15 22:24:43,083 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1ea92017-8eb7-4682-b42c-d0647338bab4/bin/uautomizer/data/a24efe25c/4e2a3a1724a144729b1daccf64d28966/FLAG49b94d150 [2019-11-15 22:24:43,548 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:24:43,548 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1ea92017-8eb7-4682-b42c-d0647338bab4/sv-benchmarks/c/termination-memory-alloca/cstrncmp-alloca-2.i [2019-11-15 22:24:43,560 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1ea92017-8eb7-4682-b42c-d0647338bab4/bin/uautomizer/data/a24efe25c/4e2a3a1724a144729b1daccf64d28966/FLAG49b94d150 [2019-11-15 22:24:43,924 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1ea92017-8eb7-4682-b42c-d0647338bab4/bin/uautomizer/data/a24efe25c/4e2a3a1724a144729b1daccf64d28966 [2019-11-15 22:24:43,926 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:24:43,927 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:24:43,928 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:24:43,929 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:24:43,932 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:24:43,933 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:24:43" (1/1) ... [2019-11-15 22:24:43,936 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37cd258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:24:43, skipping insertion in model container [2019-11-15 22:24:43,936 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:24:43" (1/1) ... [2019-11-15 22:24:43,946 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:24:44,004 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:24:44,319 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:24:44,329 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:24:44,368 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:24:44,412 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:24:44,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:24:44 WrapperNode [2019-11-15 22:24:44,412 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:24:44,413 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:24:44,413 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:24:44,413 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:24:44,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:24:44" (1/1) ... [2019-11-15 22:24:44,435 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:24:44" (1/1) ... [2019-11-15 22:24:44,458 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:24:44,459 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:24:44,459 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:24:44,459 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:24:44,468 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:24:44" (1/1) ... [2019-11-15 22:24:44,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:24:44" (1/1) ... [2019-11-15 22:24:44,471 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:24:44" (1/1) ... [2019-11-15 22:24:44,472 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:24:44" (1/1) ... [2019-11-15 22:24:44,478 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:24:44" (1/1) ... [2019-11-15 22:24:44,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:24:44" (1/1) ... [2019-11-15 22:24:44,484 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:24:44" (1/1) ... [2019-11-15 22:24:44,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:24:44,487 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:24:44,487 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:24:44,487 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:24:44,488 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:24:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ea92017-8eb7-4682-b42c-d0647338bab4/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:24:44,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:24:44,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:24:44,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:24:44,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:24:44,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:24:44,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:24:44,928 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:24:44,928 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 22:24:44,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:24:44 BoogieIcfgContainer [2019-11-15 22:24:44,929 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:24:44,930 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 22:24:44,930 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 22:24:44,934 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 22:24:44,934 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:24:44,935 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 10:24:43" (1/3) ... [2019-11-15 22:24:44,935 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@38313f3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:24:44, skipping insertion in model container [2019-11-15 22:24:44,936 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:24:44,936 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:24:44" (2/3) ... [2019-11-15 22:24:44,936 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@38313f3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:24:44, skipping insertion in model container [2019-11-15 22:24:44,936 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:24:44,936 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:24:44" (3/3) ... [2019-11-15 22:24:44,938 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrncmp-alloca-2.i [2019-11-15 22:24:44,997 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 22:24:44,997 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 22:24:44,998 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 22:24:44,998 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:24:44,998 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:24:44,998 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 22:24:44,998 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:24:44,998 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 22:24:45,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-15 22:24:45,034 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 22:24:45,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:24:45,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:24:45,042 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 22:24:45,042 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 22:24:45,042 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 22:24:45,042 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-15 22:24:45,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 22:24:45,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:24:45,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:24:45,045 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 22:24:45,045 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 22:24:45,053 INFO L791 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#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~nondet17, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet13;havoc main_#t~nondet13;main_~length2~0 := main_#t~nondet14;havoc main_#t~nondet14; 8#L565true assume !(main_~length1~0 < 1); 13#L565-2true assume !(main_~length2~0 < 1); 7#L568-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;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~nondet17;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; 17#L550true assume !(0 == cstrncmp_~n); 4#L552-5true [2019-11-15 22:24:45,053 INFO L793 eck$LassoCheckResult]: Loop: 4#L552-5true cstrncmp_#t~post2 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post2 - 1;cstrncmp_#t~short5 := cstrncmp_#t~post2 > 0; 14#L552-1true 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; 20#L552-3true assume !!cstrncmp_#t~short5;havoc cstrncmp_#t~mem4;havoc cstrncmp_#t~short5;havoc cstrncmp_#t~mem3;havoc cstrncmp_#t~post2;cstrncmp_#t~short7 := 0 == cstrncmp_~n; 11#L553true assume cstrncmp_#t~short7; 15#L553-2true assume !cstrncmp_#t~short7;havoc cstrncmp_#t~short7;havoc cstrncmp_#t~mem6;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; 4#L552-5true [2019-11-15 22:24:45,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:24:45,059 INFO L82 PathProgramCache]: Analyzing trace with hash 889572238, now seen corresponding path program 1 times [2019-11-15 22:24:45,068 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:24:45,068 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141254627] [2019-11-15 22:24:45,068 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:45,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:45,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:24:45,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:24:45,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:24:45,226 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:24:45,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:24:45,227 INFO L82 PathProgramCache]: Analyzing trace with hash 52587176, now seen corresponding path program 1 times [2019-11-15 22:24:45,227 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:24:45,227 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543350883] [2019-11-15 22:24:45,227 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:45,228 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:45,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:24:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:45,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:24:45,292 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543350883] [2019-11-15 22:24:45,292 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:24:45,292 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:24:45,293 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120087323] [2019-11-15 22:24:45,296 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 22:24:45,297 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:24:45,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:24:45,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:24:45,309 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2019-11-15 22:24:45,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:24:45,344 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2019-11-15 22:24:45,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:24:45,347 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2019-11-15 22:24:45,348 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 22:24:45,352 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 11 states and 14 transitions. [2019-11-15 22:24:45,353 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 22:24:45,353 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 22:24:45,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2019-11-15 22:24:45,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:24:45,354 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-15 22:24:45,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2019-11-15 22:24:45,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-11-15 22:24:45,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-15 22:24:45,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-11-15 22:24:45,383 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-15 22:24:45,385 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-15 22:24:45,385 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 22:24:45,385 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2019-11-15 22:24:45,388 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 22:24:45,388 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:24:45,388 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:24:45,389 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 22:24:45,389 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 22:24:45,389 INFO L791 eck$LassoCheckResult]: Stem: 52#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 46#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~nondet17, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet13;havoc main_#t~nondet13;main_~length2~0 := main_#t~nondet14;havoc main_#t~nondet14; 47#L565 assume !(main_~length1~0 < 1); 53#L565-2 assume !(main_~length2~0 < 1); 54#L568-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;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~nondet17;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; 56#L550 assume !(0 == cstrncmp_~n); 50#L552-5 [2019-11-15 22:24:45,390 INFO L793 eck$LassoCheckResult]: Loop: 50#L552-5 cstrncmp_#t~post2 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post2 - 1;cstrncmp_#t~short5 := cstrncmp_#t~post2 > 0; 51#L552-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; 55#L552-3 assume !!cstrncmp_#t~short5;havoc cstrncmp_#t~mem4;havoc cstrncmp_#t~short5;havoc cstrncmp_#t~mem3;havoc cstrncmp_#t~post2;cstrncmp_#t~short7 := 0 == cstrncmp_~n; 48#L553 assume !cstrncmp_#t~short7;call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~short7 := 0 == cstrncmp_#t~mem6; 49#L553-2 assume !cstrncmp_#t~short7;havoc cstrncmp_#t~short7;havoc cstrncmp_#t~mem6;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; 50#L552-5 [2019-11-15 22:24:45,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:24:45,390 INFO L82 PathProgramCache]: Analyzing trace with hash 889572238, now seen corresponding path program 2 times [2019-11-15 22:24:45,391 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:24:45,391 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884025114] [2019-11-15 22:24:45,392 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:45,392 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:45,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:24:45,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:24:45,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:24:45,442 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:24:45,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:24:45,442 INFO L82 PathProgramCache]: Analyzing trace with hash 52587238, now seen corresponding path program 1 times [2019-11-15 22:24:45,443 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:24:45,443 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980032933] [2019-11-15 22:24:45,443 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:45,443 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:45,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:24:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:24:45,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:24:45,467 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:24:45,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:24:45,468 INFO L82 PathProgramCache]: Analyzing trace with hash -2120298631, now seen corresponding path program 1 times [2019-11-15 22:24:45,468 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:24:45,468 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323337785] [2019-11-15 22:24:45,468 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:45,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:45,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:24:45,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:24:45,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:24:45,572 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:24:45,891 WARN L191 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2019-11-15 22:24:46,553 WARN L191 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 90 [2019-11-15 22:24:46,699 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-11-15 22:24:46,711 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:24:46,712 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:24:46,712 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:24:46,712 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:24:46,713 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:24:46,713 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:24:46,713 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:24:46,713 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:24:46,714 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncmp-alloca-2.i_Iteration2_Lasso [2019-11-15 22:24:46,714 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:24:46,714 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:24:46,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:24:46,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:24:46,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:24:46,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:24:46,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:24:46,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:24:46,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:24:46,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:24:46,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:24:46,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:24:46,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:24:46,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:24:46,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:24:46,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:24:46,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:24:46,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:24:46,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:24:46,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:24:46,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:24:46,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:24:46,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:24:46,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:24:46,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:24:47,268 WARN L191 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-11-15 22:24:47,484 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-11-15 22:24:47,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:24:47,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:24:47,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:24:47,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:24:48,513 WARN L191 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-11-15 22:24:48,675 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:24:48,679 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:24:48,681 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:24:48,683 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:48,683 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:24:48,684 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:48,684 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:48,684 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:48,686 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:24:48,686 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:24:48,689 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:48,689 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:24:48,690 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:48,690 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:24:48,690 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:48,690 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:48,690 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:48,691 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:24:48,691 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:24:48,692 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:48,692 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:24:48,693 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:48,693 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:24:48,693 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:48,693 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:48,693 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:48,694 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:24:48,694 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:24:48,695 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:48,696 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:24:48,696 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:48,696 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:48,697 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:48,697 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:48,699 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:24:48,699 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:24:48,702 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:48,703 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:24:48,704 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:48,704 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:24:48,704 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:48,704 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:48,704 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:48,705 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:24:48,705 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:24:48,706 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:48,706 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:24:48,707 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:48,707 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:48,707 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:48,708 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:48,709 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:24:48,710 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:24:48,714 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:48,715 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:24:48,715 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:48,716 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:24:48,716 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:48,716 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:48,716 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:48,717 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:24:48,717 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:24:48,718 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:48,718 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:24:48,719 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:48,719 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:24:48,720 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:48,720 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:48,720 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:48,720 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:24:48,721 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:24:48,722 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:48,722 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:24:48,723 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:48,723 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:48,723 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:48,724 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:48,725 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:24:48,725 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:24:48,728 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:48,729 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:24:48,730 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:48,730 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:24:48,730 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:48,730 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:48,731 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:48,731 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:24:48,731 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:24:48,732 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:48,732 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:24:48,733 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:48,733 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:24:48,734 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:48,734 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:48,734 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:48,734 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:24:48,735 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:24:48,735 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:48,736 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:24:48,737 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:48,737 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:24:48,737 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:48,737 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:48,738 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:48,738 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:24:48,738 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:24:48,739 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:48,740 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:24:48,740 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:48,741 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:24:48,741 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:48,741 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:48,741 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:48,742 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:24:48,742 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:24:48,743 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:48,744 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:24:48,744 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:48,745 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:24:48,745 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:48,745 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:48,745 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:48,746 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:24:48,746 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:24:48,747 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:48,747 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:24:48,748 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:48,748 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:24:48,748 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:48,749 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:48,749 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:48,749 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:24:48,750 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:24:48,750 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:48,751 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:24:48,752 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:48,752 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 22:24:48,752 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:48,752 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:48,756 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 22:24:48,756 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:24:48,794 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:24:48,819 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 22:24:48,819 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-15 22:24:48,822 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:24:48,824 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:24:48,824 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:24:48,825 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncmp_~n) = 1*ULTIMATE.start_cstrncmp_~n Supporting invariants [] [2019-11-15 22:24:48,880 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2019-11-15 22:24:48,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:24:48,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:48,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:24:48,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:24:48,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:48,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:24:48,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:24:48,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:49,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:24:49,017 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 22:24:49,018 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand 4 states. [2019-11-15 22:24:49,102 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 21 states and 26 transitions. Complement of second has 6 states. [2019-11-15 22:24:49,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 22:24:49,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 22:24:49,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-11-15 22:24:49,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 6 letters. Loop has 5 letters. [2019-11-15 22:24:49,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:24:49,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 11 letters. Loop has 5 letters. [2019-11-15 22:24:49,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:24:49,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 6 letters. Loop has 10 letters. [2019-11-15 22:24:49,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:24:49,111 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2019-11-15 22:24:49,113 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:24:49,113 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 0 states and 0 transitions. [2019-11-15 22:24:49,113 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 22:24:49,113 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 22:24:49,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 22:24:49,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:24:49,113 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:24:49,114 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:24:49,114 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:24:49,114 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 22:24:49,114 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:24:49,114 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:24:49,114 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 22:24:49,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 10:24:49 BoogieIcfgContainer [2019-11-15 22:24:49,121 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 22:24:49,122 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:24:49,122 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:24:49,122 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:24:49,123 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:24:44" (3/4) ... [2019-11-15 22:24:49,127 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 22:24:49,127 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:24:49,129 INFO L168 Benchmark]: Toolchain (without parser) took 5200.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 946.1 MB in the beginning and 894.7 MB in the end (delta: 51.3 MB). Peak memory consumption was 184.5 MB. Max. memory is 11.5 GB. [2019-11-15 22:24:49,129 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:24:49,130 INFO L168 Benchmark]: CACSL2BoogieTranslator took 484.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -171.0 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:24:49,131 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.57 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:24:49,132 INFO L168 Benchmark]: Boogie Preprocessor took 27.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:24:49,132 INFO L168 Benchmark]: RCFGBuilder took 442.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:24:49,133 INFO L168 Benchmark]: BuchiAutomizer took 4191.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 894.7 MB in the end (delta: 193.2 MB). Peak memory consumption was 193.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:24:49,134 INFO L168 Benchmark]: Witness Printer took 5.25 ms. Allocated memory is still 1.2 GB. Free memory is still 894.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:24:49,137 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 484.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -171.0 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.57 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.60 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. * RCFGBuilder took 442.67 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 4191.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 894.7 MB in the end (delta: 193.2 MB). Peak memory consumption was 193.2 MB. Max. memory is 11.5 GB. * Witness Printer took 5.25 ms. Allocated memory is still 1.2 GB. Free memory is still 894.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function n and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.1s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 34 SDtfs, 12 SDslu, 23 SDs, 0 SdLazy, 15 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital236 mio100 ax107 hnf99 lsp81 ukn85 mio100 lsp42 div100 bol100 ite100 ukn100 eq192 hnf88 smp100 dnf187 smp97 tf100 neg96 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 73ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...