./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-memsafety/cstrcmp-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d2fd910c-cebb-497f-9562-ddd03fc7b877/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d2fd910c-cebb-497f-9562-ddd03fc7b877/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d2fd910c-cebb-497f-9562-ddd03fc7b877/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d2fd910c-cebb-497f-9562-ddd03fc7b877/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/cstrcmp-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d2fd910c-cebb-497f-9562-ddd03fc7b877/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d2fd910c-cebb-497f-9562-ddd03fc7b877/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 32bit --witnessprinter.graph.data.programhash bd1b17fffb471392e4e5cb414f885f337c434a14 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 03:23:25,700 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 03:23:25,701 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 03:23:25,707 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 03:23:25,707 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 03:23:25,708 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 03:23:25,709 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 03:23:25,710 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 03:23:25,711 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 03:23:25,712 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 03:23:25,712 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 03:23:25,713 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 03:23:25,713 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 03:23:25,714 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 03:23:25,715 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 03:23:25,715 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 03:23:25,716 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 03:23:25,717 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 03:23:25,719 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 03:23:25,720 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 03:23:25,720 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 03:23:25,721 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 03:23:25,723 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 03:23:25,723 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 03:23:25,723 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 03:23:25,724 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 03:23:25,724 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 03:23:25,725 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 03:23:25,726 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 03:23:25,726 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 03:23:25,726 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 03:23:25,727 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 03:23:25,727 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 03:23:25,727 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 03:23:25,728 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 03:23:25,728 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 03:23:25,729 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d2fd910c-cebb-497f-9562-ddd03fc7b877/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 03:23:25,739 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 03:23:25,740 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 03:23:25,741 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 03:23:25,741 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 03:23:25,741 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 03:23:25,741 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 03:23:25,741 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 03:23:25,741 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 03:23:25,741 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 03:23:25,742 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 03:23:25,742 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 03:23:25,742 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 03:23:25,742 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 03:23:25,742 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 03:23:25,742 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 03:23:25,742 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 03:23:25,743 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 03:23:25,743 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 03:23:25,743 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 03:23:25,743 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 03:23:25,743 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 03:23:25,743 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 03:23:25,743 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 03:23:25,744 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 03:23:25,744 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 03:23:25,744 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 03:23:25,744 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 03:23:25,744 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 03:23:25,744 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 03:23:25,745 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 03:23:25,745 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 03:23:25,745 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_d2fd910c-cebb-497f-9562-ddd03fc7b877/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bd1b17fffb471392e4e5cb414f885f337c434a14 [2018-11-10 03:23:25,768 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 03:23:25,777 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 03:23:25,780 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 03:23:25,781 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 03:23:25,781 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 03:23:25,782 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d2fd910c-cebb-497f-9562-ddd03fc7b877/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-11-10 03:23:25,819 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d2fd910c-cebb-497f-9562-ddd03fc7b877/bin-2019/uautomizer/data/eb2c2762e/2444f5cec2c5494b9e675972ddf3d8a4/FLAG75da75b6b [2018-11-10 03:23:26,234 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 03:23:26,234 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d2fd910c-cebb-497f-9562-ddd03fc7b877/sv-benchmarks/c/array-memsafety/cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-11-10 03:23:26,241 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d2fd910c-cebb-497f-9562-ddd03fc7b877/bin-2019/uautomizer/data/eb2c2762e/2444f5cec2c5494b9e675972ddf3d8a4/FLAG75da75b6b [2018-11-10 03:23:26,251 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d2fd910c-cebb-497f-9562-ddd03fc7b877/bin-2019/uautomizer/data/eb2c2762e/2444f5cec2c5494b9e675972ddf3d8a4 [2018-11-10 03:23:26,254 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 03:23:26,255 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 03:23:26,256 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 03:23:26,256 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 03:23:26,258 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 03:23:26,258 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:23:26" (1/1) ... [2018-11-10 03:23:26,260 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e2e6dd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:23:26, skipping insertion in model container [2018-11-10 03:23:26,260 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:23:26" (1/1) ... [2018-11-10 03:23:26,266 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 03:23:26,292 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 03:23:26,461 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:23:26,468 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 03:23:26,495 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:23:26,526 INFO L193 MainTranslator]: Completed translation [2018-11-10 03:23:26,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:23:26 WrapperNode [2018-11-10 03:23:26,526 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 03:23:26,527 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 03:23:26,527 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 03:23:26,527 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 03:23:26,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:23:26" (1/1) ... [2018-11-10 03:23:26,583 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:23:26" (1/1) ... [2018-11-10 03:23:26,596 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 03:23:26,596 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 03:23:26,596 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 03:23:26,596 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 03:23:26,602 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:23:26" (1/1) ... [2018-11-10 03:23:26,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:23:26" (1/1) ... [2018-11-10 03:23:26,604 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:23:26" (1/1) ... [2018-11-10 03:23:26,604 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:23:26" (1/1) ... [2018-11-10 03:23:26,608 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:23:26" (1/1) ... [2018-11-10 03:23:26,612 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:23:26" (1/1) ... [2018-11-10 03:23:26,613 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:23:26" (1/1) ... [2018-11-10 03:23:26,615 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 03:23:26,615 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 03:23:26,615 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 03:23:26,615 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 03:23:26,616 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:23:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d2fd910c-cebb-497f-9562-ddd03fc7b877/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-11-10 03:23:26,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 03:23:26,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 03:23:26,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 03:23:26,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 03:23:26,873 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 03:23:26,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:23:26 BoogieIcfgContainer [2018-11-10 03:23:26,874 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 03:23:26,874 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 03:23:26,874 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 03:23:26,877 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 03:23:26,877 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:23:26,877 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 03:23:26" (1/3) ... [2018-11-10 03:23:26,878 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d2b3def and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 03:23:26, skipping insertion in model container [2018-11-10 03:23:26,878 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:23:26,879 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:23:26" (2/3) ... [2018-11-10 03:23:26,879 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d2b3def and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 03:23:26, skipping insertion in model container [2018-11-10 03:23:26,879 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:23:26,879 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:23:26" (3/3) ... [2018-11-10 03:23:26,880 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-11-10 03:23:26,916 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 03:23:26,916 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 03:23:26,916 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 03:23:26,916 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 03:23:26,916 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 03:23:26,917 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 03:23:26,917 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 03:23:26,917 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 03:23:26,917 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 03:23:26,926 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-11-10 03:23:26,942 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 03:23:26,943 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:23:26,943 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:23:26,947 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:23:26,948 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 03:23:26,948 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 03:23:26,948 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-11-10 03:23:26,949 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 03:23:26,949 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:23:26,950 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:23:26,950 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:23:26,950 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 03:23:26,955 INFO L793 eck$LassoCheckResult]: Stem: 25#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 22#L554true assume !(main_~length1~0 < 1); 12#L554-2true assume !(main_~length2~0 < 1); 7#L557-1true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset; 26#L562true SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L562 27#L562-1true SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L562-1 11#L563true assume { :begin_inline_cstrcmp } true;cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset, cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.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; 8#L543-10true [2018-11-10 03:23:26,955 INFO L795 eck$LassoCheckResult]: Loop: 8#L543-10true assume true; 10#L543-1true SUMMARY for call cstrcmp_#t~mem2 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1); srcloc: L543-1 13#L543-2true cstrcmp_#t~short5 := cstrcmp_#t~mem2 != 0; 14#L543-3true assume !cstrcmp_#t~short5; 6#L543-8true assume !!cstrcmp_#t~short5;havoc cstrcmp_#t~mem3;havoc cstrcmp_#t~short5;havoc cstrcmp_#t~mem2;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, cstrcmp_#t~post6.offset + 1;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, cstrcmp_#t~post7.offset + 1;havoc cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset; 8#L543-10true [2018-11-10 03:23:26,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:23:26,960 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 1 times [2018-11-10 03:23:26,961 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:23:26,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:23:26,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:23:26,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:23:26,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:23:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:23:27,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:23:27,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:23:27,074 INFO L82 PathProgramCache]: Analyzing trace with hash 49686684, now seen corresponding path program 1 times [2018-11-10 03:23:27,075 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:23:27,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:23:27,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:23:27,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:23:27,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:23:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:23:27,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:23:27,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:23:27,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 03:23:27,111 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:23:27,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:23:27,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:23:27,121 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 3 states. [2018-11-10 03:23:27,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:23:27,136 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-10 03:23:27,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:23:27,138 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. [2018-11-10 03:23:27,139 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 03:23:27,141 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 16 states and 18 transitions. [2018-11-10 03:23:27,142 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-10 03:23:27,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-10 03:23:27,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 18 transitions. [2018-11-10 03:23:27,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:23:27,143 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-11-10 03:23:27,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 18 transitions. [2018-11-10 03:23:27,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-10 03:23:27,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-10 03:23:27,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-11-10 03:23:27,164 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-11-10 03:23:27,165 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-11-10 03:23:27,165 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 03:23:27,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. [2018-11-10 03:23:27,165 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 03:23:27,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:23:27,165 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:23:27,166 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:23:27,166 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:23:27,166 INFO L793 eck$LassoCheckResult]: Stem: 72#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 70#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 68#L554 assume !(main_~length1~0 < 1); 69#L554-2 assume !(main_~length2~0 < 1); 65#L557-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset; 66#L562 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L562 75#L562-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L562-1 73#L563 assume { :begin_inline_cstrcmp } true;cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset, cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.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; 64#L543-10 [2018-11-10 03:23:27,166 INFO L795 eck$LassoCheckResult]: Loop: 64#L543-10 assume true; 67#L543-1 SUMMARY for call cstrcmp_#t~mem2 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1); srcloc: L543-1 71#L543-2 cstrcmp_#t~short5 := cstrcmp_#t~mem2 != 0; 74#L543-3 assume cstrcmp_#t~short5; 76#L543-4 SUMMARY for call cstrcmp_#t~mem3 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1); srcloc: L543-4 77#L543-5 SUMMARY for call cstrcmp_#t~mem4 := read~int(cstrcmp_~s2.base, cstrcmp_~s2.offset, 1); srcloc: L543-5 62#L543-6 cstrcmp_#t~short5 := cstrcmp_#t~mem3 == cstrcmp_#t~mem4; 63#L543-8 assume !!cstrcmp_#t~short5;havoc cstrcmp_#t~mem3;havoc cstrcmp_#t~short5;havoc cstrcmp_#t~mem2;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, cstrcmp_#t~post6.offset + 1;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, cstrcmp_#t~post7.offset + 1;havoc cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset; 64#L543-10 [2018-11-10 03:23:27,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:23:27,167 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 2 times [2018-11-10 03:23:27,167 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:23:27,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:23:27,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:23:27,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:23:27,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:23:27,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:23:27,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:23:27,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:23:27,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1552599761, now seen corresponding path program 1 times [2018-11-10 03:23:27,195 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:23:27,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:23:27,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:23:27,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:23:27,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:23:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:23:27,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:23:27,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:23:27,212 INFO L82 PathProgramCache]: Analyzing trace with hash -995262887, now seen corresponding path program 1 times [2018-11-10 03:23:27,212 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:23:27,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:23:27,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:23:27,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:23:27,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:23:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:23:27,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:23:27,384 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2018-11-10 03:23:27,624 WARN L179 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2018-11-10 03:23:27,693 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:23:27,694 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:23:27,694 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:23:27,695 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:23:27,695 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:23:27,695 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:23:27,695 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:23:27,695 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:23:27,695 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcmp-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-10 03:23:27,695 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:23:27,696 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:23:27,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:23:27,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:23:27,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:23:27,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:23:27,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:23:27,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:23:27,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:23:27,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:23:27,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:23:27,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:23:27,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:23:27,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:23:27,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:23:27,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:23:27,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:23:27,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:23:27,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:23:27,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:23:27,983 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 87 [2018-11-10 03:23:28,124 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2018-11-10 03:23:28,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-11-10 03:23:28,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:23:28,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-11-10 03:23:28,507 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:23:28,511 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:23:28,512 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-11-10 03:23:28,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:28,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:23:28,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:28,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:28,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:28,515 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:23:28,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:23:28,517 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:28,517 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-11-10 03:23:28,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:28,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:23:28,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:28,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:28,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:28,518 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:23:28,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:23:28,519 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:28,519 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-11-10 03:23:28,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:28,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:23:28,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:28,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:28,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:28,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:23:28,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:23:28,521 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:28,521 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-11-10 03:23:28,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:28,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:23:28,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:28,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:28,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:28,522 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:23:28,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:23:28,523 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:28,523 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-11-10 03:23:28,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:28,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:28,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:28,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:28,531 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:23:28,531 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:23:28,534 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:28,534 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-11-10 03:23:28,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:28,535 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:23:28,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:28,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:28,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:28,535 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:23:28,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:23:28,536 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:28,537 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-11-10 03:23:28,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:28,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:23:28,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:28,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:28,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:28,541 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:23:28,541 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:23:28,542 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:28,542 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-11-10 03:23:28,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:28,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:28,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:28,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:28,544 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:23:28,544 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:23:28,548 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:28,548 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-11-10 03:23:28,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:28,549 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:23:28,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:28,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:28,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:28,549 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:23:28,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:23:28,550 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:28,550 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-11-10 03:23:28,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:28,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:23:28,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:28,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:28,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:28,552 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:23:28,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:23:28,552 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:28,553 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-11-10 03:23:28,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:28,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:23:28,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:28,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:28,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:28,557 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:23:28,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:23:28,558 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:28,559 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-11-10 03:23:28,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:28,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:23:28,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:28,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:28,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:28,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:23:28,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:23:28,560 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:28,561 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-11-10 03:23:28,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:28,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:23:28,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:28,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:28,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:28,562 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:23:28,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:23:28,563 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:28,563 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-11-10 03:23:28,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:28,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:23:28,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:28,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:28,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:28,564 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:23:28,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:23:28,565 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:28,565 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-11-10 03:23:28,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:28,566 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:23:28,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:28,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:28,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:28,566 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:23:28,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:23:28,567 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:28,567 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-11-10 03:23:28,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:28,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:23:28,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:28,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:28,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:28,569 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:23:28,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:23:28,570 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:28,570 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-11-10 03:23:28,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:28,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:23:28,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:28,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:28,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:28,571 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:23:28,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:23:28,572 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:28,572 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-11-10 03:23:28,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:28,577 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 03:23:28,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:28,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:28,580 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 03:23:28,580 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:23:28,597 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:28,597 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-11-10 03:23:28,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:28,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:28,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:28,599 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:28,600 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:23:28,600 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:23:28,603 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:28,603 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-11-10 03:23:28,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:28,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:28,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:28,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:28,605 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:23:28,605 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:23:28,609 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:28,610 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-11-10 03:23:28,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:28,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:28,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:28,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:28,612 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:23:28,612 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:23:28,621 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:28,621 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-11-10 03:23:28,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:28,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:28,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:28,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:28,624 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:23:28,624 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:23:28,637 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:28,637 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-11-10 03:23:28,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:28,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:23:28,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:28,638 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:23:28,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:28,639 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:23:28,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:23:28,644 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:28,645 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-11-10 03:23:28,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:28,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:28,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:28,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:28,646 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:23:28,647 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:23:28,652 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:28,652 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-11-10 03:23:28,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:28,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:28,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:28,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:28,659 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:23:28,659 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:23:28,700 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:23:28,724 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 03:23:28,725 INFO L444 ModelExtractionUtils]: 51 out of 55 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 03:23:28,726 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:23:28,728 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 03:23:28,728 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:23:28,728 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcmp_~s1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_1) = -1*ULTIMATE.start_cstrcmp_~s1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_1 Supporting invariants [] [2018-11-10 03:23:28,785 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2018-11-10 03:23:28,792 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 03:23:28,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:23:28,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:23:28,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:23:28,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:23:28,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:23:28,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:23:28,859 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-11-10 03:23:28,860 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 18 transitions. cyclomatic complexity: 3 Second operand 5 states. [2018-11-10 03:23:28,908 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 18 transitions. cyclomatic complexity: 3. Second operand 5 states. Result 24 states and 27 transitions. Complement of second has 7 states. [2018-11-10 03:23:28,909 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-11-10 03:23:28,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 03:23:28,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2018-11-10 03:23:28,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 8 letters. Loop has 8 letters. [2018-11-10 03:23:28,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:23:28,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 16 letters. Loop has 8 letters. [2018-11-10 03:23:28,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:23:28,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 8 letters. Loop has 16 letters. [2018-11-10 03:23:28,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:23:28,912 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 27 transitions. [2018-11-10 03:23:28,913 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 03:23:28,913 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2018-11-10 03:23:28,913 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 03:23:28,913 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 03:23:28,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 03:23:28,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:23:28,914 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:23:28,914 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:23:28,914 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:23:28,914 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 03:23:28,914 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 03:23:28,914 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 03:23:28,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 03:23:28,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 03:23:28 BoogieIcfgContainer [2018-11-10 03:23:28,919 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 03:23:28,919 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 03:23:28,919 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 03:23:28,919 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 03:23:28,919 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:23:26" (3/4) ... [2018-11-10 03:23:28,922 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 03:23:28,922 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 03:23:28,923 INFO L168 Benchmark]: Toolchain (without parser) took 2668.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 957.5 MB in the beginning and 932.4 MB in the end (delta: 25.1 MB). Peak memory consumption was 171.4 MB. Max. memory is 11.5 GB. [2018-11-10 03:23:28,923 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:23:28,923 INFO L168 Benchmark]: CACSL2BoogieTranslator took 271.08 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 936.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 03:23:28,924 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 936.1 MB in the beginning and 1.1 GB in the end (delta: -207.0 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-10 03:23:28,924 INFO L168 Benchmark]: Boogie Preprocessor took 18.45 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 03:23:28,925 INFO L168 Benchmark]: RCFGBuilder took 258.96 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. [2018-11-10 03:23:28,925 INFO L168 Benchmark]: BuchiAutomizer took 2044.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 932.4 MB in the end (delta: 185.6 MB). Peak memory consumption was 185.6 MB. Max. memory is 11.5 GB. [2018-11-10 03:23:28,925 INFO L168 Benchmark]: Witness Printer took 3.18 ms. Allocated memory is still 1.2 GB. Free memory is still 932.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:23:28,927 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 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 271.08 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 936.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 936.1 MB in the beginning and 1.1 GB in the end (delta: -207.0 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.45 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 258.96 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 2044.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 932.4 MB in the end (delta: 185.6 MB). Peak memory consumption was 185.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.18 ms. Allocated memory is still 1.2 GB. Free memory is still 932.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * 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 * s1 + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.0s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. 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 16 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 41 SDtfs, 20 SDslu, 33 SDs, 0 SdLazy, 17 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital217 mio100 ax100 hnf99 lsp97 ukn109 mio100 lsp42 div100 bol100 ite100 ukn100 eq201 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 24ms VariablesStem: 5 VariablesLoop: 4 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...