./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/array-memsafety/diff-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f 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/array-memsafety/diff-alloca_true-valid-memsafety_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 986c31897144a5b76f321e97eaa1d3383cce25ed .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 04:57:22,818 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:57:22,819 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:57:22,831 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:57:22,831 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:57:22,832 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:57:22,834 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:57:22,837 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:57:22,838 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:57:22,840 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:57:22,842 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:57:22,843 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:57:22,844 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:57:22,847 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:57:22,852 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:57:22,854 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:57:22,855 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:57:22,858 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:57:22,862 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:57:22,867 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:57:22,868 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:57:22,871 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:57:22,875 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:57:22,876 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:57:22,877 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:57:22,878 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:57:22,879 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:57:22,879 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:57:22,880 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:57:22,881 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:57:22,881 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:57:22,882 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:57:22,882 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:57:22,882 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:57:22,883 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:57:22,884 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:57:22,884 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:57:22,901 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:57:22,901 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:57:22,904 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:57:22,904 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:57:22,905 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:57:22,906 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:57:22,906 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:57:22,906 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:57:22,906 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:57:22,906 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:57:22,906 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:57:22,907 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:57:22,907 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:57:22,907 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:57:22,907 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:57:22,907 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:57:22,907 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:57:22,908 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:57:22,909 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:57:22,909 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:57:22,909 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:57:22,909 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:57:22,909 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:57:22,909 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:57:22,910 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:57:22,910 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:57:22,910 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:57:22,910 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:57:22,911 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:57:22,911 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:57:22,911 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:57:22,915 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:57:22,915 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 986c31897144a5b76f321e97eaa1d3383cce25ed [2019-01-14 04:57:22,976 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:57:22,994 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:57:23,000 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:57:23,002 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:57:23,002 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:57:23,003 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/diff-alloca_true-valid-memsafety_true-termination.i [2019-01-14 04:57:23,062 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/848a8fb89/2a7bba940b904f5c8ce7221200a6d957/FLAGb41253732 [2019-01-14 04:57:23,542 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:57:23,543 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/diff-alloca_true-valid-memsafety_true-termination.i [2019-01-14 04:57:23,558 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/848a8fb89/2a7bba940b904f5c8ce7221200a6d957/FLAGb41253732 [2019-01-14 04:57:23,853 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/848a8fb89/2a7bba940b904f5c8ce7221200a6d957 [2019-01-14 04:57:23,859 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:57:23,861 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:57:23,862 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:57:23,864 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:57:23,867 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:57:23,868 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:57:23" (1/1) ... [2019-01-14 04:57:23,871 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74bc7883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:23, skipping insertion in model container [2019-01-14 04:57:23,872 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:57:23" (1/1) ... [2019-01-14 04:57:23,881 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:57:23,932 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:57:24,280 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:57:24,291 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:57:24,360 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:57:24,416 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:57:24,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:24 WrapperNode [2019-01-14 04:57:24,416 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:57:24,417 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:57:24,417 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:57:24,417 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:57:24,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:24" (1/1) ... [2019-01-14 04:57:24,517 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:24" (1/1) ... [2019-01-14 04:57:24,548 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:57:24,549 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:57:24,549 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:57:24,549 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:57:24,559 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:24" (1/1) ... [2019-01-14 04:57:24,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:24" (1/1) ... [2019-01-14 04:57:24,565 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:24" (1/1) ... [2019-01-14 04:57:24,573 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:24" (1/1) ... [2019-01-14 04:57:24,585 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:24" (1/1) ... [2019-01-14 04:57:24,593 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:24" (1/1) ... [2019-01-14 04:57:24,598 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:24" (1/1) ... [2019-01-14 04:57:24,604 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:57:24,605 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:57:24,608 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:57:24,608 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:57:24,609 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:24" (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-14 04:57:24,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 04:57:24,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 04:57:24,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:57:24,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 04:57:24,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:57:24,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:57:25,200 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:57:25,200 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-14 04:57:25,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:57:25 BoogieIcfgContainer [2019-01-14 04:57:25,202 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:57:25,203 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:57:25,203 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:57:25,206 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:57:25,207 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:57:25,207 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:57:23" (1/3) ... [2019-01-14 04:57:25,208 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5b316084 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:57:25, skipping insertion in model container [2019-01-14 04:57:25,209 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:57:25,209 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:24" (2/3) ... [2019-01-14 04:57:25,209 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5b316084 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:57:25, skipping insertion in model container [2019-01-14 04:57:25,209 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:57:25,209 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:57:25" (3/3) ... [2019-01-14 04:57:25,211 INFO L375 chiAutomizerObserver]: Analyzing ICFG diff-alloca_true-valid-memsafety_true-termination.i [2019-01-14 04:57:25,262 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:57:25,263 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:57:25,263 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:57:25,263 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:57:25,263 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:57:25,263 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:57:25,264 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:57:25,264 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:57:25,264 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:57:25,276 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-14 04:57:25,299 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:57:25,299 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:57:25,300 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:57:25,307 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:57:25,308 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:57:25,308 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:57:25,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-14 04:57:25,310 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:57:25,310 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:57:25,310 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:57:25,310 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:57:25,311 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:57:25,320 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 5#L567true assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 9#L567-2true assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 4#L570-1true call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 7#L547-2true [2019-01-14 04:57:25,322 INFO L796 eck$LassoCheckResult]: Loop: 7#L547-2true assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 16#L551-2true assume !true; 3#L550-2true assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 6#L557-1true diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 7#L547-2true [2019-01-14 04:57:25,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:25,329 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-01-14 04:57:25,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:25,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:25,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:25,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:25,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:25,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:25,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:25,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:25,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1679350, now seen corresponding path program 1 times [2019-01-14 04:57:25,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:25,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:25,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:25,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:25,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:25,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:25,536 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-14 04:57:25,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:57:25,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 04:57:25,543 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:57:25,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 04:57:25,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 04:57:25,563 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2019-01-14 04:57:25,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:57:25,575 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2019-01-14 04:57:25,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 04:57:25,578 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2019-01-14 04:57:25,579 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:57:25,584 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 15 transitions. [2019-01-14 04:57:25,585 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-14 04:57:25,585 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-14 04:57:25,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 15 transitions. [2019-01-14 04:57:25,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:57:25,587 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2019-01-14 04:57:25,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 15 transitions. [2019-01-14 04:57:25,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-14 04:57:25,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-14 04:57:25,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2019-01-14 04:57:25,615 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2019-01-14 04:57:25,615 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2019-01-14 04:57:25,615 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:57:25,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 15 transitions. [2019-01-14 04:57:25,617 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:57:25,617 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:57:25,617 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:57:25,617 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:57:25,617 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:57:25,618 INFO L794 eck$LassoCheckResult]: Stem: 42#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 38#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 39#L567 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 43#L567-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 40#L570-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 41#L547-2 [2019-01-14 04:57:25,618 INFO L796 eck$LassoCheckResult]: Loop: 41#L547-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 45#L551-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 36#L550-2 assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 37#L557-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 41#L547-2 [2019-01-14 04:57:25,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:25,618 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2019-01-14 04:57:25,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:25,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:25,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:25,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:25,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:25,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:25,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:25,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:25,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1669740, now seen corresponding path program 1 times [2019-01-14 04:57:25,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:25,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:25,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:25,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:57:25,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:25,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:25,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:25,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:25,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1298476337, now seen corresponding path program 1 times [2019-01-14 04:57:25,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:25,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:25,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:25,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:25,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:25,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:25,895 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-14 04:57:25,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:57:25,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:57:26,283 WARN L181 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-01-14 04:57:26,409 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-01-14 04:57:26,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:57:26,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:57:26,411 INFO L87 Difference]: Start difference. First operand 10 states and 15 transitions. cyclomatic complexity: 6 Second operand 5 states. [2019-01-14 04:57:26,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:57:26,495 INFO L93 Difference]: Finished difference Result 12 states and 18 transitions. [2019-01-14 04:57:26,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 04:57:26,497 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 18 transitions. [2019-01-14 04:57:26,498 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 04:57:26,500 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 18 transitions. [2019-01-14 04:57:26,500 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-01-14 04:57:26,500 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-01-14 04:57:26,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 18 transitions. [2019-01-14 04:57:26,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:57:26,501 INFO L706 BuchiCegarLoop]: Abstraction has 12 states and 18 transitions. [2019-01-14 04:57:26,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 18 transitions. [2019-01-14 04:57:26,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-01-14 04:57:26,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-14 04:57:26,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2019-01-14 04:57:26,504 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-01-14 04:57:26,504 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-01-14 04:57:26,504 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:57:26,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2019-01-14 04:57:26,505 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 04:57:26,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:57:26,505 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:57:26,506 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:57:26,506 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:57:26,506 INFO L794 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 74#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 75#L567 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 81#L567-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 76#L570-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 77#L547-2 [2019-01-14 04:57:26,507 INFO L796 eck$LassoCheckResult]: Loop: 77#L547-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 82#L551-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 79#L551 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem2;havoc diff_#t~mem3;diff_~found~0 := 1; 80#L551-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 72#L550-2 assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 73#L557-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 77#L547-2 [2019-01-14 04:57:26,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:26,507 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 3 times [2019-01-14 04:57:26,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:26,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:26,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:26,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:26,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:26,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:26,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:26,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:26,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1606183209, now seen corresponding path program 1 times [2019-01-14 04:57:26,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:26,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:26,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:26,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:57:26,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:26,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:26,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:57:26,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:57:26,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 04:57:26,595 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:57:26,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 04:57:26,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 04:57:26,596 INFO L87 Difference]: Start difference. First operand 11 states and 16 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-01-14 04:57:26,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:57:26,653 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2019-01-14 04:57:26,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 04:57:26,654 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2019-01-14 04:57:26,655 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-01-14 04:57:26,656 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 22 transitions. [2019-01-14 04:57:26,657 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-01-14 04:57:26,657 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-14 04:57:26,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2019-01-14 04:57:26,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:57:26,657 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-01-14 04:57:26,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2019-01-14 04:57:26,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 13. [2019-01-14 04:57:26,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-14 04:57:26,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2019-01-14 04:57:26,661 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-01-14 04:57:26,661 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-01-14 04:57:26,661 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:57:26,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2019-01-14 04:57:26,662 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 04:57:26,662 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:57:26,662 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:57:26,662 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:57:26,662 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:57:26,663 INFO L794 eck$LassoCheckResult]: Stem: 113#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 109#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 110#L567 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 117#L567-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 111#L570-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 112#L547-2 [2019-01-14 04:57:26,665 INFO L796 eck$LassoCheckResult]: Loop: 112#L547-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 118#L551-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 114#L551 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem2;havoc diff_#t~mem3;diff_~found~0 := 1; 115#L551-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 107#L550-2 assume !(0 == diff_~found~0); 108#L557-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 112#L547-2 [2019-01-14 04:57:26,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:26,665 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 4 times [2019-01-14 04:57:26,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:26,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:26,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:26,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:26,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:26,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:26,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:26,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1606183271, now seen corresponding path program 1 times [2019-01-14 04:57:26,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:26,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:26,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:26,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:57:26,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:26,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:26,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:26,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:26,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1998160148, now seen corresponding path program 1 times [2019-01-14 04:57:26,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:26,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:26,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:26,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:26,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:26,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:26,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:27,089 WARN L181 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-01-14 04:57:27,819 WARN L181 SmtUtils]: Spent 637.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-01-14 04:57:28,121 WARN L181 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-01-14 04:57:28,135 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:57:28,136 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:57:28,137 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:57:28,137 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:57:28,137 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:57:28,137 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:57:28,137 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:57:28,137 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:57:28,138 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2019-01-14 04:57:28,138 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:57:28,138 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:57:28,165 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-14 04:57:28,171 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-14 04:57:28,175 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-14 04:57:28,184 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-14 04:57:28,202 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-14 04:57:28,207 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-14 04:57:28,210 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-14 04:57:28,221 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-14 04:57:28,228 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-14 04:57:28,254 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-14 04:57:28,814 WARN L181 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 96 [2019-01-14 04:57:28,871 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-14 04:57:28,874 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-14 04:57:28,876 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-14 04:57:28,878 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-14 04:57:28,881 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-14 04:57:29,222 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-01-14 04:57:30,682 WARN L181 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-01-14 04:57:30,887 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:57:30,893 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:57:30,895 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-14 04:57:30,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:30,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:30,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:30,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:30,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:30,901 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:30,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:30,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:30,904 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-14 04:57:30,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:30,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:30,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:30,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:30,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:30,905 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:30,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:30,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:30,906 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-14 04:57:30,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:30,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:30,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:30,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:30,910 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:30,910 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:30,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:30,914 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-14 04:57:30,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:30,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:30,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:30,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:30,919 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:30,919 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:30,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:30,922 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-14 04:57:30,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:30,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:30,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:30,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:30,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:30,926 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:30,926 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:30,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:30,927 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-14 04:57:30,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:30,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:30,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:30,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:30,932 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:30,932 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:30,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:30,936 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-14 04:57:30,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:30,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:30,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:30,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:30,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:30,939 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:30,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:30,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:30,941 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-14 04:57:30,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:30,941 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:30,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:30,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:30,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:30,942 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:30,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:30,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:30,946 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-14 04:57:30,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:30,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:30,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:30,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:30,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:30,950 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:30,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:30,951 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:30,951 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-14 04:57:30,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:30,952 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-14 04:57:30,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:30,952 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:30,970 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-14 04:57:30,971 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:31,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:31,079 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-14 04:57:31,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:31,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:31,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:31,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:31,082 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:31,083 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:31,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:31,086 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-14 04:57:31,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:31,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:31,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:31,087 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:31,088 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:31,090 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:31,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:31,093 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-14 04:57:31,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:31,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:31,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:31,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:31,095 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:31,096 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:31,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:31,103 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-14 04:57:31,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:31,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:31,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:31,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:31,109 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:31,110 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:31,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:31,122 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-14 04:57:31,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:31,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:31,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:31,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:31,126 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:31,127 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:31,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:31,132 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-14 04:57:31,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:31,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:31,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:31,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:31,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:31,136 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:31,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:31,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:31,138 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-14 04:57:31,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:31,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:31,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:31,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:31,144 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:31,144 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:31,171 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:57:31,212 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 04:57:31,214 INFO L444 ModelExtractionUtils]: 35 out of 40 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 04:57:31,217 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:57:31,219 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:57:31,227 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:57:31,228 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~l1~0) = -1*ULTIMATE.start_diff_~i~0 + 1*ULTIMATE.start_diff_~l1~0 Supporting invariants [] [2019-01-14 04:57:31,441 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2019-01-14 04:57:31,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:31,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:31,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:31,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:31,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 04:57:31,583 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-14 04:57:31,583 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-14 04:57:31,693 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 21 states and 30 transitions. Complement of second has 4 states. [2019-01-14 04:57:31,694 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-14 04:57:31,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:57:31,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-01-14 04:57:31,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 5 letters. Loop has 6 letters. [2019-01-14 04:57:31,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:31,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 11 letters. Loop has 6 letters. [2019-01-14 04:57:31,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:31,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 5 letters. Loop has 12 letters. [2019-01-14 04:57:31,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:31,700 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 30 transitions. [2019-01-14 04:57:31,701 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 04:57:31,702 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 24 transitions. [2019-01-14 04:57:31,702 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-14 04:57:31,702 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-14 04:57:31,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2019-01-14 04:57:31,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:57:31,703 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-01-14 04:57:31,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2019-01-14 04:57:31,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-01-14 04:57:31,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-14 04:57:31,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2019-01-14 04:57:31,706 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2019-01-14 04:57:31,706 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2019-01-14 04:57:31,706 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 04:57:31,706 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 23 transitions. [2019-01-14 04:57:31,707 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 04:57:31,707 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:57:31,707 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:57:31,707 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:57:31,707 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:57:31,707 INFO L794 eck$LassoCheckResult]: Stem: 260#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 254#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 255#L567 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 261#L567-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 258#L570-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 259#L547-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 263#L551-2 [2019-01-14 04:57:31,708 INFO L796 eck$LassoCheckResult]: Loop: 263#L551-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 262#L551 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 263#L551-2 [2019-01-14 04:57:31,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:31,708 INFO L82 PathProgramCache]: Analyzing trace with hash 889572242, now seen corresponding path program 1 times [2019-01-14 04:57:31,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:31,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:31,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:31,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:31,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:31,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:31,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:31,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:31,741 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 1 times [2019-01-14 04:57:31,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:31,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:31,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:31,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:31,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:31,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:31,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:31,754 INFO L82 PathProgramCache]: Analyzing trace with hash 180433719, now seen corresponding path program 1 times [2019-01-14 04:57:31,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:31,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:31,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:31,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:31,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:31,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:32,126 WARN L181 SmtUtils]: Spent 319.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-01-14 04:57:32,236 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-01-14 04:57:32,699 WARN L181 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2019-01-14 04:57:33,445 WARN L181 SmtUtils]: Spent 743.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-14 04:57:33,460 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:57:33,460 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:57:33,460 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:57:33,460 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:57:33,462 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:57:33,462 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:57:33,462 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:57:33,462 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:57:33,462 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2019-01-14 04:57:33,463 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:57:33,463 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:57:33,470 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-14 04:57:33,522 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-14 04:57:33,549 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-14 04:57:33,586 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-14 04:57:33,610 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-14 04:57:33,634 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-14 04:57:33,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:33,682 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-14 04:57:33,719 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-14 04:57:33,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:34,927 WARN L181 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 102 [2019-01-14 04:57:34,967 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-14 04:57:34,969 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-14 04:57:34,970 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-14 04:57:34,977 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-14 04:57:34,979 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-14 04:57:35,348 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-01-14 04:57:35,562 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-01-14 04:57:35,804 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-01-14 04:57:36,869 WARN L181 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-01-14 04:57:36,951 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:57:36,951 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:57:36,951 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-14 04:57:36,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:36,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:36,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:36,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:36,956 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:36,957 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:36,959 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:36,960 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-14 04:57:36,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:36,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:36,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:36,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:36,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:36,964 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:36,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:36,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:36,965 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-14 04:57:36,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:36,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:36,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:36,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:36,969 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:36,970 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:36,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:36,972 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-14 04:57:36,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:36,972 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:36,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:36,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:36,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:36,973 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:36,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:36,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:36,977 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-14 04:57:36,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:36,978 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:36,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:36,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:36,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:36,978 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:36,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:36,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:36,982 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-14 04:57:36,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:36,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:36,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:36,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:36,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:36,986 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:36,986 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:36,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:36,988 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-14 04:57:36,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:36,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:36,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:36,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:36,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:36,989 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:36,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:36,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:36,993 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-14 04:57:36,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:36,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:36,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:36,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:36,994 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:36,995 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:36,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:36,999 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-14 04:57:37,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:37,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:37,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:37,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:37,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:37,001 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:37,001 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:37,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:37,002 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-14 04:57:37,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:37,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:37,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:37,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:37,012 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:37,013 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:37,045 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:57:37,078 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-14 04:57:37,079 INFO L444 ModelExtractionUtils]: 66 out of 73 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-14 04:57:37,079 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:57:37,080 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:57:37,081 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:57:37,081 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~B.offset, v_rep(select #length ULTIMATE.start_diff_~B.base)_2, ULTIMATE.start_diff_~j~0) = -1*ULTIMATE.start_diff_~B.offset + 1*v_rep(select #length ULTIMATE.start_diff_~B.base)_2 - 4*ULTIMATE.start_diff_~j~0 Supporting invariants [] [2019-01-14 04:57:37,473 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2019-01-14 04:57:37,484 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 04:57:37,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:37,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:37,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:37,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:37,669 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-14 04:57:37,670 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-14 04:57:37,670 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 23 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-01-14 04:57:37,786 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 23 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 38 states and 53 transitions. Complement of second has 7 states. [2019-01-14 04:57:37,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:57:37,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:57:37,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-14 04:57:37,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-14 04:57:37,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:37,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 8 letters. Loop has 2 letters. [2019-01-14 04:57:37,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:37,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-14 04:57:37,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:37,788 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 53 transitions. [2019-01-14 04:57:37,792 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 04:57:37,793 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 27 states and 39 transitions. [2019-01-14 04:57:37,793 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-14 04:57:37,793 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-14 04:57:37,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 39 transitions. [2019-01-14 04:57:37,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:57:37,793 INFO L706 BuchiCegarLoop]: Abstraction has 27 states and 39 transitions. [2019-01-14 04:57:37,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 39 transitions. [2019-01-14 04:57:37,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2019-01-14 04:57:37,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-14 04:57:37,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2019-01-14 04:57:37,797 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-01-14 04:57:37,797 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-01-14 04:57:37,797 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 04:57:37,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2019-01-14 04:57:37,798 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 04:57:37,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:57:37,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:57:37,798 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:57:37,798 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:57:37,799 INFO L794 eck$LassoCheckResult]: Stem: 422#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 418#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 419#L567 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 427#L567-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 420#L570-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 421#L547-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 429#L551-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 434#L551 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem2;havoc diff_#t~mem3;diff_~found~0 := 1; 431#L551-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 416#L550-2 assume !(0 == diff_~found~0); 417#L557-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 428#L547-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 424#L551-2 [2019-01-14 04:57:37,799 INFO L796 eck$LassoCheckResult]: Loop: 424#L551-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 423#L551 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 424#L551-2 [2019-01-14 04:57:37,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:37,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1813422420, now seen corresponding path program 2 times [2019-01-14 04:57:37,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:37,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:37,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:37,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:37,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:37,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:37,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:37,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:37,836 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 2 times [2019-01-14 04:57:37,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:37,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:37,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:37,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:57:37,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:37,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:37,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:37,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:37,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1057777617, now seen corresponding path program 1 times [2019-01-14 04:57:37,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:37,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:37,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:37,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:57:37,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:37,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:37,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:38,199 WARN L181 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-01-14 04:57:38,466 WARN L181 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-01-14 04:57:39,362 WARN L181 SmtUtils]: Spent 891.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 144 [2019-01-14 04:57:39,573 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2019-01-14 04:57:39,577 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:57:39,577 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:57:39,577 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:57:39,577 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:57:39,577 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:57:39,577 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:57:39,577 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:57:39,577 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:57:39,578 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2019-01-14 04:57:39,578 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:57:39,578 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:57:39,583 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-14 04:57:39,606 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-14 04:57:39,608 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-14 04:57:39,610 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-14 04:57:39,611 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-14 04:57:39,613 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-14 04:57:39,619 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-14 04:57:39,620 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-14 04:57:40,066 WARN L181 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 104 [2019-01-14 04:57:40,118 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-14 04:57:40,120 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-14 04:57:40,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-14 04:57:40,124 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-14 04:57:40,127 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-14 04:57:40,130 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-14 04:57:40,131 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-14 04:57:40,423 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-01-14 04:57:40,787 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-01-14 04:57:41,911 WARN L181 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-01-14 04:57:41,938 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:57:41,938 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:57:41,938 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-14 04:57:41,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:41,941 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:41,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:41,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:41,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:41,943 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:41,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:41,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:41,946 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-14 04:57:41,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:41,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:41,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:41,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:41,947 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:41,947 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:41,951 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:41,952 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-14 04:57:41,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:41,952 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:41,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:41,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:41,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:41,953 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:41,953 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:41,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:41,953 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-14 04:57:41,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:41,959 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:41,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:41,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:41,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:41,960 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:41,960 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:41,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:41,963 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-14 04:57:41,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:41,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:41,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:41,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:41,966 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:41,967 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:41,968 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:41,968 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-14 04:57:41,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:41,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:41,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:41,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:41,973 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:41,974 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:41,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:41,977 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-14 04:57:41,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:41,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:41,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:41,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:41,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:41,978 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:41,978 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:41,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:41,982 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-14 04:57:41,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:41,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:41,983 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:57:41,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:41,988 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-01-14 04:57:41,988 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 04:57:41,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:41,999 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-14 04:57:41,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:42,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:42,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:42,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:42,006 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:42,007 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:42,029 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:57:42,045 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 04:57:42,045 INFO L444 ModelExtractionUtils]: 68 out of 73 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:57:42,046 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:57:42,046 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:57:42,048 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:57:42,048 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~B.offset, ULTIMATE.start_diff_~j~0, v_rep(select #length ULTIMATE.start_diff_~B.base)_3) = -1*ULTIMATE.start_diff_~B.offset - 4*ULTIMATE.start_diff_~j~0 + 1*v_rep(select #length ULTIMATE.start_diff_~B.base)_3 Supporting invariants [] [2019-01-14 04:57:42,218 INFO L297 tatePredicateManager]: 18 out of 18 supporting invariants were superfluous and have been removed [2019-01-14 04:57:42,220 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 04:57:42,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:42,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:42,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:42,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:42,271 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-14 04:57:42,271 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-14 04:57:42,271 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-01-14 04:57:42,304 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 36 states and 51 transitions. Complement of second has 7 states. [2019-01-14 04:57:42,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:57:42,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:57:42,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-14 04:57:42,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 12 letters. Loop has 2 letters. [2019-01-14 04:57:42,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:42,307 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:57:42,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:42,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:42,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:42,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:42,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:42,361 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-14 04:57:42,362 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 04:57:42,362 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-01-14 04:57:42,410 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 36 states and 51 transitions. Complement of second has 7 states. [2019-01-14 04:57:42,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:57:42,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:57:42,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-14 04:57:42,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 12 letters. Loop has 2 letters. [2019-01-14 04:57:42,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:42,413 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:57:42,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:42,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:42,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:42,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:42,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:42,486 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-14 04:57:42,487 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 04:57:42,487 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-01-14 04:57:42,537 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 34 states and 51 transitions. Complement of second has 6 states. [2019-01-14 04:57:42,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:57:42,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:57:42,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2019-01-14 04:57:42,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 12 letters. Loop has 2 letters. [2019-01-14 04:57:42,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:42,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 14 letters. Loop has 2 letters. [2019-01-14 04:57:42,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:42,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 12 letters. Loop has 4 letters. [2019-01-14 04:57:42,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:42,541 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 51 transitions. [2019-01-14 04:57:42,544 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:57:42,545 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 0 states and 0 transitions. [2019-01-14 04:57:42,545 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:57:42,545 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:57:42,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:57:42,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:57:42,545 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:57:42,545 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:57:42,545 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:57:42,545 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 04:57:42,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:57:42,546 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:57:42,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:57:42,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:57:42 BoogieIcfgContainer [2019-01-14 04:57:42,555 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:57:42,555 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:57:42,555 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:57:42,555 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:57:42,556 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:57:25" (3/4) ... [2019-01-14 04:57:42,559 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:57:42,559 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:57:42,560 INFO L168 Benchmark]: Toolchain (without parser) took 18700.67 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 353.4 MB). Free memory was 951.4 MB in the beginning and 1.2 GB in the end (delta: -206.7 MB). Peak memory consumption was 146.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:57:42,561 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-14 04:57:42,561 INFO L168 Benchmark]: CACSL2BoogieTranslator took 555.07 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 929.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-01-14 04:57:42,563 INFO L168 Benchmark]: Boogie Procedure Inliner took 131.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -184.7 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2019-01-14 04:57:42,564 INFO L168 Benchmark]: Boogie Preprocessor took 55.57 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:57:42,564 INFO L168 Benchmark]: RCFGBuilder took 597.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:57:42,565 INFO L168 Benchmark]: BuchiAutomizer took 17352.15 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 225.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -62.2 MB). Peak memory consumption was 163.3 MB. Max. memory is 11.5 GB. [2019-01-14 04:57:42,568 INFO L168 Benchmark]: Witness Printer took 4.01 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:57:42,573 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 555.07 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 929.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 131.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -184.7 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.57 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 597.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 17352.15 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 225.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -62.2 MB). Peak memory consumption was 163.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.01 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 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 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * i + l1 and consists of 3 locations. One deterministic module has affine ranking function -1 * B + unknown-#length-unknown[B] + -4 * j and consists of 4 locations. One nondeterministic module has affine ranking function -1 * B + -4 * j + unknown-#length-unknown[B] and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 17.3s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 16.0s. Construction of modules took 0.3s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 13 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 20 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 110 SDtfs, 118 SDslu, 48 SDs, 0 SdLazy, 77 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital282 mio100 ax100 hnf98 lsp90 ukn87 mio100 lsp50 div100 bol100 ite100 ukn100 eq182 hnf89 smp100 dnf366 smp95 tf100 neg95 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 126ms VariablesStem: 13 VariablesLoop: 4 DisjunctsStem: 8 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 20 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...