./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/cstrncmp_malloc.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_f773489a-4ab7-476b-80c8-e19f0f956db1/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f773489a-4ab7-476b-80c8-e19f0f956db1/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f773489a-4ab7-476b-80c8-e19f0f956db1/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f773489a-4ab7-476b-80c8-e19f0f956db1/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrncmp_malloc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_f773489a-4ab7-476b-80c8-e19f0f956db1/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f773489a-4ab7-476b-80c8-e19f0f956db1/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 56be9dfe64f940b7419bf11610ecc3d24973c46d .............................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 23:57:14,935 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:57:14,937 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:57:14,952 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:57:14,952 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:57:14,953 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:57:14,955 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:57:14,964 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:57:14,968 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:57:14,972 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:57:14,973 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:57:14,975 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:57:14,975 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:57:14,977 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:57:14,978 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:57:14,979 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:57:14,980 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:57:14,980 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:57:14,983 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:57:14,986 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:57:14,989 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:57:14,991 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:57:14,993 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:57:14,994 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:57:14,997 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:57:14,997 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:57:14,998 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:57:14,999 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:57:14,999 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:57:15,000 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:57:15,000 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:57:15,001 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:57:15,002 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:57:15,002 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:57:15,004 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:57:15,004 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:57:15,005 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:57:15,005 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:57:15,005 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:57:15,006 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:57:15,006 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:57:15,007 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f773489a-4ab7-476b-80c8-e19f0f956db1/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 23:57:15,032 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:57:15,042 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:57:15,043 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:57:15,043 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:57:15,044 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:57:15,044 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:57:15,044 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:57:15,044 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:57:15,045 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:57:15,045 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:57:15,045 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:57:15,045 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:57:15,046 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:57:15,047 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:57:15,047 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:57:15,047 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:57:15,047 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:57:15,048 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:57:15,048 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:57:15,048 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:57:15,048 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:57:15,048 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:57:15,049 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:57:15,049 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:57:15,049 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:57:15,050 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:57:15,050 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:57:15,050 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:57:15,051 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:57:15,053 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_f773489a-4ab7-476b-80c8-e19f0f956db1/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 -> 56be9dfe64f940b7419bf11610ecc3d24973c46d [2019-11-15 23:57:15,085 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:57:15,102 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:57:15,106 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:57:15,107 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:57:15,108 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:57:15,109 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f773489a-4ab7-476b-80c8-e19f0f956db1/bin/uautomizer/../../sv-benchmarks/c/termination-15/cstrncmp_malloc.i [2019-11-15 23:57:15,159 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f773489a-4ab7-476b-80c8-e19f0f956db1/bin/uautomizer/data/88bcbf25d/1468445a54444078880029c7b9ffa32b/FLAG4d0ab082e [2019-11-15 23:57:15,683 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:57:15,683 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f773489a-4ab7-476b-80c8-e19f0f956db1/sv-benchmarks/c/termination-15/cstrncmp_malloc.i [2019-11-15 23:57:15,693 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f773489a-4ab7-476b-80c8-e19f0f956db1/bin/uautomizer/data/88bcbf25d/1468445a54444078880029c7b9ffa32b/FLAG4d0ab082e [2019-11-15 23:57:16,178 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f773489a-4ab7-476b-80c8-e19f0f956db1/bin/uautomizer/data/88bcbf25d/1468445a54444078880029c7b9ffa32b [2019-11-15 23:57:16,181 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:57:16,182 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:57:16,183 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:57:16,183 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:57:16,186 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:57:16,187 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:57:16" (1/1) ... [2019-11-15 23:57:16,190 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1657b208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:57:16, skipping insertion in model container [2019-11-15 23:57:16,190 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:57:16" (1/1) ... [2019-11-15 23:57:16,197 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:57:16,240 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:57:16,578 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:57:16,586 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:57:16,622 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:57:16,680 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:57:16,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:57:16 WrapperNode [2019-11-15 23:57:16,681 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:57:16,681 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:57:16,681 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:57:16,681 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:57:16,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:57:16" (1/1) ... [2019-11-15 23:57:16,702 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:57:16" (1/1) ... [2019-11-15 23:57:16,726 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:57:16,726 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:57:16,727 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:57:16,727 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:57:16,735 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:57:16" (1/1) ... [2019-11-15 23:57:16,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:57:16" (1/1) ... [2019-11-15 23:57:16,746 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:57:16" (1/1) ... [2019-11-15 23:57:16,747 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:57:16" (1/1) ... [2019-11-15 23:57:16,761 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:57:16" (1/1) ... [2019-11-15 23:57:16,769 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:57:16" (1/1) ... [2019-11-15 23:57:16,770 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:57:16" (1/1) ... [2019-11-15 23:57:16,772 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:57:16,772 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:57:16,773 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:57:16,773 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:57:16,773 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:57:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f773489a-4ab7-476b-80c8-e19f0f956db1/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 23:57:16,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:57:16,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:57:16,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 23:57:16,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:57:16,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:57:16,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:57:17,167 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:57:17,167 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 23:57:17,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:57:17 BoogieIcfgContainer [2019-11-15 23:57:17,168 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:57:17,169 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:57:17,169 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:57:17,172 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:57:17,175 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:57:17,175 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:57:16" (1/3) ... [2019-11-15 23:57:17,176 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d758565 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:57:17, skipping insertion in model container [2019-11-15 23:57:17,176 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:57:17,176 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:57:16" (2/3) ... [2019-11-15 23:57:17,176 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d758565 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:57:17, skipping insertion in model container [2019-11-15 23:57:17,176 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:57:17,176 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:57:17" (3/3) ... [2019-11-15 23:57:17,177 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrncmp_malloc.i [2019-11-15 23:57:17,210 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:57:17,210 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:57:17,211 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:57:17,211 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:57:17,211 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:57:17,211 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:57:17,211 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:57:17,211 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:57:17,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-15 23:57:17,239 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:57:17,240 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:57:17,240 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:57:17,244 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 23:57:17,245 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 23:57:17,245 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:57:17,245 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-15 23:57:17,246 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:57:17,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:57:17,247 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:57:17,247 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 23:57:17,247 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 23:57:17,254 INFO L791 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet216, main_#t~nondet217, main_#t~malloc218.base, main_#t~malloc218.offset, main_#t~malloc219.base, main_#t~malloc219.offset, main_#t~nondet220, main_#t~ret221, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet216;havoc main_#t~nondet216;main_~length2~0 := main_#t~nondet217;havoc main_#t~nondet217; 12#L382true assume !(main_~length1~0 < 1); 15#L382-2true assume !(main_~length2~0 < 1); 10#L385-1true call main_#t~malloc218.base, main_#t~malloc218.offset := #Ultimate.allocOnHeap(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc218.base, main_#t~malloc218.offset;call main_#t~malloc219.base, main_#t~malloc219.offset := #Ultimate.allocOnHeap(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc219.base, main_#t~malloc219.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~nondet220;havoc cstrncmp_#res;havoc cstrncmp_#t~mem209, cstrncmp_#t~short210, cstrncmp_#t~post211.base, cstrncmp_#t~post211.offset, cstrncmp_#t~post212.base, cstrncmp_#t~post212.offset, cstrncmp_#t~post205, cstrncmp_#t~mem206, cstrncmp_#t~mem207, cstrncmp_#t~short208, cstrncmp_#t~mem213, cstrncmp_#t~mem214, cstrncmp_#t~ite215, 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; 20#L367true assume !(0 == cstrncmp_~n); 6#L369-5true [2019-11-15 23:57:17,255 INFO L793 eck$LassoCheckResult]: Loop: 6#L369-5true cstrncmp_#t~post205 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post205 - 1;cstrncmp_#t~short208 := cstrncmp_#t~post205 > 0; 17#L369-1true assume cstrncmp_#t~short208;call cstrncmp_#t~mem206 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);call cstrncmp_#t~mem207 := read~int(cstrncmp_~s2.base, cstrncmp_~s2.offset, 1);cstrncmp_#t~short208 := cstrncmp_#t~mem206 == cstrncmp_#t~mem207; 4#L369-3true assume !!cstrncmp_#t~short208;havoc cstrncmp_#t~post205;havoc cstrncmp_#t~mem207;havoc cstrncmp_#t~short208;havoc cstrncmp_#t~mem206;cstrncmp_#t~short210 := 0 == cstrncmp_~n; 14#L370true assume cstrncmp_#t~short210; 19#L370-2true assume !cstrncmp_#t~short210;havoc cstrncmp_#t~mem209;havoc cstrncmp_#t~short210;cstrncmp_#t~post211.base, cstrncmp_#t~post211.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post211.base, 1 + cstrncmp_#t~post211.offset;havoc cstrncmp_#t~post211.base, cstrncmp_#t~post211.offset;cstrncmp_#t~post212.base, cstrncmp_#t~post212.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post212.base, 1 + cstrncmp_#t~post212.offset;havoc cstrncmp_#t~post212.base, cstrncmp_#t~post212.offset; 6#L369-5true [2019-11-15 23:57:17,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:17,260 INFO L82 PathProgramCache]: Analyzing trace with hash 889572238, now seen corresponding path program 1 times [2019-11-15 23:57:17,266 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:17,266 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333046429] [2019-11-15 23:57:17,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:17,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:17,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:17,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:57:17,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:57:17,413 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:57:17,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:17,414 INFO L82 PathProgramCache]: Analyzing trace with hash 52587176, now seen corresponding path program 1 times [2019-11-15 23:57:17,414 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:17,415 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771618643] [2019-11-15 23:57:17,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:17,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:17,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:17,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:17,462 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 23:57:17,462 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771618643] [2019-11-15 23:57:17,462 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:57:17,463 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:57:17,463 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119593198] [2019-11-15 23:57:17,466 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:57:17,467 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:17,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:57:17,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:57:17,479 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2019-11-15 23:57:17,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:17,507 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2019-11-15 23:57:17,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:57:17,510 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2019-11-15 23:57:17,511 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:57:17,515 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 11 states and 14 transitions. [2019-11-15 23:57:17,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 23:57:17,516 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 23:57:17,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2019-11-15 23:57:17,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:57:17,517 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-15 23:57:17,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2019-11-15 23:57:17,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-11-15 23:57:17,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-15 23:57:17,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-11-15 23:57:17,543 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-15 23:57:17,543 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-15 23:57:17,543 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:57:17,543 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2019-11-15 23:57:17,544 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:57:17,544 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:57:17,544 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:57:17,546 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 23:57:17,546 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 23:57:17,546 INFO L791 eck$LassoCheckResult]: Stem: 51#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 46#L-1 havoc main_#res;havoc main_#t~nondet216, main_#t~nondet217, main_#t~malloc218.base, main_#t~malloc218.offset, main_#t~malloc219.base, main_#t~malloc219.offset, main_#t~nondet220, main_#t~ret221, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet216;havoc main_#t~nondet216;main_~length2~0 := main_#t~nondet217;havoc main_#t~nondet217; 47#L382 assume !(main_~length1~0 < 1); 50#L382-2 assume !(main_~length2~0 < 1); 55#L385-1 call main_#t~malloc218.base, main_#t~malloc218.offset := #Ultimate.allocOnHeap(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc218.base, main_#t~malloc218.offset;call main_#t~malloc219.base, main_#t~malloc219.offset := #Ultimate.allocOnHeap(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc219.base, main_#t~malloc219.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~nondet220;havoc cstrncmp_#res;havoc cstrncmp_#t~mem209, cstrncmp_#t~short210, cstrncmp_#t~post211.base, cstrncmp_#t~post211.offset, cstrncmp_#t~post212.base, cstrncmp_#t~post212.offset, cstrncmp_#t~post205, cstrncmp_#t~mem206, cstrncmp_#t~mem207, cstrncmp_#t~short208, cstrncmp_#t~mem213, cstrncmp_#t~mem214, cstrncmp_#t~ite215, 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#L367 assume !(0 == cstrncmp_~n); 53#L369-5 [2019-11-15 23:57:17,547 INFO L793 eck$LassoCheckResult]: Loop: 53#L369-5 cstrncmp_#t~post205 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post205 - 1;cstrncmp_#t~short208 := cstrncmp_#t~post205 > 0; 54#L369-1 assume cstrncmp_#t~short208;call cstrncmp_#t~mem206 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);call cstrncmp_#t~mem207 := read~int(cstrncmp_~s2.base, cstrncmp_~s2.offset, 1);cstrncmp_#t~short208 := cstrncmp_#t~mem206 == cstrncmp_#t~mem207; 48#L369-3 assume !!cstrncmp_#t~short208;havoc cstrncmp_#t~post205;havoc cstrncmp_#t~mem207;havoc cstrncmp_#t~short208;havoc cstrncmp_#t~mem206;cstrncmp_#t~short210 := 0 == cstrncmp_~n; 49#L370 assume !cstrncmp_#t~short210;call cstrncmp_#t~mem209 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~short210 := 0 == cstrncmp_#t~mem209; 52#L370-2 assume !cstrncmp_#t~short210;havoc cstrncmp_#t~mem209;havoc cstrncmp_#t~short210;cstrncmp_#t~post211.base, cstrncmp_#t~post211.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post211.base, 1 + cstrncmp_#t~post211.offset;havoc cstrncmp_#t~post211.base, cstrncmp_#t~post211.offset;cstrncmp_#t~post212.base, cstrncmp_#t~post212.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post212.base, 1 + cstrncmp_#t~post212.offset;havoc cstrncmp_#t~post212.base, cstrncmp_#t~post212.offset; 53#L369-5 [2019-11-15 23:57:17,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:17,547 INFO L82 PathProgramCache]: Analyzing trace with hash 889572238, now seen corresponding path program 2 times [2019-11-15 23:57:17,547 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:17,548 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036465667] [2019-11-15 23:57:17,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:17,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:17,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:17,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:57:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:57:17,594 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:57:17,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:17,595 INFO L82 PathProgramCache]: Analyzing trace with hash 52587238, now seen corresponding path program 1 times [2019-11-15 23:57:17,595 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:17,595 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501805797] [2019-11-15 23:57:17,595 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:17,596 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:17,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:17,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:57:17,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:57:17,632 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:57:17,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:17,635 INFO L82 PathProgramCache]: Analyzing trace with hash -2120298631, now seen corresponding path program 1 times [2019-11-15 23:57:17,635 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:17,636 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119694411] [2019-11-15 23:57:17,636 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:17,636 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:17,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:17,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:57:17,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:57:17,721 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:57:17,951 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2019-11-15 23:57:18,430 WARN L191 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 90 [2019-11-15 23:57:18,601 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-11-15 23:57:18,615 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:57:18,617 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:57:18,617 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:57:18,617 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:57:18,617 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:57:18,625 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:57:18,626 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:57:18,626 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:57:18,626 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncmp_malloc.i_Iteration2_Lasso [2019-11-15 23:57:18,626 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:57:18,627 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:57:18,657 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 23:57:18,663 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 23:57:18,666 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 23:57:18,668 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 23:57:18,684 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 23:57:18,687 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 23:57:18,690 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 23:57:18,699 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 23:57:18,702 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 23:57:19,119 WARN L191 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2019-11-15 23:57:19,319 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-11-15 23:57:19,319 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 23:57:19,323 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 23:57:19,326 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 23:57:19,329 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 23:57:19,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:19,338 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 23:57:19,339 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 23:57:19,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:19,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:19,346 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 23:57:19,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:19,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:57:19,353 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 23:57:19,355 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 23:57:19,357 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 23:57:19,359 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 23:57:20,245 WARN L191 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-11-15 23:57:20,316 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:57:20,321 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:57:20,323 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 23:57:20,325 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:57:20,325 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:57:20,326 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:57:20,326 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:57:20,326 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:57:20,328 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:57:20,328 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:57:20,330 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:57:20,330 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 23:57:20,331 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:57:20,331 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:57:20,331 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:57:20,331 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:57:20,331 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:57:20,332 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:57:20,332 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:57:20,333 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:57:20,333 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 23:57:20,334 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:57:20,334 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:57:20,334 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:57:20,334 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:57:20,335 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:57:20,335 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:57:20,335 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:57:20,336 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:57:20,336 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 23:57:20,337 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:57:20,337 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 23:57:20,337 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:57:20,337 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:57:20,346 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 23:57:20,348 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:57:20,402 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:57:20,416 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:57:20,417 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:57:20,420 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:57:20,422 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:57:20,422 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:57:20,423 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncmp_~n) = 1*ULTIMATE.start_cstrncmp_~n Supporting invariants [] [2019-11-15 23:57:20,500 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2019-11-15 23:57:20,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:20,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:20,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:57:20,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:20,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:20,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:57:20,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:20,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:20,613 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 23:57:20,615 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 23:57:20,616 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand 4 states. [2019-11-15 23:57:20,674 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 23:57:20,675 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 23:57:20,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 23:57:20,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-11-15 23:57:20,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 6 letters. Loop has 5 letters. [2019-11-15 23:57:20,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:57:20,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 11 letters. Loop has 5 letters. [2019-11-15 23:57:20,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:57:20,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 6 letters. Loop has 10 letters. [2019-11-15 23:57:20,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:57:20,679 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2019-11-15 23:57:20,680 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:57:20,680 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 0 states and 0 transitions. [2019-11-15 23:57:20,680 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 23:57:20,681 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 23:57:20,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 23:57:20,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:57:20,681 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:57:20,681 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:57:20,681 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:57:20,681 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 23:57:20,681 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:57:20,682 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:57:20,682 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 23:57:20,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 11:57:20 BoogieIcfgContainer [2019-11-15 23:57:20,687 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 23:57:20,688 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:57:20,688 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:57:20,688 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:57:20,689 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:57:17" (3/4) ... [2019-11-15 23:57:20,693 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 23:57:20,693 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:57:20,695 INFO L168 Benchmark]: Toolchain (without parser) took 4512.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 939.8 MB in the beginning and 897.6 MB in the end (delta: 42.1 MB). Peak memory consumption was 166.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:57:20,696 INFO L168 Benchmark]: CDTParser took 0.25 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 23:57:20,697 INFO L168 Benchmark]: CACSL2BoogieTranslator took 497.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -161.8 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:57:20,697 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.03 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 23:57:20,698 INFO L168 Benchmark]: Boogie Preprocessor took 45.87 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 23:57:20,699 INFO L168 Benchmark]: RCFGBuilder took 396.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:57:20,701 INFO L168 Benchmark]: BuchiAutomizer took 3518.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 897.6 MB in the end (delta: 176.2 MB). Peak memory consumption was 176.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:57:20,703 INFO L168 Benchmark]: Witness Printer took 5.63 ms. Allocated memory is still 1.2 GB. Free memory is still 897.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:57:20,712 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.25 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 497.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -161.8 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.03 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 45.87 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 396.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3518.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 897.6 MB in the end (delta: 176.2 MB). Peak memory consumption was 176.2 MB. Max. memory is 11.5 GB. * Witness Printer took 5.63 ms. Allocated memory is still 1.2 GB. Free memory is still 897.6 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 3.4s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. 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: inital235 mio100 ax100 hnf99 lsp87 ukn85 mio100 lsp45 div100 bol100 ite100 ukn100 eq197 hnf87 smp100 dnf174 smp97 tf100 neg96 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 86ms 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...