/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-optional-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 21:25:37,523 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 21:25:37,525 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 21:25:37,542 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 21:25:37,543 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 21:25:37,544 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 21:25:37,545 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 21:25:37,547 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 21:25:37,549 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 21:25:37,549 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 21:25:37,550 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 21:25:37,552 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 21:25:37,552 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 21:25:37,553 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 21:25:37,554 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 21:25:37,555 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 21:25:37,556 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 21:25:37,557 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 21:25:37,558 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 21:25:37,560 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 21:25:37,561 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 21:25:37,562 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 21:25:37,563 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 21:25:37,564 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 21:25:37,566 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 21:25:37,567 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 21:25:37,567 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 21:25:37,568 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 21:25:37,568 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 21:25:37,569 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 21:25:37,569 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 21:25:37,570 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 21:25:37,571 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 21:25:37,571 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 21:25:37,572 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 21:25:37,573 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 21:25:37,573 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 21:25:37,574 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 21:25:37,574 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 21:25:37,575 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 21:25:37,575 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 21:25:37,576 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-11-23 21:25:37,590 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 21:25:37,590 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 21:25:37,591 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 21:25:37,591 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 21:25:37,592 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 21:25:37,592 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 21:25:37,592 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 21:25:37,592 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 21:25:37,592 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 21:25:37,593 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 21:25:37,593 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 21:25:37,593 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 21:25:37,593 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 21:25:37,593 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 21:25:37,594 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 21:25:37,594 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 21:25:37,594 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 21:25:37,594 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 21:25:37,594 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 21:25:37,595 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 21:25:37,595 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 21:25:37,595 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 21:25:37,595 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 21:25:37,595 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 21:25:37,596 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 21:25:37,596 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 21:25:37,596 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 21:25:37,596 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 21:25:37,596 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 21:25:37,597 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 21:25:37,855 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 21:25:37,870 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 21:25:37,874 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 21:25:37,876 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 21:25:37,876 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 21:25:37,877 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-optional-1.i [2019-11-23 21:25:37,953 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1b044b5a/01bdfb6daded4282a3508998e17509a7/FLAGf464c9aa2 [2019-11-23 21:25:38,505 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 21:25:38,505 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-optional-1.i [2019-11-23 21:25:38,523 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1b044b5a/01bdfb6daded4282a3508998e17509a7/FLAGf464c9aa2 [2019-11-23 21:25:38,783 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1b044b5a/01bdfb6daded4282a3508998e17509a7 [2019-11-23 21:25:38,792 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 21:25:38,794 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 21:25:38,795 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 21:25:38,795 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 21:25:38,798 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 21:25:38,799 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:25:38" (1/1) ... [2019-11-23 21:25:38,802 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3233fd50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:25:38, skipping insertion in model container [2019-11-23 21:25:38,802 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:25:38" (1/1) ... [2019-11-23 21:25:38,810 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 21:25:38,849 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 21:25:39,283 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:25:39,293 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 21:25:39,346 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:25:39,400 INFO L208 MainTranslator]: Completed translation [2019-11-23 21:25:39,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:25:39 WrapperNode [2019-11-23 21:25:39,400 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 21:25:39,403 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 21:25:39,403 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 21:25:39,403 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 21:25:39,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:25:39" (1/1) ... [2019-11-23 21:25:39,431 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:25:39" (1/1) ... [2019-11-23 21:25:39,454 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 21:25:39,454 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 21:25:39,454 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 21:25:39,454 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 21:25:39,462 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:25:39" (1/1) ... [2019-11-23 21:25:39,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:25:39" (1/1) ... [2019-11-23 21:25:39,467 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:25:39" (1/1) ... [2019-11-23 21:25:39,467 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:25:39" (1/1) ... [2019-11-23 21:25:39,477 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:25:39" (1/1) ... [2019-11-23 21:25:39,483 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:25:39" (1/1) ... [2019-11-23 21:25:39,485 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:25:39" (1/1) ... [2019-11-23 21:25:39,488 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 21:25:39,488 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 21:25:39,489 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 21:25:39,489 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 21:25:39,490 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:25:39" (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-11-23 21:25:39,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-23 21:25:39,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-23 21:25:39,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-23 21:25:39,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-23 21:25:39,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-23 21:25:39,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-23 21:25:39,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 21:25:39,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 21:25:40,028 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 21:25:40,028 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-23 21:25:40,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:25:40 BoogieIcfgContainer [2019-11-23 21:25:40,030 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 21:25:40,031 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 21:25:40,031 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 21:25:40,034 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 21:25:40,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:25:38" (1/3) ... [2019-11-23 21:25:40,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2deea25c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:25:40, skipping insertion in model container [2019-11-23 21:25:40,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:25:39" (2/3) ... [2019-11-23 21:25:40,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2deea25c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:25:40, skipping insertion in model container [2019-11-23 21:25:40,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:25:40" (3/3) ... [2019-11-23 21:25:40,038 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-optional-1.i [2019-11-23 21:25:40,048 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 21:25:40,055 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 21:25:40,064 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 21:25:40,085 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 21:25:40,085 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 21:25:40,085 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 21:25:40,085 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 21:25:40,085 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 21:25:40,086 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 21:25:40,086 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 21:25:40,086 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 21:25:40,098 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2019-11-23 21:25:40,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-23 21:25:40,105 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:25:40,106 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:25:40,106 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:25:40,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:25:40,111 INFO L82 PathProgramCache]: Analyzing trace with hash 573386926, now seen corresponding path program 1 times [2019-11-23 21:25:40,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:25:40,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392367651] [2019-11-23 21:25:40,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:25:40,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:25:40,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:25:40,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392367651] [2019-11-23 21:25:40,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:25:40,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 21:25:40,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154560918] [2019-11-23 21:25:40,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-23 21:25:40,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:25:40,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-23 21:25:40,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-23 21:25:40,305 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2019-11-23 21:25:40,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:25:40,326 INFO L93 Difference]: Finished difference Result 51 states and 77 transitions. [2019-11-23 21:25:40,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-23 21:25:40,328 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-11-23 21:25:40,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:25:40,336 INFO L225 Difference]: With dead ends: 51 [2019-11-23 21:25:40,337 INFO L226 Difference]: Without dead ends: 22 [2019-11-23 21:25:40,340 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-23 21:25:40,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-11-23 21:25:40,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-11-23 21:25:40,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-23 21:25:40,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2019-11-23 21:25:40,373 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 15 [2019-11-23 21:25:40,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:25:40,374 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2019-11-23 21:25:40,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-23 21:25:40,374 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2019-11-23 21:25:40,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-23 21:25:40,375 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:25:40,375 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:25:40,375 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:25:40,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:25:40,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1170055612, now seen corresponding path program 1 times [2019-11-23 21:25:40,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:25:40,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912069125] [2019-11-23 21:25:40,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:25:40,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:25:40,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:25:40,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912069125] [2019-11-23 21:25:40,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:25:40,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:25:40,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943807239] [2019-11-23 21:25:40,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:25:40,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:25:40,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:25:40,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:25:40,468 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand 4 states. [2019-11-23 21:25:40,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:25:40,516 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2019-11-23 21:25:40,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:25:40,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-23 21:25:40,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:25:40,519 INFO L225 Difference]: With dead ends: 37 [2019-11-23 21:25:40,519 INFO L226 Difference]: Without dead ends: 25 [2019-11-23 21:25:40,521 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:25:40,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-23 21:25:40,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-11-23 21:25:40,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-23 21:25:40,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2019-11-23 21:25:40,532 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 16 [2019-11-23 21:25:40,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:25:40,533 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2019-11-23 21:25:40,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:25:40,533 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2019-11-23 21:25:40,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-23 21:25:40,535 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:25:40,535 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:25:40,536 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:25:40,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:25:40,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1170053690, now seen corresponding path program 1 times [2019-11-23 21:25:40,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:25:40,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931520475] [2019-11-23 21:25:40,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:25:40,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:25:40,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:25:40,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931520475] [2019-11-23 21:25:40,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:25:40,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 21:25:40,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950976785] [2019-11-23 21:25:40,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 21:25:40,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:25:40,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 21:25:40,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:25:40,695 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand 6 states. [2019-11-23 21:25:40,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:25:40,976 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2019-11-23 21:25:40,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-23 21:25:40,976 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-23 21:25:40,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:25:40,977 INFO L225 Difference]: With dead ends: 41 [2019-11-23 21:25:40,978 INFO L226 Difference]: Without dead ends: 39 [2019-11-23 21:25:40,978 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-11-23 21:25:40,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-23 21:25:40,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 29. [2019-11-23 21:25:40,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-23 21:25:40,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2019-11-23 21:25:40,986 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 16 [2019-11-23 21:25:40,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:25:40,987 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2019-11-23 21:25:40,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 21:25:40,987 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2019-11-23 21:25:40,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-23 21:25:40,988 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:25:40,988 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:25:40,988 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:25:40,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:25:40,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1171900732, now seen corresponding path program 1 times [2019-11-23 21:25:40,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:25:40,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551753299] [2019-11-23 21:25:40,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:25:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:25:41,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:25:41,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551753299] [2019-11-23 21:25:41,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:25:41,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 21:25:41,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410137421] [2019-11-23 21:25:41,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 21:25:41,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:25:41,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 21:25:41,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:25:41,152 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand 7 states. [2019-11-23 21:25:41,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:25:41,529 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2019-11-23 21:25:41,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 21:25:41,530 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-11-23 21:25:41,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:25:41,531 INFO L225 Difference]: With dead ends: 93 [2019-11-23 21:25:41,531 INFO L226 Difference]: Without dead ends: 74 [2019-11-23 21:25:41,532 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-11-23 21:25:41,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-23 21:25:41,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 42. [2019-11-23 21:25:41,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-23 21:25:41,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2019-11-23 21:25:41,541 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 16 [2019-11-23 21:25:41,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:25:41,541 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2019-11-23 21:25:41,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 21:25:41,541 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2019-11-23 21:25:41,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-23 21:25:41,542 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:25:41,542 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:25:41,543 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:25:41,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:25:41,543 INFO L82 PathProgramCache]: Analyzing trace with hash 604953672, now seen corresponding path program 1 times [2019-11-23 21:25:41,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:25:41,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448331791] [2019-11-23 21:25:41,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:25:41,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:25:41,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:25:41,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448331791] [2019-11-23 21:25:41,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:25:41,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 21:25:41,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998401133] [2019-11-23 21:25:41,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 21:25:41,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:25:41,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 21:25:41,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:25:41,622 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand 6 states. [2019-11-23 21:25:41,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:25:41,829 INFO L93 Difference]: Finished difference Result 87 states and 108 transitions. [2019-11-23 21:25:41,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 21:25:41,832 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-23 21:25:41,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:25:41,834 INFO L225 Difference]: With dead ends: 87 [2019-11-23 21:25:41,834 INFO L226 Difference]: Without dead ends: 64 [2019-11-23 21:25:41,834 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-23 21:25:41,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-23 21:25:41,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 40. [2019-11-23 21:25:41,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-23 21:25:41,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2019-11-23 21:25:41,842 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 16 [2019-11-23 21:25:41,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:25:41,842 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2019-11-23 21:25:41,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 21:25:41,842 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2019-11-23 21:25:41,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-23 21:25:41,843 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:25:41,843 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:25:41,843 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:25:41,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:25:41,844 INFO L82 PathProgramCache]: Analyzing trace with hash 466614784, now seen corresponding path program 1 times [2019-11-23 21:25:41,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:25:41,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061892339] [2019-11-23 21:25:41,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:25:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:25:41,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:25:41,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061892339] [2019-11-23 21:25:41,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:25:41,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 21:25:41,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981714415] [2019-11-23 21:25:41,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 21:25:41,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:25:41,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 21:25:41,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:25:41,970 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand 6 states. [2019-11-23 21:25:42,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:25:42,272 INFO L93 Difference]: Finished difference Result 85 states and 107 transitions. [2019-11-23 21:25:42,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-23 21:25:42,273 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-11-23 21:25:42,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:25:42,274 INFO L225 Difference]: With dead ends: 85 [2019-11-23 21:25:42,275 INFO L226 Difference]: Without dead ends: 83 [2019-11-23 21:25:42,275 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-23 21:25:42,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-23 21:25:42,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 50. [2019-11-23 21:25:42,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-23 21:25:42,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 65 transitions. [2019-11-23 21:25:42,298 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 65 transitions. Word has length 17 [2019-11-23 21:25:42,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:25:42,298 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 65 transitions. [2019-11-23 21:25:42,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 21:25:42,299 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2019-11-23 21:25:42,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-23 21:25:42,301 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:25:42,301 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:25:42,302 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:25:42,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:25:42,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1690516158, now seen corresponding path program 1 times [2019-11-23 21:25:42,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:25:42,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358342332] [2019-11-23 21:25:42,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:25:42,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:25:42,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:25:42,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358342332] [2019-11-23 21:25:42,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395673489] [2019-11-23 21:25:42,964 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-11-23 21:25:43,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:25:43,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 48 conjunts are in the unsatisfiable core [2019-11-23 21:25:43,056 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:25:43,130 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:25:43,130 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:25:43,138 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:25:43,139 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:25:43,139 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 21:25:43,171 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:25:43,171 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:25:43,173 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:25:43,236 INFO L567 ElimStorePlain]: treesize reduction 14, result has 85.1 percent of original size [2019-11-23 21:25:43,248 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 17 [2019-11-23 21:25:43,249 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:25:43,266 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:25:43,271 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 17 [2019-11-23 21:25:43,271 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:25:43,295 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:25:43,296 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:25:43,297 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:82, output treesize:68 [2019-11-23 21:25:43,484 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:25:43,504 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 99 [2019-11-23 21:25:43,508 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:25:43,657 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-11-23 21:25:43,659 INFO L567 ElimStorePlain]: treesize reduction 46, result has 83.7 percent of original size [2019-11-23 21:25:43,662 INFO L392 ElimStorePlain]: Different costs {14=[|v_#memory_$Pointer$.offset_42|], 26=[|v_#memory_$Pointer$.base_42|]} [2019-11-23 21:25:43,675 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:25:43,677 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:25:43,678 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:25:43,679 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:25:43,695 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:25:43,696 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 79 [2019-11-23 21:25:43,698 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:25:43,798 INFO L567 ElimStorePlain]: treesize reduction 16, result has 92.5 percent of original size [2019-11-23 21:25:43,803 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:25:43,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:25:44,076 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-11-23 21:25:44,078 INFO L343 Elim1Store]: treesize reduction 95, result has 68.1 percent of original size [2019-11-23 21:25:44,079 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 132 treesize of output 245 [2019-11-23 21:25:44,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:25:44,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:25:44,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 21:25:44,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:25:44,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 21:25:44,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:25:44,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 21:25:44,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:25:44,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:25:44,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:25:44,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 21:25:44,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:25:44,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 21:25:44,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:25:44,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 21:25:44,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:25:44,106 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:25:44,267 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 58 [2019-11-23 21:25:44,268 INFO L567 ElimStorePlain]: treesize reduction 162, result has 41.5 percent of original size [2019-11-23 21:25:44,269 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:25:44,269 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:228, output treesize:153 [2019-11-23 21:25:44,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:25:44,479 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:25:44,480 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 311 treesize of output 327 [2019-11-23 21:25:44,482 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:25:44,529 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:25:44,530 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 284 treesize of output 300 [2019-11-23 21:25:44,531 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:25:48,423 WARN L192 SmtUtils]: Spent 3.89 s on a formula simplification. DAG size of input: 102 DAG size of output: 102 [2019-11-23 21:25:48,424 INFO L567 ElimStorePlain]: treesize reduction 11, result has 98.1 percent of original size [2019-11-23 21:25:48,426 INFO L392 ElimStorePlain]: Different costs {12=[|v_#memory_$Pointer$.base_41|, |v_#memory_$Pointer$.offset_41|], 38=[|v_#memory_$Pointer$.offset_43|, |v_#memory_$Pointer$.base_43|]} [2019-11-23 21:25:48,440 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:25:48,449 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:25:49,059 WARN L192 SmtUtils]: Spent 609.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-11-23 21:25:49,061 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:25:49,068 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:25:49,075 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:25:49,405 WARN L192 SmtUtils]: Spent 329.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-11-23 21:25:49,405 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:25:49,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:25:49,429 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:25:49,432 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:25:49,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:25:49,555 INFO L237 Elim1Store]: Index analysis took 136 ms [2019-11-23 21:25:49,688 INFO L343 Elim1Store]: treesize reduction 5, result has 93.1 percent of original size [2019-11-23 21:25:49,689 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 261 treesize of output 304 [2019-11-23 21:25:49,691 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-23 21:25:49,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:25:49,745 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 212 [2019-11-23 21:25:49,747 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-23 21:25:50,254 WARN L192 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 89 [2019-11-23 21:25:50,255 INFO L567 ElimStorePlain]: treesize reduction 44, result has 91.1 percent of original size [2019-11-23 21:25:50,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:25:50,305 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:25:50,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:25:50,337 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:25:50,641 WARN L192 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-11-23 21:25:50,642 INFO L343 Elim1Store]: treesize reduction 95, result has 70.9 percent of original size [2019-11-23 21:25:50,643 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 203 treesize of output 341 [2019-11-23 21:25:50,647 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-23 21:25:50,659 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:25:50,678 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:25:51,430 WARN L192 SmtUtils]: Spent 749.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 138 [2019-11-23 21:25:51,432 INFO L343 Elim1Store]: treesize reduction 259, result has 65.0 percent of original size [2019-11-23 21:25:51,433 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 248 treesize of output 601 [2019-11-23 21:25:51,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:25:51,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:25:51,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 21:25:51,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:25:51,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:25:51,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:25:51,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:25:51,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 21:25:51,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:25:51,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:25:51,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:25:51,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:25:51,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 21:25:51,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:25:51,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:25:51,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:25:51,466 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-23 21:25:52,310 WARN L192 SmtUtils]: Spent 843.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 87 [2019-11-23 21:25:52,311 INFO L567 ElimStorePlain]: treesize reduction 5251, result has 7.4 percent of original size [2019-11-23 21:25:52,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:25:52,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:25:52,318 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-23 21:25:52,319 INFO L221 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:596, output treesize:449 [2019-11-23 21:25:52,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:25:52,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:25:52,547 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-23 21:25:52,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:25:52,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:25:52,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:25:52,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:25:52,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:25:52,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:25:53,198 WARN L192 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 113 [2019-11-23 21:25:53,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:25:53,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:25:53,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:25:53,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 17 [2019-11-23 21:25:53,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884300076] [2019-11-23 21:25:53,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-23 21:25:53,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:25:53,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-23 21:25:53,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-11-23 21:25:53,249 INFO L87 Difference]: Start difference. First operand 50 states and 65 transitions. Second operand 17 states. [2019-11-23 21:25:55,852 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-11-23 21:25:56,279 WARN L192 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 116 [2019-11-23 21:25:58,579 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-11-23 21:26:03,441 WARN L192 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 219 DAG size of output: 97 [2019-11-23 21:26:03,628 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-11-23 21:26:04,788 WARN L192 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 98 [2019-11-23 21:26:05,295 WARN L192 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 99 [2019-11-23 21:26:06,096 WARN L192 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 95 [2019-11-23 21:26:07,003 WARN L192 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 109 [2019-11-23 21:26:07,548 WARN L192 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 112 [2019-11-23 21:26:07,705 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-11-23 21:26:08,051 WARN L192 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 109 [2019-11-23 21:26:08,426 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 107 [2019-11-23 21:26:08,886 WARN L192 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 108 [2019-11-23 21:26:09,255 WARN L192 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 110 [2019-11-23 21:26:09,630 WARN L192 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 89 [2019-11-23 21:26:09,973 WARN L192 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 104 [2019-11-23 21:26:10,321 WARN L192 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 107 [2019-11-23 21:26:10,647 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 104 [2019-11-23 21:26:10,995 WARN L192 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 102 [2019-11-23 21:26:11,382 WARN L192 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 103 [2019-11-23 21:26:11,732 WARN L192 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 105 [2019-11-23 21:26:12,114 WARN L192 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 111 [2019-11-23 21:26:12,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:26:12,118 INFO L93 Difference]: Finished difference Result 244 states and 306 transitions. [2019-11-23 21:26:12,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-11-23 21:26:12,118 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 19 [2019-11-23 21:26:12,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:26:12,120 INFO L225 Difference]: With dead ends: 244 [2019-11-23 21:26:12,120 INFO L226 Difference]: Without dead ends: 225 [2019-11-23 21:26:12,122 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1350 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=1134, Invalid=3558, Unknown=0, NotChecked=0, Total=4692 [2019-11-23 21:26:12,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-11-23 21:26:12,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 54. [2019-11-23 21:26:12,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-23 21:26:12,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 71 transitions. [2019-11-23 21:26:12,134 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 71 transitions. Word has length 19 [2019-11-23 21:26:12,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:26:12,135 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 71 transitions. [2019-11-23 21:26:12,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-23 21:26:12,135 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 71 transitions. [2019-11-23 21:26:12,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-23 21:26:12,136 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:26:12,136 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:26:12,339 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:26:12,340 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:26:12,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:26:12,340 INFO L82 PathProgramCache]: Analyzing trace with hash 86338246, now seen corresponding path program 1 times [2019-11-23 21:26:12,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:26:12,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424567980] [2019-11-23 21:26:12,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:26:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:26:12,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:26:12,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424567980] [2019-11-23 21:26:12,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471484914] [2019-11-23 21:26:12,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:26:12,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:26:12,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-23 21:26:12,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:26:12,604 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:26:12,605 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:12,610 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:12,611 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:26:12,611 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 21:26:12,633 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:12,634 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:26:12,635 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:12,672 INFO L567 ElimStorePlain]: treesize reduction 14, result has 80.3 percent of original size [2019-11-23 21:26:12,673 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_39|], 2=[|v_#memory_int_35|]} [2019-11-23 21:26:12,678 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:12,684 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2019-11-23 21:26:12,684 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:12,699 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:12,703 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-23 21:26:12,704 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:12,729 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:12,730 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:26:12,730 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:59, output treesize:27 [2019-11-23 21:26:12,836 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:12,837 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2019-11-23 21:26:12,839 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:12,926 INFO L567 ElimStorePlain]: treesize reduction 28, result has 80.6 percent of original size [2019-11-23 21:26:12,931 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:26:12,971 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:12,974 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:26:13,008 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:13,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:13,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:13,016 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:26:13,047 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:13,047 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 47 [2019-11-23 21:26:13,048 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:13,111 INFO L567 ElimStorePlain]: treesize reduction 16, result has 84.8 percent of original size [2019-11-23 21:26:13,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:13,115 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:13,146 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:13,147 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:26:13,148 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:114, output treesize:40 [2019-11-23 21:26:13,242 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:13,242 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 treesize of output 37 [2019-11-23 21:26:13,243 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:13,287 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:13,288 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_38|], 4=[|v_#memory_int_41|]} [2019-11-23 21:26:13,291 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:26:13,318 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:13,334 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-23 21:26:13,335 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 31 [2019-11-23 21:26:13,336 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:13,363 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:13,364 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:26:13,365 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:84, output treesize:26 [2019-11-23 21:26:13,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:13,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:26:13,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:26:13,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-11-23 21:26:13,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910370614] [2019-11-23 21:26:13,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-23 21:26:13,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:26:13,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-23 21:26:13,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-23 21:26:13,424 INFO L87 Difference]: Start difference. First operand 54 states and 71 transitions. Second operand 14 states. [2019-11-23 21:26:14,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:26:14,147 INFO L93 Difference]: Finished difference Result 143 states and 178 transitions. [2019-11-23 21:26:14,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-23 21:26:14,147 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 19 [2019-11-23 21:26:14,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:26:14,149 INFO L225 Difference]: With dead ends: 143 [2019-11-23 21:26:14,149 INFO L226 Difference]: Without dead ends: 122 [2019-11-23 21:26:14,150 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2019-11-23 21:26:14,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-23 21:26:14,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 48. [2019-11-23 21:26:14,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-23 21:26:14,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2019-11-23 21:26:14,159 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 19 [2019-11-23 21:26:14,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:26:14,159 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2019-11-23 21:26:14,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-23 21:26:14,159 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2019-11-23 21:26:14,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-23 21:26:14,160 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:26:14,160 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:26:14,363 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:26:14,364 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:26:14,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:26:14,365 INFO L82 PathProgramCache]: Analyzing trace with hash -978098042, now seen corresponding path program 1 times [2019-11-23 21:26:14,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:26:14,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460310150] [2019-11-23 21:26:14,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:26:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:26:14,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:26:14,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460310150] [2019-11-23 21:26:14,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583530894] [2019-11-23 21:26:14,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:26:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:26:14,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 37 conjunts are in the unsatisfiable core [2019-11-23 21:26:14,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:26:14,647 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:26:14,648 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:14,652 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:14,652 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:26:14,653 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 21:26:14,658 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-23 21:26:14,659 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:14,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:14,671 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-23 21:26:14,671 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:14,680 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:14,680 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:26:14,680 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2019-11-23 21:26:14,734 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:14,734 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:26:14,735 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:14,852 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-11-23 21:26:14,853 INFO L567 ElimStorePlain]: treesize reduction 14, result has 93.3 percent of original size [2019-11-23 21:26:14,855 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_46|], 16=[|v_#memory_$Pointer$.base_47|]} [2019-11-23 21:26:14,860 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:14,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:14,863 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:26:14,881 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:14,882 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 58 [2019-11-23 21:26:14,882 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:14,981 INFO L567 ElimStorePlain]: treesize reduction 22, result has 87.6 percent of original size [2019-11-23 21:26:14,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:14,992 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:15,064 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:15,064 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 123 [2019-11-23 21:26:15,066 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:15,161 INFO L567 ElimStorePlain]: treesize reduction 78, result has 53.8 percent of original size [2019-11-23 21:26:15,162 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:26:15,162 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:197, output treesize:109 [2019-11-23 21:26:15,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:15,278 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:15,279 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 261 treesize of output 271 [2019-11-23 21:26:15,280 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:15,313 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:15,314 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 288 treesize of output 298 [2019-11-23 21:26:15,314 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:17,085 WARN L192 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 94 DAG size of output: 94 [2019-11-23 21:26:17,086 INFO L567 ElimStorePlain]: treesize reduction 3, result has 99.4 percent of original size [2019-11-23 21:26:17,089 INFO L392 ElimStorePlain]: Different costs {14=[|v_#memory_$Pointer$.base_46|, |v_#memory_$Pointer$.offset_45|], 28=[|v_#memory_$Pointer$.base_48|, |v_#memory_$Pointer$.offset_47|]} [2019-11-23 21:26:17,097 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:26:17,109 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:26:17,527 WARN L192 SmtUtils]: Spent 417.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-11-23 21:26:17,528 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:17,533 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:26:17,539 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:26:17,791 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-23 21:26:17,791 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:17,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:17,809 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:17,814 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:17,815 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:18,260 WARN L192 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 87 [2019-11-23 21:26:18,261 INFO L343 Elim1Store]: treesize reduction 28, result has 93.0 percent of original size [2019-11-23 21:26:18,262 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 236 treesize of output 494 [2019-11-23 21:26:18,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:18,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:18,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:18,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:18,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:18,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:18,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:18,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:18,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:18,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:18,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:18,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:18,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:18,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:18,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:18,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:18,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:18,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:18,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:18,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:18,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:18,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:18,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:18,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:18,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,380 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:18,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:18,966 WARN L192 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 110 [2019-11-23 21:26:18,967 INFO L343 Elim1Store]: treesize reduction 200, result has 66.8 percent of original size [2019-11-23 21:26:18,968 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 212 treesize of output 507 [2019-11-23 21:26:18,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:18,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:18,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:18,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:18,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:19,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:19,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:19,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:19,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:19,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:19,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:19,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:19,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:19,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:19,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:19,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:19,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:19,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:19,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:19,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:19,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:19,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:19,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:19,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:19,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:19,192 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:24,940 WARN L192 SmtUtils]: Spent 5.75 s on a formula simplification. DAG size of input: 303 DAG size of output: 84 [2019-11-23 21:26:24,940 INFO L567 ElimStorePlain]: treesize reduction 1918065, result has 0.0 percent of original size [2019-11-23 21:26:24,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:24,960 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:24,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:24,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:25,067 INFO L343 Elim1Store]: treesize reduction 19, result has 77.6 percent of original size [2019-11-23 21:26:25,068 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 204 treesize of output 199 [2019-11-23 21:26:25,071 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:25,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:25,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:25,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:25,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:25,168 INFO L343 Elim1Store]: treesize reduction 5, result has 93.1 percent of original size [2019-11-23 21:26:25,168 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 211 treesize of output 245 [2019-11-23 21:26:25,170 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:25,459 WARN L192 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 78 [2019-11-23 21:26:25,460 INFO L567 ElimStorePlain]: treesize reduction 189, result has 66.1 percent of original size [2019-11-23 21:26:25,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:25,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:25,465 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-23 21:26:25,465 INFO L221 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:550, output treesize:393 [2019-11-23 21:26:25,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:25,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:25,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:25,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:25,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:25,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:25,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:25,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:25,961 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-11-23 21:26:25,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:25,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:26:25,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:26:25,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2019-11-23 21:26:25,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452000261] [2019-11-23 21:26:25,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-23 21:26:25,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:26:25,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-23 21:26:25,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2019-11-23 21:26:25,986 INFO L87 Difference]: Start difference. First operand 48 states and 63 transitions. Second operand 14 states. [2019-11-23 21:26:28,816 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 78 [2019-11-23 21:26:31,630 WARN L192 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 111 [2019-11-23 21:26:34,418 WARN L192 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 113 [2019-11-23 21:26:34,770 WARN L192 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 115 [2019-11-23 21:26:35,243 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 80 [2019-11-23 21:26:35,524 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 82 [2019-11-23 21:26:35,721 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 80 [2019-11-23 21:26:36,007 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 75 [2019-11-23 21:26:36,215 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 77 [2019-11-23 21:26:36,428 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 79 [2019-11-23 21:26:36,652 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 77 [2019-11-23 21:26:36,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:26:36,658 INFO L93 Difference]: Finished difference Result 181 states and 228 transitions. [2019-11-23 21:26:36,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-23 21:26:36,659 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2019-11-23 21:26:36,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:26:36,661 INFO L225 Difference]: With dead ends: 181 [2019-11-23 21:26:36,661 INFO L226 Difference]: Without dead ends: 160 [2019-11-23 21:26:36,663 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=292, Invalid=968, Unknown=0, NotChecked=0, Total=1260 [2019-11-23 21:26:36,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-23 21:26:36,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 53. [2019-11-23 21:26:36,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-23 21:26:36,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2019-11-23 21:26:36,673 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 20 [2019-11-23 21:26:36,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:26:36,673 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2019-11-23 21:26:36,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-23 21:26:36,673 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2019-11-23 21:26:36,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-23 21:26:36,674 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:26:36,674 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:26:36,877 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:26:36,877 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:26:36,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:26:36,878 INFO L82 PathProgramCache]: Analyzing trace with hash 798756362, now seen corresponding path program 1 times [2019-11-23 21:26:36,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:26:36,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116973312] [2019-11-23 21:26:36,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:26:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:26:37,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:26:37,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116973312] [2019-11-23 21:26:37,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192440547] [2019-11-23 21:26:37,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:26:37,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:26:37,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-23 21:26:37,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:26:37,203 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:26:37,203 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:37,215 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:37,216 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:26:37,216 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 21:26:37,222 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-23 21:26:37,222 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:37,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:37,238 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-23 21:26:37,239 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:37,251 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:37,252 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:26:37,252 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2019-11-23 21:26:37,335 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:37,336 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:26:37,337 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:37,523 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-11-23 21:26:37,524 INFO L567 ElimStorePlain]: treesize reduction 14, result has 93.3 percent of original size [2019-11-23 21:26:37,526 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_50|], 16=[|v_#memory_$Pointer$.base_51|]} [2019-11-23 21:26:37,535 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:37,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:37,538 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:26:37,557 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:37,558 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 58 [2019-11-23 21:26:37,558 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:37,661 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-11-23 21:26:37,661 INFO L567 ElimStorePlain]: treesize reduction 22, result has 87.6 percent of original size [2019-11-23 21:26:37,664 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:37,667 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:37,734 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:37,735 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 123 [2019-11-23 21:26:37,735 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:37,826 INFO L567 ElimStorePlain]: treesize reduction 78, result has 53.8 percent of original size [2019-11-23 21:26:37,826 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:26:37,827 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:197, output treesize:109 [2019-11-23 21:26:37,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:37,929 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:37,930 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 288 treesize of output 298 [2019-11-23 21:26:37,931 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:37,974 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:37,975 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 261 treesize of output 271 [2019-11-23 21:26:37,976 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:40,485 WARN L192 SmtUtils]: Spent 2.51 s on a formula simplification. DAG size of input: 94 DAG size of output: 94 [2019-11-23 21:26:40,485 INFO L567 ElimStorePlain]: treesize reduction 17, result has 96.8 percent of original size [2019-11-23 21:26:40,488 INFO L392 ElimStorePlain]: Different costs {14=[|v_#memory_$Pointer$.offset_49|, |v_#memory_$Pointer$.base_50|], 28=[|v_#memory_$Pointer$.offset_51|, |v_#memory_$Pointer$.base_52|]} [2019-11-23 21:26:40,503 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:26:40,510 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:26:40,997 WARN L192 SmtUtils]: Spent 486.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-11-23 21:26:40,997 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:41,003 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:26:41,016 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:26:41,404 WARN L192 SmtUtils]: Spent 386.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-23 21:26:41,404 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:41,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:41,454 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:41,457 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:41,460 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:41,580 INFO L237 Elim1Store]: Index analysis took 159 ms [2019-11-23 21:26:41,710 INFO L343 Elim1Store]: treesize reduction 5, result has 93.1 percent of original size [2019-11-23 21:26:41,711 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 212 treesize of output 254 [2019-11-23 21:26:41,712 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:41,728 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:41,804 INFO L343 Elim1Store]: treesize reduction 19, result has 77.6 percent of original size [2019-11-23 21:26:41,805 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 222 treesize of output 223 [2019-11-23 21:26:41,807 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:42,255 WARN L192 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 81 [2019-11-23 21:26:42,256 INFO L567 ElimStorePlain]: treesize reduction 197, result has 67.1 percent of original size [2019-11-23 21:26:42,275 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:42,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:42,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:42,284 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:42,781 WARN L192 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 87 [2019-11-23 21:26:42,782 INFO L343 Elim1Store]: treesize reduction 28, result has 93.0 percent of original size [2019-11-23 21:26:42,782 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 190 treesize of output 460 [2019-11-23 21:26:42,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:42,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:42,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:43,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:43,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:43,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:43,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:43,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:43,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:43,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:43,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:43,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:43,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:43,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:43,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:43,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:43,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:43,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:43,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:43,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:43,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:43,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:43,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:43,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:43,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:43,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:43,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:43,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:43,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:43,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:43,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:43,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:43,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:43,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:43,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:43,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:43,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:43,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:43,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:43,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:43,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:43,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:43,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:43,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,104 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:43,118 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:43,667 WARN L192 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 110 [2019-11-23 21:26:43,669 INFO L343 Elim1Store]: treesize reduction 200, result has 66.8 percent of original size [2019-11-23 21:26:43,670 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 211 treesize of output 514 [2019-11-23 21:26:43,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:43,684 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:45,396 WARN L192 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 255 DAG size of output: 81 [2019-11-23 21:26:45,397 INFO L567 ElimStorePlain]: treesize reduction 1209857, result has 0.0 percent of original size [2019-11-23 21:26:45,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:45,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:45,401 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-23 21:26:45,401 INFO L221 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:550, output treesize:393 [2019-11-23 21:26:45,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:45,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:45,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:45,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:45,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:45,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:45,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:45,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:45,794 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-11-23 21:26:45,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 21:26:45,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:45,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:45,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:45,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:45,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:26:45,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:26:45,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-11-23 21:26:45,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418660819] [2019-11-23 21:26:45,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-23 21:26:45,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:26:45,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-23 21:26:45,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-11-23 21:26:45,857 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand 13 states. [2019-11-23 21:26:48,642 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 81 [2019-11-23 21:26:51,421 WARN L192 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 111 [2019-11-23 21:26:52,031 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 112 [2019-11-23 21:26:52,266 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 75 [2019-11-23 21:26:52,557 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 76 [2019-11-23 21:26:52,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:26:52,572 INFO L93 Difference]: Finished difference Result 132 states and 160 transitions. [2019-11-23 21:26:52,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-23 21:26:52,572 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2019-11-23 21:26:52,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:26:52,574 INFO L225 Difference]: With dead ends: 132 [2019-11-23 21:26:52,574 INFO L226 Difference]: Without dead ends: 130 [2019-11-23 21:26:52,575 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=143, Invalid=457, Unknown=0, NotChecked=0, Total=600 [2019-11-23 21:26:52,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-23 21:26:52,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 47. [2019-11-23 21:26:52,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-23 21:26:52,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2019-11-23 21:26:52,588 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 60 transitions. Word has length 20 [2019-11-23 21:26:52,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:26:52,588 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 60 transitions. [2019-11-23 21:26:52,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-23 21:26:52,588 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2019-11-23 21:26:52,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 21:26:52,589 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:26:52,589 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:26:52,799 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:26:52,800 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:26:52,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:26:52,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1984947091, now seen corresponding path program 1 times [2019-11-23 21:26:52,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:26:52,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374705106] [2019-11-23 21:26:52,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:26:52,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:26:52,861 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:26:52,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374705106] [2019-11-23 21:26:52,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430284524] [2019-11-23 21:26:52,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:26:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:26:52,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-23 21:26:52,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:26:52,924 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:26:52,924 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:52,928 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:52,929 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:26:52,929 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 21:26:52,951 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:52,951 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-23 21:26:52,951 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:52,960 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:52,965 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 17 [2019-11-23 21:26:52,965 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:52,975 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:52,976 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:26:52,976 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-11-23 21:26:53,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:53,044 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 21:26:53,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:26:53,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2019-11-23 21:26:53,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198898621] [2019-11-23 21:26:53,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 21:26:53,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:26:53,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 21:26:53,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-11-23 21:26:53,049 INFO L87 Difference]: Start difference. First operand 47 states and 60 transitions. Second operand 7 states. [2019-11-23 21:26:53,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:26:53,383 INFO L93 Difference]: Finished difference Result 98 states and 119 transitions. [2019-11-23 21:26:53,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 21:26:53,384 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-23 21:26:53,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:26:53,385 INFO L225 Difference]: With dead ends: 98 [2019-11-23 21:26:53,385 INFO L226 Difference]: Without dead ends: 79 [2019-11-23 21:26:53,386 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-11-23 21:26:53,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-23 21:26:53,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 55. [2019-11-23 21:26:53,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-23 21:26:53,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2019-11-23 21:26:53,399 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 26 [2019-11-23 21:26:53,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:26:53,399 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2019-11-23 21:26:53,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 21:26:53,400 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2019-11-23 21:26:53,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 21:26:53,400 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:26:53,401 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:26:53,603 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:26:53,604 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:26:53,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:26:53,604 INFO L82 PathProgramCache]: Analyzing trace with hash -118277399, now seen corresponding path program 1 times [2019-11-23 21:26:53,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:26:53,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623393563] [2019-11-23 21:26:53,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:26:53,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:26:53,664 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:26:53,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623393563] [2019-11-23 21:26:53,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132692660] [2019-11-23 21:26:53,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:26:53,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:26:53,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-23 21:26:53,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:26:53,739 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:26:53,740 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:53,752 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:53,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:53,758 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2019-11-23 21:26:53,759 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:53,771 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:53,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:53,775 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2019-11-23 21:26:53,776 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:53,789 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:53,789 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:26:53,790 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:42, output treesize:41 [2019-11-23 21:26:53,835 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:53,836 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-23 21:26:53,836 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:53,923 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:53,925 INFO L392 ElimStorePlain]: Different costs {4=[|v_#memory_$Pointer$.base_54|, |v_#memory_$Pointer$.offset_52|], 6=[|v_#memory_$Pointer$.base_56|, |v_#memory_$Pointer$.offset_54|]} [2019-11-23 21:26:53,929 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:26:53,990 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:53,992 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:26:54,037 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:54,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:54,044 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:54,045 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:54,046 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:54,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:54,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:54,053 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 48 [2019-11-23 21:26:54,053 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:54,089 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:54,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:54,101 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:54,101 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:54,102 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:54,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:54,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:54,106 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 48 [2019-11-23 21:26:54,107 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:54,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:54,138 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:26:54,138 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:146, output treesize:84 [2019-11-23 21:26:54,230 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:54,231 INFO L377 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 79 [2019-11-23 21:26:54,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:54,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:54,233 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:26:54,258 INFO L567 ElimStorePlain]: treesize reduction 16, result has 71.4 percent of original size [2019-11-23 21:26:54,261 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 16 [2019-11-23 21:26:54,262 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:54,267 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:54,267 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:26:54,268 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:7 [2019-11-23 21:26:54,272 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:26:54,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:26:54,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-11-23 21:26:54,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226354646] [2019-11-23 21:26:54,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 21:26:54,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:26:54,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 21:26:54,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-23 21:26:54,273 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. Second operand 9 states. [2019-11-23 21:26:54,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:26:54,730 INFO L93 Difference]: Finished difference Result 94 states and 113 transitions. [2019-11-23 21:26:54,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 21:26:54,731 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-11-23 21:26:54,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:26:54,731 INFO L225 Difference]: With dead ends: 94 [2019-11-23 21:26:54,731 INFO L226 Difference]: Without dead ends: 51 [2019-11-23 21:26:54,732 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-11-23 21:26:54,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-23 21:26:54,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-11-23 21:26:54,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-23 21:26:54,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2019-11-23 21:26:54,740 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 26 [2019-11-23 21:26:54,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:26:54,740 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2019-11-23 21:26:54,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 21:26:54,741 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2019-11-23 21:26:54,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-23 21:26:54,742 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:26:54,742 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:26:54,949 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:26:54,950 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:26:54,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:26:54,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1426250389, now seen corresponding path program 1 times [2019-11-23 21:26:54,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:26:54,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167527923] [2019-11-23 21:26:54,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:26:54,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:26:55,340 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:26:55,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167527923] [2019-11-23 21:26:55,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155529432] [2019-11-23 21:26:55,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:26:55,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:26:55,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 53 conjunts are in the unsatisfiable core [2019-11-23 21:26:55,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:26:55,432 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:26:55,432 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:55,440 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:55,440 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:26:55,441 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 21:26:55,463 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:55,463 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:26:55,464 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:55,484 INFO L567 ElimStorePlain]: treesize reduction 14, result has 56.3 percent of original size [2019-11-23 21:26:55,485 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:26:55,485 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2019-11-23 21:26:55,598 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:55,598 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2019-11-23 21:26:55,599 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:55,747 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-11-23 21:26:55,747 INFO L567 ElimStorePlain]: treesize reduction 28, result has 88.3 percent of original size [2019-11-23 21:26:55,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:55,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:55,778 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:26:55,791 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:55,791 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2019-11-23 21:26:55,792 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:55,892 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-11-23 21:26:55,893 INFO L567 ElimStorePlain]: treesize reduction 16, result has 90.1 percent of original size [2019-11-23 21:26:55,896 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:55,912 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:55,913 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2019-11-23 21:26:55,913 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:56,001 INFO L567 ElimStorePlain]: treesize reduction 16, result has 83.2 percent of original size [2019-11-23 21:26:56,002 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:26:56,002 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:209, output treesize:96 [2019-11-23 21:26:56,102 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:56,103 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 25 treesize of output 41 [2019-11-23 21:26:56,103 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:56,201 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:56,202 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_57|, |v_#memory_$Pointer$.offset_55|], 6=[|v_#memory_$Pointer$.base_59|, |v_#memory_$Pointer$.offset_57|]} [2019-11-23 21:26:56,206 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:26:56,282 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:56,285 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:26:56,346 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:56,397 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:56,398 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 167 treesize of output 135 [2019-11-23 21:26:56,399 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:56,518 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-11-23 21:26:56,518 INFO L567 ElimStorePlain]: treesize reduction 44, result has 79.3 percent of original size [2019-11-23 21:26:56,525 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 68 [2019-11-23 21:26:56,526 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:56,593 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:56,594 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:26:56,594 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:239, output treesize:132 [2019-11-23 21:26:56,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:26:56,931 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:26:56,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:26:56,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2019-11-23 21:26:56,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146894014] [2019-11-23 21:26:56,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-23 21:26:56,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:26:56,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-23 21:26:56,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2019-11-23 21:26:56,933 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand 20 states. [2019-11-23 21:26:58,042 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-11-23 21:26:58,597 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2019-11-23 21:26:59,365 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 90 [2019-11-23 21:26:59,535 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 91 [2019-11-23 21:27:00,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:27:00,462 INFO L93 Difference]: Finished difference Result 226 states and 270 transitions. [2019-11-23 21:27:00,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-11-23 21:27:00,462 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 29 [2019-11-23 21:27:00,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:27:00,464 INFO L225 Difference]: With dead ends: 226 [2019-11-23 21:27:00,464 INFO L226 Difference]: Without dead ends: 207 [2019-11-23 21:27:00,465 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=486, Invalid=1964, Unknown=0, NotChecked=0, Total=2450 [2019-11-23 21:27:00,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-11-23 21:27:00,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 103. [2019-11-23 21:27:00,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-23 21:27:00,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 128 transitions. [2019-11-23 21:27:00,487 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 128 transitions. Word has length 29 [2019-11-23 21:27:00,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:27:00,487 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 128 transitions. [2019-11-23 21:27:00,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-23 21:27:00,487 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 128 transitions. [2019-11-23 21:27:00,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-23 21:27:00,488 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:27:00,488 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:27:00,691 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:27:00,692 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:27:00,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:27:00,693 INFO L82 PathProgramCache]: Analyzing trace with hash 350604015, now seen corresponding path program 1 times [2019-11-23 21:27:00,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:27:00,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475559893] [2019-11-23 21:27:00,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:27:00,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:27:00,950 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:27:00,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475559893] [2019-11-23 21:27:00,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912039044] [2019-11-23 21:27:00,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:27:01,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:27:01,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 48 conjunts are in the unsatisfiable core [2019-11-23 21:27:01,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:27:01,024 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:27:01,025 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:27:01,029 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:27:01,029 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:27:01,029 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 21:27:01,056 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:27:01,057 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:27:01,057 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:27:01,078 INFO L567 ElimStorePlain]: treesize reduction 14, result has 56.3 percent of original size [2019-11-23 21:27:01,079 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:27:01,079 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2019-11-23 21:27:01,189 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:27:01,189 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2019-11-23 21:27:01,190 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:27:01,326 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-11-23 21:27:01,326 INFO L567 ElimStorePlain]: treesize reduction 28, result has 88.3 percent of original size [2019-11-23 21:27:01,331 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:27:01,336 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:27:01,337 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:27:01,351 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:27:01,352 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2019-11-23 21:27:01,352 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:27:01,437 INFO L567 ElimStorePlain]: treesize reduction 16, result has 90.1 percent of original size [2019-11-23 21:27:01,439 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:27:01,453 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:27:01,465 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:27:01,466 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2019-11-23 21:27:01,466 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:27:01,551 INFO L567 ElimStorePlain]: treesize reduction 16, result has 83.2 percent of original size [2019-11-23 21:27:01,552 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:27:01,552 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:209, output treesize:96 [2019-11-23 21:27:01,662 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:27:01,662 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 25 treesize of output 41 [2019-11-23 21:27:01,663 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:27:01,873 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-23 21:27:01,873 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:27:01,876 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_58|, |v_#memory_$Pointer$.base_60|, |v_#memory_int_42|, |v_#memory_int_43|], 6=[|v_#memory_$Pointer$.offset_60|, |v_#memory_$Pointer$.base_62|]} [2019-11-23 21:27:01,881 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:27:02,054 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-11-23 21:27:02,055 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:27:02,059 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:27:02,184 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-11-23 21:27:02,185 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:27:02,188 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:27:02,297 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-23 21:27:02,297 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:27:02,304 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 23 [2019-11-23 21:27:02,304 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-23 21:27:02,384 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:27:02,389 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 68 [2019-11-23 21:27:02,390 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-23 21:27:02,457 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:27:02,481 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:27:02,481 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 162 treesize of output 130 [2019-11-23 21:27:02,483 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-23 21:27:02,611 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-11-23 21:27:02,612 INFO L567 ElimStorePlain]: treesize reduction 44, result has 79.5 percent of original size [2019-11-23 21:27:02,612 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:27:02,613 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 9 variables, input treesize:284, output treesize:143 [2019-11-23 21:27:02,754 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:27:02,754 INFO L377 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 7 new quantified variables, introduced 10 case distinctions, treesize of input 140 treesize of output 90 [2019-11-23 21:27:02,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:27:02,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:27:02,756 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:27:02,804 INFO L567 ElimStorePlain]: treesize reduction 16, result has 79.5 percent of original size [2019-11-23 21:27:02,808 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2019-11-23 21:27:02,808 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:27:02,816 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:27:02,816 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:27:02,817 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:154, output treesize:11 [2019-11-23 21:27:02,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:27:02,875 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:27:02,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:27:02,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2019-11-23 21:27:02,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599491754] [2019-11-23 21:27:02,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-23 21:27:02,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:27:02,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-23 21:27:02,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-11-23 21:27:02,877 INFO L87 Difference]: Start difference. First operand 103 states and 128 transitions. Second operand 17 states. [2019-11-23 21:27:03,443 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-11-23 21:27:04,030 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 65 [2019-11-23 21:27:05,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:27:05,311 INFO L93 Difference]: Finished difference Result 224 states and 272 transitions. [2019-11-23 21:27:05,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-23 21:27:05,311 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2019-11-23 21:27:05,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:27:05,314 INFO L225 Difference]: With dead ends: 224 [2019-11-23 21:27:05,314 INFO L226 Difference]: Without dead ends: 191 [2019-11-23 21:27:05,315 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=299, Invalid=1033, Unknown=0, NotChecked=0, Total=1332 [2019-11-23 21:27:05,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-11-23 21:27:05,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 107. [2019-11-23 21:27:05,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-23 21:27:05,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2019-11-23 21:27:05,332 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 29 [2019-11-23 21:27:05,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:27:05,332 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2019-11-23 21:27:05,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-23 21:27:05,332 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2019-11-23 21:27:05,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-23 21:27:05,333 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:27:05,334 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:27:05,537 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:27:05,537 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:27:05,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:27:05,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1329481401, now seen corresponding path program 1 times [2019-11-23 21:27:05,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:27:05,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744508926] [2019-11-23 21:27:05,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:27:05,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:27:05,749 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:27:05,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744508926] [2019-11-23 21:27:05,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977257276] [2019-11-23 21:27:05,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:27:05,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:27:05,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-23 21:27:05,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:27:05,828 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:27:05,829 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:27:05,831 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:27:05,832 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:27:05,832 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-23 21:27:05,862 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:27:05,862 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:27:05,862 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:27:05,879 INFO L567 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-23 21:27:05,879 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:27:05,880 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2019-11-23 21:27:05,947 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:27:05,948 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-23 21:27:05,948 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:27:05,983 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:27:05,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:27:05,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:27:06,020 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:27:06,020 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 49 [2019-11-23 21:27:06,021 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:27:06,084 INFO L567 ElimStorePlain]: treesize reduction 24, result has 84.1 percent of original size [2019-11-23 21:27:06,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:27:06,102 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:27:06,103 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2019-11-23 21:27:06,103 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:27:06,158 INFO L567 ElimStorePlain]: treesize reduction 16, result has 79.2 percent of original size [2019-11-23 21:27:06,159 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:27:06,159 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:200, output treesize:62 [2019-11-23 21:27:06,193 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_61|, |v_#memory_$Pointer$.base_63|], 6=[|v_#memory_$Pointer$.base_65|, |v_#memory_$Pointer$.offset_63|]} [2019-11-23 21:27:06,195 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:27:06,228 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:27:06,231 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:27:06,267 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:27:06,352 INFO L343 Elim1Store]: treesize reduction 30, result has 65.1 percent of original size [2019-11-23 21:27:06,352 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 101 treesize of output 125 [2019-11-23 21:27:06,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:27:06,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:27:06,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:27:06,356 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2019-11-23 21:27:06,453 INFO L567 ElimStorePlain]: treesize reduction 275, result has 28.2 percent of original size [2019-11-23 21:27:06,459 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 61 [2019-11-23 21:27:06,459 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:27:06,483 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:27:06,484 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:27:06,484 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:156, output treesize:86 [2019-11-23 21:27:06,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:27:06,620 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:27:06,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:27:06,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2019-11-23 21:27:06,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87411690] [2019-11-23 21:27:06,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-23 21:27:06,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:27:06,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-23 21:27:06,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-11-23 21:27:06,621 INFO L87 Difference]: Start difference. First operand 107 states and 131 transitions. Second operand 16 states. [2019-11-23 21:27:08,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:27:08,278 INFO L93 Difference]: Finished difference Result 190 states and 229 transitions. [2019-11-23 21:27:08,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-23 21:27:08,278 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-11-23 21:27:08,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:27:08,280 INFO L225 Difference]: With dead ends: 190 [2019-11-23 21:27:08,280 INFO L226 Difference]: Without dead ends: 188 [2019-11-23 21:27:08,281 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=173, Invalid=583, Unknown=0, NotChecked=0, Total=756 [2019-11-23 21:27:08,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-23 21:27:08,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 128. [2019-11-23 21:27:08,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-23 21:27:08,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 158 transitions. [2019-11-23 21:27:08,300 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 158 transitions. Word has length 30 [2019-11-23 21:27:08,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:27:08,300 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 158 transitions. [2019-11-23 21:27:08,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-23 21:27:08,300 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 158 transitions. [2019-11-23 21:27:08,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-23 21:27:08,301 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:27:08,301 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:27:08,504 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:27:08,505 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:27:08,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:27:08,505 INFO L82 PathProgramCache]: Analyzing trace with hash -291073107, now seen corresponding path program 2 times [2019-11-23 21:27:08,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:27:08,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740105261] [2019-11-23 21:27:08,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:27:08,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:27:08,795 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:27:08,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740105261] [2019-11-23 21:27:08,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029560865] [2019-11-23 21:27:08,796 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:27:08,911 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 21:27:08,911 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:27:08,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 45 conjunts are in the unsatisfiable core [2019-11-23 21:27:08,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:27:08,937 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:27:08,937 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:27:08,944 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:27:08,945 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:27:08,945 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 21:27:08,964 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:27:08,965 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:27:08,965 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:27:08,998 INFO L567 ElimStorePlain]: treesize reduction 14, result has 77.8 percent of original size [2019-11-23 21:27:09,002 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 17 [2019-11-23 21:27:09,002 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:27:09,012 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:27:09,013 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:27:09,013 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:43 [2019-11-23 21:27:09,133 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:27:09,134 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 99 [2019-11-23 21:27:09,135 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:27:09,232 INFO L567 ElimStorePlain]: treesize reduction 46, result has 77.8 percent of original size [2019-11-23 21:27:09,236 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:27:09,241 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:27:09,485 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-11-23 21:27:09,486 INFO L343 Elim1Store]: treesize reduction 57, result has 75.0 percent of original size [2019-11-23 21:27:09,486 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 111 treesize of output 200 [2019-11-23 21:27:09,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 21:27:09,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:27:09,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:27:09,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:27:09,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:27:09,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:27:09,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:27:09,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:27:09,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 21:27:09,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:27:09,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:27:09,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:27:09,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:27:09,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:27:09,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:27:09,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:27:09,497 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:27:09,616 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 49 [2019-11-23 21:27:09,617 INFO L567 ElimStorePlain]: treesize reduction 132, result has 38.3 percent of original size [2019-11-23 21:27:09,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:27:09,619 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-23 21:27:09,619 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:153, output treesize:110 [2019-11-23 21:27:09,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:27:09,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:27:09,776 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:27:09,777 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 152 treesize of output 264 [2019-11-23 21:27:09,778 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:27:09,859 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:27:09,860 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 165 treesize of output 277 [2019-11-23 21:27:09,861 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:27:10,154 WARN L192 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-11-23 21:27:10,155 INFO L567 ElimStorePlain]: treesize reduction 326, result has 34.0 percent of original size [2019-11-23 21:27:10,156 INFO L392 ElimStorePlain]: Different costs {4=[|v_#memory_$Pointer$.base_67|], 30=[|v_#memory_$Pointer$.base_70|]} [2019-11-23 21:27:10,160 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:27:10,212 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:27:10,217 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:27:10,817 WARN L192 SmtUtils]: Spent 597.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 117 [2019-11-23 21:27:10,819 INFO L343 Elim1Store]: treesize reduction 170, result has 68.0 percent of original size [2019-11-23 21:27:10,819 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 139 treesize of output 410 [2019-11-23 21:27:10,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:27:10,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:27:10,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 21:27:10,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:27:10,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:27:10,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:27:10,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:27:10,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:27:10,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 21:27:10,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:27:10,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:27:10,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:27:10,828 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:27:11,040 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 60 [2019-11-23 21:27:11,041 INFO L567 ElimStorePlain]: treesize reduction 300, result has 26.1 percent of original size [2019-11-23 21:27:11,043 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-23 21:27:11,043 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:318, output treesize:139