java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:01:23,097 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:01:23,102 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:01:23,120 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:01:23,121 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:01:23,123 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:01:23,125 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:01:23,135 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:01:23,140 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:01:23,142 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:01:23,144 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:01:23,146 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:01:23,146 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:01:23,148 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:01:23,151 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:01:23,153 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:01:23,154 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:01:23,156 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:01:23,158 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:01:23,162 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:01:23,168 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:01:23,171 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:01:23,174 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:01:23,175 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:01:23,178 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:01:23,179 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:01:23,179 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:01:23,181 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:01:23,182 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:01:23,183 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:01:23,184 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:01:23,184 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:01:23,185 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:01:23,186 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:01:23,187 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:01:23,188 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:01:23,188 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:01:23,188 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:01:23,189 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:01:23,189 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:01:23,191 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:01:23,192 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 03:01:23,206 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:01:23,206 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:01:23,208 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:01:23,208 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:01:23,208 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:01:23,208 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:01:23,208 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:01:23,209 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:01:23,209 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:01:23,209 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:01:23,209 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:01:23,209 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:01:23,210 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:01:23,210 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:01:23,210 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:01:23,210 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:01:23,210 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:01:23,211 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:01:23,211 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:01:23,211 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:01:23,211 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:01:23,211 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:01:23,212 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:01:23,212 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:01:23,212 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:01:23,212 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:01:23,212 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:01:23,213 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:01:23,213 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-15 03:01:23,566 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:01:23,589 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:01:23,593 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:01:23,595 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:01:23,595 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:01:23,597 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i [2019-10-15 03:01:23,671 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49848a79a/8d8181a4d8d9475bbe721506195f627d/FLAG55ebc3a2c [2019-10-15 03:01:24,128 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:01:24,129 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i [2019-10-15 03:01:24,136 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49848a79a/8d8181a4d8d9475bbe721506195f627d/FLAG55ebc3a2c [2019-10-15 03:01:24,481 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49848a79a/8d8181a4d8d9475bbe721506195f627d [2019-10-15 03:01:24,490 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:01:24,491 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:01:24,492 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:01:24,493 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:01:24,496 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:01:24,497 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:01:24" (1/1) ... [2019-10-15 03:01:24,500 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eff091d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:01:24, skipping insertion in model container [2019-10-15 03:01:24,501 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:01:24" (1/1) ... [2019-10-15 03:01:24,508 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:01:24,527 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:01:24,737 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:01:24,741 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:01:24,764 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:01:24,785 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:01:24,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:01:24 WrapperNode [2019-10-15 03:01:24,785 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:01:24,786 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:01:24,786 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:01:24,787 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:01:24,888 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:01:24" (1/1) ... [2019-10-15 03:01:24,888 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:01:24" (1/1) ... [2019-10-15 03:01:24,898 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:01:24" (1/1) ... [2019-10-15 03:01:24,899 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:01:24" (1/1) ... [2019-10-15 03:01:24,905 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:01:24" (1/1) ... [2019-10-15 03:01:24,912 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:01:24" (1/1) ... [2019-10-15 03:01:24,914 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:01:24" (1/1) ... [2019-10-15 03:01:24,917 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:01:24,917 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:01:24,917 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:01:24,917 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:01:24,918 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:01:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:01:24,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:01:24,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:01:24,971 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-15 03:01:24,971 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:01:24,971 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:01:24,972 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 03:01:24,972 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-15 03:01:24,974 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-10-15 03:01:24,974 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:01:24,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 03:01:24,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 03:01:24,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 03:01:24,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:01:24,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:01:24,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 03:01:25,262 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:01:25,262 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-15 03:01:25,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:01:25 BoogieIcfgContainer [2019-10-15 03:01:25,264 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:01:25,265 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:01:25,266 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:01:25,269 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:01:25,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:01:24" (1/3) ... [2019-10-15 03:01:25,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8fc37e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:01:25, skipping insertion in model container [2019-10-15 03:01:25,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:01:24" (2/3) ... [2019-10-15 03:01:25,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8fc37e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:01:25, skipping insertion in model container [2019-10-15 03:01:25,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:01:25" (3/3) ... [2019-10-15 03:01:25,273 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i [2019-10-15 03:01:25,284 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:01:25,297 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:01:25,319 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:01:25,358 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:01:25,358 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:01:25,359 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:01:25,360 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:01:25,360 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:01:25,360 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:01:25,360 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:01:25,361 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:01:25,379 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2019-10-15 03:01:25,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-15 03:01:25,384 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:01:25,385 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:01:25,387 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:01:25,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:01:25,393 INFO L82 PathProgramCache]: Analyzing trace with hash -859450362, now seen corresponding path program 1 times [2019-10-15 03:01:25,400 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:01:25,400 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879861800] [2019-10-15 03:01:25,400 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:01:25,401 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:01:25,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:01:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:01:25,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:01:25,702 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879861800] [2019-10-15 03:01:25,703 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:01:25,703 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:01:25,704 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049793440] [2019-10-15 03:01:25,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:01:25,709 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:01:25,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:01:25,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:01:25,728 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 5 states. [2019-10-15 03:01:25,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:01:25,905 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2019-10-15 03:01:25,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 03:01:25,907 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-10-15 03:01:25,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:01:25,916 INFO L225 Difference]: With dead ends: 52 [2019-10-15 03:01:25,916 INFO L226 Difference]: Without dead ends: 29 [2019-10-15 03:01:25,920 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:01:25,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-15 03:01:25,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2019-10-15 03:01:25,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-15 03:01:25,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2019-10-15 03:01:25,960 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 10 [2019-10-15 03:01:25,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:01:25,961 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-10-15 03:01:25,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:01:25,961 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2019-10-15 03:01:25,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-15 03:01:25,963 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:01:25,963 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:01:25,964 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:01:25,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:01:25,964 INFO L82 PathProgramCache]: Analyzing trace with hash -884331265, now seen corresponding path program 1 times [2019-10-15 03:01:25,965 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:01:25,965 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090396091] [2019-10-15 03:01:25,965 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:01:25,966 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:01:25,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:01:26,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:01:26,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:01:26,030 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090396091] [2019-10-15 03:01:26,031 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:01:26,031 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:01:26,031 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153897240] [2019-10-15 03:01:26,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:01:26,033 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:01:26,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:01:26,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:01:26,034 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 3 states. [2019-10-15 03:01:26,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:01:26,054 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2019-10-15 03:01:26,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:01:26,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-15 03:01:26,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:01:26,056 INFO L225 Difference]: With dead ends: 35 [2019-10-15 03:01:26,056 INFO L226 Difference]: Without dead ends: 25 [2019-10-15 03:01:26,057 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:01:26,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-15 03:01:26,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-10-15 03:01:26,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-15 03:01:26,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-10-15 03:01:26,066 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 12 [2019-10-15 03:01:26,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:01:26,067 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-10-15 03:01:26,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:01:26,069 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-10-15 03:01:26,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-15 03:01:26,070 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:01:26,070 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:01:26,070 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:01:26,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:01:26,073 INFO L82 PathProgramCache]: Analyzing trace with hash 689803461, now seen corresponding path program 1 times [2019-10-15 03:01:26,073 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:01:26,074 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662536162] [2019-10-15 03:01:26,075 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:01:26,076 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:01:26,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:01:26,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:01:26,460 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:01:26,461 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662536162] [2019-10-15 03:01:26,461 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:01:26,462 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:01:26,462 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858245554] [2019-10-15 03:01:26,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:01:26,464 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:01:26,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:01:26,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:01:26,467 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 9 states. [2019-10-15 03:01:26,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:01:26,659 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-10-15 03:01:26,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 03:01:26,662 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-10-15 03:01:26,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:01:26,665 INFO L225 Difference]: With dead ends: 37 [2019-10-15 03:01:26,666 INFO L226 Difference]: Without dead ends: 35 [2019-10-15 03:01:26,667 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-15 03:01:26,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-15 03:01:26,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 23. [2019-10-15 03:01:26,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-15 03:01:26,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-10-15 03:01:26,684 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 17 [2019-10-15 03:01:26,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:01:26,685 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-10-15 03:01:26,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:01:26,685 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-10-15 03:01:26,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-15 03:01:26,686 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:01:26,687 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:01:26,687 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:01:26,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:01:26,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1889908222, now seen corresponding path program 1 times [2019-10-15 03:01:26,689 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:01:26,689 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867100795] [2019-10-15 03:01:26,690 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:01:26,690 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:01:26,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:01:26,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:01:27,322 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 36 [2019-10-15 03:01:27,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:01:27,449 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867100795] [2019-10-15 03:01:27,449 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160677593] [2019-10-15 03:01:27,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:01:27,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:01:27,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-15 03:01:27,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:01:28,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:28,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:28,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:28,094 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-15 03:01:28,095 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:28,110 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-15 03:01:28,110 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:28,123 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-15 03:01:28,124 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:28,274 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2019-10-15 03:01:28,275 INFO L341 Elim1Store]: treesize reduction 44, result has 66.9 percent of original size [2019-10-15 03:01:28,276 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 157 [2019-10-15 03:01:28,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:28,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:28,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:28,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:28,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:28,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:28,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:28,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:28,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:28,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:28,294 INFO L496 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-15 03:01:32,326 WARN L191 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 62 DAG size of output: 30 [2019-10-15 03:01:32,326 INFO L567 ElimStorePlain]: treesize reduction 99, result has 34.4 percent of original size [2019-10-15 03:01:32,330 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-15 03:01:32,331 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:461, output treesize:7 [2019-10-15 03:01:32,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:32,528 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:01:32,529 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:01:32,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:32,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:32,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:32,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:32,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:32,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:32,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:32,897 WARN L191 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-10-15 03:01:32,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 03:01:32,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:32,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:32,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:32,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:32,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:32,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:32,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:32,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:32,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:32,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:32,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:32,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:32,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:32,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:32,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:32,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:32,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:32,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:32,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:32,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:32,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,245 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-15 03:01:33,246 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:33,392 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:33,393 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:33,393 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:33,395 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:33,397 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:33,401 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:33,402 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:33,414 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:33,415 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:33,461 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 03:01:33,462 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 84 [2019-10-15 03:01:33,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:33,467 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:35,607 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:35,609 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:35,627 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:35,628 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:35,629 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:35,630 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:35,651 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:35,652 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:35,655 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:35,658 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:35,678 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:35,775 INFO L235 Elim1Store]: Index analysis took 168 ms [2019-10-15 03:01:35,893 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-10-15 03:01:35,893 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 03:01:35,894 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 185 treesize of output 160 [2019-10-15 03:01:35,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:35,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:35,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:35,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:35,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:35,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:35,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:35,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:35,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:35,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:35,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:35,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:35,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:35,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:35,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:35,944 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:36,004 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:36,006 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:36,036 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:36,122 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 03:01:36,123 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 122 [2019-10-15 03:01:36,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:36,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:36,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:36,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:36,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:36,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:36,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:36,157 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:36,182 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:36,182 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:36,183 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:36,184 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:36,184 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:36,185 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:36,186 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:36,188 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:36,189 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:36,190 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:36,191 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:36,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:36,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:36,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:36,245 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 72 [2019-10-15 03:01:36,247 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:36,295 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-15 03:01:36,295 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:36,318 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-15 03:01:36,318 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:36,355 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:36,367 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:36,368 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:36,369 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:36,369 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:36,374 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:36,375 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:36,376 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:36,377 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:36,378 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:36,386 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:36,484 INFO L235 Elim1Store]: Index analysis took 129 ms [2019-10-15 03:01:36,541 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 03:01:36,541 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 205 treesize of output 159 [2019-10-15 03:01:36,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:36,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:36,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:36,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:36,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:36,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:36,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:36,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:36,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:36,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:36,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:36,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:36,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:36,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:36,600 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:36,620 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:36,621 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:36,622 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:36,622 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:36,623 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:36,624 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:36,625 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:36,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:36,628 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:36,629 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:36,631 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:36,634 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:36,665 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:36,678 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:36,680 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 74 [2019-10-15 03:01:36,682 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:36,697 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-15 03:01:36,697 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:36,717 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:36,719 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:36,720 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:36,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:36,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:36,750 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:36,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:36,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:36,791 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 55 [2019-10-15 03:01:36,793 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:36,809 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-15 03:01:36,809 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:36,828 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:36,829 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:36,830 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:36,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:36,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:36,840 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:36,872 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:36,879 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:36,885 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 56 [2019-10-15 03:01:36,887 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:37,013 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-15 03:01:37,013 INFO L496 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:37,036 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:37,038 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:37,040 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:37,041 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:37,042 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:37,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:37,050 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:37,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:37,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:37,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:37,081 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 63 [2019-10-15 03:01:37,083 INFO L496 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:37,101 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:37,102 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:37,103 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:37,104 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:37,105 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:37,106 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:37,113 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:37,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:37,158 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:37,180 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:37,184 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 55 [2019-10-15 03:01:37,187 INFO L496 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:37,210 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:37,212 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:37,213 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:37,214 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:37,215 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:37,216 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:37,217 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:37,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:37,221 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:37,221 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:37,222 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:37,224 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:37,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:37,258 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:37,261 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 207 treesize of output 73 [2019-10-15 03:01:37,264 INFO L496 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:37,278 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-15 03:01:37,278 INFO L496 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:37,291 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-15 03:01:37,292 INFO L496 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:37,310 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:37,311 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:37,312 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:37,312 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:37,313 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:37,314 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:37,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:37,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:38,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:38,387 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:38,387 INFO L235 Elim1Store]: Index analysis took 1077 ms [2019-10-15 03:01:38,388 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 56 [2019-10-15 03:01:38,393 INFO L496 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:38,411 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-15 03:01:38,411 INFO L496 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:38,435 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-15 03:01:38,436 INFO L496 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:38,449 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-15 03:01:38,449 INFO L496 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:38,469 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:38,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:38,473 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:38,475 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:38,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:38,500 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:38,502 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 60 [2019-10-15 03:01:38,504 INFO L496 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:38,521 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:38,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:38,524 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:38,524 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:38,528 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:38,530 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:38,531 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:38,532 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:38,533 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:38,538 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:38,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:38,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:38,571 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 72 [2019-10-15 03:01:38,573 INFO L496 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:38,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:38,592 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:38,592 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:38,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:38,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:38,607 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:38,609 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 62 [2019-10-15 03:01:38,610 INFO L496 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:38,631 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:38,632 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:38,633 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:38,634 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:38,635 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:38,637 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:38,641 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:38,654 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:38,655 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 64 [2019-10-15 03:01:38,657 INFO L496 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:38,669 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-15 03:01:38,670 INFO L496 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:38,697 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-15 03:01:38,698 INFO L496 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:38,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:38,727 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:38,728 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:38,729 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:38,730 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:38,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:38,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:38,750 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:38,751 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 63 [2019-10-15 03:01:38,754 INFO L496 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:38,768 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-15 03:01:38,768 INFO L496 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:38,783 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-15 03:01:38,784 INFO L496 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:38,809 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-15 03:01:38,809 INFO L496 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:38,821 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:38,822 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:38,823 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:38,825 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:38,825 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:38,830 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:38,831 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:38,832 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:38,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:38,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:38,867 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 64 [2019-10-15 03:01:38,872 INFO L496 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:38,887 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-15 03:01:38,888 INFO L496 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:38,910 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-15 03:01:38,911 INFO L496 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:38,934 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:38,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:38,939 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:38,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:38,949 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:38,959 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:38,961 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 61 [2019-10-15 03:01:38,962 INFO L496 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:38,990 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:38,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:38,993 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:38,994 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:38,995 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:38,995 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:38,996 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:38,997 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:38,997 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:38,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:39,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:39,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:39,024 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 74 [2019-10-15 03:01:39,026 INFO L496 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:39,050 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-15 03:01:39,051 INFO L496 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:39,063 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-15 03:01:39,064 INFO L496 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:39,078 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-15 03:01:39,079 INFO L496 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:39,099 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-15 03:01:39,099 INFO L496 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:39,120 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,121 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:39,123 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,123 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,124 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,125 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:39,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:39,149 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:39,151 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 62 [2019-10-15 03:01:39,154 INFO L496 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:39,166 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-15 03:01:39,167 INFO L496 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:39,180 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,181 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,182 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,182 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,186 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,187 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,187 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,188 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,194 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:39,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:39,205 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:39,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:39,304 INFO L235 Elim1Store]: Index analysis took 124 ms [2019-10-15 03:01:39,306 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 63 [2019-10-15 03:01:39,308 INFO L496 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:39,326 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,328 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:39,328 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,329 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,330 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,331 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,333 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:39,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:39,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:39,355 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 64 [2019-10-15 03:01:39,356 INFO L496 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:39,365 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-15 03:01:39,365 INFO L496 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:39,376 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-15 03:01:39,376 INFO L496 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:39,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:39,391 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,391 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,393 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:39,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:39,405 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:39,407 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 61 [2019-10-15 03:01:39,416 INFO L496 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:39,430 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,432 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:39,432 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,433 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,434 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,434 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,435 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,436 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,436 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,438 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:39,442 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:39,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:39,464 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 72 [2019-10-15 03:01:39,466 INFO L496 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:39,480 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,482 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,484 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,486 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,487 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,488 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,489 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,489 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,494 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:39,508 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:39,513 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:39,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:39,580 INFO L235 Elim1Store]: Index analysis took 101 ms [2019-10-15 03:01:39,581 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 63 [2019-10-15 03:01:39,583 INFO L496 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:39,603 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-15 03:01:39,603 INFO L496 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:39,619 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,620 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,621 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,621 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,622 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,623 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,624 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:39,628 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,628 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,629 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:39,649 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:39,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:39,659 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 71 [2019-10-15 03:01:39,660 INFO L496 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:39,671 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-15 03:01:39,672 INFO L496 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:39,705 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-15 03:01:39,705 INFO L496 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:39,714 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-15 03:01:39,714 INFO L496 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:39,733 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-15 03:01:39,733 INFO L496 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:39,744 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:39,746 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,746 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,747 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,748 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,748 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,749 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,750 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:39,756 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:39,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:39,774 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 71 [2019-10-15 03:01:39,778 INFO L496 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:39,796 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-15 03:01:39,797 INFO L496 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:39,804 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-15 03:01:39,804 INFO L496 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:39,820 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-15 03:01:39,821 INFO L496 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:39,833 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,834 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,835 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,839 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,840 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,841 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,841 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,842 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:39,879 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:39,880 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:39,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:39,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:39,942 INFO L235 Elim1Store]: Index analysis took 109 ms [2019-10-15 03:01:39,944 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 66 [2019-10-15 03:01:39,956 INFO L496 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:39,981 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-15 03:01:39,981 INFO L496 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:39,995 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-15 03:01:39,995 INFO L496 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:40,006 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,006 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,007 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,007 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,008 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,008 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,009 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,011 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:40,012 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,013 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,014 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:40,036 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:40,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:40,050 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 71 [2019-10-15 03:01:40,054 INFO L496 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:40,080 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:40,087 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,093 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,094 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,099 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,105 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,106 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,111 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:40,123 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:40,155 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:40,157 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 71 [2019-10-15 03:01:40,159 INFO L496 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:40,174 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,176 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,178 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,194 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,195 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,196 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,196 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,197 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:40,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:40,219 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,257 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:40,280 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:40,284 INFO L235 Elim1Store]: Index analysis took 111 ms [2019-10-15 03:01:40,287 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 67 [2019-10-15 03:01:40,292 INFO L496 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:40,300 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-15 03:01:40,301 INFO L496 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:40,318 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-15 03:01:40,319 INFO L496 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:40,342 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,343 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:40,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:40,355 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:40,357 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:40,359 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 53 [2019-10-15 03:01:40,360 INFO L496 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:40,372 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,377 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:40,379 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,380 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,381 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,382 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,384 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:40,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:40,399 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:40,402 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 63 [2019-10-15 03:01:40,404 INFO L496 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:40,417 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,418 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,420 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,443 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,444 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,446 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,447 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,448 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,453 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:40,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:40,490 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,529 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:40,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:40,558 INFO L235 Elim1Store]: Index analysis took 142 ms [2019-10-15 03:01:40,560 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 64 [2019-10-15 03:01:40,563 INFO L496 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:40,577 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-15 03:01:40,577 INFO L496 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:40,586 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-15 03:01:40,586 INFO L496 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:40,593 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-15 03:01:40,593 INFO L496 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:40,605 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,606 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,607 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:40,608 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,609 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,609 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,611 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:40,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:40,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:40,624 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 63 [2019-10-15 03:01:40,625 INFO L496 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:40,633 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-15 03:01:40,633 INFO L496 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:40,642 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,643 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,644 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,645 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,645 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,647 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,647 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,648 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:40,662 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 03:01:40,663 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 03:01:40,668 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 03:01:40,668 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 179 treesize of output 72 [2019-10-15 03:01:40,671 INFO L496 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2019-10-15 03:01:40,783 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 20 [2019-10-15 03:01:40,784 INFO L567 ElimStorePlain]: treesize reduction 271, result has 10.3 percent of original size [2019-10-15 03:01:40,784 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-15 03:01:40,785 INFO L221 ElimStorePlain]: Needed 79 recursive calls to eliminate 3 variables, input treesize:12356, output treesize:31 [2019-10-15 03:01:40,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:01:40,856 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 03:01:40,856 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9, 7] imperfect sequences [8] total 14 [2019-10-15 03:01:40,856 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517794850] [2019-10-15 03:01:40,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-15 03:01:40,857 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:01:40,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-15 03:01:40,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-10-15 03:01:40,858 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 13 states. [2019-10-15 03:01:43,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:01:43,748 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2019-10-15 03:01:43,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 03:01:43,749 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2019-10-15 03:01:43,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:01:43,750 INFO L225 Difference]: With dead ends: 33 [2019-10-15 03:01:43,750 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 03:01:43,751 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 7 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-15 03:01:43,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 03:01:43,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 03:01:43,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 03:01:43,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 03:01:43,752 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2019-10-15 03:01:43,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:01:43,752 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 03:01:43,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-15 03:01:43,752 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 03:01:43,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 03:01:43,957 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:01:43,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 03:01:44,430 WARN L191 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-10-15 03:01:44,646 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-10-15 03:01:44,803 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-15 03:01:44,803 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 03:01:44,803 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 03:01:44,803 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-15 03:01:44,804 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 03:01:44,804 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 03:01:44,804 INFO L439 ceAbstractionStarter]: At program point L31-2(lines 31 37) the Hoare annotation is: (let ((.cse2 (* 4294967296 (div main_~index2~0 4294967296)))) (or (let ((.cse0 (+ main_~index2~0 1))) (and (<= (+ (* 4294967296 (div .cse0 4294967296)) main_~index1~0) (+ (* 4294967296 (div (+ main_~index1~0 (- 1)) 4294967296)) main_~index2~0 1)) (let ((.cse1 (select |#memory_int| |main_~#array~0.base|))) (= (mod (select .cse1 (+ (* (mod (+ main_~index1~0 4294967295) 4294967296) 4) |main_~#array~0.offset|)) 4294967296) (mod (select .cse1 (+ (* (mod .cse0 4294967296) 4) |main_~#array~0.offset|)) 4294967296))) (<= main_~index2~0 (+ .cse2 99998)))) (and (< main_~index1~0 (+ (* 4294967296 (div main_~index1~0 4294967296)) 100000)) (< main_~index2~0 (+ .cse2 100000)) (= 0 main_~loop_entered~0)))) [2019-10-15 03:01:44,804 INFO L443 ceAbstractionStarter]: For program point L31-3(lines 20 47) no Hoare annotation was computed. [2019-10-15 03:01:44,804 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 19 47) no Hoare annotation was computed. [2019-10-15 03:01:44,805 INFO L439 ceAbstractionStarter]: At program point L40-2(lines 40 44) the Hoare annotation is: (or (let ((.cse2 (+ main_~index2~0 1))) (let ((.cse0 (* 4294967296 (div .cse2 4294967296)))) (and (<= (+ .cse0 main_~index1~0) (+ (* 4294967296 (div (+ main_~index1~0 (- 1)) 4294967296)) main_~index2~0 1)) (let ((.cse1 (select |#memory_int| |main_~#array~0.base|))) (= (mod (select .cse1 (+ (* (mod (+ main_~index1~0 4294967295) 4294967296) 4) |main_~#array~0.offset|)) 4294967296) (mod (select .cse1 (+ (* (mod .cse2 4294967296) 4) |main_~#array~0.offset|)) 4294967296))) (<= main_~index2~0 (+ .cse0 99998))))) (let ((.cse3 (* 4294967296 (div main_~index2~0 4294967296)))) (and (<= main_~index2~0 (+ .cse3 99999)) (<= (+ .cse3 main_~index1~0 1) (+ main_~index2~0 (* 4294967296 (div main_~index1~0 4294967296))))))) [2019-10-15 03:01:44,805 INFO L439 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~index2~0 4294967296)))) (let ((.cse1 (<= (+ .cse0 main_~index1~0 1) (+ main_~index2~0 (* 4294967296 (div main_~index1~0 4294967296)))))) (or (and (<= main_~index2~0 (+ .cse0 99998)) .cse1) (and .cse1 (< main_~index2~0 (+ .cse0 100000)) (= 0 main_~loop_entered~0))))) [2019-10-15 03:01:44,805 INFO L443 ceAbstractionStarter]: For program point L32-1(line 32) no Hoare annotation was computed. [2019-10-15 03:01:44,805 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 19 47) the Hoare annotation is: true [2019-10-15 03:01:44,806 INFO L439 ceAbstractionStarter]: At program point L41(line 41) the Hoare annotation is: (let ((.cse2 (+ main_~index2~0 1))) (let ((.cse0 (* 4294967296 (div .cse2 4294967296))) (.cse4 (* 4294967296 (div |main_#t~mem7| 4294967296))) (.cse3 (+ (* 4294967296 (div |main_#t~mem8| 4294967296)) |main_#t~mem7|))) (and (<= (+ .cse0 main_~index1~0) (+ (* 4294967296 (div (+ main_~index1~0 (- 1)) 4294967296)) main_~index2~0 1)) (let ((.cse1 (select |#memory_int| |main_~#array~0.base|))) (= (mod (select .cse1 (+ (* (mod (+ main_~index1~0 4294967295) 4294967296) 4) |main_~#array~0.offset|)) 4294967296) (mod (select .cse1 (+ (* (mod .cse2 4294967296) 4) |main_~#array~0.offset|)) 4294967296))) (< .cse3 (+ .cse4 |main_#t~mem8| 1)) (<= main_~index2~0 (+ .cse0 99998)) (<= (mod main_~index2~0 4294967296) (mod main_~index1~0 4294967296)) (<= (+ .cse4 |main_#t~mem8|) .cse3)))) [2019-10-15 03:01:44,806 INFO L443 ceAbstractionStarter]: For program point L41-1(line 41) no Hoare annotation was computed. [2019-10-15 03:01:44,806 INFO L443 ceAbstractionStarter]: For program point L39(lines 39 45) no Hoare annotation was computed. [2019-10-15 03:01:44,806 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2019-10-15 03:01:44,806 INFO L443 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2019-10-15 03:01:44,806 INFO L443 ceAbstractionStarter]: For program point L11(lines 11 13) no Hoare annotation was computed. [2019-10-15 03:01:44,806 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2019-10-15 03:01:44,806 INFO L443 ceAbstractionStarter]: For program point L11-2(lines 9 15) no Hoare annotation was computed. [2019-10-15 03:01:44,807 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2019-10-15 03:01:44,821 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 03:01:44,822 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 03:01:44,833 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 03:01:44,833 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 03:01:44,835 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 03:01:44,836 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 03:01:44,837 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 03:01:44,837 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 03:01:44,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:01:44 BoogieIcfgContainer [2019-10-15 03:01:44,839 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 03:01:44,843 INFO L168 Benchmark]: Toolchain (without parser) took 20351.17 ms. Allocated memory was 142.1 MB in the beginning and 273.2 MB in the end (delta: 131.1 MB). Free memory was 102.7 MB in the beginning and 163.9 MB in the end (delta: -61.2 MB). Peak memory consumption was 69.9 MB. Max. memory is 7.1 GB. [2019-10-15 03:01:44,844 INFO L168 Benchmark]: CDTParser took 2.61 ms. Allocated memory is still 142.1 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-10-15 03:01:44,844 INFO L168 Benchmark]: CACSL2BoogieTranslator took 293.46 ms. Allocated memory is still 142.1 MB. Free memory was 102.5 MB in the beginning and 92.3 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2019-10-15 03:01:44,845 INFO L168 Benchmark]: Boogie Preprocessor took 130.56 ms. Allocated memory was 142.1 MB in the beginning and 202.4 MB in the end (delta: 60.3 MB). Free memory was 92.3 MB in the beginning and 180.1 MB in the end (delta: -87.8 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2019-10-15 03:01:44,846 INFO L168 Benchmark]: RCFGBuilder took 347.07 ms. Allocated memory is still 202.4 MB. Free memory was 180.1 MB in the beginning and 163.8 MB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 7.1 GB. [2019-10-15 03:01:44,847 INFO L168 Benchmark]: TraceAbstraction took 19574.18 ms. Allocated memory was 202.4 MB in the beginning and 273.2 MB in the end (delta: 70.8 MB). Free memory was 163.8 MB in the beginning and 163.9 MB in the end (delta: -99.6 kB). Peak memory consumption was 70.7 MB. Max. memory is 7.1 GB. [2019-10-15 03:01:44,850 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.61 ms. Allocated memory is still 142.1 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 293.46 ms. Allocated memory is still 142.1 MB. Free memory was 102.5 MB in the beginning and 92.3 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 130.56 ms. Allocated memory was 142.1 MB in the beginning and 202.4 MB in the end (delta: 60.3 MB). Free memory was 92.3 MB in the beginning and 180.1 MB in the end (delta: -87.8 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 347.07 ms. Allocated memory is still 202.4 MB. Free memory was 180.1 MB in the beginning and 163.8 MB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19574.18 ms. Allocated memory was 202.4 MB in the beginning and 273.2 MB in the end (delta: 70.8 MB). Free memory was 163.8 MB in the beginning and 163.9 MB in the end (delta: -99.6 kB). Peak memory consumption was 70.7 MB. Max. memory is 7.1 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 - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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: - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 40]: Loop Invariant [2019-10-15 03:01:44,858 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 03:01:44,859 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 03:01:44,859 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 03:01:44,859 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((4294967296 * ((index2 + 1) / 4294967296) + index1 <= 4294967296 * ((index1 + -1) / 4294967296) + index2 + 1 && unknown-#memory_int-unknown[array][(index1 + 4294967295) % 4294967296 * 4 + array] % 4294967296 == unknown-#memory_int-unknown[array][(index2 + 1) % 4294967296 * 4 + array] % 4294967296) && index2 <= 4294967296 * ((index2 + 1) / 4294967296) + 99998) || (index2 <= 4294967296 * (index2 / 4294967296) + 99999 && 4294967296 * (index2 / 4294967296) + index1 + 1 <= index2 + 4294967296 * (index1 / 4294967296)) - InvariantResult [Line: 31]: Loop Invariant [2019-10-15 03:01:44,860 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 03:01:44,861 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 03:01:44,861 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 03:01:44,861 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((4294967296 * ((index2 + 1) / 4294967296) + index1 <= 4294967296 * ((index1 + -1) / 4294967296) + index2 + 1 && unknown-#memory_int-unknown[array][(index1 + 4294967295) % 4294967296 * 4 + array] % 4294967296 == unknown-#memory_int-unknown[array][(index2 + 1) % 4294967296 * 4 + array] % 4294967296) && index2 <= 4294967296 * (index2 / 4294967296) + 99998) || ((index1 < 4294967296 * (index1 / 4294967296) + 100000 && index2 < 4294967296 * (index2 / 4294967296) + 100000) && 0 == loop_entered) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. Result: SAFE, OverallTime: 19.4s, OverallIterations: 4, TraceHistogramMax: 2, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, HoareTripleCheckerStatistics: 64 SDtfs, 39 SDslu, 174 SDs, 0 SdLazy, 186 SolverSat, 25 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 34 SyntacticMatches, 7 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=1, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 18 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 15 PreInvPairs, 22 NumberOfFragments, 336 HoareAnnotationTreeSize, 15 FomulaSimplifications, 32 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 202 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 14.2s InterpolantComputationTime, 77 NumberOfCodeBlocks, 77 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 38932 SizeOfPredicates, 10 NumberOfNonLiveVariables, 73 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 12/13 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...