./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash cb5770b8d32c05b82025135c2b222cf31b0a4100 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 02:26:41,797 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:26:41,799 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:26:41,815 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:26:41,815 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:26:41,816 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:26:41,817 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:26:41,819 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:26:41,821 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:26:41,822 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:26:41,823 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:26:41,823 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:26:41,824 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:26:41,825 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:26:41,827 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:26:41,828 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:26:41,829 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:26:41,831 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:26:41,833 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:26:41,835 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:26:41,836 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:26:41,837 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:26:41,840 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:26:41,841 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:26:41,841 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:26:41,842 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:26:41,844 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:26:41,845 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:26:41,846 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:26:41,847 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:26:41,847 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:26:41,848 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:26:41,848 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:26:41,848 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:26:41,849 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:26:41,850 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:26:41,851 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:26:41,869 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:26:41,869 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:26:41,871 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:26:41,871 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:26:41,871 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:26:41,871 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:26:41,872 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:26:41,872 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:26:41,872 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:26:41,872 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:26:41,872 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:26:41,872 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:26:41,873 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:26:41,873 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:26:41,873 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:26:41,873 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:26:41,873 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:26:41,874 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:26:41,874 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:26:41,874 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:26:41,874 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:26:41,874 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:26:41,874 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:26:41,875 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:26:41,877 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:26:41,877 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:26:41,877 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:26:41,877 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:26:41,878 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:26:41,879 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cb5770b8d32c05b82025135c2b222cf31b0a4100 [2019-01-14 02:26:41,939 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:26:41,953 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:26:41,957 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:26:41,959 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:26:41,959 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:26:41,960 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca_true-termination.c.i [2019-01-14 02:26:42,018 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86df5a77b/79b77597952b46f9874b3e19a023b6b6/FLAG1349970a8 [2019-01-14 02:26:42,573 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:26:42,574 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca_true-termination.c.i [2019-01-14 02:26:42,596 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86df5a77b/79b77597952b46f9874b3e19a023b6b6/FLAG1349970a8 [2019-01-14 02:26:42,855 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86df5a77b/79b77597952b46f9874b3e19a023b6b6 [2019-01-14 02:26:42,859 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:26:42,860 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:26:42,862 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:26:42,862 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:26:42,866 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:26:42,867 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:26:42" (1/1) ... [2019-01-14 02:26:42,870 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10e2c51a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:42, skipping insertion in model container [2019-01-14 02:26:42,870 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:26:42" (1/1) ... [2019-01-14 02:26:42,879 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:26:42,942 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:26:43,436 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:26:43,459 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:26:43,540 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:26:43,745 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:26:43,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:43 WrapperNode [2019-01-14 02:26:43,746 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:26:43,749 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:26:43,749 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:26:43,749 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:26:43,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:43" (1/1) ... [2019-01-14 02:26:43,797 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:43" (1/1) ... [2019-01-14 02:26:43,852 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:26:43,854 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:26:43,855 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:26:43,855 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:26:43,869 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:43" (1/1) ... [2019-01-14 02:26:43,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:43" (1/1) ... [2019-01-14 02:26:43,885 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:43" (1/1) ... [2019-01-14 02:26:43,885 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:43" (1/1) ... [2019-01-14 02:26:43,901 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:43" (1/1) ... [2019-01-14 02:26:43,914 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:43" (1/1) ... [2019-01-14 02:26:43,917 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:43" (1/1) ... [2019-01-14 02:26:43,920 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:26:43,921 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:26:43,922 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:26:43,922 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:26:43,923 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:43" (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 02:26:43,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:26:43,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:26:43,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:26:43,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:26:43,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:26:43,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:26:44,702 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:26:44,702 INFO L286 CfgBuilder]: Removed 12 assue(true) statements. [2019-01-14 02:26:44,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:26:44 BoogieIcfgContainer [2019-01-14 02:26:44,705 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:26:44,706 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:26:44,707 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:26:44,711 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:26:44,712 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:26:44,713 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:26:42" (1/3) ... [2019-01-14 02:26:44,715 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@676bc888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:26:44, skipping insertion in model container [2019-01-14 02:26:44,717 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:26:44,717 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:43" (2/3) ... [2019-01-14 02:26:44,717 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@676bc888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:26:44, skipping insertion in model container [2019-01-14 02:26:44,718 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:26:44,718 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:26:44" (3/3) ... [2019-01-14 02:26:44,721 INFO L375 chiAutomizerObserver]: Analyzing ICFG HarrisLalNoriRajamani-2010SAS-Fig1-alloca_true-termination.c.i [2019-01-14 02:26:44,791 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:26:44,792 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:26:44,792 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:26:44,793 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:26:44,793 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:26:44,793 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:26:44,793 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:26:44,793 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:26:44,793 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:26:44,810 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-01-14 02:26:44,836 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-01-14 02:26:44,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:26:44,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:26:44,845 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 02:26:44,846 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:26:44,846 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:26:44,846 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-01-14 02:26:44,849 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-01-14 02:26:44,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:26:44,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:26:44,849 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 02:26:44,850 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:26:44,859 INFO L794 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 14#L-1true havoc main_#res;havoc main_#t~nondet21; 8#L578true assume 0 != main_#t~nondet21;havoc main_#t~nondet21;f_#in~d := 1;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.allocOnStack(4);f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset;call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(1, f_~x~0.base, f_~x~0.offset, 4);call write~int(1, f_~y~0.base, f_~y~0.offset, 4);call write~int(1, f_~k~0.base, f_~k~0.offset, 4);call write~int(1, f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); 3#L558true assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 23#L562-2true [2019-01-14 02:26:44,859 INFO L796 eck$LassoCheckResult]: Loop: 23#L562-2true call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); 18#L562true assume !!(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem9;havoc f_#t~mem8;call f_#t~mem10 := read~int(f_~z~0.base, f_~z~0.offset, 4);call write~int(2 * f_#t~mem10, f_~z~0.base, f_~z~0.offset, 4);havoc f_#t~mem10; 23#L562-2true [2019-01-14 02:26:44,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:44,866 INFO L82 PathProgramCache]: Analyzing trace with hash 925608, now seen corresponding path program 1 times [2019-01-14 02:26:44,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:44,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:44,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:44,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:26:44,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:45,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:45,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:45,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:45,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1446, now seen corresponding path program 1 times [2019-01-14 02:26:45,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:45,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:45,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:45,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:26:45,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:45,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:45,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:45,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:45,148 INFO L82 PathProgramCache]: Analyzing trace with hash 889509773, now seen corresponding path program 1 times [2019-01-14 02:26:45,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:45,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:45,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:45,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:26:45,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:45,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:45,714 WARN L181 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 18 [2019-01-14 02:26:45,837 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 02:26:45,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:26:45,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 02:26:45,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 02:26:45,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 02:26:45,985 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2019-01-14 02:26:46,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:26:46,537 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2019-01-14 02:26:46,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 02:26:46,542 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 50 transitions. [2019-01-14 02:26:46,545 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 02:26:46,553 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 29 states and 38 transitions. [2019-01-14 02:26:46,555 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-01-14 02:26:46,556 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-01-14 02:26:46,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 38 transitions. [2019-01-14 02:26:46,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:26:46,557 INFO L706 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2019-01-14 02:26:46,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 38 transitions. [2019-01-14 02:26:46,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 19. [2019-01-14 02:26:46,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-14 02:26:46,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-01-14 02:26:46,586 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-01-14 02:26:46,587 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-01-14 02:26:46,587 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:26:46,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2019-01-14 02:26:46,589 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 02:26:46,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:26:46,590 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:26:46,591 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:26:46,591 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:26:46,591 INFO L794 eck$LassoCheckResult]: Stem: 93#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 92#L-1 havoc main_#res;havoc main_#t~nondet21; 85#L578 assume 0 != main_#t~nondet21;havoc main_#t~nondet21;f_#in~d := 1;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.allocOnStack(4);f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset;call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(1, f_~x~0.base, f_~x~0.offset, 4);call write~int(1, f_~y~0.base, f_~y~0.offset, 4);call write~int(1, f_~k~0.base, f_~k~0.offset, 4);call write~int(1, f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); 78#L558 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 79#L562-2 call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); 94#L562 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem9;havoc f_#t~mem8; 81#L567-2 [2019-01-14 02:26:46,593 INFO L796 eck$LassoCheckResult]: Loop: 81#L567-2 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 89#L566 assume !f_#t~short13; 90#L566-2 assume !!f_#t~short13;havoc f_#t~mem11;havoc f_#t~mem12;havoc f_#t~short13; 86#L567 assume !(0 != f_#t~nondet14);havoc f_#t~nondet14;call f_#t~mem19 := read~int(f_~y~0.base, f_~y~0.offset, 4);call f_#t~mem20 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(f_#t~mem19 - f_#t~mem20, f_~y~0.base, f_~y~0.offset, 4);havoc f_#t~mem20;havoc f_#t~mem19; 81#L567-2 [2019-01-14 02:26:46,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:46,594 INFO L82 PathProgramCache]: Analyzing trace with hash 889509771, now seen corresponding path program 1 times [2019-01-14 02:26:46,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:46,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:46,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:46,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:26:46,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:46,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:46,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:46,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1759853, now seen corresponding path program 1 times [2019-01-14 02:26:46,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:46,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:46,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:46,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:26:46,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:46,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:46,694 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 02:26:46,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:26:46,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:26:46,695 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:26:46,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:26:46,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:26:46,696 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-14 02:26:46,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:26:46,761 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2019-01-14 02:26:46,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:26:46,765 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2019-01-14 02:26:46,766 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 02:26:46,767 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 22 transitions. [2019-01-14 02:26:46,767 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-01-14 02:26:46,767 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-01-14 02:26:46,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2019-01-14 02:26:46,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:26:46,768 INFO L706 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-01-14 02:26:46,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2019-01-14 02:26:46,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-14 02:26:46,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-14 02:26:46,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2019-01-14 02:26:46,770 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-01-14 02:26:46,771 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-01-14 02:26:46,771 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:26:46,771 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2019-01-14 02:26:46,772 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 02:26:46,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:26:46,772 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:26:46,773 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:26:46,773 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:26:46,774 INFO L794 eck$LassoCheckResult]: Stem: 139#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 137#L-1 havoc main_#res;havoc main_#t~nondet21; 131#L578 assume 0 != main_#t~nondet21;havoc main_#t~nondet21;f_#in~d := 1;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.allocOnStack(4);f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset;call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(1, f_~x~0.base, f_~x~0.offset, 4);call write~int(1, f_~y~0.base, f_~y~0.offset, 4);call write~int(1, f_~k~0.base, f_~k~0.offset, 4);call write~int(1, f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); 124#L558 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 125#L562-2 call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); 140#L562 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem9;havoc f_#t~mem8; 127#L567-2 [2019-01-14 02:26:46,774 INFO L796 eck$LassoCheckResult]: Loop: 127#L567-2 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 135#L566 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 136#L566-2 assume !!f_#t~short13;havoc f_#t~mem11;havoc f_#t~mem12;havoc f_#t~short13; 132#L567 assume !(0 != f_#t~nondet14);havoc f_#t~nondet14;call f_#t~mem19 := read~int(f_~y~0.base, f_~y~0.offset, 4);call f_#t~mem20 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(f_#t~mem19 - f_#t~mem20, f_~y~0.base, f_~y~0.offset, 4);havoc f_#t~mem20;havoc f_#t~mem19; 127#L567-2 [2019-01-14 02:26:46,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:46,774 INFO L82 PathProgramCache]: Analyzing trace with hash 889509771, now seen corresponding path program 2 times [2019-01-14 02:26:46,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:46,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:46,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:46,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:26:46,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:46,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:46,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:46,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:46,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1757931, now seen corresponding path program 1 times [2019-01-14 02:26:46,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:46,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:46,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:46,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:26:46,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:46,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:46,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:46,948 INFO L82 PathProgramCache]: Analyzing trace with hash -260778635, now seen corresponding path program 1 times [2019-01-14 02:26:46,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:46,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:46,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:46,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:26:46,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:46,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:47,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:47,536 WARN L181 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-01-14 02:26:48,886 WARN L181 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 158 DAG size of output: 132 [2019-01-14 02:26:49,462 WARN L181 SmtUtils]: Spent 569.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-01-14 02:26:49,473 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:26:49,475 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:26:49,475 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:26:49,475 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:26:49,475 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:26:49,475 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:26:49,475 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:26:49,475 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:26:49,476 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-2010SAS-Fig1-alloca_true-termination.c.i_Iteration3_Lasso [2019-01-14 02:26:49,476 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:26:49,476 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:26:49,499 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 02:26:49,503 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 02:26:49,507 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 02:26:49,510 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 02:26:49,513 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 02:26:49,531 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 02:26:49,534 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 02:26:49,541 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 02:26:50,814 WARN L181 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 101 [2019-01-14 02:26:51,024 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 82 [2019-01-14 02:26:51,025 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 02:26:51,029 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 02:26:51,030 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 02:26:51,032 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 02:26:51,038 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 02:26:51,040 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 02:26:51,043 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 02:26:51,045 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 02:26:51,047 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 02:26:51,049 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 02:26:51,051 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 02:26:51,054 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 02:26:51,056 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 02:26:51,058 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 02:26:51,061 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 02:26:51,064 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 02:26:51,067 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 02:26:55,355 WARN L181 SmtUtils]: Spent 3.38 s on a formula simplification. DAG size of input: 80 DAG size of output: 80 [2019-01-14 02:26:55,434 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:26:55,440 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:26:55,442 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 02:26:55,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:55,444 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:55,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:55,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:55,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:55,447 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:55,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:55,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:55,450 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 02:26:55,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:55,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:55,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:55,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:55,455 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:55,455 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:55,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:55,459 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 02:26:55,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:55,460 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:55,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:55,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:55,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:55,460 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:55,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:55,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:55,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:55,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:55,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:55,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:55,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:55,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:55,466 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:55,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:55,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:55,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:55,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:55,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:55,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:55,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:55,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:55,472 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:55,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:55,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:55,474 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 02:26:55,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:55,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:55,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:55,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:55,479 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:55,479 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:55,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:55,482 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 02:26:55,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:55,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:55,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:55,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:55,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:55,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:55,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:55,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:55,488 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 02:26:55,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:55,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:55,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:55,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:55,493 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:55,493 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:55,501 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:55,502 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 02:26:55,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:55,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:55,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:55,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:55,507 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:55,507 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:55,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:55,515 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 02:26:55,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:55,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:55,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:55,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:55,518 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:55,518 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:55,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:55,520 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 02:26:55,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:55,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:55,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:55,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:55,530 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:55,530 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:55,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:55,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:55,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:55,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:55,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:55,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:55,566 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:55,569 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:55,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:55,580 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 02:26:55,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:55,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:55,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:55,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:55,582 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:55,583 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:55,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:55,588 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 02:26:55,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:55,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:55,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:55,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:55,592 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:55,593 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:55,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:55,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:55,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:55,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:55,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:55,599 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:55,602 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:55,602 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:55,615 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:26:55,632 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:26:55,633 INFO L444 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:26:55,636 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:26:55,637 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-14 02:26:55,638 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:26:55,639 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~y~0.base) ULTIMATE.start_f_~y~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_f_~y~0.base) ULTIMATE.start_f_~y~0.offset)_1 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_f_~d_ref~0.base) ULTIMATE.start_f_~d_ref~0.offset)_1 - 1 >= 0] [2019-01-14 02:26:55,964 INFO L297 tatePredicateManager]: 60 out of 64 supporting invariants were superfluous and have been removed [2019-01-14 02:26:55,978 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:26:56,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:56,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:56,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:26:56,186 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-01-14 02:26:56,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:56,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-14 02:26:56,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:56,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:56,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-14 02:26:56,489 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-01-14 02:26:56,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:56,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:56,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:56,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 64 [2019-01-14 02:26:56,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:56,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:56,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:56,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:56,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:56,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:56,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-14 02:26:56,586 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:56,625 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:56,696 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:56,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:56,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 251 treesize of output 132 [2019-01-14 02:26:56,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:26:56,845 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:56,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 131 treesize of output 90 [2019-01-14 02:26:56,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 78 [2019-01-14 02:26:56,942 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:57,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 73 [2019-01-14 02:26:57,111 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:57,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:57,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 50 [2019-01-14 02:26:57,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:26:57,259 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:57,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 46 [2019-01-14 02:26:57,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:26:57,289 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:57,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 54 [2019-01-14 02:26:57,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:26:57,337 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:57,356 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:57,365 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:57,377 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:57,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 74 treesize of output 69 [2019-01-14 02:26:57,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 57 [2019-01-14 02:26:57,505 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:57,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 52 [2019-01-14 02:26:57,606 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:57,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 56 [2019-01-14 02:26:57,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:26:57,772 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:57,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:57,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:57,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 61 [2019-01-14 02:26:57,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:26:57,875 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:57,894 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:57,919 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:58,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 52 treesize of output 69 [2019-01-14 02:26:58,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 59 [2019-01-14 02:26:58,112 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:58,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 50 [2019-01-14 02:26:58,201 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:58,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 47 treesize of output 81 [2019-01-14 02:26:58,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 74 [2019-01-14 02:26:58,340 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:58,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 43 [2019-01-14 02:26:58,434 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:58,503 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:26:58,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 71 [2019-01-14 02:26:58,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:26:58,634 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:58,656 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:58,808 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:26:58,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 49 treesize of output 68 [2019-01-14 02:26:58,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 56 [2019-01-14 02:26:58,941 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:59,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2019-01-14 02:26:59,020 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:59,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 77 [2019-01-14 02:26:59,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 67 [2019-01-14 02:26:59,184 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:59,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 46 [2019-01-14 02:26:59,276 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:59,316 INFO L267 ElimStorePlain]: Start of recursive call 35: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:26:59,566 INFO L303 Elim1Store]: Index analysis took 140 ms [2019-01-14 02:26:59,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 76 [2019-01-14 02:26:59,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 64 [2019-01-14 02:26:59,594 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:59,675 INFO L267 ElimStorePlain]: Start of recursive call 38: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:59,699 INFO L267 ElimStorePlain]: Start of recursive call 32: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:59,729 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:59,789 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:26:59,814 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:26:59,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 11 dim-0 vars, and 2 xjuncts. [2019-01-14 02:26:59,875 INFO L202 ElimStorePlain]: Needed 39 recursive calls to eliminate 10 variables, input treesize:315, output treesize:134 [2019-01-14 02:27:00,136 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 50 [2019-01-14 02:27:00,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:27:00,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:27:00,261 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 02:27:00,265 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-14 02:27:00,266 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5 Second operand 6 states. [2019-01-14 02:27:00,549 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5. Second operand 6 states. Result 34 states and 40 transitions. Complement of second has 10 states. [2019-01-14 02:27:00,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:27:00,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 02:27:00,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2019-01-14 02:27:00,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-14 02:27:00,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:27:00,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 10 letters. Loop has 4 letters. [2019-01-14 02:27:00,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:27:00,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 6 letters. Loop has 8 letters. [2019-01-14 02:27:00,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:27:00,555 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 40 transitions. [2019-01-14 02:27:00,558 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 02:27:00,559 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 33 states and 39 transitions. [2019-01-14 02:27:00,559 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-01-14 02:27:00,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-01-14 02:27:00,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 39 transitions. [2019-01-14 02:27:00,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:27:00,560 INFO L706 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2019-01-14 02:27:00,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 39 transitions. [2019-01-14 02:27:00,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2019-01-14 02:27:00,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-14 02:27:00,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2019-01-14 02:27:00,563 INFO L729 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-01-14 02:27:00,563 INFO L609 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-01-14 02:27:00,563 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:27:00,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2019-01-14 02:27:00,564 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 02:27:00,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:27:00,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:27:00,564 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:27:00,564 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:27:00,565 INFO L794 eck$LassoCheckResult]: Stem: 520#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 517#L-1 havoc main_#res;havoc main_#t~nondet21; 506#L578 assume !(0 != main_#t~nondet21);havoc main_#t~nondet21;f_#in~d := 2;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.allocOnStack(4);f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset;call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(1, f_~x~0.base, f_~x~0.offset, 4);call write~int(1, f_~y~0.base, f_~y~0.offset, 4);call write~int(1, f_~k~0.base, f_~k~0.offset, 4);call write~int(1, f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); 503#L558-1 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 504#L562-5 call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); 505#L562-3 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem9;havoc f_#t~mem8; 511#L567-5 [2019-01-14 02:27:00,565 INFO L796 eck$LassoCheckResult]: Loop: 511#L567-5 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 523#L566-5 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 524#L566-7 assume !!f_#t~short13;havoc f_#t~mem11;havoc f_#t~mem12;havoc f_#t~short13; 519#L567-3 assume !(0 != f_#t~nondet14);havoc f_#t~nondet14;call f_#t~mem19 := read~int(f_~y~0.base, f_~y~0.offset, 4);call f_#t~mem20 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(f_#t~mem19 - f_#t~mem20, f_~y~0.base, f_~y~0.offset, 4);havoc f_#t~mem20;havoc f_#t~mem19; 511#L567-5 [2019-01-14 02:27:00,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:27:00,565 INFO L82 PathProgramCache]: Analyzing trace with hash 890987403, now seen corresponding path program 1 times [2019-01-14 02:27:00,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:27:00,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:27:00,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:00,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:27:00,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:00,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:00,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:27:00,602 INFO L82 PathProgramCache]: Analyzing trace with hash 3235563, now seen corresponding path program 1 times [2019-01-14 02:27:00,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:27:00,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:27:00,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:00,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:27:00,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:00,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:00,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:27:00,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1434718859, now seen corresponding path program 1 times [2019-01-14 02:27:00,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:27:00,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:27:00,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:00,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:27:00,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:00,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:00,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:00,893 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-01-14 02:27:01,894 WARN L181 SmtUtils]: Spent 965.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 132 [2019-01-14 02:27:02,241 WARN L181 SmtUtils]: Spent 344.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-01-14 02:27:02,246 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:27:02,247 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:27:02,247 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:27:02,247 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:27:02,247 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:27:02,247 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:27:02,247 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:27:02,247 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:27:02,247 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-2010SAS-Fig1-alloca_true-termination.c.i_Iteration4_Lasso [2019-01-14 02:27:02,248 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:27:02,248 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:27:02,253 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 02:27:02,267 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 02:27:02,269 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 02:27:02,270 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 02:27:02,273 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 02:27:02,276 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 02:27:02,280 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 02:27:02,295 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 02:27:02,296 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 02:27:02,302 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 02:27:02,303 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 02:27:02,306 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 02:27:02,308 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 02:27:02,311 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 02:27:02,314 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 02:27:03,141 WARN L181 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 100 [2019-01-14 02:27:03,331 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2019-01-14 02:27:03,331 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 02:27:03,337 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 02:27:03,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:27:03,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:27:03,350 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 02:27:03,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:27:03,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:27:03,356 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 02:27:03,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:27:03,361 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 02:27:07,021 WARN L181 SmtUtils]: Spent 3.11 s on a formula simplification. DAG size of input: 80 DAG size of output: 80 [2019-01-14 02:27:07,125 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:27:07,125 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:27:07,125 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 02:27:07,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:07,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:27:07,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:07,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:07,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:07,129 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:27:07,130 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:27:07,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:07,131 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 02:27:07,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:07,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:27:07,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:07,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:07,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:07,135 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:27:07,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:27:07,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:07,136 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 02:27:07,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:07,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:27:07,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:07,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:07,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:07,137 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:27:07,137 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:27:07,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:07,142 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 02:27:07,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:07,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:07,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:07,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:07,147 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:27:07,147 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:27:07,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:07,149 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 02:27:07,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:07,150 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:27:07,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:07,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:07,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:07,153 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:27:07,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:27:07,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:07,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:27:07,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:07,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:07,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:07,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:07,159 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:27:07,159 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:27:07,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:07,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:27:07,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:07,162 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:27:07,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:07,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:07,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:07,165 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:27:07,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:27:07,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:07,167 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:27:07,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:07,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:27:07,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:07,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:07,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:07,170 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:27:07,170 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:27:07,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:07,173 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 02:27:07,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:07,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:07,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:07,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:07,176 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:27:07,176 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:27:07,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:07,180 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 02:27:07,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:07,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:27:07,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:07,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:07,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:07,181 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:27:07,181 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:27:07,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:07,186 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 02:27:07,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:07,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:07,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:07,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:07,190 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:27:07,190 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:27:07,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:07,193 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 02:27:07,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:07,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:27:07,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:07,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:07,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:07,194 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:27:07,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:27:07,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:07,199 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 02:27:07,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:07,199 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:27:07,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:07,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:07,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:07,200 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:27:07,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:27:07,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:07,204 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 02:27:07,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:07,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:07,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:07,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:07,209 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:27:07,209 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:27:07,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:07,212 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 02:27:07,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:07,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:07,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:07,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:07,213 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:27:07,213 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:27:07,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:07,219 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 02:27:07,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:07,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:07,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:07,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:07,220 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:27:07,221 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:27:07,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:07,225 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 02:27:07,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:07,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:07,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:07,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:07,227 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:27:07,227 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:27:07,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:07,232 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 02:27:07,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:07,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:07,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:07,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:07,239 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:27:07,239 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:27:07,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:07,254 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 02:27:07,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:07,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:07,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:07,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:07,257 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:27:07,260 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:27:07,273 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:27:07,278 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:27:07,278 INFO L444 ModelExtractionUtils]: 12 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:27:07,279 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:27:07,280 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-14 02:27:07,281 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:27:07,281 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~y~0.base) ULTIMATE.start_f_~y~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_f_~y~0.base) ULTIMATE.start_f_~y~0.offset)_2 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_f_~d_ref~0.base) ULTIMATE.start_f_~d_ref~0.offset)_2 - 2 >= 0] [2019-01-14 02:27:07,861 INFO L297 tatePredicateManager]: 55 out of 59 supporting invariants were superfluous and have been removed [2019-01-14 02:27:07,869 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:27:07,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:27:07,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:27:07,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:27:07,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:07,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-14 02:27:08,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:08,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:08,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-14 02:27:08,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:08,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:08,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:08,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 64 [2019-01-14 02:27:08,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:08,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:08,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:08,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:08,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:08,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:08,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-14 02:27:08,159 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:08,216 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:08,263 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:08,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:08,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 251 treesize of output 132 [2019-01-14 02:27:08,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:27:08,436 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:08,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 79 [2019-01-14 02:27:08,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:27:08,464 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:08,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 62 [2019-01-14 02:27:08,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:27:08,497 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:08,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 65 [2019-01-14 02:27:08,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:27:08,536 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:08,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 77 [2019-01-14 02:27:08,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:27:08,587 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:08,614 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:08,624 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:08,636 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:08,646 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:08,658 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:08,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-01-14 02:27:08,702 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 10 variables, input treesize:312, output treesize:83 [2019-01-14 02:27:08,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:27:08,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:27:08,966 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 02:27:08,967 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-14 02:27:08,967 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-01-14 02:27:10,104 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 8. Second operand 6 states. Result 37 states and 44 transitions. Complement of second has 10 states. [2019-01-14 02:27:10,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:27:10,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 02:27:10,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-01-14 02:27:10,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-14 02:27:10,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:27:10,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 10 letters. Loop has 4 letters. [2019-01-14 02:27:10,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:27:10,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 6 letters. Loop has 8 letters. [2019-01-14 02:27:10,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:27:10,109 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 44 transitions. [2019-01-14 02:27:10,111 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 02:27:10,112 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 36 states and 43 transitions. [2019-01-14 02:27:10,112 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-01-14 02:27:10,112 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-01-14 02:27:10,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 43 transitions. [2019-01-14 02:27:10,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:27:10,114 INFO L706 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2019-01-14 02:27:10,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 43 transitions. [2019-01-14 02:27:10,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-01-14 02:27:10,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-14 02:27:10,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2019-01-14 02:27:10,117 INFO L729 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2019-01-14 02:27:10,118 INFO L609 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2019-01-14 02:27:10,118 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:27:10,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 42 transitions. [2019-01-14 02:27:10,121 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 02:27:10,121 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:27:10,121 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:27:10,122 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:27:10,122 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:27:10,122 INFO L794 eck$LassoCheckResult]: Stem: 887#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 886#L-1 havoc main_#res;havoc main_#t~nondet21; 872#L578 assume 0 != main_#t~nondet21;havoc main_#t~nondet21;f_#in~d := 1;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.allocOnStack(4);f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset;call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(1, f_~x~0.base, f_~x~0.offset, 4);call write~int(1, f_~y~0.base, f_~y~0.offset, 4);call write~int(1, f_~k~0.base, f_~k~0.offset, 4);call write~int(1, f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); 865#L558 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 866#L562-2 call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); 891#L562 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem9;havoc f_#t~mem8; 892#L567-2 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 878#L566 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 879#L566-2 assume !!f_#t~short13;havoc f_#t~mem11;havoc f_#t~mem12;havoc f_#t~short13; 873#L567 assume 0 != f_#t~nondet14;havoc f_#t~nondet14; 867#L568 [2019-01-14 02:27:10,122 INFO L796 eck$LassoCheckResult]: Loop: 867#L568 call f_#t~mem15 := read~int(f_~x~0.base, f_~x~0.offset, 4);call f_#t~mem16 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(f_#t~mem15 - f_#t~mem16, f_~x~0.base, f_~x~0.offset, 4);havoc f_#t~mem15;havoc f_#t~mem16;call write~int(f_#t~nondet17, f_~y~0.base, f_~y~0.offset, 4);havoc f_#t~nondet17;call f_#t~mem18 := read~int(f_~z~0.base, f_~z~0.offset, 4);call write~int(f_#t~mem18 - 1, f_~z~0.base, f_~z~0.offset, 4);havoc f_#t~mem18; 868#L567-2 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 882#L566 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 897#L566-2 assume !!f_#t~short13;havoc f_#t~mem11;havoc f_#t~mem12;havoc f_#t~short13; 896#L567 assume 0 != f_#t~nondet14;havoc f_#t~nondet14; 867#L568 [2019-01-14 02:27:10,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:27:10,122 INFO L82 PathProgramCache]: Analyzing trace with hash -260778639, now seen corresponding path program 1 times [2019-01-14 02:27:10,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:27:10,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:27:10,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:10,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:27:10,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:10,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:10,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:10,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:27:10,158 INFO L82 PathProgramCache]: Analyzing trace with hash 69174960, now seen corresponding path program 1 times [2019-01-14 02:27:10,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:27:10,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:27:10,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:10,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:27:10,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:10,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:10,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:10,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:27:10,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1938200384, now seen corresponding path program 1 times [2019-01-14 02:27:10,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:27:10,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:27:10,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:10,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:27:10,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:10,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:27:10,792 WARN L181 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2019-01-14 02:27:10,943 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2019-01-14 02:27:11,040 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:27:11,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:27:11,040 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:27:11,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:27:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:27:11,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:27:11,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:11,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-14 02:27:11,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:11,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:11,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-14 02:27:11,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:11,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:11,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:11,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:11,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-14 02:27:11,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:11,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:11,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:11,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:11,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:11,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:11,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-14 02:27:11,393 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:11,433 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:11,478 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:11,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:11,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 251 treesize of output 132 [2019-01-14 02:27:11,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:27:11,605 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:11,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 79 [2019-01-14 02:27:11,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:27:11,634 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:11,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 62 [2019-01-14 02:27:11,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:27:11,677 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:11,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 65 [2019-01-14 02:27:11,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:27:11,733 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:11,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 77 [2019-01-14 02:27:11,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:27:11,826 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:11,856 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:11,867 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:11,878 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:11,889 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:11,899 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:11,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 02:27:11,939 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 3 variables, input treesize:308, output treesize:82 [2019-01-14 02:27:12,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:12,126 INFO L303 Elim1Store]: Index analysis took 120 ms [2019-01-14 02:27:12,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 149 [2019-01-14 02:27:12,242 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-01-14 02:27:12,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:12,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2019-01-14 02:27:12,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:12,404 INFO L303 Elim1Store]: Index analysis took 114 ms [2019-01-14 02:27:12,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 107 [2019-01-14 02:27:12,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2019-01-14 02:27:12,414 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:12,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:12,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 104 [2019-01-14 02:27:12,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:12,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2019-01-14 02:27:12,517 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:12,546 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:12,559 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:12,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:12,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-14 02:27:12,610 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:237, output treesize:61 [2019-01-14 02:27:12,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:27:12,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:27:12,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2019-01-14 02:27:12,829 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-01-14 02:27:12,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 02:27:12,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-01-14 02:27:12,886 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. cyclomatic complexity: 11 Second operand 10 states. [2019-01-14 02:27:13,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:27:13,445 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2019-01-14 02:27:13,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 02:27:13,446 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 60 transitions. [2019-01-14 02:27:13,447 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 02:27:13,448 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 42 states and 48 transitions. [2019-01-14 02:27:13,448 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-01-14 02:27:13,449 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-01-14 02:27:13,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 48 transitions. [2019-01-14 02:27:13,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:27:13,449 INFO L706 BuchiCegarLoop]: Abstraction has 42 states and 48 transitions. [2019-01-14 02:27:13,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 48 transitions. [2019-01-14 02:27:13,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2019-01-14 02:27:13,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-14 02:27:13,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2019-01-14 02:27:13,455 INFO L729 BuchiCegarLoop]: Abstraction has 39 states and 45 transitions. [2019-01-14 02:27:13,455 INFO L609 BuchiCegarLoop]: Abstraction has 39 states and 45 transitions. [2019-01-14 02:27:13,455 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:27:13,455 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 45 transitions. [2019-01-14 02:27:13,456 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 02:27:13,456 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:27:13,456 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:27:13,456 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:27:13,457 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:27:13,457 INFO L794 eck$LassoCheckResult]: Stem: 1048#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1047#L-1 havoc main_#res;havoc main_#t~nondet21; 1030#L578 assume !(0 != main_#t~nondet21);havoc main_#t~nondet21;f_#in~d := 2;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.allocOnStack(4);f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset;call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(1, f_~x~0.base, f_~x~0.offset, 4);call write~int(1, f_~y~0.base, f_~y~0.offset, 4);call write~int(1, f_~k~0.base, f_~k~0.offset, 4);call write~int(1, f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); 1027#L558-1 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 1028#L562-5 call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); 1029#L562-3 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem9;havoc f_#t~mem8; 1055#L567-5 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 1052#L566-5 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 1053#L566-7 assume !!f_#t~short13;havoc f_#t~mem11;havoc f_#t~mem12;havoc f_#t~short13; 1044#L567-3 assume 0 != f_#t~nondet14;havoc f_#t~nondet14; 1034#L568-1 [2019-01-14 02:27:13,457 INFO L796 eck$LassoCheckResult]: Loop: 1034#L568-1 call f_#t~mem15 := read~int(f_~x~0.base, f_~x~0.offset, 4);call f_#t~mem16 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(f_#t~mem15 - f_#t~mem16, f_~x~0.base, f_~x~0.offset, 4);havoc f_#t~mem15;havoc f_#t~mem16;call write~int(f_#t~nondet17, f_~y~0.base, f_~y~0.offset, 4);havoc f_#t~nondet17;call f_#t~mem18 := read~int(f_~z~0.base, f_~z~0.offset, 4);call write~int(f_#t~mem18 - 1, f_~z~0.base, f_~z~0.offset, 4);havoc f_#t~mem18; 1035#L567-5 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 1050#L566-5 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 1059#L566-7 assume !!f_#t~short13;havoc f_#t~mem11;havoc f_#t~mem12;havoc f_#t~short13; 1058#L567-3 assume 0 != f_#t~nondet14;havoc f_#t~nondet14; 1034#L568-1 [2019-01-14 02:27:13,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:27:13,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1434718863, now seen corresponding path program 1 times [2019-01-14 02:27:13,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:27:13,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:27:13,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:13,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:27:13,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:13,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:13,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:27:13,492 INFO L82 PathProgramCache]: Analyzing trace with hash 114981600, now seen corresponding path program 1 times [2019-01-14 02:27:13,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:27:13,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:27:13,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:13,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:27:13,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:13,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:13,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:13,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:27:13,507 INFO L82 PathProgramCache]: Analyzing trace with hash -588680336, now seen corresponding path program 1 times [2019-01-14 02:27:13,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:27:13,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:27:13,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:13,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:27:13,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:13,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:27:13,720 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-14 02:27:13,794 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:27:13,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:27:13,795 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:27:13,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:27:13,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:27:13,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:27:13,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-14 02:27:13,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:13,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:13,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-14 02:27:14,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:14,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:14,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:14,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:14,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-14 02:27:14,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:14,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:14,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:14,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:14,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:14,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:14,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-14 02:27:14,093 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:14,131 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:14,165 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:14,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:14,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 251 treesize of output 132 [2019-01-14 02:27:14,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:27:14,281 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:14,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:14,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 131 treesize of output 97 [2019-01-14 02:27:14,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 86 [2019-01-14 02:27:14,349 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:14,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:14,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 77 [2019-01-14 02:27:14,507 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:14,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:14,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:14,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 70 [2019-01-14 02:27:14,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:27:14,664 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:14,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:14,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:14,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:14,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 82 [2019-01-14 02:27:14,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2019-01-14 02:27:14,712 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:14,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:14,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:14,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:14,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:14,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 102 [2019-01-14 02:27:14,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2019-01-14 02:27:14,786 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:14,819 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:14,831 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:14,844 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:14,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 50 [2019-01-14 02:27:14,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:27:14,945 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:14,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 46 [2019-01-14 02:27:14,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:27:14,982 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:15,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 54 [2019-01-14 02:27:15,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:27:15,018 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:15,037 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:15,046 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:15,056 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:15,086 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:27:15,114 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:27:15,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-14 02:27:15,170 INFO L202 ElimStorePlain]: Needed 22 recursive calls to eliminate 4 variables, input treesize:306, output treesize:143 [2019-01-14 02:27:15,328 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-01-14 02:27:15,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:15,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:15,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:15,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:15,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:15,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:15,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:15,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:15,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:15,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:15,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 17 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 231 [2019-01-14 02:27:15,594 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 53 [2019-01-14 02:27:15,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:15,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2019-01-14 02:27:15,600 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:15,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:15,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:15,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:15,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:15,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:15,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:15,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:15,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:15,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:15,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:15,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 147 [2019-01-14 02:27:15,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2019-01-14 02:27:15,714 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:16,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:16,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:16,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:16,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:16,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:16,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:16,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:16,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:16,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:16,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:16,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:16,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:16,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:16,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:16,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 19 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 179 [2019-01-14 02:27:16,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:16,298 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 79 treesize of output 86 [2019-01-14 02:27:16,303 INFO L267 ElimStorePlain]: Start of recursive call 7: 12 dim-0 vars, End of recursive call: 12 dim-0 vars, and 9 xjuncts. [2019-01-14 02:27:16,395 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:16,406 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:16,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:16,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:16,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:16,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:16,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 217 treesize of output 167 [2019-01-14 02:27:16,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:16,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 11 [2019-01-14 02:27:16,688 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:16,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:16,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:16,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:16,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:16,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 92 [2019-01-14 02:27:16,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2019-01-14 02:27:16,766 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:16,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:16,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:16,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:16,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:16,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:16,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:16,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 100 [2019-01-14 02:27:16,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:16,896 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 43 [2019-01-14 02:27:16,900 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-14 02:27:16,945 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:16,956 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:16,979 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:17,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-14 02:27:17,035 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 13 variables, input treesize:446, output treesize:70 [2019-01-14 02:27:17,121 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:27:17,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:27:17,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 9 [2019-01-14 02:27:17,403 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-01-14 02:27:17,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 02:27:17,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-01-14 02:27:17,522 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. cyclomatic complexity: 10 Second operand 9 states. [2019-01-14 02:27:17,724 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-01-14 02:27:18,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:27:18,149 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2019-01-14 02:27:18,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 02:27:18,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 63 transitions. [2019-01-14 02:27:18,153 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 02:27:18,154 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 46 states and 51 transitions. [2019-01-14 02:27:18,154 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-01-14 02:27:18,155 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-01-14 02:27:18,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 51 transitions. [2019-01-14 02:27:18,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:27:18,155 INFO L706 BuchiCegarLoop]: Abstraction has 46 states and 51 transitions. [2019-01-14 02:27:18,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 51 transitions. [2019-01-14 02:27:18,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2019-01-14 02:27:18,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-14 02:27:18,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2019-01-14 02:27:18,163 INFO L729 BuchiCegarLoop]: Abstraction has 43 states and 48 transitions. [2019-01-14 02:27:18,163 INFO L609 BuchiCegarLoop]: Abstraction has 43 states and 48 transitions. [2019-01-14 02:27:18,163 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 02:27:18,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 48 transitions. [2019-01-14 02:27:18,164 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 02:27:18,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:27:18,165 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:27:18,165 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:27:18,165 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:27:18,166 INFO L794 eck$LassoCheckResult]: Stem: 1209#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1208#L-1 havoc main_#res;havoc main_#t~nondet21; 1191#L578 assume 0 != main_#t~nondet21;havoc main_#t~nondet21;f_#in~d := 1;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.allocOnStack(4);f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset;call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(1, f_~x~0.base, f_~x~0.offset, 4);call write~int(1, f_~y~0.base, f_~y~0.offset, 4);call write~int(1, f_~k~0.base, f_~k~0.offset, 4);call write~int(1, f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); 1184#L558 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 1185#L562-2 call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); 1213#L562 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem9;havoc f_#t~mem8; 1214#L567-2 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 1220#L566 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 1206#L566-2 assume !!f_#t~short13;havoc f_#t~mem11;havoc f_#t~mem12;havoc f_#t~short13; 1207#L567 assume !(0 != f_#t~nondet14);havoc f_#t~nondet14;call f_#t~mem19 := read~int(f_~y~0.base, f_~y~0.offset, 4);call f_#t~mem20 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(f_#t~mem19 - f_#t~mem20, f_~y~0.base, f_~y~0.offset, 4);havoc f_#t~mem20;havoc f_#t~mem19; 1201#L567-2 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 1199#L566 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 1200#L566-2 assume !!f_#t~short13;havoc f_#t~mem11;havoc f_#t~mem12;havoc f_#t~short13; 1193#L567 assume !(0 != f_#t~nondet14);havoc f_#t~nondet14;call f_#t~mem19 := read~int(f_~y~0.base, f_~y~0.offset, 4);call f_#t~mem20 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(f_#t~mem19 - f_#t~mem20, f_~y~0.base, f_~y~0.offset, 4);havoc f_#t~mem20;havoc f_#t~mem19; 1194#L567-2 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 1222#L566 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 1221#L566-2 assume !!f_#t~short13;havoc f_#t~mem11;havoc f_#t~mem12;havoc f_#t~short13; 1192#L567 assume 0 != f_#t~nondet14;havoc f_#t~nondet14; 1186#L568 [2019-01-14 02:27:18,166 INFO L796 eck$LassoCheckResult]: Loop: 1186#L568 call f_#t~mem15 := read~int(f_~x~0.base, f_~x~0.offset, 4);call f_#t~mem16 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(f_#t~mem15 - f_#t~mem16, f_~x~0.base, f_~x~0.offset, 4);havoc f_#t~mem15;havoc f_#t~mem16;call write~int(f_#t~nondet17, f_~y~0.base, f_~y~0.offset, 4);havoc f_#t~nondet17;call f_#t~mem18 := read~int(f_~z~0.base, f_~z~0.offset, 4);call write~int(f_#t~mem18 - 1, f_~z~0.base, f_~z~0.offset, 4);havoc f_#t~mem18; 1187#L567-2 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 1197#L566 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 1198#L566-2 assume !!f_#t~short13;havoc f_#t~mem11;havoc f_#t~mem12;havoc f_#t~short13; 1205#L567 assume 0 != f_#t~nondet14;havoc f_#t~nondet14; 1186#L568 [2019-01-14 02:27:18,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:27:18,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1529889349, now seen corresponding path program 1 times [2019-01-14 02:27:18,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:27:18,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:27:18,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:18,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:27:18,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:18,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:27:18,605 WARN L181 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 28 [2019-01-14 02:27:18,811 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:27:18,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:27:18,811 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:27:18,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:27:18,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:27:18,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:27:18,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 251 treesize of output 132 [2019-01-14 02:27:18,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:27:18,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:19,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 131 treesize of output 90 [2019-01-14 02:27:19,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 78 [2019-01-14 02:27:19,012 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:19,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 73 [2019-01-14 02:27:19,190 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:19,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 84 [2019-01-14 02:27:19,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 56 [2019-01-14 02:27:19,522 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:27,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 61 [2019-01-14 02:27:27,197 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:35,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 52 [2019-01-14 02:27:35,049 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:39,533 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:27:39,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 60 treesize of output 94 [2019-01-14 02:27:39,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 67 [2019-01-14 02:27:39,627 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:13,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 39 [2019-01-14 02:28:13,116 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:47,692 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:28:47,704 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:28:47,717 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:28:47,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 55 treesize of output 93 [2019-01-14 02:28:47,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 71 [2019-01-14 02:28:47,850 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:48,118 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:08,468 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:29:08,470 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:29:08,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 51 treesize of output 91 [2019-01-14 02:29:08,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 70 [2019-01-14 02:29:08,582 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:08,754 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:29:09,298 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:29:09,302 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:29:09,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 51 treesize of output 99 [2019-01-14 02:29:09,374 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-14 02:29:09,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 70 [2019-01-14 02:29:09,413 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:09,674 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:10,049 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:29:10,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 48 treesize of output 95 [2019-01-14 02:29:10,120 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-14 02:29:10,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 60 [2019-01-14 02:29:10,165 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:12,053 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:12,185 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, 18 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:15,730 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:29:15,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 86 [2019-01-14 02:29:15,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 63 [2019-01-14 02:29:15,820 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:19,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 47 [2019-01-14 02:29:19,107 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:22,273 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:29:22,274 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:29:22,276 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:29:22,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 51 treesize of output 92 [2019-01-14 02:29:22,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 70 [2019-01-14 02:29:22,403 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:22,522 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:29:24,206 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:29:24,207 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:29:24,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 51 treesize of output 95 [2019-01-14 02:29:24,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 61 [2019-01-14 02:29:24,292 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:24,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 50 [2019-01-14 02:29:24,490 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:24,523 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:25,162 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:29:25,171 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:29:25,172 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:29:25,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 51 treesize of output 92 [2019-01-14 02:29:25,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 70 [2019-01-14 02:29:25,248 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:25,356 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:26,257 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:29:26,259 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:29:26,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 47 treesize of output 91 [2019-01-14 02:29:26,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 56 [2019-01-14 02:29:26,353 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:26,752 INFO L267 ElimStorePlain]: Start of recursive call 32: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:27,085 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:29:27,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 48 treesize of output 99 [2019-01-14 02:29:27,160 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-01-14 02:29:27,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 60 [2019-01-14 02:29:27,182 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:27,559 INFO L267 ElimStorePlain]: Start of recursive call 34: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:27,748 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:29:27,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 40 treesize of output 72 [2019-01-14 02:29:27,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 48 [2019-01-14 02:29:27,814 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:27,909 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:27,979 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-1 vars, 12 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:28,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 53 treesize of output 86 [2019-01-14 02:29:28,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 56 [2019-01-14 02:29:28,420 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:57,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 51 [2019-01-14 02:29:57,813 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:25,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 47 [2019-01-14 02:30:25,060 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:53,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 39 [2019-01-14 02:30:53,078 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:22,563 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:31:22,565 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:31:22,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 43 treesize of output 76 [2019-01-14 02:31:22,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 65 [2019-01-14 02:31:22,636 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:22,714 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:46,172 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:31:46,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 55 treesize of output 101 [2019-01-14 02:31:46,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 74 [2019-01-14 02:31:46,266 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:46,473 INFO L267 ElimStorePlain]: Start of recursive call 45: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:53,652 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:31:53,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 43 treesize of output 82 [2019-01-14 02:31:53,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2019-01-14 02:31:53,729 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:53,854 INFO L267 ElimStorePlain]: Start of recursive call 47: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:58,879 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:31:58,881 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:31:58,882 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:31:58,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 47 treesize of output 85 [2019-01-14 02:31:58,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 56 [2019-01-14 02:31:58,966 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:59,107 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:32:02,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 59 [2019-01-14 02:32:02,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2019-01-14 02:32:02,634 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:02,684 INFO L267 ElimStorePlain]: Start of recursive call 51: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:08,741 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:32:08,743 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:32:08,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 47 treesize of output 91 [2019-01-14 02:32:08,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 56 [2019-01-14 02:32:08,822 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:08,943 INFO L267 ElimStorePlain]: Start of recursive call 53: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:09,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 40 treesize of output 78 [2019-01-14 02:32:09,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2019-01-14 02:32:09,928 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:10,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2019-01-14 02:32:10,101 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:10,153 INFO L267 ElimStorePlain]: Start of recursive call 55: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:10,787 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:32:10,788 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:32:10,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 47 treesize of output 91 [2019-01-14 02:32:10,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 59 [2019-01-14 02:32:10,888 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:11,203 INFO L267 ElimStorePlain]: Start of recursive call 58: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:11,502 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:32:11,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 16 case distinctions, treesize of input 47 treesize of output 97 [2019-01-14 02:32:11,580 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-14 02:32:11,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 56 [2019-01-14 02:32:11,609 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:11,950 INFO L267 ElimStorePlain]: Start of recursive call 60: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:12,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 17 case distinctions, treesize of input 44 treesize of output 93 [2019-01-14 02:32:12,246 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-14 02:32:12,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 51 [2019-01-14 02:32:12,260 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:12,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2019-01-14 02:32:12,726 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:12,779 INFO L267 ElimStorePlain]: Start of recursive call 62: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:12,830 INFO L267 ElimStorePlain]: Start of recursive call 38: 4 dim-1 vars, 18 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:12,859 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:12,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 61 [2019-01-14 02:32:12,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2019-01-14 02:32:12,995 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:13,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 44 [2019-01-14 02:32:13,098 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:13,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 48 [2019-01-14 02:32:13,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2019-01-14 02:32:13,227 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:13,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 31 [2019-01-14 02:32:13,285 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:13,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 59 [2019-01-14 02:32:13,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2019-01-14 02:32:13,384 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:13,466 INFO L267 ElimStorePlain]: Start of recursive call 71: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:13,523 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:32:13,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 55 [2019-01-14 02:32:13,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 43 [2019-01-14 02:32:13,562 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:13,604 INFO L267 ElimStorePlain]: Start of recursive call 73: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:32:13,662 INFO L267 ElimStorePlain]: Start of recursive call 68: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:13,738 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:32:13,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 71 [2019-01-14 02:32:13,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 54 [2019-01-14 02:32:13,787 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:14,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2019-01-14 02:32:14,757 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:15,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2019-01-14 02:32:15,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-14 02:32:15,724 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:15,737 INFO L267 ElimStorePlain]: Start of recursive call 78: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:16,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 42 [2019-01-14 02:32:16,659 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:17,564 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:32:17,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 47 treesize of output 86 [2019-01-14 02:32:17,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 62 [2019-01-14 02:32:17,656 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:17,825 INFO L267 ElimStorePlain]: Start of recursive call 81: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:18,525 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:32:18,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 58 [2019-01-14 02:32:18,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2019-01-14 02:32:18,564 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:18,606 INFO L267 ElimStorePlain]: Start of recursive call 83: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:32:19,019 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:32:19,021 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:32:19,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 45 treesize of output 77 [2019-01-14 02:32:19,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 63 [2019-01-14 02:32:19,076 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:19,138 INFO L267 ElimStorePlain]: Start of recursive call 85: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:32:19,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 32 treesize of output 59 [2019-01-14 02:32:19,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 31 [2019-01-14 02:32:19,348 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:19,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-01-14 02:32:19,460 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:19,490 INFO L267 ElimStorePlain]: Start of recursive call 87: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:19,545 INFO L267 ElimStorePlain]: Start of recursive call 75: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:32:19,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 45 treesize of output 67 [2019-01-14 02:32:19,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2019-01-14 02:32:19,651 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:20,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 39 [2019-01-14 02:32:20,537 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:21,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2019-01-14 02:32:21,395 INFO L267 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:22,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 39 [2019-01-14 02:32:22,272 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:23,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 63 [2019-01-14 02:32:23,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2019-01-14 02:32:23,170 INFO L267 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:23,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2019-01-14 02:32:23,315 INFO L267 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:23,357 INFO L267 ElimStorePlain]: Start of recursive call 95: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:24,025 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:32:24,027 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:32:24,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 39 treesize of output 68 [2019-01-14 02:32:24,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 51 [2019-01-14 02:32:24,082 INFO L267 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:24,130 INFO L267 ElimStorePlain]: Start of recursive call 98: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:24,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 40 treesize of output 78 [2019-01-14 02:32:24,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2019-01-14 02:32:24,878 INFO L267 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:25,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2019-01-14 02:32:25,044 INFO L267 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:25,095 INFO L267 ElimStorePlain]: Start of recursive call 100: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:25,189 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:32:25,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 39 treesize of output 74 [2019-01-14 02:32:25,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 51 [2019-01-14 02:32:25,248 INFO L267 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:25,343 INFO L267 ElimStorePlain]: Start of recursive call 103: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:25,409 INFO L267 ElimStorePlain]: Start of recursive call 90: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:25,429 INFO L267 ElimStorePlain]: Start of recursive call 65: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:25,473 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:25,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:25,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-14 02:32:25,499 INFO L202 ElimStorePlain]: Needed 104 recursive calls to eliminate 4 variables, input treesize:258, output treesize:42 [2019-01-14 02:32:25,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:25,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:25,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 73 [2019-01-14 02:32:25,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:25,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 55 [2019-01-14 02:32:25,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:25,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:25,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2019-01-14 02:32:25,596 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:25,635 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:32:25,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:32:25,652 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:44, output treesize:47 [2019-01-14 02:32:25,756 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 02:32:25,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:32:25,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 13 [2019-01-14 02:32:25,775 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:32:25,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:25,775 INFO L82 PathProgramCache]: Analyzing trace with hash 69174960, now seen corresponding path program 2 times [2019-01-14 02:32:25,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:25,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:25,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:25,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:32:25,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:25,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:26,078 WARN L181 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-01-14 02:32:26,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 02:32:26,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-01-14 02:32:26,149 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. cyclomatic complexity: 9 Second operand 13 states. [2019-01-14 02:32:26,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:32:26,576 INFO L93 Difference]: Finished difference Result 23 states and 22 transitions. [2019-01-14 02:32:26,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 02:32:26,578 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 22 transitions. [2019-01-14 02:32:26,579 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:32:26,579 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 0 states and 0 transitions. [2019-01-14 02:32:26,579 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:32:26,579 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:32:26,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:32:26,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:32:26,581 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:32:26,581 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:32:26,581 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:32:26,581 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 02:32:26,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:32:26,581 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:32:26,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:32:26,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:32:26 BoogieIcfgContainer [2019-01-14 02:32:26,590 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:32:26,591 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:32:26,591 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:32:26,591 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:32:26,592 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:26:44" (3/4) ... [2019-01-14 02:32:26,599 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:32:26,599 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:32:26,602 INFO L168 Benchmark]: Toolchain (without parser) took 343740.34 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 333.4 MB). Free memory was 952.7 MB in the beginning and 1.3 GB in the end (delta: -324.2 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. [2019-01-14 02:32:26,603 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 02:32:26,604 INFO L168 Benchmark]: CACSL2BoogieTranslator took 885.41 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -138.6 MB). Peak memory consumption was 42.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:32:26,604 INFO L168 Benchmark]: Boogie Procedure Inliner took 105.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:32:26,604 INFO L168 Benchmark]: Boogie Preprocessor took 66.57 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:32:26,607 INFO L168 Benchmark]: RCFGBuilder took 783.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-01-14 02:32:26,607 INFO L168 Benchmark]: BuchiAutomizer took 341884.12 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 235.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -230.4 MB). Peak memory consumption was 5.0 MB. Max. memory is 11.5 GB. [2019-01-14 02:32:26,609 INFO L168 Benchmark]: Witness Printer took 8.27 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:32:26,614 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 885.41 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -138.6 MB). Peak memory consumption was 42.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 105.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 66.57 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 783.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 341884.12 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 235.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -230.4 MB). Peak memory consumption was 5.0 MB. Max. memory is 11.5 GB. * Witness Printer took 8.27 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (5 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 6 locations. 5 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 341.8s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 332.5s. Construction of modules took 2.2s. Büchi inclusion checks took 6.8s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 23 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 43 states and ocurred in iteration 6. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 110 SDtfs, 134 SDslu, 239 SDs, 0 SdLazy, 376 SolverSat, 48 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc3 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital560 mio100 ax103 hnf100 lsp93 ukn46 mio100 lsp31 div100 bol100 ite100 ukn100 eq199 hnf87 smp100 dnf1563 smp89 tf100 neg91 sie127 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...