./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 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-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-2e94e6a [2019-01-01 21:43:32,943 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:43:32,945 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:43:32,958 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:43:32,959 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:43:32,960 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:43:32,962 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:43:32,964 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:43:32,966 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:43:32,967 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:43:32,968 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:43:32,968 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:43:32,969 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:43:32,971 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:43:32,972 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:43:32,973 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:43:32,974 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:43:32,976 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:43:32,982 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:43:32,984 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:43:32,985 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:43:32,986 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:43:32,989 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:43:32,989 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:43:32,989 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:43:32,990 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:43:32,991 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:43:32,992 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:43:32,993 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:43:32,994 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:43:32,994 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:43:32,995 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:43:32,995 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:43:32,995 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:43:32,996 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:43:32,997 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:43:32,997 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:43:33,030 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:43:33,032 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:43:33,033 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:43:33,033 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:43:33,033 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:43:33,034 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:43:33,034 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:43:33,034 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:43:33,034 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:43:33,034 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:43:33,035 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:43:33,037 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:43:33,038 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:43:33,038 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:43:33,039 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:43:33,039 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:43:33,039 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:43:33,039 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:43:33,040 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:43:33,040 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:43:33,040 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:43:33,040 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:43:33,040 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:43:33,041 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:43:33,041 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:43:33,041 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:43:33,041 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:43:33,041 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:43:33,044 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:43:33,044 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-01 21:43:33,119 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:43:33,137 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:43:33,141 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:43:33,143 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:43:33,144 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:43:33,144 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-01 21:43:33,220 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/661c54551/8112a481389945b1af48a4d3e06b26af/FLAG1ecee3e7d [2019-01-01 21:43:33,756 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:43:33,757 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca_true-termination.c.i [2019-01-01 21:43:33,772 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/661c54551/8112a481389945b1af48a4d3e06b26af/FLAG1ecee3e7d [2019-01-01 21:43:34,074 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/661c54551/8112a481389945b1af48a4d3e06b26af [2019-01-01 21:43:34,078 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:43:34,079 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:43:34,080 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:43:34,080 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:43:34,084 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:43:34,085 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:43:34" (1/1) ... [2019-01-01 21:43:34,088 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2377fee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:43:34, skipping insertion in model container [2019-01-01 21:43:34,088 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:43:34" (1/1) ... [2019-01-01 21:43:34,097 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:43:34,151 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:43:34,553 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:43:34,567 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:43:34,724 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:43:34,784 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:43:34,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:43:34 WrapperNode [2019-01-01 21:43:34,786 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:43:34,786 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:43:34,787 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:43:34,787 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:43:34,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:43:34" (1/1) ... [2019-01-01 21:43:34,818 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:43:34" (1/1) ... [2019-01-01 21:43:34,860 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:43:34,861 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:43:34,861 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:43:34,861 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:43:34,870 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:43:34" (1/1) ... [2019-01-01 21:43:34,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:43:34" (1/1) ... [2019-01-01 21:43:34,877 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:43:34" (1/1) ... [2019-01-01 21:43:34,877 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:43:34" (1/1) ... [2019-01-01 21:43:34,885 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:43:34" (1/1) ... [2019-01-01 21:43:34,891 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:43:34" (1/1) ... [2019-01-01 21:43:34,893 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:43:34" (1/1) ... [2019-01-01 21:43:34,897 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:43:34,898 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:43:34,898 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:43:34,898 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:43:34,899 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:43:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:43:34,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:43:34,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:43:34,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:43:34,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:43:34,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:43:34,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:43:35,755 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:43:35,755 INFO L280 CfgBuilder]: Removed 12 assue(true) statements. [2019-01-01 21:43:35,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:43:35 BoogieIcfgContainer [2019-01-01 21:43:35,756 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:43:35,757 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:43:35,757 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:43:35,763 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:43:35,764 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:43:35,765 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:43:34" (1/3) ... [2019-01-01 21:43:35,767 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@81a4106 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:43:35, skipping insertion in model container [2019-01-01 21:43:35,767 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:43:35,768 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:43:34" (2/3) ... [2019-01-01 21:43:35,768 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@81a4106 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:43:35, skipping insertion in model container [2019-01-01 21:43:35,768 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:43:35,768 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:43:35" (3/3) ... [2019-01-01 21:43:35,772 INFO L375 chiAutomizerObserver]: Analyzing ICFG HarrisLalNoriRajamani-2010SAS-Fig1-alloca_true-termination.c.i [2019-01-01 21:43:35,858 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:43:35,859 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:43:35,859 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:43:35,859 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:43:35,859 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:43:35,859 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:43:35,860 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:43:35,860 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:43:35,860 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:43:35,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-01-01 21:43:35,907 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-01-01 21:43:35,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:43:35,907 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:43:35,917 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:43:35,917 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:43:35,917 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:43:35,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-01-01 21:43:35,920 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-01-01 21:43:35,920 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:43:35,920 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:43:35,921 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:43:35,921 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:43:35,932 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-01 21:43:35,932 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-01 21:43:35,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:35,940 INFO L82 PathProgramCache]: Analyzing trace with hash 925608, now seen corresponding path program 1 times [2019-01-01 21:43:35,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:35,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:36,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:36,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:43:36,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:36,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:36,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:36,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:36,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1446, now seen corresponding path program 1 times [2019-01-01 21:43:36,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:36,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:36,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:36,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:43:36,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:36,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:36,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:36,254 INFO L82 PathProgramCache]: Analyzing trace with hash 889509773, now seen corresponding path program 1 times [2019-01-01 21:43:36,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:36,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:36,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:36,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:43:36,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:36,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:43:36,754 WARN L181 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 18 [2019-01-01 21:43:36,990 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2019-01-01 21:43:37,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:43:37,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:43:37,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 21:43:37,378 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-01-01 21:43:37,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 21:43:37,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 21:43:37,406 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2019-01-01 21:43:37,710 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-01 21:43:37,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:43:37,870 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2019-01-01 21:43:37,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 21:43:37,873 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 50 transitions. [2019-01-01 21:43:37,877 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-01 21:43:37,884 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 29 states and 38 transitions. [2019-01-01 21:43:37,887 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-01-01 21:43:37,887 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-01-01 21:43:37,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 38 transitions. [2019-01-01 21:43:37,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:43:37,889 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2019-01-01 21:43:37,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 38 transitions. [2019-01-01 21:43:37,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 19. [2019-01-01 21:43:37,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-01 21:43:37,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-01-01 21:43:37,931 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-01-01 21:43:37,931 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-01-01 21:43:37,931 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:43:37,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2019-01-01 21:43:37,933 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-01 21:43:37,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:43:37,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:43:37,934 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:43:37,934 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:43:37,934 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-01 21:43:37,935 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~short13;havoc f_#t~mem12;havoc f_#t~mem11; 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-01 21:43:37,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:37,935 INFO L82 PathProgramCache]: Analyzing trace with hash 889509771, now seen corresponding path program 1 times [2019-01-01 21:43:37,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:37,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:37,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:37,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:43:37,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:37,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:38,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:38,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:38,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1759853, now seen corresponding path program 1 times [2019-01-01 21:43:38,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:38,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:38,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:38,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:43:38,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:38,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:43:38,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:43:38,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:43:38,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 21:43:38,073 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:43:38,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:43:38,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:43:38,074 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-01 21:43:38,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:43:38,111 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2019-01-01 21:43:38,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:43:38,112 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2019-01-01 21:43:38,114 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-01 21:43:38,114 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 22 transitions. [2019-01-01 21:43:38,115 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-01-01 21:43:38,115 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-01-01 21:43:38,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2019-01-01 21:43:38,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:43:38,116 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-01-01 21:43:38,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2019-01-01 21:43:38,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-01 21:43:38,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-01 21:43:38,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2019-01-01 21:43:38,118 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-01-01 21:43:38,119 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-01-01 21:43:38,119 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:43:38,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2019-01-01 21:43:38,120 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-01 21:43:38,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:43:38,120 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:43:38,121 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:43:38,121 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:43:38,121 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-01 21:43:38,121 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~short13;havoc f_#t~mem12;havoc f_#t~mem11; 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-01 21:43:38,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:38,122 INFO L82 PathProgramCache]: Analyzing trace with hash 889509771, now seen corresponding path program 2 times [2019-01-01 21:43:38,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:38,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:38,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:38,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:43:38,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:38,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:38,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:38,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1757931, now seen corresponding path program 1 times [2019-01-01 21:43:38,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:38,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:38,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:38,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:43:38,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:38,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:38,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:38,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:38,191 INFO L82 PathProgramCache]: Analyzing trace with hash -260778635, now seen corresponding path program 1 times [2019-01-01 21:43:38,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:38,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:38,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:38,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:43:38,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:38,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:38,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:38,710 WARN L181 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-01-01 21:43:40,104 WARN L181 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 158 DAG size of output: 132 [2019-01-01 21:43:40,678 WARN L181 SmtUtils]: Spent 568.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-01-01 21:43:40,692 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:43:40,693 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:43:40,693 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:43:40,694 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:43:40,694 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:43:40,694 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:43:40,694 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:43:40,694 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:43:40,694 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-2010SAS-Fig1-alloca_true-termination.c.i_Iteration3_Lasso [2019-01-01 21:43:40,695 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:43:40,695 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:43:40,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:40,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:40,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:40,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:40,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:40,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:40,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:40,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:42,149 WARN L181 SmtUtils]: Spent 589.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 101 [2019-01-01 21:43:42,369 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 82 [2019-01-01 21:43:42,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:42,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:42,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:42,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:42,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:42,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:42,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:42,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:42,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:42,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:42,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:42,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:42,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:42,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:42,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:42,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:42,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:46,751 WARN L181 SmtUtils]: Spent 3.52 s on a formula simplification. DAG size of input: 80 DAG size of output: 80 [2019-01-01 21:43:46,830 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:43:46,836 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:43:46,839 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:46,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:46,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:46,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:46,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:46,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:46,846 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:46,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:46,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:46,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:46,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:46,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:46,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:46,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:46,853 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:46,853 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:46,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:46,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:46,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:46,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:46,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:46,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:46,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:46,858 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:46,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:46,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:46,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:46,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:46,859 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:46,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:46,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:46,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:46,860 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:46,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:46,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:46,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:46,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:46,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:46,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:46,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:46,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:46,863 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:46,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:46,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:46,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:46,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:46,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:46,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:46,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:46,867 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:46,867 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:46,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:46,871 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:46,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:46,872 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:46,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:46,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:46,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:46,873 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:46,873 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:46,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:46,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:46,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:46,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:46,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:46,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:46,884 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:46,884 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:46,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:46,908 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:46,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:46,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:46,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:46,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:46,912 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:46,917 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:46,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:46,932 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:46,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:46,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:46,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:46,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:46,939 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:46,939 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:46,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:46,945 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:46,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:46,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:46,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:46,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:46,960 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:46,961 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:47,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:47,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:47,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:47,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:47,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:47,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:47,014 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:47,015 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:47,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:47,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:47,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:47,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:47,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:47,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:47,028 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:47,029 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:47,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:47,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:47,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:47,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:47,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:47,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:47,043 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:47,043 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:47,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:47,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:47,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:47,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:47,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:47,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:47,053 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:47,054 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:47,066 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:43:47,077 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:43:47,077 INFO L444 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:43:47,081 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:43:47,082 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-01 21:43:47,083 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:43:47,084 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-01 21:43:47,730 INFO L297 tatePredicateManager]: 60 out of 64 supporting invariants were superfluous and have been removed [2019-01-01 21:43:47,746 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:43:47,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:47,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:43:47,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:43:47,962 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-01 21:43:47,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:43:47,986 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 34 treesize of output 43 [2019-01-01 21:43:48,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:43:48,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:43:48,096 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 30 treesize of output 45 [2019-01-01 21:43:48,106 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 33 treesize of output 45 [2019-01-01 21:43:48,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:43:48,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:43:48,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:43:48,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:43:48,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-01 21:43:48,184 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 21:43:48,220 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:43:48,256 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:43:48,405 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:43:48,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-01 21:43:48,631 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-01 21:43:48,631 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 21:43:48,684 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 131 treesize of output 90 [2019-01-01 21:43:48,708 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-01 21:43:48,708 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 21:43:48,889 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-01 21:43:48,890 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-01 21:43:49,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:43:49,024 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-01 21:43:49,030 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-01 21:43:49,030 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-01 21:43:49,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 6 case distinctions, treesize of input 42 treesize of output 68 [2019-01-01 21:43:49,149 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-01 21:43:49,149 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-01 21:43:49,817 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 35 treesize of output 32 [2019-01-01 21:43:49,818 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-01 21:43:50,416 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 35 treesize of output 36 [2019-01-01 21:43:50,417 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-01 21:43:51,024 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 42 treesize of output 41 [2019-01-01 21:43:51,025 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-01 21:43:51,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, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 65 [2019-01-01 21:43:51,720 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 54 treesize of output 53 [2019-01-01 21:43:51,721 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-01-01 21:43:51,775 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:43:52,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:43:52,262 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:43:52,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 55 [2019-01-01 21:43:52,279 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-01 21:43:52,280 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-01-01 21:43:52,297 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:43:52,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:43:52,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 38 [2019-01-01 21:43:52,727 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-01 21:43:52,728 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-01-01 21:43:52,740 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:43:53,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 36 treesize of output 60 [2019-01-01 21:43:53,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 49 treesize of output 48 [2019-01-01 21:43:53,045 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-01-01 21:43:53,131 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:43:53,249 INFO L267 ElimStorePlain]: Start of recursive call 13: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:43:53,266 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-01 21:43:53,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 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-01 21:43:53,410 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-01 21:43:53,410 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-01-01 21:43:53,543 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-01 21:43:53,543 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-01-01 21:43:53,777 INFO L303 Elim1Store]: Index analysis took 135 ms [2019-01-01 21:43:53,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 53 treesize of output 90 [2019-01-01 21:43:53,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 60 [2019-01-01 21:43:53,866 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-01-01 21:44:44,785 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-01 21:44:44,786 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:02,578 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 47 [2019-01-01 21:45:02,579 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:20,042 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:45:20,044 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:45:20,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 95 [2019-01-01 21:45:20,245 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-01 21:45:20,246 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:20,435 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-01 21:45:29,340 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 3 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 94 [2019-01-01 21:45:29,351 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-01 21:45:29,352 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:29,511 INFO L267 ElimStorePlain]: Start of recursive call 35: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:45:34,377 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:45:34,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 47 treesize of output 91 [2019-01-01 21:45:34,444 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-01 21:45:34,444 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:34,612 INFO L267 ElimStorePlain]: Start of recursive call 37: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:45:35,135 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:45:35,136 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:45:35,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 54 treesize of output 96 [2019-01-01 21:45:35,189 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-01 21:45:35,190 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:35,324 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-01 21:45:36,588 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:45:36,611 INFO L303 Elim1Store]: Index analysis took 375 ms [2019-01-01 21:45:36,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 47 treesize of output 87 [2019-01-01 21:45:36,652 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-01 21:45:36,652 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:36,805 INFO L267 ElimStorePlain]: Start of recursive call 41: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-01 21:45:37,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 44 treesize of output 83 [2019-01-01 21:45:37,283 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 51 [2019-01-01 21:45:37,283 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:37,397 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-01 21:45:37,397 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:37,452 INFO L267 ElimStorePlain]: Start of recursive call 43: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:45:37,560 INFO L267 ElimStorePlain]: Start of recursive call 29: 4 dim-1 vars, 18 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:45:37,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 52 treesize of output 83 [2019-01-01 21:45:37,813 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-01 21:45:37,814 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:41,531 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 49 treesize of output 46 [2019-01-01 21:45:41,531 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:44,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:44,955 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 65 [2019-01-01 21:45:44,974 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 51 treesize of output 58 [2019-01-01 21:45:44,975 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:45,050 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 40 treesize of output 39 [2019-01-01 21:45:45,051 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:45,090 INFO L267 ElimStorePlain]: Start of recursive call 49: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:45:47,341 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:45:47,342 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:45:47,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 53 treesize of output 100 [2019-01-01 21:45:47,396 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 84 treesize of output 83 [2019-01-01 21:45:47,397 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:47,578 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 46 treesize of output 53 [2019-01-01 21:45:47,579 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:47,653 INFO L267 ElimStorePlain]: Start of recursive call 52: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-01 21:45:49,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:49,710 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:45:49,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 67 [2019-01-01 21:45:49,754 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-01 21:45:49,755 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:49,808 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:45:51,074 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:45:51,075 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:45:51,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 53 treesize of output 94 [2019-01-01 21:45:51,148 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 74 treesize of output 73 [2019-01-01 21:45:51,149 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:51,329 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-01 21:45:52,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 51 treesize of output 88 [2019-01-01 21:45:52,780 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-01 21:45:52,780 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:52,943 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 48 treesize of output 47 [2019-01-01 21:45:52,943 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:53,082 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 47 treesize of output 54 [2019-01-01 21:45:53,083 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:53,136 INFO L267 ElimStorePlain]: Start of recursive call 59: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:45:53,568 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:45:53,569 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:45:53,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 46 treesize of output 84 [2019-01-01 21:45:53,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 67 treesize of output 66 [2019-01-01 21:45:53,626 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:53,727 INFO L267 ElimStorePlain]: Start of recursive call 63: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-01 21:45:54,969 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:45:55,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 49 treesize of output 89 [2019-01-01 21:45:55,023 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 73 treesize of output 72 [2019-01-01 21:45:55,024 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:55,197 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-01 21:45:55,198 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:55,272 INFO L267 ElimStorePlain]: Start of recursive call 65: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-01 21:45:55,491 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:45:55,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 46 treesize of output 84 [2019-01-01 21:45:55,566 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-01 21:45:55,567 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:55,803 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 35 treesize of output 42 [2019-01-01 21:45:55,803 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:55,872 INFO L267 ElimStorePlain]: Start of recursive call 68: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-01 21:45:55,954 INFO L267 ElimStorePlain]: Start of recursive call 46: 2 dim-1 vars, 12 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:45:56,017 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:45:56,061 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:45:56,084 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-01 21:45:56,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-01 21:45:56,131 INFO L202 ElimStorePlain]: Needed 70 recursive calls to eliminate 9 variables, input treesize:298, output treesize:58 [2019-01-01 21:45:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:45:56,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:45:56,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:45:56,468 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-01 21:45:56,469 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5 Second operand 6 states. [2019-01-01 21:45:56,767 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5. Second operand 6 states. Result 29 states and 34 transitions. Complement of second has 10 states. [2019-01-01 21:45:56,769 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-01 21:45:56,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 21:45:56,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-01-01 21:45:56,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-01 21:45:56,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:45:56,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 10 letters. Loop has 4 letters. [2019-01-01 21:45:56,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:45:56,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 6 letters. Loop has 8 letters. [2019-01-01 21:45:56,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:45:56,775 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 34 transitions. [2019-01-01 21:45:56,777 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-01 21:45:56,778 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 28 states and 33 transitions. [2019-01-01 21:45:56,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-01-01 21:45:56,779 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-01-01 21:45:56,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 33 transitions. [2019-01-01 21:45:56,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:45:56,779 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-01-01 21:45:56,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 33 transitions. [2019-01-01 21:45:56,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-01-01 21:45:56,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-01 21:45:56,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2019-01-01 21:45:56,784 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-01-01 21:45:56,784 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-01-01 21:45:56,784 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:45:56,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2019-01-01 21:45:56,785 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-01 21:45:56,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:45:56,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:45:56,785 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:45:56,785 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:45:56,788 INFO L794 eck$LassoCheckResult]: Stem: 515#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 512#L-1 havoc main_#res;havoc main_#t~nondet21; 501#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); 498#L558-1 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 499#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); 500#L562-3 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem9;havoc f_#t~mem8; 506#L567-5 [2019-01-01 21:45:56,789 INFO L796 eck$LassoCheckResult]: Loop: 506#L567-5 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 518#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; 519#L566-7 assume !!f_#t~short13;havoc f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11; 514#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; 506#L567-5 [2019-01-01 21:45:56,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:45:56,789 INFO L82 PathProgramCache]: Analyzing trace with hash 890987403, now seen corresponding path program 1 times [2019-01-01 21:45:56,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:45:56,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:45:56,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:45:56,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:45:56,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:45:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:45:56,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:45:56,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:45:56,827 INFO L82 PathProgramCache]: Analyzing trace with hash 3235563, now seen corresponding path program 1 times [2019-01-01 21:45:56,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:45:56,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:45:56,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:45:56,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:45:56,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:45:56,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:45:56,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:45:56,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:45:56,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1434718859, now seen corresponding path program 1 times [2019-01-01 21:45:56,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:45:56,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:45:56,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:45:56,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:45:56,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:45:56,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:45:56,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:45:57,185 WARN L181 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-01-01 21:45:57,340 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-01-01 21:45:58,273 WARN L181 SmtUtils]: Spent 931.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 132 [2019-01-01 21:45:58,638 WARN L181 SmtUtils]: Spent 362.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-01-01 21:45:58,641 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:45:58,641 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:45:58,641 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:45:58,641 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:45:58,641 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:45:58,641 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:45:58,642 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:45:58,642 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:45:58,642 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-2010SAS-Fig1-alloca_true-termination.c.i_Iteration4_Lasso [2019-01-01 21:45:58,642 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:45:58,642 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:45:58,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:45:58,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:45:58,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:45:58,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:45:58,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:45:58,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:45:58,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:45:58,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:45:58,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:45:58,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:45:58,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:45:58,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:45:58,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:45:58,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:45:58,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:45:59,454 WARN L181 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 100 [2019-01-01 21:45:59,631 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2019-01-01 21:45:59,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:45:59,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:45:59,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:45:59,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:45:59,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:45:59,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:45:59,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:45:59,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:45:59,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:45:59,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:03,322 WARN L181 SmtUtils]: Spent 3.09 s on a formula simplification. DAG size of input: 80 DAG size of output: 80 [2019-01-01 21:46:03,427 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:46:03,428 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:46:03,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:03,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:03,429 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:03,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:03,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:03,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:03,432 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:03,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:03,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:03,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:03,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:03,434 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:03,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:03,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:03,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:03,434 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:03,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:03,438 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:03,439 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:03,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:03,439 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:03,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:03,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:03,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:03,440 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:03,440 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:03,441 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:03,441 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:03,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:03,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:03,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:03,442 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:03,443 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:03,443 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:03,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:03,444 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:03,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:03,445 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:03,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:03,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:03,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:03,445 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:03,445 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:03,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:03,446 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:03,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:03,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:03,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:03,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:03,454 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:03,454 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:03,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:03,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:03,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:03,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:03,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:03,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:03,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:03,459 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:03,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:03,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:03,466 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:03,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:03,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:03,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:03,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:03,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:03,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:03,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:03,467 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:03,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:03,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:03,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:03,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:03,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:03,481 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:03,481 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:03,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:03,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:03,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:03,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:03,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:03,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:03,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:03,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:03,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:03,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:03,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:03,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:03,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:03,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:03,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:03,494 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:03,494 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:03,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:03,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:03,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:03,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:03,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:03,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:03,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:03,502 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:03,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:03,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:03,503 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:03,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:03,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:03,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:03,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:03,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:03,506 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:03,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:03,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:03,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:03,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:03,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:03,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:03,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:03,513 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:03,513 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:03,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:03,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-01 21:46:03,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:03,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:03,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:03,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:03,520 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:03,520 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:03,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:03,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:03,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:03,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:03,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:03,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:03,527 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:03,527 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:03,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:03,534 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:03,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:03,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:03,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:03,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:03,535 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:03,535 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:03,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:03,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:03,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:03,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:03,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:03,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:03,548 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:03,548 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:03,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:03,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:03,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:03,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:03,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:03,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:03,568 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:03,568 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:03,580 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:46:03,587 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:46:03,588 INFO L444 ModelExtractionUtils]: 12 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:46:03,588 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:46:03,590 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-01 21:46:03,591 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:46:03,591 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-01 21:46:04,426 INFO L297 tatePredicateManager]: 55 out of 59 supporting invariants were superfluous and have been removed [2019-01-01 21:46:04,435 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:46:04,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:04,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:46:04,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:46:04,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:04,552 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-01 21:46:04,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:04,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:04,595 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-01 21:46:04,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:04,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:04,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:04,679 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-01 21:46:04,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:04,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:04,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:04,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:04,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:04,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:04,779 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-01 21:46:04,780 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:04,823 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:04,874 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:04,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:05,002 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-01 21:46:05,006 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-01 21:46:05,006 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:05,029 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-01 21:46:05,034 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-01 21:46:05,035 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:05,101 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-01 21:46:05,116 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-01 21:46:05,116 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:05,149 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-01 21:46:05,155 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-01 21:46:05,155 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:05,246 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-01 21:46:05,267 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-01 21:46:05,268 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:05,320 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:05,333 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-01 21:46:05,345 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-01 21:46:05,357 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-01 21:46:05,370 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-01 21:46:05,416 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-01 21:46:05,416 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 10 variables, input treesize:312, output treesize:83 [2019-01-01 21:46:05,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:46:05,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:46:05,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:46:05,689 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-01 21:46:05,690 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-01-01 21:46:06,853 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-01 21:46:06,855 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-01 21:46:06,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 21:46:06,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-01-01 21:46:06,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-01 21:46:06,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:46:06,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 10 letters. Loop has 4 letters. [2019-01-01 21:46:06,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:46:06,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 6 letters. Loop has 8 letters. [2019-01-01 21:46:06,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:46:06,859 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 44 transitions. [2019-01-01 21:46:06,860 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-01 21:46:06,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 36 states and 43 transitions. [2019-01-01 21:46:06,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-01-01 21:46:06,860 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-01-01 21:46:06,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 43 transitions. [2019-01-01 21:46:06,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:46:06,862 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2019-01-01 21:46:06,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 43 transitions. [2019-01-01 21:46:06,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-01-01 21:46:06,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-01 21:46:06,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2019-01-01 21:46:06,865 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2019-01-01 21:46:06,865 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2019-01-01 21:46:06,865 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:46:06,865 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 42 transitions. [2019-01-01 21:46:06,867 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-01 21:46:06,867 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:46:06,867 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:46:06,868 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:46:06,868 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 21:46:06,868 INFO L794 eck$LassoCheckResult]: Stem: 882#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 881#L-1 havoc main_#res;havoc main_#t~nondet21; 867#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); 860#L558 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 861#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); 886#L562 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem9;havoc f_#t~mem8; 887#L567-2 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 873#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; 874#L566-2 assume !!f_#t~short13;havoc f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11; 868#L567 assume 0 != f_#t~nondet14;havoc f_#t~nondet14; 862#L568 [2019-01-01 21:46:06,868 INFO L796 eck$LassoCheckResult]: Loop: 862#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; 863#L567-2 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 877#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; 892#L566-2 assume !!f_#t~short13;havoc f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11; 891#L567 assume 0 != f_#t~nondet14;havoc f_#t~nondet14; 862#L568 [2019-01-01 21:46:06,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:06,868 INFO L82 PathProgramCache]: Analyzing trace with hash -260778639, now seen corresponding path program 1 times [2019-01-01 21:46:06,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:06,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:06,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:06,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:46:06,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:06,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:06,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:06,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:06,913 INFO L82 PathProgramCache]: Analyzing trace with hash 69174960, now seen corresponding path program 1 times [2019-01-01 21:46:06,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:06,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:06,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:06,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:46:06,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:06,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:06,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:06,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:06,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1938200384, now seen corresponding path program 1 times [2019-01-01 21:46:06,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:06,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:06,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:06,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:46:06,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:06,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:46:07,294 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2019-01-01 21:46:07,508 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-01 21:46:07,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:46:07,508 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-01 21:46:07,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:46:07,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:46:07,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:46:07,794 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-01-01 21:46:07,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:07,835 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-01 21:46:08,047 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2019-01-01 21:46:08,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:08,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:08,059 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-01 21:46:08,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:08,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:08,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:08,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:08,184 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-01 21:46:08,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:08,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:08,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:08,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:08,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:08,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:08,320 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-01 21:46:08,321 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:08,355 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:08,396 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:08,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:08,602 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-01 21:46:08,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 8 treesize of output 7 [2019-01-01 21:46:08,608 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:08,637 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-01 21:46:08,679 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-01 21:46:08,680 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:08,952 INFO L303 Elim1Store]: Index analysis took 158 ms [2019-01-01 21:46:08,954 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-01 21:46:08,969 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-01 21:46:08,970 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:09,200 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-01 21:46:09,204 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-01 21:46:09,204 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:09,249 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-01 21:46:09,269 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-01 21:46:09,270 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:09,481 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:09,494 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-01 21:46:09,564 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-01 21:46:09,575 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-01 21:46:09,592 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-01 21:46:09,630 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-01 21:46:09,631 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 3 variables, input treesize:308, output treesize:82 [2019-01-01 21:46:09,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:09,764 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-01 21:46:09,871 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-01-01 21:46:09,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:09,876 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-01 21:46:09,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:10,050 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-01 21:46:10,056 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-01 21:46:10,057 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:10,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:10,145 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-01 21:46:10,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:10,154 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-01 21:46:10,154 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:10,201 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:10,212 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-01 21:46:10,224 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-01 21:46:10,259 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-01 21:46:10,260 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:237, output treesize:61 [2019-01-01 21:46:10,455 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-01 21:46:10,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:46:10,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2019-01-01 21:46:10,647 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-01-01 21:46:10,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 21:46:10,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-01-01 21:46:10,714 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. cyclomatic complexity: 11 Second operand 10 states. [2019-01-01 21:46:11,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:46:11,290 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2019-01-01 21:46:11,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 21:46:11,292 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 60 transitions. [2019-01-01 21:46:11,294 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-01 21:46:11,295 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 42 states and 48 transitions. [2019-01-01 21:46:11,295 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-01-01 21:46:11,295 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-01-01 21:46:11,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 48 transitions. [2019-01-01 21:46:11,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:46:11,295 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 48 transitions. [2019-01-01 21:46:11,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 48 transitions. [2019-01-01 21:46:11,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2019-01-01 21:46:11,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-01 21:46:11,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2019-01-01 21:46:11,299 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 45 transitions. [2019-01-01 21:46:11,299 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 45 transitions. [2019-01-01 21:46:11,299 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 21:46:11,299 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 45 transitions. [2019-01-01 21:46:11,300 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-01 21:46:11,300 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:46:11,300 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:46:11,300 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:46:11,301 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 21:46:11,301 INFO L794 eck$LassoCheckResult]: Stem: 1043#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1042#L-1 havoc main_#res;havoc main_#t~nondet21; 1025#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); 1024#L558-1 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 1022#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); 1023#L562-3 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem9;havoc f_#t~mem8; 1050#L567-5 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 1047#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; 1048#L566-7 assume !!f_#t~short13;havoc f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11; 1039#L567-3 assume 0 != f_#t~nondet14;havoc f_#t~nondet14; 1029#L568-1 [2019-01-01 21:46:11,301 INFO L796 eck$LassoCheckResult]: Loop: 1029#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; 1030#L567-5 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 1045#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; 1054#L566-7 assume !!f_#t~short13;havoc f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11; 1053#L567-3 assume 0 != f_#t~nondet14;havoc f_#t~nondet14; 1029#L568-1 [2019-01-01 21:46:11,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:11,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1434718863, now seen corresponding path program 1 times [2019-01-01 21:46:11,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:11,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:11,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:11,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:46:11,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:11,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:11,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:11,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:11,334 INFO L82 PathProgramCache]: Analyzing trace with hash 114981600, now seen corresponding path program 1 times [2019-01-01 21:46:11,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:11,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:11,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:11,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:46:11,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:11,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:11,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:11,345 INFO L82 PathProgramCache]: Analyzing trace with hash -588680336, now seen corresponding path program 1 times [2019-01-01 21:46:11,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:11,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:11,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:11,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:46:11,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:11,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:46:11,580 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-01 21:46:11,622 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-01 21:46:11,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:46:11,623 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-01 21:46:11,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:46:11,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:46:11,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:46: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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-01 21:46:11,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:11,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:11,710 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-01 21:46:11,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:11,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:11,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:11,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:11,758 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-01 21:46:11,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:11,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:11,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:11,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:11,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:11,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:11,882 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-01 21:46:11,882 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:11,921 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:11,974 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:12,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:12,080 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-01 21:46:12,085 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-01 21:46:12,085 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:12,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:12,142 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-01 21:46:12,165 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-01 21:46:12,166 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:12,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:12,380 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-01 21:46:12,381 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:12,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:12,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:12,518 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 77 treesize of output 73 [2019-01-01 21:46:12,523 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-01 21:46:12,524 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:12,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:12,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:12,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:12,559 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 52 treesize of output 85 [2019-01-01 21:46:12,562 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-01 21:46:12,563 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:12,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:12,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:12,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:12,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:12,612 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 43 treesize of output 105 [2019-01-01 21:46:12,616 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-01 21:46:12,616 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:12,650 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:12,660 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-01 21:46:12,672 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-01 21:46:12,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:12,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:12,753 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-01 21:46:12,758 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-01 21:46:12,758 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:12,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:12,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:12,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:12,797 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-01 21:46:12,811 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-01 21:46:12,811 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:12,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:12,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:12,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:12,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:12,856 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-01 21:46:12,875 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-01 21:46:12,876 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:12,929 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:12,940 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-01 21:46:12,952 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-01 21:46:13,002 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-01 21:46:13,022 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-01 21:46:13,023 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:13,133 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-01 21:46:13,141 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-01 21:46:13,141 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:13,174 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-01 21:46:13,178 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-01 21:46:13,178 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:13,196 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:13,207 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:13,219 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:13,248 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-01 21:46:13,277 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-01 21:46:13,341 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-01 21:46:13,341 INFO L202 ElimStorePlain]: Needed 28 recursive calls to eliminate 4 variables, input treesize:306, output treesize:143 [2019-01-01 21:46:13,495 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-01-01 21:46:13,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:13,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:13,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:13,605 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-01 21:46:13,736 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2019-01-01 21:46:13,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:13,741 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-01 21:46:13,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:13,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:13,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:13,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:13,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:13,793 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-01 21:46:13,804 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-01 21:46:13,804 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:13,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:13,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:13,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:13,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:13,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:13,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:13,854 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-01 21:46:13,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:13,877 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-01 21:46:13,880 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-01 21:46:13,912 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:13,924 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-01 21:46:13,944 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-01 21:46:14,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:14,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:14,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:14,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:14,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:14,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:14,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:14,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:14,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:14,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:14,101 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-01 21:46:14,226 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 53 [2019-01-01 21:46:14,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:14,230 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-01 21:46:14,230 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:14,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:14,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:14,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:14,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:14,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:14,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:14,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:14,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:14,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:14,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:14,303 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-01 21:46:14,309 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-01 21:46:14,310 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:14,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:14,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:14,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:14,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:14,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:14,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:14,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:14,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:14,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:14,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:14,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:14,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:14,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:14,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:14,399 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-01 21:46:14,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:14,449 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-01 21:46:14,455 INFO L267 ElimStorePlain]: Start of recursive call 13: 12 dim-0 vars, End of recursive call: 12 dim-0 vars, and 9 xjuncts. [2019-01-01 21:46:15,444 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:15,580 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-01 21:46:15,853 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-01 21:46:16,406 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-01 21:46:16,406 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 13 variables, input treesize:446, output treesize:70 [2019-01-01 21:46:16,871 WARN L181 SmtUtils]: Spent 315.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-01-01 21:46:16,927 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-01 21:46:16,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:46:16,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 9 [2019-01-01 21:46:17,596 WARN L181 SmtUtils]: Spent 630.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-01-01 21:46:17,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 21:46:17,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-01-01 21:46:17,685 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. cyclomatic complexity: 10 Second operand 9 states. [2019-01-01 21:46:18,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:46:18,185 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2019-01-01 21:46:18,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 21:46:18,187 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 63 transitions. [2019-01-01 21:46:18,188 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-01 21:46:18,189 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 46 states and 51 transitions. [2019-01-01 21:46:18,189 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-01-01 21:46:18,189 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-01-01 21:46:18,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 51 transitions. [2019-01-01 21:46:18,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:46:18,189 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 51 transitions. [2019-01-01 21:46:18,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 51 transitions. [2019-01-01 21:46:18,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2019-01-01 21:46:18,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-01 21:46:18,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2019-01-01 21:46:18,193 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 48 transitions. [2019-01-01 21:46:18,193 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 48 transitions. [2019-01-01 21:46:18,193 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 21:46:18,193 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 48 transitions. [2019-01-01 21:46:18,194 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-01 21:46:18,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:46:18,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:46:18,195 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:46:18,195 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 21:46:18,195 INFO L794 eck$LassoCheckResult]: Stem: 1204#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1203#L-1 havoc main_#res;havoc main_#t~nondet21; 1186#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); 1179#L558 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 1180#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); 1208#L562 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem9;havoc f_#t~mem8; 1209#L567-2 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 1214#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~short13;havoc f_#t~mem12;havoc f_#t~mem11; 1220#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; 1197#L567-2 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 1194#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; 1195#L566-2 assume !!f_#t~short13;havoc f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11; 1188#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; 1189#L567-2 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 1192#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; 1193#L566-2 assume !!f_#t~short13;havoc f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11; 1187#L567 assume 0 != f_#t~nondet14;havoc f_#t~nondet14; 1181#L568 [2019-01-01 21:46:18,196 INFO L796 eck$LassoCheckResult]: Loop: 1181#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; 1182#L567-2 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 1196#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~short13;havoc f_#t~mem12;havoc f_#t~mem11; 1199#L567 assume 0 != f_#t~nondet14;havoc f_#t~nondet14; 1181#L568 [2019-01-01 21:46:18,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:18,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1529889349, now seen corresponding path program 1 times [2019-01-01 21:46:18,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:18,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:18,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:18,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:46:18,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:18,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:46:18,517 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 28 [2019-01-01 21:46:18,743 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-01 21:46:18,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:46:18,744 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-01 21:46:18,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:46:18,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:46:18,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:46:18,801 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-01 21:46:18,804 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-01 21:46:18,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:18,864 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-01 21:46:18,890 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-01 21:46:18,891 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:19,043 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-01 21:46:19,043 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:19,244 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-01 21:46:19,265 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-01 21:46:19,266 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:19,391 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-01 21:46:19,391 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:19,542 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 49 treesize of output 71 [2019-01-01 21:46:19,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, 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-01 21:46:19,565 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:20,931 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-01 21:46:20,932 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:21,551 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-01 21:46:21,552 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:22,740 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:46:22,772 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 39 treesize of output 63 [2019-01-01 21:46:22,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-01 21:46:22,787 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:22,840 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:46:23,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 48 treesize of output 86 [2019-01-01 21:46:23,402 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-01 21:46:23,403 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:24,024 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-01 21:46:24,025 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:24,091 INFO L267 ElimStorePlain]: Start of recursive call 16: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:24,459 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:46:24,461 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:46:24,514 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 72 [2019-01-01 21:46:24,521 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 59 treesize of output 58 [2019-01-01 21:46:24,522 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:24,583 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:24,779 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:46:24,835 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 43 treesize of output 78 [2019-01-01 21:46:24,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 59 treesize of output 58 [2019-01-01 21:46:24,845 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:24,940 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:25,073 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-01 21:46:25,088 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-01 21:46:25,089 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:25,174 INFO L267 ElimStorePlain]: Start of recursive call 23: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:25,240 INFO L267 ElimStorePlain]: Start of recursive call 10: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:25,319 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:46:25,357 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-01 21:46:25,388 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-01 21:46:25,388 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:26,229 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-01 21:46:26,230 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:27,090 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:46:27,092 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:46:27,164 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 72 [2019-01-01 21:46:27,168 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-01 21:46:27,169 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:27,226 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:27,652 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:46:27,683 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 39 treesize of output 59 [2019-01-01 21:46:27,687 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 48 treesize of output 47 [2019-01-01 21:46:27,687 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:27,732 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:46:28,224 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 40 [2019-01-01 21:46:28,242 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 26 treesize of output 23 [2019-01-01 21:46:28,243 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:28,276 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 25 treesize of output 24 [2019-01-01 21:46:28,276 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:28,293 INFO L267 ElimStorePlain]: Start of recursive call 32: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:28,371 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:46:28,423 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 36 treesize of output 72 [2019-01-01 21:46:28,470 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-01 21:46:28,471 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:28,617 INFO L267 ElimStorePlain]: Start of recursive call 35: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:28,673 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:28,706 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:28,869 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 74 treesize of output 80 [2019-01-01 21:46:28,877 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-01 21:46:28,877 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:35,537 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-01 21:46:35,538 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:44,714 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-01 21:46:44,714 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:52,791 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-01 21:46:52,791 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:59,739 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:46:59,774 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-01 21:46:59,781 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-01 21:46:59,782 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2019-01-01 21:47:00,619 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-01 21:47:00,620 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2019-01-01 21:47:01,444 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:47:01,445 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:47:01,494 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-01 21:47:01,500 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-01 21:47:01,501 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2019-01-01 21:47:01,566 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:47:01,735 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:47:01,791 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 78 [2019-01-01 21:47:01,799 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-01 21:47:01,799 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2019-01-01 21:47:01,901 INFO L267 ElimStorePlain]: Start of recursive call 47: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:47:01,978 INFO L267 ElimStorePlain]: Start of recursive call 42: 2 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:47:06,708 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:47:06,760 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-01 21:47:06,786 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 61 treesize of output 58 [2019-01-01 21:47:06,787 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2019-01-01 21:47:10,405 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-01 21:47:10,405 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2019-01-01 21:47:14,014 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:47:14,015 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:47:14,016 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:47:14,080 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-01 21:47:14,089 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-01 21:47:14,089 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2019-01-01 21:47:14,175 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:47:15,486 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:47:15,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 56 treesize of output 99 [2019-01-01 21:47:15,576 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 66 treesize of output 63 [2019-01-01 21:47:15,577 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2019-01-01 21:47:15,865 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 53 treesize of output 52 [2019-01-01 21:47:15,865 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2019-01-01 21:47:15,902 INFO L267 ElimStorePlain]: Start of recursive call 54: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:47:16,689 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:47:16,690 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:47:16,759 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-01 21:47:16,803 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-01 21:47:16,804 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2019-01-01 21:47:17,026 INFO L267 ElimStorePlain]: Start of recursive call 57: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:47:17,444 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:47:17,495 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-01 21:47:17,524 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-01 21:47:17,525 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2019-01-01 21:47:17,801 INFO L267 ElimStorePlain]: Start of recursive call 59: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:47:17,928 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:47:17,929 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:47:18,007 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-01 21:47:18,022 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 67 treesize of output 66 [2019-01-01 21:47:18,022 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2019-01-01 21:47:18,199 INFO L267 ElimStorePlain]: Start of recursive call 61: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:47:18,319 INFO L267 ElimStorePlain]: Start of recursive call 49: 2 dim-1 vars, 12 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:47:19,727 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-01 21:47:19,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 54 treesize of output 51 [2019-01-01 21:47:19,757 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2019-01-01 21:48:02,761 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-01 21:48:02,761 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2019-01-01 21:48:20,826 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-01 21:48:20,827 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2019-01-01 21:48:38,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 56 treesize of output 105 [2019-01-01 21:48:38,610 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-01 21:48:38,622 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-01 21:48:38,622 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2019-01-01 21:48:39,021 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 53 treesize of output 52 [2019-01-01 21:48:39,022 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2019-01-01 21:48:39,107 INFO L267 ElimStorePlain]: Start of recursive call 67: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:48:50,511 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:48:50,599 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 105 [2019-01-01 21:48:50,599 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-01 21:48:50,627 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 72 treesize of output 69 [2019-01-01 21:48:50,627 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2019-01-01 21:48:51,036 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-01 21:48:51,037 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2019-01-01 21:48:51,104 INFO L267 ElimStorePlain]: Start of recursive call 70: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:48:58,708 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:48:58,710 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:48:58,780 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 91 [2019-01-01 21:48:58,807 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-01 21:48:58,807 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2019-01-01 21:48:58,989 INFO L267 ElimStorePlain]: Start of recursive call 73: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-01 21:49:02,543 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:49:02,544 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:49:02,590 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-01 21:49:02,597 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-01 21:49:02,598 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2019-01-01 21:49:02,648 INFO L267 ElimStorePlain]: Start of recursive call 75: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:49:06,855 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:49:06,857 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:49:06,918 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 95 [2019-01-01 21:49:06,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 71 treesize of output 70 [2019-01-01 21:49:06,944 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2019-01-01 21:49:07,152 INFO L267 ElimStorePlain]: Start of recursive call 77: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:49:09,147 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:49:09,149 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:49:09,223 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-01 21:49:09,235 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-01 21:49:09,236 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2019-01-01 21:49:09,385 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-01 21:49:09,385 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2019-01-01 21:49:09,411 INFO L267 ElimStorePlain]: Start of recursive call 79: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:49:10,065 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-01 21:49:10,073 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-01 21:49:10,074 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2019-01-01 21:49:10,244 INFO L267 ElimStorePlain]: Start of recursive call 82: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:49:10,620 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:49:10,728 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 93 [2019-01-01 21:49:10,736 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-01 21:49:10,736 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2019-01-01 21:49:10,997 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-01 21:49:10,998 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2019-01-01 21:49:11,034 INFO L267 ElimStorePlain]: Start of recursive call 84: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:49:11,134 INFO L267 ElimStorePlain]: Start of recursive call 63: 4 dim-1 vars, 18 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:49:11,549 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 63 [2019-01-01 21:49:11,554 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-01 21:49:11,555 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2019-01-01 21:49:11,813 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-01 21:49:11,813 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2019-01-01 21:49:12,119 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 10 case distinctions, treesize of input 44 treesize of output 78 [2019-01-01 21:49:12,140 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 53 treesize of output 52 [2019-01-01 21:49:12,141 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2019-01-01 21:49:12,263 INFO L267 ElimStorePlain]: Start of recursive call 90: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:49:12,466 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:49:12,467 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:49:12,518 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-01 21:49:12,549 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-01 21:49:12,550 INFO L267 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2019-01-01 21:49:12,610 INFO L267 ElimStorePlain]: Start of recursive call 92: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:49:12,761 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:49:12,812 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-01 21:49:12,818 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 48 treesize of output 47 [2019-01-01 21:49:12,819 INFO L267 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2019-01-01 21:49:12,929 INFO L267 ElimStorePlain]: Start of recursive call 94: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:49:13,062 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 55 [2019-01-01 21:49:13,067 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-01 21:49:13,067 INFO L267 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2019-01-01 21:49:13,127 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-01 21:49:13,128 INFO L267 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2019-01-01 21:49:13,152 INFO L267 ElimStorePlain]: Start of recursive call 96: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:49:13,219 INFO L267 ElimStorePlain]: Start of recursive call 87: 2 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:49:13,362 INFO L267 ElimStorePlain]: Start of recursive call 37: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:49:13,409 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-01 21:49:13,421 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-01 21:49:13,436 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-01 21:49:13,437 INFO L202 ElimStorePlain]: Needed 98 recursive calls to eliminate 4 variables, input treesize:258, output treesize:42 [2019-01-01 21:49:13,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:49:13,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:49:13,492 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-01 21:49:13,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:49:13,499 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-01 21:49:13,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:49:13,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:49:13,534 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-01 21:49:13,534 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 21:49:13,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:49:13,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:49:13,566 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:44, output treesize:47 [2019-01-01 21:49:13,667 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-01 21:49:13,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:49:13,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 13 [2019-01-01 21:49:13,687 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:49:13,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:13,687 INFO L82 PathProgramCache]: Analyzing trace with hash 69174960, now seen corresponding path program 2 times [2019-01-01 21:49:13,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:13,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:13,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:13,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:49:13,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:13,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:13,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:14,092 WARN L181 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-01-01 21:49:14,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 21:49:14,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-01-01 21:49:14,161 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. cyclomatic complexity: 9 Second operand 13 states. [2019-01-01 21:49:14,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:49:14,589 INFO L93 Difference]: Finished difference Result 23 states and 22 transitions. [2019-01-01 21:49:14,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 21:49:14,591 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 22 transitions. [2019-01-01 21:49:14,591 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:49:14,591 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 0 states and 0 transitions. [2019-01-01 21:49:14,592 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:49:14,592 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:49:14,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:49:14,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:49:14,592 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:49:14,592 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:49:14,592 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:49:14,592 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 21:49:14,593 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:49:14,593 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:49:14,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:49:14,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:49:14 BoogieIcfgContainer [2019-01-01 21:49:14,600 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:49:14,600 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:49:14,601 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:49:14,601 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:49:14,601 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:43:35" (3/4) ... [2019-01-01 21:49:14,605 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:49:14,605 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:49:14,606 INFO L168 Benchmark]: Toolchain (without parser) took 340527.60 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 257.4 MB). Free memory was 952.7 MB in the beginning and 1.0 GB in the end (delta: -83.8 MB). Peak memory consumption was 173.6 MB. Max. memory is 11.5 GB. [2019-01-01 21:49:14,606 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:49:14,607 INFO L168 Benchmark]: CACSL2BoogieTranslator took 706.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -165.5 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:49:14,607 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:49:14,607 INFO L168 Benchmark]: Boogie Preprocessor took 36.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:49:14,607 INFO L168 Benchmark]: RCFGBuilder took 858.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 11.5 GB. [2019-01-01 21:49:14,608 INFO L168 Benchmark]: BuchiAutomizer took 338843.41 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 124.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 44.0 MB). Peak memory consumption was 168.2 MB. Max. memory is 11.5 GB. [2019-01-01 21:49:14,608 INFO L168 Benchmark]: Witness Printer took 4.58 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:49:14,611 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.17 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 706.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -165.5 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 858.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 338843.41 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 124.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 44.0 MB). Peak memory consumption was 168.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.58 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #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 338.7s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 205.0s. Construction of modules took 1.9s. Büchi inclusion checks took 131.4s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 18 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: 115 SDtfs, 118 SDslu, 253 SDs, 0 SdLazy, 388 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s 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: 6ms 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...