./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-15/cstrspn_reverse_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-15/cstrspn_reverse_alloca_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 b0714679a57fe7287c2b60684006200e7d793859 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 22:05:01,892 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 22:05:01,894 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 22:05:01,911 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 22:05:01,911 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 22:05:01,912 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 22:05:01,914 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 22:05:01,916 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 22:05:01,918 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 22:05:01,919 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 22:05:01,920 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 22:05:01,920 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 22:05:01,921 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 22:05:01,922 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 22:05:01,923 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 22:05:01,925 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 22:05:01,925 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 22:05:01,927 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 22:05:01,929 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 22:05:01,931 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 22:05:01,932 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 22:05:01,934 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 22:05:01,936 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 22:05:01,936 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 22:05:01,936 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 22:05:01,937 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 22:05:01,938 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 22:05:01,939 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 22:05:01,940 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 22:05:01,942 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 22:05:01,942 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 22:05:01,942 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 22:05:01,943 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 22:05:01,943 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 22:05:01,944 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 22:05:01,945 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 22:05:01,946 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 22:05:01,963 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 22:05:01,963 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 22:05:01,965 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 22:05:01,965 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 22:05:01,965 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 22:05:01,965 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 22:05:01,965 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 22:05:01,965 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 22:05:01,966 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 22:05:01,966 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 22:05:01,966 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 22:05:01,966 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 22:05:01,966 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 22:05:01,966 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 22:05:01,968 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 22:05:01,968 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 22:05:01,968 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 22:05:01,968 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 22:05:01,968 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 22:05:01,969 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 22:05:01,969 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 22:05:01,970 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 22:05:01,970 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 22:05:01,970 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 22:05:01,970 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 22:05:01,970 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 22:05:01,970 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 22:05:01,971 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 22:05:01,972 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 22:05:01,973 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> b0714679a57fe7287c2b60684006200e7d793859 [2019-01-01 22:05:02,007 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 22:05:02,020 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 22:05:02,025 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 22:05:02,027 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 22:05:02,027 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 22:05:02,028 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-15/cstrspn_reverse_alloca_true-termination.c.i [2019-01-01 22:05:02,088 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fc0bb98e/b0279f46b77c4867b00a204e02435ad1/FLAG44858edab [2019-01-01 22:05:02,565 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 22:05:02,566 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-15/cstrspn_reverse_alloca_true-termination.c.i [2019-01-01 22:05:02,578 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fc0bb98e/b0279f46b77c4867b00a204e02435ad1/FLAG44858edab [2019-01-01 22:05:02,863 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fc0bb98e/b0279f46b77c4867b00a204e02435ad1 [2019-01-01 22:05:02,866 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 22:05:02,867 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 22:05:02,869 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 22:05:02,869 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 22:05:02,872 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 22:05:02,873 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:05:02" (1/1) ... [2019-01-01 22:05:02,876 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50c9968d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:02, skipping insertion in model container [2019-01-01 22:05:02,877 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:05:02" (1/1) ... [2019-01-01 22:05:02,885 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 22:05:02,936 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 22:05:03,313 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:05:03,325 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 22:05:03,383 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:05:03,608 INFO L195 MainTranslator]: Completed translation [2019-01-01 22:05:03,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:03 WrapperNode [2019-01-01 22:05:03,609 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 22:05:03,610 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 22:05:03,610 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 22:05:03,610 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 22:05:03,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:03" (1/1) ... [2019-01-01 22:05:03,641 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:03" (1/1) ... [2019-01-01 22:05:03,671 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 22:05:03,671 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 22:05:03,671 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 22:05:03,671 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 22:05:03,682 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:03" (1/1) ... [2019-01-01 22:05:03,683 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:03" (1/1) ... [2019-01-01 22:05:03,686 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:03" (1/1) ... [2019-01-01 22:05:03,686 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:03" (1/1) ... [2019-01-01 22:05:03,704 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:03" (1/1) ... [2019-01-01 22:05:03,716 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:03" (1/1) ... [2019-01-01 22:05:03,720 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:03" (1/1) ... [2019-01-01 22:05:03,724 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 22:05:03,727 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 22:05:03,727 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 22:05:03,727 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 22:05:03,728 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:05:03,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 22:05:03,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 22:05:03,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 22:05:03,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 22:05:03,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 22:05:03,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 22:05:04,279 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 22:05:04,280 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-01 22:05:04,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:05:04 BoogieIcfgContainer [2019-01-01 22:05:04,281 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 22:05:04,281 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 22:05:04,281 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 22:05:04,285 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 22:05:04,286 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:05:04,286 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 10:05:02" (1/3) ... [2019-01-01 22:05:04,287 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f7e39e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:05:04, skipping insertion in model container [2019-01-01 22:05:04,287 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:05:04,288 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:03" (2/3) ... [2019-01-01 22:05:04,288 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f7e39e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:05:04, skipping insertion in model container [2019-01-01 22:05:04,288 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:05:04,289 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:05:04" (3/3) ... [2019-01-01 22:05:04,290 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrspn_reverse_alloca_true-termination.c.i [2019-01-01 22:05:04,350 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 22:05:04,350 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 22:05:04,351 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 22:05:04,351 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 22:05:04,351 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 22:05:04,351 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 22:05:04,351 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 22:05:04,351 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 22:05:04,351 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 22:05:04,367 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-01 22:05:04,389 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-01 22:05:04,389 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:05:04,389 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:05:04,396 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 22:05:04,397 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 22:05:04,397 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 22:05:04,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-01 22:05:04,399 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-01 22:05:04,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:05:04,400 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:05:04,401 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 22:05:04,401 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 22:05:04,410 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 12#L382true assume !(main_~length1~0 < 1); 15#L382-2true assume !(main_~length2~0 < 1); 9#L385-1true call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 6#L369-4true [2019-01-01 22:05:04,410 INFO L796 eck$LassoCheckResult]: Loop: 6#L369-4true call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 18#L369-1true assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 20#L372-5true assume !true; 4#L372-6true call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 8#L374true assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 5#L369-3true cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, cstrspn_#t~post205.offset - 1;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 6#L369-4true [2019-01-01 22:05:04,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:04,417 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-01-01 22:05:04,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:04,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:04,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:04,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:04,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:04,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:04,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:04,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:04,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2019-01-01 22:05:04,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:04,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:04,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:04,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:04,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:04,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:04,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:05:04,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:05:04,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 22:05:04,640 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:05:04,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-01 22:05:04,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-01 22:05:04,658 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-01-01 22:05:04,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:05:04,665 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-01-01 22:05:04,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 22:05:04,668 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-01-01 22:05:04,669 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-01 22:05:04,673 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2019-01-01 22:05:04,675 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-01 22:05:04,675 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-01 22:05:04,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2019-01-01 22:05:04,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:05:04,678 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-01 22:05:04,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2019-01-01 22:05:04,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-01 22:05:04,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-01 22:05:04,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-01-01 22:05:04,707 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-01 22:05:04,707 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-01 22:05:04,707 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 22:05:04,707 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-01-01 22:05:04,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-01 22:05:04,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:05:04,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:05:04,709 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 22:05:04,709 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:05:04,709 INFO L794 eck$LassoCheckResult]: Stem: 55#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 50#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 51#L382 assume !(main_~length1~0 < 1); 52#L382-2 assume !(main_~length2~0 < 1); 49#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 47#L369-4 [2019-01-01 22:05:04,710 INFO L796 eck$LassoCheckResult]: Loop: 47#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 48#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 56#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 53#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 54#L372-3 assume !cstrspn_#t~short210;havoc cstrspn_#t~mem209;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem208; 44#L372-6 call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 45#L374 assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 46#L369-3 cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, cstrspn_#t~post205.offset - 1;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 47#L369-4 [2019-01-01 22:05:04,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:04,710 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2019-01-01 22:05:04,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:04,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:04,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:04,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:04,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:04,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:04,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:04,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:04,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2019-01-01 22:05:04,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:04,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:04,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:04,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:05:04,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:04,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:04,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:04,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:04,790 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2019-01-01 22:05:04,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:04,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:04,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:04,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:04,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:04,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:05,465 WARN L181 SmtUtils]: Spent 590.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-01-01 22:05:06,438 WARN L181 SmtUtils]: Spent 933.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-01-01 22:05:06,849 WARN L181 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-01-01 22:05:07,024 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-01-01 22:05:07,036 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:05:07,037 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:05:07,037 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:05:07,038 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:05:07,039 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:05:07,039 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:05:07,039 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:05:07,039 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:05:07,040 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_reverse_alloca_true-termination.c.i_Iteration2_Lasso [2019-01-01 22:05:07,040 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:05:07,040 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:05:07,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:07,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:07,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:07,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:07,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:07,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:07,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:07,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:07,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:07,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:07,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:07,488 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-01-01 22:05:07,832 WARN L181 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-01-01 22:05:07,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:07,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:07,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:07,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:07,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:07,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:07,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:08,475 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-01-01 22:05:08,929 WARN L181 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2019-01-01 22:05:09,341 WARN L181 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-01-01 22:05:09,376 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:05:09,381 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:05:09,384 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 [2019-01-01 22:05:09,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:09,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:09,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:09,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:09,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:09,389 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:09,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:09,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:09,392 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 [2019-01-01 22:05:09,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:09,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:09,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:09,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:09,396 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:09,396 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:09,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:09,402 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 [2019-01-01 22:05:09,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:09,403 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:09,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:09,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:09,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:09,404 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:09,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:09,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:09,405 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 [2019-01-01 22:05:09,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:09,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:09,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:09,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:09,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:09,407 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:09,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:09,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:09,408 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 [2019-01-01 22:05:09,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:09,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:09,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:09,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:09,413 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:09,413 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:09,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:09,428 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 [2019-01-01 22:05:09,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:09,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:09,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:09,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:09,432 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:09,432 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:09,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:09,436 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:09,437 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 [2019-01-01 22:05:09,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:09,439 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:09,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:09,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:09,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:09,440 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:09,440 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:09,441 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:09,441 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 [2019-01-01 22:05:09,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:09,445 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:09,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:09,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:09,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:09,446 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:09,446 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:09,449 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:09,454 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 [2019-01-01 22:05:09,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:09,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:09,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:09,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:09,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:09,458 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:09,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:09,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:09,464 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 [2019-01-01 22:05:09,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:09,464 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:09,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:09,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:09,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:09,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:09,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:09,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:09,469 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 [2019-01-01 22:05:09,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:09,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:09,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:09,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:09,474 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:09,474 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:09,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:09,478 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 [2019-01-01 22:05:09,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:09,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:09,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:09,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:09,482 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:09,483 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:09,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:09,511 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 [2019-01-01 22:05:09,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:09,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:09,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:09,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:09,517 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:09,517 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:09,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:09,525 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 [2019-01-01 22:05:09,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:09,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:09,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:09,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:09,536 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:09,537 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:09,638 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:05:09,693 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 22:05:09,695 INFO L444 ModelExtractionUtils]: 46 out of 52 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-01 22:05:09,699 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:05:09,701 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:05:09,702 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:05:09,703 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~sc1~0.offset) = 2*ULTIMATE.start_cstrspn_~sc1~0.offset + 1 Supporting invariants [] [2019-01-01 22:05:09,857 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-01-01 22:05:09,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:09,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:09,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:09,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:09,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:05:09,987 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 22:05:09,989 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-01 22:05:10,058 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 28 transitions. Complement of second has 4 states. [2019-01-01 22:05:10,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 22:05:10,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:05:10,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-01-01 22:05:10,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2019-01-01 22:05:10,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:10,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2019-01-01 22:05:10,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:10,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2019-01-01 22:05:10,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:10,065 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2019-01-01 22:05:10,067 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 22:05:10,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2019-01-01 22:05:10,068 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-01 22:05:10,068 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-01 22:05:10,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-01-01 22:05:10,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:05:10,068 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-01 22:05:10,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-01-01 22:05:10,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-01-01 22:05:10,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-01 22:05:10,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-01-01 22:05:10,071 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-01 22:05:10,071 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-01 22:05:10,071 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 22:05:10,071 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-01-01 22:05:10,072 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 22:05:10,072 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:05:10,072 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:05:10,073 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:05:10,073 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:05:10,073 INFO L794 eck$LassoCheckResult]: Stem: 188#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 181#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 182#L382 assume !(main_~length1~0 < 1); 183#L382-2 assume !(main_~length2~0 < 1); 180#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 177#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 179#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 189#L372-5 [2019-01-01 22:05:10,073 INFO L796 eck$LassoCheckResult]: Loop: 189#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 184#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 185#L372-3 assume !!cstrspn_#t~short210;havoc cstrspn_#t~mem209;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem208;cstrspn_#t~post211.base, cstrspn_#t~post211.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post211.base, cstrspn_#t~post211.offset - 1;havoc cstrspn_#t~post211.base, cstrspn_#t~post211.offset; 189#L372-5 [2019-01-01 22:05:10,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:10,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2019-01-01 22:05:10,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:10,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:10,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:10,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:10,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:10,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:10,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:10,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:10,104 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2019-01-01 22:05:10,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:10,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:10,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:10,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:10,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:10,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:10,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:10,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:10,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2019-01-01 22:05:10,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:10,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:10,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:10,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:10,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:10,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:10,320 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-01-01 22:05:10,444 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-01-01 22:05:10,775 WARN L181 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 101 [2019-01-01 22:05:10,911 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-01-01 22:05:10,915 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:05:10,915 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:05:10,916 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:05:10,916 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:05:10,916 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:05:10,916 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:05:10,916 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:05:10,916 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:05:10,916 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_reverse_alloca_true-termination.c.i_Iteration3_Lasso [2019-01-01 22:05:10,916 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:05:10,916 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:05:10,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:10,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:10,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:10,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:11,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:11,535 WARN L181 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2019-01-01 22:05:11,660 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-01-01 22:05:11,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:11,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:11,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:11,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:11,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:11,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:11,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:11,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:11,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:11,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:11,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:11,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:11,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:12,511 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-01-01 22:05:13,117 WARN L181 SmtUtils]: Spent 575.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-01 22:05:13,155 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:05:13,155 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:05:13,155 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 [2019-01-01 22:05:13,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:13,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:13,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:13,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:13,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:13,159 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:13,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:13,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:13,162 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 [2019-01-01 22:05:13,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:13,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:13,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:13,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:13,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:13,163 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:13,163 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:13,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:13,167 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 [2019-01-01 22:05:13,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:13,167 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:13,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:13,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:13,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:13,168 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:13,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:13,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:13,169 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 [2019-01-01 22:05:13,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:13,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:13,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:13,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:13,176 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:13,176 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:13,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:13,179 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 [2019-01-01 22:05:13,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:13,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:13,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:13,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:13,183 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:13,183 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:13,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:13,185 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 [2019-01-01 22:05:13,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:13,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:13,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:13,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:13,190 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:13,191 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:13,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:13,195 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 [2019-01-01 22:05:13,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:13,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:13,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:13,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:13,203 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:13,204 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:13,236 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:05:13,273 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-01 22:05:13,274 INFO L444 ModelExtractionUtils]: 47 out of 52 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 22:05:13,274 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:05:13,276 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:05:13,277 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:05:13,277 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_2, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_2 + 2*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2019-01-01 22:05:13,385 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2019-01-01 22:05:13,390 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 22:05:13,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:13,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:13,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:13,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:13,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:13,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:05:13,635 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 [2019-01-01 22:05:13,636 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-01-01 22:05:13,692 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 43 states and 57 transitions. Complement of second has 6 states. [2019-01-01 22:05:13,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 22:05:13,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 22:05:13,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-01 22:05:13,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-01 22:05:13,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:13,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2019-01-01 22:05:13,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:13,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2019-01-01 22:05:13,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:13,695 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2019-01-01 22:05:13,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 22:05:13,699 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2019-01-01 22:05:13,700 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-01 22:05:13,700 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-01 22:05:13,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2019-01-01 22:05:13,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:05:13,700 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2019-01-01 22:05:13,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2019-01-01 22:05:13,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-01-01 22:05:13,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-01 22:05:13,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-01-01 22:05:13,704 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-01 22:05:13,704 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-01 22:05:13,704 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 22:05:13,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2019-01-01 22:05:13,705 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 22:05:13,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:05:13,706 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:05:13,707 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:05:13,707 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:05:13,708 INFO L794 eck$LassoCheckResult]: Stem: 369#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 362#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 363#L382 assume !(main_~length1~0 < 1); 364#L382-2 assume !(main_~length2~0 < 1); 361#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 357#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 358#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 371#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 367#L372-1 assume !cstrspn_#t~short210; 368#L372-3 assume !cstrspn_#t~short210;havoc cstrspn_#t~mem209;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem208; 353#L372-6 call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 354#L374 assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 355#L369-3 cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, cstrspn_#t~post205.offset - 1;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 356#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 360#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 370#L372-5 [2019-01-01 22:05:13,708 INFO L796 eck$LassoCheckResult]: Loop: 370#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 365#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 366#L372-3 assume !!cstrspn_#t~short210;havoc cstrspn_#t~mem209;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem208;cstrspn_#t~post211.base, cstrspn_#t~post211.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post211.base, cstrspn_#t~post211.offset - 1;havoc cstrspn_#t~post211.base, cstrspn_#t~post211.offset; 370#L372-5 [2019-01-01 22:05:13,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:13,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2019-01-01 22:05:13,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:13,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:13,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:13,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:13,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:13,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:13,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:05:13,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:05:13,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 22:05:13,836 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:05:13,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:13,836 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2019-01-01 22:05:13,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:13,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:13,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:13,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:13,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:13,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:13,948 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-01-01 22:05:14,054 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-01-01 22:05:14,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 22:05:14,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-01 22:05:14,056 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-01-01 22:05:14,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:05:14,151 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2019-01-01 22:05:14,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 22:05:14,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2019-01-01 22:05:14,155 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 22:05:14,156 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2019-01-01 22:05:14,156 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-01 22:05:14,156 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-01 22:05:14,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2019-01-01 22:05:14,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:05:14,156 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-01-01 22:05:14,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2019-01-01 22:05:14,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-01-01 22:05:14,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-01 22:05:14,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-01-01 22:05:14,159 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-01-01 22:05:14,160 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-01-01 22:05:14,160 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 22:05:14,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2019-01-01 22:05:14,161 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 22:05:14,161 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:05:14,161 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:05:14,161 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:05:14,161 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:05:14,162 INFO L794 eck$LassoCheckResult]: Stem: 437#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 434#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 435#L382 assume !(main_~length1~0 < 1); 436#L382-2 assume !(main_~length2~0 < 1); 433#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 429#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 430#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 443#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 447#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 446#L372-3 assume !cstrspn_#t~short210;havoc cstrspn_#t~mem209;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem208; 425#L372-6 call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 426#L374 assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 427#L369-3 cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, cstrspn_#t~post205.offset - 1;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 428#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 432#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 442#L372-5 [2019-01-01 22:05:14,162 INFO L796 eck$LassoCheckResult]: Loop: 442#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 438#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 439#L372-3 assume !!cstrspn_#t~short210;havoc cstrspn_#t~mem209;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem208;cstrspn_#t~post211.base, cstrspn_#t~post211.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post211.base, cstrspn_#t~post211.offset - 1;havoc cstrspn_#t~post211.base, cstrspn_#t~post211.offset; 442#L372-5 [2019-01-01 22:05:14,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:14,162 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2019-01-01 22:05:14,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:14,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:14,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:14,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:05:14,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:14,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:14,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:14,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:14,202 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2019-01-01 22:05:14,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:14,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:14,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:14,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:05:14,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:14,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:14,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:14,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2019-01-01 22:05:14,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:14,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:14,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:14,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:05:14,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:14,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:14,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:14,508 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-01-01 22:05:15,135 WARN L181 SmtUtils]: Spent 622.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 139 [2019-01-01 22:05:16,183 WARN L181 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 111 DAG size of output: 111 [2019-01-01 22:05:16,186 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:05:16,186 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:05:16,186 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:05:16,186 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:05:16,186 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:05:16,186 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:05:16,186 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:05:16,186 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:05:16,186 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_reverse_alloca_true-termination.c.i_Iteration5_Lasso [2019-01-01 22:05:16,187 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:05:16,187 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:05:16,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:16,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:16,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:16,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:16,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:16,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:16,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:16,542 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-01 22:05:17,396 WARN L181 SmtUtils]: Spent 851.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 103 [2019-01-01 22:05:17,550 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-01-01 22:05:17,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:17,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:17,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:17,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:17,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:17,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:17,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:17,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:17,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:17,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:17,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:18,724 WARN L181 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 163 DAG size of output: 134 [2019-01-01 22:05:18,840 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-01 22:05:29,492 WARN L181 SmtUtils]: Spent 10.59 s on a formula simplification. DAG size of input: 192 DAG size of output: 139 [2019-01-01 22:05:30,535 WARN L181 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-01-01 22:05:30,556 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:05:30,557 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:05:30,557 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 [2019-01-01 22:05:30,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:30,558 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:30,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:30,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:30,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:30,559 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:30,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:30,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:30,560 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 [2019-01-01 22:05:30,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:30,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:30,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:30,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:30,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:30,561 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:30,561 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:30,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:30,562 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 [2019-01-01 22:05:30,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:30,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:30,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:30,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:30,564 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:30,564 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:30,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:30,566 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 [2019-01-01 22:05:30,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:30,566 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:30,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:30,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:30,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:30,567 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:30,567 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:30,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:30,568 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 [2019-01-01 22:05:30,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:30,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:30,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:30,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:30,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:30,569 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:30,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:30,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:30,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 [2019-01-01 22:05:30,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:30,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:30,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:30,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:30,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:30,571 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:30,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:30,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:30,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 [2019-01-01 22:05:30,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:30,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:30,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:30,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:30,574 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:30,574 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:30,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:30,579 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 [2019-01-01 22:05:30,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:30,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:30,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:30,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:30,580 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:30,581 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:30,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:30,582 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 [2019-01-01 22:05:30,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:30,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:30,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:30,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:30,584 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:30,584 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:30,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:30,585 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 [2019-01-01 22:05:30,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:30,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:30,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:30,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:30,587 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:30,587 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:30,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:30,589 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 [2019-01-01 22:05:30,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:30,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:30,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:30,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:30,590 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:30,590 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:30,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:30,592 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 [2019-01-01 22:05:30,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:30,594 INFO L205 nArgumentSynthesizer]: 16 stem disjuncts [2019-01-01 22:05:30,594 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2019-01-01 22:05:30,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:30,873 INFO L402 nArgumentSynthesizer]: We have 276 Motzkin's Theorem applications. [2019-01-01 22:05:30,873 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2019-01-01 22:05:40,570 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:05:44,276 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2019-01-01 22:05:44,276 INFO L444 ModelExtractionUtils]: 419 out of 430 variables were initially zero. Simplification set additionally 8 variables to zero. [2019-01-01 22:05:44,279 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:05:44,285 INFO L440 nArgumentSynthesizer]: Removed 12 redundant supporting invariants from a total of 12. [2019-01-01 22:05:44,288 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:05:44,290 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_3, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_3 + 2*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2019-01-01 22:05:44,605 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2019-01-01 22:05:44,607 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 22:05:44,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:44,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:44,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:44,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:44,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:05:44,732 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 [2019-01-01 22:05:44,732 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-01 22:05:44,812 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 51 transitions. Complement of second has 6 states. [2019-01-01 22:05:44,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 22:05:44,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 22:05:44,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-01 22:05:44,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-01 22:05:44,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:44,815 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 22:05:44,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:44,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:44,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:44,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:44,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:44,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:05:44,959 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 22:05:44,960 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-01 22:05:45,034 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 51 transitions. Complement of second has 6 states. [2019-01-01 22:05:45,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 22:05:45,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 22:05:45,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-01 22:05:45,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-01 22:05:45,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:45,037 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 22:05:45,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:45,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:45,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:45,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:45,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:45,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:05:45,150 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 22:05:45,150 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-01 22:05:45,193 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 53 transitions. Complement of second has 5 states. [2019-01-01 22:05:45,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 22:05:45,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 22:05:45,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2019-01-01 22:05:45,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-01 22:05:45,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:45,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2019-01-01 22:05:45,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:45,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2019-01-01 22:05:45,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:45,198 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2019-01-01 22:05:45,200 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:05:45,201 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2019-01-01 22:05:45,201 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 22:05:45,201 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 22:05:45,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 22:05:45,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:05:45,201 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:05:45,201 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:05:45,201 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:05:45,201 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 22:05:45,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 22:05:45,202 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:05:45,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 22:05:45,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 10:05:45 BoogieIcfgContainer [2019-01-01 22:05:45,209 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 22:05:45,209 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 22:05:45,209 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 22:05:45,209 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 22:05:45,210 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:05:04" (3/4) ... [2019-01-01 22:05:45,214 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 22:05:45,214 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 22:05:45,215 INFO L168 Benchmark]: Toolchain (without parser) took 42348.14 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 948.7 MB in the beginning and 1.3 GB in the end (delta: -369.5 MB). Peak memory consumption was 844.8 MB. Max. memory is 11.5 GB. [2019-01-01 22:05:45,216 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:05:45,216 INFO L168 Benchmark]: CACSL2BoogieTranslator took 740.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -187.4 MB). Peak memory consumption was 42.8 MB. Max. memory is 11.5 GB. [2019-01-01 22:05:45,217 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.24 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-01 22:05:45,218 INFO L168 Benchmark]: Boogie Preprocessor took 55.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:05:45,219 INFO L168 Benchmark]: RCFGBuilder took 553.80 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: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-01-01 22:05:45,220 INFO L168 Benchmark]: BuchiAutomizer took 40927.56 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -206.7 MB). Peak memory consumption was 865.5 MB. Max. memory is 11.5 GB. [2019-01-01 22:05:45,220 INFO L168 Benchmark]: Witness Printer took 4.80 ms. Allocated memory is still 2.2 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:05:45,225 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 740.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -187.4 MB). Peak memory consumption was 42.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.24 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 553.80 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: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 40927.56 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -206.7 MB). Peak memory consumption was 865.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.80 ms. Allocated memory is still 2.2 GB. Free memory is still 1.3 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 - 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 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * sc1 + 1 and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length2 * sizeof(char))] + 2 * s and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length2 * sizeof(char))] + 2 * s and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 40.8s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 39.4s. Construction of modules took 0.1s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 108 SDtfs, 139 SDslu, 75 SDs, 0 SdLazy, 96 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital373 mio100 ax100 hnf99 lsp92 ukn75 mio100 lsp66 div102 bol100 ite100 ukn100 eq188 hnf88 smp85 dnf1652 smp43 tf100 neg97 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 13694ms VariablesStem: 34 VariablesLoop: 18 DisjunctsStem: 16 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 276 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...