./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-crafted-lit/cstrcmp_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b90a4a12-c5c7-41c7-aa68-cef0d49d3711/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b90a4a12-c5c7-41c7-aa68-cef0d49d3711/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b90a4a12-c5c7-41c7-aa68-cef0d49d3711/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b90a4a12-c5c7-41c7-aa68-cef0d49d3711/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted-lit/cstrcmp_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b90a4a12-c5c7-41c7-aa68-cef0d49d3711/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b90a4a12-c5c7-41c7-aa68-cef0d49d3711/bin-2019/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 256a9ac0f321f0d2863fb720d2ae6cb61570c373 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 08:19:25,333 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 08:19:25,334 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 08:19:25,340 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 08:19:25,340 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 08:19:25,341 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 08:19:25,341 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 08:19:25,342 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 08:19:25,343 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 08:19:25,343 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 08:19:25,344 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 08:19:25,344 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 08:19:25,344 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 08:19:25,345 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 08:19:25,345 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 08:19:25,345 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 08:19:25,346 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 08:19:25,347 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 08:19:25,348 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 08:19:25,348 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 08:19:25,349 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 08:19:25,349 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 08:19:25,350 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 08:19:25,351 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 08:19:25,351 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 08:19:25,351 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 08:19:25,352 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 08:19:25,352 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 08:19:25,352 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 08:19:25,353 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 08:19:25,353 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 08:19:25,353 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 08:19:25,353 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 08:19:25,353 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 08:19:25,354 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 08:19:25,354 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 08:19:25,354 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b90a4a12-c5c7-41c7-aa68-cef0d49d3711/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-09 08:19:25,362 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 08:19:25,362 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 08:19:25,363 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 08:19:25,363 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 08:19:25,363 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 08:19:25,363 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 08:19:25,363 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 08:19:25,363 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 08:19:25,363 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 08:19:25,363 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 08:19:25,363 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 08:19:25,363 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 08:19:25,364 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 08:19:25,364 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 08:19:25,364 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 08:19:25,364 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 08:19:25,364 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 08:19:25,364 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 08:19:25,364 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 08:19:25,364 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 08:19:25,364 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 08:19:25,364 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 08:19:25,364 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 08:19:25,364 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 08:19:25,365 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 08:19:25,365 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 08:19:25,365 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 08:19:25,365 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 08:19:25,365 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 08:19:25,365 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_b90a4a12-c5c7-41c7-aa68-cef0d49d3711/bin-2019/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 -> 256a9ac0f321f0d2863fb720d2ae6cb61570c373 [2018-12-09 08:19:25,383 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 08:19:25,392 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 08:19:25,394 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 08:19:25,396 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 08:19:25,396 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 08:19:25,396 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b90a4a12-c5c7-41c7-aa68-cef0d49d3711/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/cstrcmp_true-termination_true-no-overflow.c [2018-12-09 08:19:25,441 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b90a4a12-c5c7-41c7-aa68-cef0d49d3711/bin-2019/uautomizer/data/3e645d2fc/a5e143aab97f46508db37157acd596ee/FLAG1d097e24c [2018-12-09 08:19:25,854 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 08:19:25,854 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b90a4a12-c5c7-41c7-aa68-cef0d49d3711/sv-benchmarks/c/termination-crafted-lit/cstrcmp_true-termination_true-no-overflow.c [2018-12-09 08:19:25,858 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b90a4a12-c5c7-41c7-aa68-cef0d49d3711/bin-2019/uautomizer/data/3e645d2fc/a5e143aab97f46508db37157acd596ee/FLAG1d097e24c [2018-12-09 08:19:25,867 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b90a4a12-c5c7-41c7-aa68-cef0d49d3711/bin-2019/uautomizer/data/3e645d2fc/a5e143aab97f46508db37157acd596ee [2018-12-09 08:19:25,868 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 08:19:25,869 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 08:19:25,870 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 08:19:25,870 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 08:19:25,872 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 08:19:25,872 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:19:25" (1/1) ... [2018-12-09 08:19:25,874 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a347b11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:19:25, skipping insertion in model container [2018-12-09 08:19:25,874 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:19:25" (1/1) ... [2018-12-09 08:19:25,878 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 08:19:25,888 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 08:19:25,979 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 08:19:25,985 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 08:19:25,995 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 08:19:26,004 INFO L195 MainTranslator]: Completed translation [2018-12-09 08:19:26,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:19:26 WrapperNode [2018-12-09 08:19:26,005 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 08:19:26,005 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 08:19:26,005 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 08:19:26,005 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 08:19:26,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:19:26" (1/1) ... [2018-12-09 08:19:26,015 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:19:26" (1/1) ... [2018-12-09 08:19:26,028 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 08:19:26,028 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 08:19:26,028 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 08:19:26,028 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 08:19:26,066 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:19:26" (1/1) ... [2018-12-09 08:19:26,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:19:26" (1/1) ... [2018-12-09 08:19:26,067 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:19:26" (1/1) ... [2018-12-09 08:19:26,067 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:19:26" (1/1) ... [2018-12-09 08:19:26,071 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:19:26" (1/1) ... [2018-12-09 08:19:26,075 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:19:26" (1/1) ... [2018-12-09 08:19:26,076 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:19:26" (1/1) ... [2018-12-09 08:19:26,078 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 08:19:26,078 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 08:19:26,078 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 08:19:26,078 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 08:19:26,079 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:19:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b90a4a12-c5c7-41c7-aa68-cef0d49d3711/bin-2019/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 [2018-12-09 08:19:26,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 08:19:26,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 08:19:26,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 08:19:26,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 08:19:26,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 08:19:26,223 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 08:19:26,224 INFO L280 CfgBuilder]: Removed 11 assue(true) statements. [2018-12-09 08:19:26,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:19:26 BoogieIcfgContainer [2018-12-09 08:19:26,224 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 08:19:26,224 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 08:19:26,224 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 08:19:26,226 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 08:19:26,227 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 08:19:26,227 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 08:19:25" (1/3) ... [2018-12-09 08:19:26,227 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@52321e92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 08:19:26, skipping insertion in model container [2018-12-09 08:19:26,228 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 08:19:26,228 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:19:26" (2/3) ... [2018-12-09 08:19:26,228 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@52321e92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 08:19:26, skipping insertion in model container [2018-12-09 08:19:26,228 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 08:19:26,228 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:19:26" (3/3) ... [2018-12-09 08:19:26,229 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcmp_true-termination_true-no-overflow.c [2018-12-09 08:19:26,259 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 08:19:26,259 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 08:19:26,259 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 08:19:26,260 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 08:19:26,260 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 08:19:26,260 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 08:19:26,260 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 08:19:26,260 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 08:19:26,260 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 08:19:26,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-09 08:19:26,281 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 08:19:26,281 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 08:19:26,281 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 08:19:26,285 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:19:26,285 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 08:19:26,285 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 08:19:26,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-09 08:19:26,286 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 08:19:26,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 08:19:26,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 08:19:26,287 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:19:26,287 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 08:19:26,291 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true havoc main_#res;havoc main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset, main_#t~ret13;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 20#L14true assume !(build_nondet_String_~length~0 < 1); 16#L14-2true call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 10#L19true main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 15#L14-3true assume build_nondet_String_~length~0 < 1;build_nondet_String_~length~0 := 1; 11#L14-5true call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 7#L19-1true main_#t~ret12.base, main_#t~ret12.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset, cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset := main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset;havoc cstrcmp_#res;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset, cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset, cstrcmp_#t~mem2, cstrcmp_#t~mem3, cstrcmp_#t~mem4, cstrcmp_#t~short5, cstrcmp_#t~mem8, cstrcmp_#t~mem9, cstrcmp_#t~ite10, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset, cstrcmp_~uc1~0, cstrcmp_~uc2~0;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset;havoc cstrcmp_~uc1~0;havoc cstrcmp_~uc2~0; 5#L32-5true [2018-12-09 08:19:26,292 INFO L796 eck$LassoCheckResult]: Loop: 5#L32-5true call cstrcmp_#t~mem2 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~short5 := 0 != cstrcmp_#t~mem2; 13#L32-1true assume cstrcmp_#t~short5;call cstrcmp_#t~mem3 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);call cstrcmp_#t~mem4 := read~int(cstrcmp_~s2.base, cstrcmp_~s2.offset, 1);cstrcmp_#t~short5 := cstrcmp_#t~mem3 == cstrcmp_#t~mem4; 8#L32-3true assume !!cstrcmp_#t~short5;havoc cstrcmp_#t~mem2;havoc cstrcmp_#t~short5;havoc cstrcmp_#t~mem3;havoc cstrcmp_#t~mem4;cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post6.base, 1 + cstrcmp_#t~post6.offset;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset;cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post7.base, 1 + cstrcmp_#t~post7.offset;havoc cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset; 5#L32-5true [2018-12-09 08:19:26,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:19:26,295 INFO L82 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 1 times [2018-12-09 08:19:26,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:19:26,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:19:26,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:26,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:19:26,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:26,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:19:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:19:26,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:19:26,380 INFO L82 PathProgramCache]: Analyzing trace with hash 54720, now seen corresponding path program 1 times [2018-12-09 08:19:26,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:19:26,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:19:26,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:26,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:19:26,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:26,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:19:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:19:26,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:19:26,393 INFO L82 PathProgramCache]: Analyzing trace with hash 64858327, now seen corresponding path program 1 times [2018-12-09 08:19:26,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:19:26,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:19:26,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:26,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:19:26,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:19:26,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:19:26,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:19:26,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 08:19:26,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 08:19:26,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 08:19:26,602 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 7 states. [2018-12-09 08:19:26,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:19:26,694 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-12-09 08:19:26,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 08:19:26,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 38 transitions. [2018-12-09 08:19:26,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 08:19:26,699 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 13 states and 14 transitions. [2018-12-09 08:19:26,700 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-09 08:19:26,700 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-09 08:19:26,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2018-12-09 08:19:26,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 08:19:26,701 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-12-09 08:19:26,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2018-12-09 08:19:26,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2018-12-09 08:19:26,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-09 08:19:26,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-12-09 08:19:26,716 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-12-09 08:19:26,717 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-12-09 08:19:26,717 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 08:19:26,717 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2018-12-09 08:19:26,717 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 08:19:26,717 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 08:19:26,717 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 08:19:26,717 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:19:26,717 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 08:19:26,718 INFO L794 eck$LassoCheckResult]: Stem: 79#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 75#L-1 havoc main_#res;havoc main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset, main_#t~ret13;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 76#L14 assume !(build_nondet_String_~length~0 < 1); 83#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 84#L19 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 80#L14-3 assume !(build_nondet_String_~length~0 < 1); 81#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 85#L19-1 main_#t~ret12.base, main_#t~ret12.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset, cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset := main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset;havoc cstrcmp_#res;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset, cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset, cstrcmp_#t~mem2, cstrcmp_#t~mem3, cstrcmp_#t~mem4, cstrcmp_#t~short5, cstrcmp_#t~mem8, cstrcmp_#t~mem9, cstrcmp_#t~ite10, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset, cstrcmp_~uc1~0, cstrcmp_~uc2~0;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset;havoc cstrcmp_~uc1~0;havoc cstrcmp_~uc2~0; 82#L32-5 [2018-12-09 08:19:26,718 INFO L796 eck$LassoCheckResult]: Loop: 82#L32-5 call cstrcmp_#t~mem2 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~short5 := 0 != cstrcmp_#t~mem2; 77#L32-1 assume cstrcmp_#t~short5;call cstrcmp_#t~mem3 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);call cstrcmp_#t~mem4 := read~int(cstrcmp_~s2.base, cstrcmp_~s2.offset, 1);cstrcmp_#t~short5 := cstrcmp_#t~mem3 == cstrcmp_#t~mem4; 78#L32-3 assume !!cstrcmp_#t~short5;havoc cstrcmp_#t~mem2;havoc cstrcmp_#t~short5;havoc cstrcmp_#t~mem3;havoc cstrcmp_#t~mem4;cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post6.base, 1 + cstrcmp_#t~post6.offset;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset;cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post7.base, 1 + cstrcmp_#t~post7.offset;havoc cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset; 82#L32-5 [2018-12-09 08:19:26,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:19:26,718 INFO L82 PathProgramCache]: Analyzing trace with hash 176612300, now seen corresponding path program 1 times [2018-12-09 08:19:26,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:19:26,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:19:26,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:26,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:19:26,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:26,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:19:26,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:19:26,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:19:26,734 INFO L82 PathProgramCache]: Analyzing trace with hash 54720, now seen corresponding path program 2 times [2018-12-09 08:19:26,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:19:26,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:19:26,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:26,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:19:26,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:26,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:19:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:19:26,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:19:26,743 INFO L82 PathProgramCache]: Analyzing trace with hash 122116629, now seen corresponding path program 1 times [2018-12-09 08:19:26,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:19:26,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:19:26,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:26,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 08:19:26,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:26,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:19:26,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:19:27,035 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 100 [2018-12-09 08:19:27,100 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 08:19:27,100 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 08:19:27,101 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 08:19:27,101 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 08:19:27,101 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 08:19:27,101 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 08:19:27,101 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 08:19:27,101 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 08:19:27,101 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcmp_true-termination_true-no-overflow.c_Iteration2_Lasso [2018-12-09 08:19:27,101 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 08:19:27,102 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 08:19:27,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:19:27,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:19:27,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:19:27,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:19:27,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:19:27,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:19:27,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:19:27,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:19:27,279 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2018-12-09 08:19:27,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:19:27,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:19:27,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:19:27,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:19:27,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:19:27,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:19:27,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:19:27,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:19:27,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:19:27,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:19:27,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:19:27,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:19:27,668 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 08:19:27,671 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 08:19:27,673 INFO L122 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 [2018-12-09 08:19:27,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:19:27,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:19:27,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:19:27,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:19:27,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:19:27,675 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:19:27,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:19:27,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:19:27,677 INFO L122 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 [2018-12-09 08:19:27,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:19:27,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:19:27,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:19:27,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:19:27,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:19:27,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:19:27,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:19:27,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:19:27,680 INFO L122 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 [2018-12-09 08:19:27,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:19:27,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:19:27,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:19:27,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:19:27,682 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:19:27,682 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:19:27,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:19:27,684 INFO L122 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 [2018-12-09 08:19:27,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:19:27,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:19:27,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:19:27,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:19:27,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:19:27,685 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:19:27,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:19:27,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:19:27,686 INFO L122 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 [2018-12-09 08:19:27,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:19:27,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:19:27,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:19:27,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:19:27,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:19:27,687 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:19:27,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:19:27,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:19:27,687 INFO L122 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 [2018-12-09 08:19:27,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:19:27,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:19:27,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:19:27,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:19:27,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:19:27,688 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:19:27,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:19:27,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:19:27,689 INFO L122 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 [2018-12-09 08:19:27,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:19:27,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:19:27,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:19:27,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:19:27,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:19:27,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:19:27,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:19:27,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:19:27,690 INFO L122 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 [2018-12-09 08:19:27,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:19:27,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:19:27,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:19:27,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:19:27,691 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:19:27,691 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:19:27,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:19:27,694 INFO L122 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 [2018-12-09 08:19:27,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:19:27,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:19:27,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:19:27,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:19:27,700 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:19:27,700 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:19:27,744 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 08:19:27,770 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-12-09 08:19:27,770 INFO L444 ModelExtractionUtils]: 37 out of 46 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-12-09 08:19:27,772 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 08:19:27,773 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 08:19:27,773 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 08:19:27,773 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcmp_~s2.offset, v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_1) = -1*ULTIMATE.start_cstrcmp_~s2.offset + 1*v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_1 Supporting invariants [] [2018-12-09 08:19:27,808 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2018-12-09 08:19:27,814 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 08:19:27,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:19:27,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:19:27,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:19:27,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:19:27,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:19:27,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:19:27,882 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-09 08:19:27,883 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 12 transitions. cyclomatic complexity: 2 Second operand 5 states. [2018-12-09 08:19:27,926 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 12 transitions. cyclomatic complexity: 2. Second operand 5 states. Result 14 states and 16 transitions. Complement of second has 7 states. [2018-12-09 08:19:27,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-09 08:19:27,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 08:19:27,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-12-09 08:19:27,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 8 letters. Loop has 3 letters. [2018-12-09 08:19:27,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 08:19:27,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 11 letters. Loop has 3 letters. [2018-12-09 08:19:27,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 08:19:27,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 8 letters. Loop has 6 letters. [2018-12-09 08:19:27,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 08:19:27,930 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 16 transitions. [2018-12-09 08:19:27,930 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 08:19:27,930 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 0 states and 0 transitions. [2018-12-09 08:19:27,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-09 08:19:27,931 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-09 08:19:27,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-09 08:19:27,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 08:19:27,931 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 08:19:27,931 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 08:19:27,931 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 08:19:27,931 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 08:19:27,931 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-09 08:19:27,931 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 08:19:27,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-09 08:19:27,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 08:19:27 BoogieIcfgContainer [2018-12-09 08:19:27,937 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 08:19:27,937 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 08:19:27,937 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 08:19:27,937 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 08:19:27,938 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:19:26" (3/4) ... [2018-12-09 08:19:27,940 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 08:19:27,940 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 08:19:27,941 INFO L168 Benchmark]: Toolchain (without parser) took 2072.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 207.6 MB). Free memory was 955.9 MB in the beginning and 1.1 GB in the end (delta: -148.4 MB). Peak memory consumption was 59.2 MB. Max. memory is 11.5 GB. [2018-12-09 08:19:27,942 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 08:19:27,942 INFO L168 Benchmark]: CACSL2BoogieTranslator took 135.20 ms. Allocated memory is still 1.0 GB. Free memory was 955.9 MB in the beginning and 945.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 08:19:27,943 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.59 ms. Allocated memory is still 1.0 GB. Free memory was 945.2 MB in the beginning and 939.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 08:19:27,943 INFO L168 Benchmark]: Boogie Preprocessor took 50.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -183.5 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2018-12-09 08:19:27,944 INFO L168 Benchmark]: RCFGBuilder took 145.77 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: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-12-09 08:19:27,944 INFO L168 Benchmark]: BuchiAutomizer took 1712.76 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 614.7 kB). Peak memory consumption was 76.1 MB. Max. memory is 11.5 GB. [2018-12-09 08:19:27,945 INFO L168 Benchmark]: Witness Printer took 3.17 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. [2018-12-09 08:19:27,947 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 135.20 ms. Allocated memory is still 1.0 GB. Free memory was 955.9 MB in the beginning and 945.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.59 ms. Allocated memory is still 1.0 GB. Free memory was 945.2 MB in the beginning and 939.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -183.5 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 145.77 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: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1712.76 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 614.7 kB). Peak memory consumption was 76.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.17 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * s2 + unknown-#length-unknown[malloc(length * sizeof(char))] and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.6s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.3s. 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, 2 StatesRemovedByMinimization, 1 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: 33 SDtfs, 38 SDslu, 84 SDs, 0 SdLazy, 73 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital210 mio100 ax100 hnf99 lsp97 ukn84 mio100 lsp49 div100 bol100 ite100 ukn100 eq198 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...