java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/memsafety-ext/dll_extends_pointer_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 18:50:06,078 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 18:50:06,080 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 18:50:06,093 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 18:50:06,093 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 18:50:06,094 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 18:50:06,095 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 18:50:06,096 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 18:50:06,098 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 18:50:06,099 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 18:50:06,099 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 18:50:06,099 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 18:50:06,100 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 18:50:06,101 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 18:50:06,102 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 18:50:06,103 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 18:50:06,105 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 18:50:06,106 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 18:50:06,107 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 18:50:06,108 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 18:50:06,110 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 18:50:06,110 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 18:50:06,110 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 18:50:06,111 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 18:50:06,112 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 18:50:06,112 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 18:50:06,113 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 18:50:06,113 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 18:50:06,113 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 18:50:06,113 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 18:50:06,114 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 18:50:06,114 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 18:50:06,123 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 18:50:06,124 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 18:50:06,124 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 18:50:06,125 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 18:50:06,125 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 18:50:06,125 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 18:50:06,125 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 18:50:06,125 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 18:50:06,125 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 18:50:06,126 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 18:50:06,126 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 18:50:06,126 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 18:50:06,126 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 18:50:06,126 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 18:50:06,126 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 18:50:06,126 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 18:50:06,127 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 18:50:06,127 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 18:50:06,127 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 18:50:06,127 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 18:50:06,127 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 18:50:06,127 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 18:50:06,128 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 18:50:06,128 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 18:50:06,128 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 18:50:06,158 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 18:50:06,168 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 18:50:06,171 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 18:50:06,172 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 18:50:06,173 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 18:50:06,173 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/dll_extends_pointer_true-valid-memsafety.i [2018-02-02 18:50:06,315 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 18:50:06,316 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 18:50:06,317 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 18:50:06,317 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 18:50:06,321 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 18:50:06,322 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 06:50:06" (1/1) ... [2018-02-02 18:50:06,324 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73440f64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:50:06, skipping insertion in model container [2018-02-02 18:50:06,324 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 06:50:06" (1/1) ... [2018-02-02 18:50:06,338 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 18:50:06,364 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 18:50:06,446 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 18:50:06,461 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 18:50:06,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:50:06 WrapperNode [2018-02-02 18:50:06,465 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 18:50:06,466 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 18:50:06,466 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 18:50:06,466 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 18:50:06,479 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:50:06" (1/1) ... [2018-02-02 18:50:06,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:50:06" (1/1) ... [2018-02-02 18:50:06,486 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:50:06" (1/1) ... [2018-02-02 18:50:06,486 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:50:06" (1/1) ... [2018-02-02 18:50:06,488 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:50:06" (1/1) ... [2018-02-02 18:50:06,490 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:50:06" (1/1) ... [2018-02-02 18:50:06,491 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:50:06" (1/1) ... [2018-02-02 18:50:06,492 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 18:50:06,492 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 18:50:06,492 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 18:50:06,493 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 18:50:06,493 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:50:06" (1/1) ... No working directory specified, using /home/ultimate/work/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 [2018-02-02 18:50:06,531 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 18:50:06,531 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 18:50:06,531 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 18:50:06,531 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 18:50:06,531 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 18:50:06,531 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 18:50:06,532 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 18:50:06,532 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 18:50:06,532 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 18:50:06,532 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 18:50:06,532 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 18:50:06,532 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 18:50:06,532 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 18:50:06,532 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 18:50:06,732 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 18:50:06,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 06:50:06 BoogieIcfgContainer [2018-02-02 18:50:06,733 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 18:50:06,733 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 18:50:06,733 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 18:50:06,735 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 18:50:06,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 06:50:06" (1/3) ... [2018-02-02 18:50:06,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31912961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 06:50:06, skipping insertion in model container [2018-02-02 18:50:06,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:50:06" (2/3) ... [2018-02-02 18:50:06,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31912961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 06:50:06, skipping insertion in model container [2018-02-02 18:50:06,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 06:50:06" (3/3) ... [2018-02-02 18:50:06,738 INFO L107 eAbstractionObserver]: Analyzing ICFG dll_extends_pointer_true-valid-memsafety.i [2018-02-02 18:50:06,744 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 18:50:06,749 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 25 error locations. [2018-02-02 18:50:06,773 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 18:50:06,773 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 18:50:06,773 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 18:50:06,773 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 18:50:06,773 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 18:50:06,773 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 18:50:06,773 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 18:50:06,773 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 18:50:06,774 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 18:50:06,781 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-02-02 18:50:06,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-02-02 18:50:06,789 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:50:06,790 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:50:06,790 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 18:50:06,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1414487999, now seen corresponding path program 1 times [2018-02-02 18:50:06,796 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:50:06,796 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:50:06,838 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:06,839 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:50:06,839 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:06,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:50:06,878 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:50:06,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:50:06,932 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:50:06,932 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:50:06,933 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:50:06,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:50:06,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:50:06,943 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 4 states. [2018-02-02 18:50:07,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:50:07,149 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2018-02-02 18:50:07,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 18:50:07,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-02-02 18:50:07,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:50:07,161 INFO L225 Difference]: With dead ends: 82 [2018-02-02 18:50:07,161 INFO L226 Difference]: Without dead ends: 78 [2018-02-02 18:50:07,163 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:50:07,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-02 18:50:07,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 57. [2018-02-02 18:50:07,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-02 18:50:07,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-02-02 18:50:07,196 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 9 [2018-02-02 18:50:07,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:50:07,196 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-02-02 18:50:07,197 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:50:07,197 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-02-02 18:50:07,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-02-02 18:50:07,197 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:50:07,197 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:50:07,197 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 18:50:07,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1414487998, now seen corresponding path program 1 times [2018-02-02 18:50:07,198 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:50:07,198 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:50:07,199 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:07,199 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:50:07,199 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:07,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:50:07,212 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:50:07,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:50:07,277 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:50:07,277 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:50:07,278 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:50:07,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:50:07,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:50:07,278 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 4 states. [2018-02-02 18:50:07,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:50:07,384 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2018-02-02 18:50:07,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:50:07,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-02-02 18:50:07,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:50:07,386 INFO L225 Difference]: With dead ends: 104 [2018-02-02 18:50:07,386 INFO L226 Difference]: Without dead ends: 104 [2018-02-02 18:50:07,387 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:50:07,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-02 18:50:07,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 54. [2018-02-02 18:50:07,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-02 18:50:07,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-02-02 18:50:07,394 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 9 [2018-02-02 18:50:07,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:50:07,394 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-02-02 18:50:07,394 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:50:07,395 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-02-02 18:50:07,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 18:50:07,395 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:50:07,395 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:50:07,395 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 18:50:07,395 INFO L82 PathProgramCache]: Analyzing trace with hash 689004913, now seen corresponding path program 1 times [2018-02-02 18:50:07,395 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:50:07,396 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:50:07,396 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:07,396 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:50:07,396 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:07,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:50:07,410 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:50:07,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:50:07,443 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:50:07,443 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:50:07,444 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:50:07,444 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:50:07,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:50:07,444 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 4 states. [2018-02-02 18:50:07,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:50:07,535 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-02-02 18:50:07,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 18:50:07,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-02-02 18:50:07,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:50:07,537 INFO L225 Difference]: With dead ends: 64 [2018-02-02 18:50:07,537 INFO L226 Difference]: Without dead ends: 64 [2018-02-02 18:50:07,537 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:50:07,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-02 18:50:07,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2018-02-02 18:50:07,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-02 18:50:07,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2018-02-02 18:50:07,541 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 18 [2018-02-02 18:50:07,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:50:07,542 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2018-02-02 18:50:07,542 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:50:07,542 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2018-02-02 18:50:07,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 18:50:07,542 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:50:07,543 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:50:07,543 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 18:50:07,543 INFO L82 PathProgramCache]: Analyzing trace with hash 689004914, now seen corresponding path program 1 times [2018-02-02 18:50:07,543 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:50:07,543 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:50:07,544 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:07,544 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:50:07,544 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:07,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:50:07,555 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:50:07,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:50:07,614 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:50:07,614 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 18:50:07,614 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 18:50:07,614 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 18:50:07,614 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:50:07,614 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand 5 states. [2018-02-02 18:50:07,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:50:07,710 INFO L93 Difference]: Finished difference Result 139 states and 156 transitions. [2018-02-02 18:50:07,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 18:50:07,710 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-02 18:50:07,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:50:07,711 INFO L225 Difference]: With dead ends: 139 [2018-02-02 18:50:07,711 INFO L226 Difference]: Without dead ends: 139 [2018-02-02 18:50:07,711 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 18:50:07,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-02-02 18:50:07,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 76. [2018-02-02 18:50:07,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-02 18:50:07,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2018-02-02 18:50:07,715 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 18 [2018-02-02 18:50:07,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:50:07,715 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2018-02-02 18:50:07,715 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 18:50:07,715 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2018-02-02 18:50:07,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 18:50:07,715 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:50:07,715 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:50:07,715 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 18:50:07,715 INFO L82 PathProgramCache]: Analyzing trace with hash 689036531, now seen corresponding path program 1 times [2018-02-02 18:50:07,715 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:50:07,716 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:50:07,716 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:07,716 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:50:07,716 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:07,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:50:07,725 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:50:07,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:50:07,745 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:50:07,745 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:50:07,745 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:50:07,745 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:50:07,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:50:07,746 INFO L87 Difference]: Start difference. First operand 76 states and 91 transitions. Second operand 4 states. [2018-02-02 18:50:07,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:50:07,818 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2018-02-02 18:50:07,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 18:50:07,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-02-02 18:50:07,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:50:07,821 INFO L225 Difference]: With dead ends: 92 [2018-02-02 18:50:07,821 INFO L226 Difference]: Without dead ends: 92 [2018-02-02 18:50:07,821 INFO L554 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 [2018-02-02 18:50:07,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-02 18:50:07,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 75. [2018-02-02 18:50:07,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-02 18:50:07,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 89 transitions. [2018-02-02 18:50:07,830 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 89 transitions. Word has length 18 [2018-02-02 18:50:07,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:50:07,830 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 89 transitions. [2018-02-02 18:50:07,830 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:50:07,830 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 89 transitions. [2018-02-02 18:50:07,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 18:50:07,831 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:50:07,831 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:50:07,831 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 18:50:07,831 INFO L82 PathProgramCache]: Analyzing trace with hash 689036532, now seen corresponding path program 1 times [2018-02-02 18:50:07,832 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:50:07,834 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:50:07,835 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:07,835 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:50:07,835 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:07,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:50:07,844 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:50:07,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:50:07,880 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:50:07,880 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:50:07,880 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:50:07,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:50:07,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:50:07,881 INFO L87 Difference]: Start difference. First operand 75 states and 89 transitions. Second operand 4 states. [2018-02-02 18:50:07,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:50:07,943 INFO L93 Difference]: Finished difference Result 110 states and 128 transitions. [2018-02-02 18:50:07,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:50:07,943 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-02-02 18:50:07,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:50:07,944 INFO L225 Difference]: With dead ends: 110 [2018-02-02 18:50:07,944 INFO L226 Difference]: Without dead ends: 110 [2018-02-02 18:50:07,944 INFO L554 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 [2018-02-02 18:50:07,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-02-02 18:50:07,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 73. [2018-02-02 18:50:07,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-02 18:50:07,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 86 transitions. [2018-02-02 18:50:07,947 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 86 transitions. Word has length 18 [2018-02-02 18:50:07,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:50:07,947 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 86 transitions. [2018-02-02 18:50:07,947 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:50:07,948 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 86 transitions. [2018-02-02 18:50:07,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 18:50:07,948 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:50:07,948 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:50:07,948 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 18:50:07,948 INFO L82 PathProgramCache]: Analyzing trace with hash -115685232, now seen corresponding path program 1 times [2018-02-02 18:50:07,948 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:50:07,948 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:50:07,949 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:07,949 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:50:07,949 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:50:07,955 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:50:07,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:50:07,983 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:50:07,983 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 18:50:07,983 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 18:50:07,983 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 18:50:07,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:50:07,984 INFO L87 Difference]: Start difference. First operand 73 states and 86 transitions. Second operand 5 states. [2018-02-02 18:50:08,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:50:08,059 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2018-02-02 18:50:08,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 18:50:08,059 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-02-02 18:50:08,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:50:08,060 INFO L225 Difference]: With dead ends: 87 [2018-02-02 18:50:08,060 INFO L226 Difference]: Without dead ends: 87 [2018-02-02 18:50:08,060 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 18:50:08,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-02-02 18:50:08,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 73. [2018-02-02 18:50:08,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-02 18:50:08,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2018-02-02 18:50:08,063 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 19 [2018-02-02 18:50:08,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:50:08,063 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2018-02-02 18:50:08,063 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 18:50:08,063 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2018-02-02 18:50:08,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 18:50:08,064 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:50:08,064 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:50:08,064 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 18:50:08,064 INFO L82 PathProgramCache]: Analyzing trace with hash 580005852, now seen corresponding path program 1 times [2018-02-02 18:50:08,065 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:50:08,065 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:50:08,065 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:08,066 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:50:08,066 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:50:08,081 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:50:08,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:50:08,197 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:50:08,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 18:50:08,198 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 18:50:08,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 18:50:08,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 18:50:08,198 INFO L87 Difference]: Start difference. First operand 73 states and 85 transitions. Second operand 7 states. [2018-02-02 18:50:08,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:50:08,343 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2018-02-02 18:50:08,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 18:50:08,344 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-02-02 18:50:08,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:50:08,344 INFO L225 Difference]: With dead ends: 77 [2018-02-02 18:50:08,344 INFO L226 Difference]: Without dead ends: 77 [2018-02-02 18:50:08,345 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-02-02 18:50:08,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-02 18:50:08,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 69. [2018-02-02 18:50:08,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-02 18:50:08,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2018-02-02 18:50:08,348 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 23 [2018-02-02 18:50:08,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:50:08,348 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2018-02-02 18:50:08,348 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 18:50:08,348 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2018-02-02 18:50:08,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 18:50:08,349 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:50:08,349 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:50:08,349 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 18:50:08,349 INFO L82 PathProgramCache]: Analyzing trace with hash -493029770, now seen corresponding path program 1 times [2018-02-02 18:50:08,349 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:50:08,350 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:50:08,350 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:08,350 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:50:08,350 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:08,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:50:08,362 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:50:08,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:50:08,418 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:50:08,419 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 18:50:08,419 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 18:50:08,419 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 18:50:08,419 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:50:08,419 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand 5 states. [2018-02-02 18:50:08,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:50:08,497 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2018-02-02 18:50:08,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 18:50:08,497 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-02 18:50:08,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:50:08,498 INFO L225 Difference]: With dead ends: 107 [2018-02-02 18:50:08,498 INFO L226 Difference]: Without dead ends: 107 [2018-02-02 18:50:08,499 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-02 18:50:08,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-02 18:50:08,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 68. [2018-02-02 18:50:08,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-02 18:50:08,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2018-02-02 18:50:08,502 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 23 [2018-02-02 18:50:08,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:50:08,502 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2018-02-02 18:50:08,502 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 18:50:08,503 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2018-02-02 18:50:08,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 18:50:08,503 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:50:08,503 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:50:08,503 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 18:50:08,504 INFO L82 PathProgramCache]: Analyzing trace with hash -951533272, now seen corresponding path program 1 times [2018-02-02 18:50:08,504 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:50:08,504 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:50:08,505 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:08,505 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:50:08,505 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:08,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:50:08,511 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:50:08,581 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:50:08,581 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:50:08,581 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:50:08,587 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:50:08,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:50:08,625 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:50:08,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 18:50:08,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 18:50:08,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:08,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:08,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 18:50:08,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 18:50:08,694 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:08,696 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:08,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:08,700 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:18 [2018-02-02 18:50:08,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-02-02 18:50:08,723 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:08,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-02 18:50:08,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:08,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:08,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-02-02 18:50:08,751 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:08,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-02 18:50:08,752 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:08,756 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:08,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:08,761 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:36 [2018-02-02 18:50:08,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2018-02-02 18:50:08,787 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:08,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 30 [2018-02-02 18:50:08,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:08,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:08,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2018-02-02 18:50:08,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-02-02 18:50:08,807 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:08,811 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:08,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:08,818 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:43 [2018-02-02 18:50:08,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-02-02 18:50:08,892 INFO L477 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 0 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2018-02-02 18:50:08,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-02-02 18:50:08,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-02 18:50:08,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-02-02 18:50:08,937 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:08,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2018-02-02 18:50:08,946 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-02-02 18:50:08,960 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-02 18:50:08,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-02-02 18:50:08,987 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:63, output treesize:136 [2018-02-02 18:50:09,032 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:50:09,049 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:50:09,050 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12] total 15 [2018-02-02 18:50:09,050 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 18:50:09,050 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 18:50:09,050 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-02 18:50:09,050 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand 15 states. [2018-02-02 18:50:09,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:50:09,479 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-02-02 18:50:09,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 18:50:09,479 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-02-02 18:50:09,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:50:09,480 INFO L225 Difference]: With dead ends: 76 [2018-02-02 18:50:09,480 INFO L226 Difference]: Without dead ends: 76 [2018-02-02 18:50:09,480 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2018-02-02 18:50:09,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-02 18:50:09,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2018-02-02 18:50:09,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-02 18:50:09,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2018-02-02 18:50:09,483 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 25 [2018-02-02 18:50:09,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:50:09,484 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2018-02-02 18:50:09,484 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 18:50:09,484 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2018-02-02 18:50:09,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 18:50:09,484 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:50:09,484 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:50:09,485 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 18:50:09,485 INFO L82 PathProgramCache]: Analyzing trace with hash 567238585, now seen corresponding path program 1 times [2018-02-02 18:50:09,485 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:50:09,485 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:50:09,485 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:09,486 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:50:09,486 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:09,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:50:09,494 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:50:09,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:50:09,558 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:50:09,558 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:50:09,563 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:50:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:50:09,578 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:50:09,611 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~y~0.base Int)) (and (= |c_#valid| (store |c_old(#valid)| main_~y~0.base 0)) (not (= main_~y~0.base 0)) (= (select |c_old(#valid)| main_~y~0.base) 0))) is different from true [2018-02-02 18:50:09,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-02-02 18:50:09,636 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:50:09,636 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-02-02 18:50:09,637 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 18:50:09,637 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 18:50:09,637 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=55, Unknown=1, NotChecked=14, Total=90 [2018-02-02 18:50:09,637 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand 10 states. [2018-02-02 18:50:09,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:50:09,777 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2018-02-02 18:50:09,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 18:50:09,777 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-02-02 18:50:09,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:50:09,777 INFO L225 Difference]: With dead ends: 72 [2018-02-02 18:50:09,777 INFO L226 Difference]: Without dead ends: 61 [2018-02-02 18:50:09,778 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=95, Unknown=1, NotChecked=20, Total=156 [2018-02-02 18:50:09,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-02 18:50:09,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-02-02 18:50:09,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-02 18:50:09,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2018-02-02 18:50:09,780 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 26 [2018-02-02 18:50:09,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:50:09,780 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2018-02-02 18:50:09,781 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 18:50:09,781 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2018-02-02 18:50:09,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 18:50:09,781 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:50:09,781 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:50:09,781 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 18:50:09,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1660969695, now seen corresponding path program 1 times [2018-02-02 18:50:09,782 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:50:09,782 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:50:09,782 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:09,783 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:50:09,783 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:09,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:50:09,792 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:50:09,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:50:09,860 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:50:09,860 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 18:50:09,860 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 18:50:09,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 18:50:09,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:50:09,861 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand 5 states. [2018-02-02 18:50:09,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:50:09,975 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2018-02-02 18:50:09,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 18:50:09,975 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-02-02 18:50:09,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:50:09,976 INFO L225 Difference]: With dead ends: 119 [2018-02-02 18:50:09,976 INFO L226 Difference]: Without dead ends: 119 [2018-02-02 18:50:09,976 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 18:50:09,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-02 18:50:09,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 76. [2018-02-02 18:50:09,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-02 18:50:09,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 89 transitions. [2018-02-02 18:50:09,979 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 89 transitions. Word has length 29 [2018-02-02 18:50:09,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:50:09,979 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 89 transitions. [2018-02-02 18:50:09,979 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 18:50:09,980 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 89 transitions. [2018-02-02 18:50:09,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 18:50:09,980 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:50:09,980 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:50:09,980 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 18:50:09,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1477377571, now seen corresponding path program 1 times [2018-02-02 18:50:09,981 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:50:09,981 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:50:09,981 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:09,982 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:50:09,982 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:50:09,991 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:50:10,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:50:10,050 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:50:10,050 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 18:50:10,050 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 18:50:10,050 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 18:50:10,050 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 18:50:10,051 INFO L87 Difference]: Start difference. First operand 76 states and 89 transitions. Second operand 6 states. [2018-02-02 18:50:10,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:50:10,142 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2018-02-02 18:50:10,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 18:50:10,142 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-02-02 18:50:10,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:50:10,143 INFO L225 Difference]: With dead ends: 101 [2018-02-02 18:50:10,143 INFO L226 Difference]: Without dead ends: 101 [2018-02-02 18:50:10,144 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-02-02 18:50:10,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-02 18:50:10,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 62. [2018-02-02 18:50:10,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-02 18:50:10,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2018-02-02 18:50:10,146 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 30 [2018-02-02 18:50:10,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:50:10,146 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2018-02-02 18:50:10,146 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 18:50:10,146 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2018-02-02 18:50:10,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 18:50:10,147 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:50:10,147 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:50:10,147 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 18:50:10,148 INFO L82 PathProgramCache]: Analyzing trace with hash 49545921, now seen corresponding path program 1 times [2018-02-02 18:50:10,148 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:50:10,148 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:50:10,148 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:10,149 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:50:10,149 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:10,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:50:10,157 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:50:10,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:50:10,182 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:50:10,182 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 18:50:10,183 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 18:50:10,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 18:50:10,183 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:50:10,183 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand 5 states. [2018-02-02 18:50:10,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:50:10,236 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2018-02-02 18:50:10,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 18:50:10,236 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-02-02 18:50:10,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:50:10,236 INFO L225 Difference]: With dead ends: 79 [2018-02-02 18:50:10,236 INFO L226 Difference]: Without dead ends: 79 [2018-02-02 18:50:10,237 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 18:50:10,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-02 18:50:10,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 62. [2018-02-02 18:50:10,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-02 18:50:10,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2018-02-02 18:50:10,238 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 30 [2018-02-02 18:50:10,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:50:10,238 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2018-02-02 18:50:10,238 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 18:50:10,238 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2018-02-02 18:50:10,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 18:50:10,239 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:50:10,239 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:50:10,239 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 18:50:10,239 INFO L82 PathProgramCache]: Analyzing trace with hash -873404019, now seen corresponding path program 1 times [2018-02-02 18:50:10,239 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:50:10,239 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:50:10,239 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:10,239 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:50:10,240 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:10,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:50:10,249 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:50:10,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:50:10,353 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:50:10,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 18:50:10,354 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 18:50:10,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 18:50:10,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 18:50:10,354 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand 8 states. [2018-02-02 18:50:10,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:50:10,543 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2018-02-02 18:50:10,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 18:50:10,544 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-02-02 18:50:10,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:50:10,544 INFO L225 Difference]: With dead ends: 89 [2018-02-02 18:50:10,544 INFO L226 Difference]: Without dead ends: 89 [2018-02-02 18:50:10,544 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-02-02 18:50:10,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-02 18:50:10,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 72. [2018-02-02 18:50:10,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-02 18:50:10,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2018-02-02 18:50:10,546 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 34 [2018-02-02 18:50:10,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:50:10,547 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2018-02-02 18:50:10,547 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 18:50:10,547 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2018-02-02 18:50:10,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 18:50:10,548 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:50:10,548 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:50:10,548 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 18:50:10,548 INFO L82 PathProgramCache]: Analyzing trace with hash 733993419, now seen corresponding path program 1 times [2018-02-02 18:50:10,548 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:50:10,548 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:50:10,549 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:10,549 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:50:10,549 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:10,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:50:10,565 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:50:10,661 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:50:10,661 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:50:10,661 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 18:50:10,661 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 18:50:10,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 18:50:10,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 18:50:10,662 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand 9 states. [2018-02-02 18:50:10,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:50:10,802 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2018-02-02 18:50:10,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 18:50:10,802 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-02-02 18:50:10,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:50:10,803 INFO L225 Difference]: With dead ends: 105 [2018-02-02 18:50:10,803 INFO L226 Difference]: Without dead ends: 105 [2018-02-02 18:50:10,803 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-02-02 18:50:10,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-02 18:50:10,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 72. [2018-02-02 18:50:10,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-02 18:50:10,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2018-02-02 18:50:10,805 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 35 [2018-02-02 18:50:10,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:50:10,805 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2018-02-02 18:50:10,805 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 18:50:10,806 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2018-02-02 18:50:10,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 18:50:10,806 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:50:10,806 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:50:10,806 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 18:50:10,806 INFO L82 PathProgramCache]: Analyzing trace with hash 733993420, now seen corresponding path program 1 times [2018-02-02 18:50:10,807 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:50:10,807 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:50:10,807 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:10,807 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:50:10,808 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:10,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:50:10,816 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:50:10,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:50:10,937 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:50:10,937 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 18:50:10,937 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 18:50:10,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 18:50:10,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 18:50:10,937 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand 9 states. [2018-02-02 18:50:11,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:50:11,173 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2018-02-02 18:50:11,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 18:50:11,174 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-02-02 18:50:11,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:50:11,175 INFO L225 Difference]: With dead ends: 93 [2018-02-02 18:50:11,175 INFO L226 Difference]: Without dead ends: 93 [2018-02-02 18:50:11,175 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2018-02-02 18:50:11,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-02 18:50:11,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 72. [2018-02-02 18:50:11,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-02 18:50:11,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-02-02 18:50:11,177 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 35 [2018-02-02 18:50:11,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:50:11,178 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2018-02-02 18:50:11,178 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 18:50:11,178 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-02-02 18:50:11,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 18:50:11,178 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:50:11,178 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:50:11,180 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 18:50:11,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1814048103, now seen corresponding path program 1 times [2018-02-02 18:50:11,180 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:50:11,180 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:50:11,181 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:11,181 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:50:11,181 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:11,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:50:11,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:50:11,339 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:50:11,340 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:50:11,340 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:50:11,344 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:50:11,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:50:11,365 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:50:11,371 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:11,371 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:11,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 18:50:11,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:11,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:11,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-02-02 18:50:11,397 INFO L477 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 18:50:11,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-02-02 18:50:11,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:11,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:11,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:11,404 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:19 [2018-02-02 18:50:11,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-02-02 18:50:11,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 13 [2018-02-02 18:50:11,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:11,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:11,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:50:11,440 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:38 [2018-02-02 18:50:11,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2018-02-02 18:50:11,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2018-02-02 18:50:11,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:11,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:11,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:50:11,490 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:42 [2018-02-02 18:50:11,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-02-02 18:50:11,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2018-02-02 18:50:11,584 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-02 18:50:11,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-02 18:50:11,604 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:11,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-02 18:50:11,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-02 18:50:11,647 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:55, output treesize:73 [2018-02-02 18:50:11,744 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:11,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-02 18:50:11,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:11,768 INFO L267 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. [2018-02-02 18:50:11,768 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-02-02 18:50:11,786 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:50:11,802 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:50:11,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 21 [2018-02-02 18:50:11,803 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 18:50:11,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 18:50:11,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-02-02 18:50:11,803 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 22 states. [2018-02-02 18:50:12,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:50:12,962 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2018-02-02 18:50:12,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 18:50:12,963 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 36 [2018-02-02 18:50:12,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:50:12,963 INFO L225 Difference]: With dead ends: 110 [2018-02-02 18:50:12,969 INFO L226 Difference]: Without dead ends: 110 [2018-02-02 18:50:12,970 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=399, Invalid=1763, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 18:50:12,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-02-02 18:50:12,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 77. [2018-02-02 18:50:12,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-02 18:50:12,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2018-02-02 18:50:12,972 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 36 [2018-02-02 18:50:12,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:50:12,973 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2018-02-02 18:50:12,973 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 18:50:12,973 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2018-02-02 18:50:12,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 18:50:12,973 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:50:12,973 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:50:12,973 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 18:50:12,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1814048102, now seen corresponding path program 1 times [2018-02-02 18:50:12,974 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:50:12,974 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:50:12,974 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:12,975 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:50:12,975 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:12,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:50:12,984 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:50:13,175 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:50:13,175 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:50:13,175 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:50:13,181 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:50:13,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:50:13,200 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:50:13,266 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:13,267 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:13,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 18:50:13,267 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:13,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:13,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-02-02 18:50:13,291 INFO L477 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 11 treesize of output 8 [2018-02-02 18:50:13,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-02-02 18:50:13,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:13,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:13,298 INFO L477 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 11 treesize of output 8 [2018-02-02 18:50:13,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 18:50:13,300 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:13,304 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:13,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:13,309 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-02-02 18:50:13,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-02-02 18:50:13,330 INFO L477 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 12 treesize of output 11 [2018-02-02 18:50:13,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:13,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:13,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-02-02 18:50:13,353 INFO L477 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 12 treesize of output 11 [2018-02-02 18:50:13,353 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:13,356 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:13,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:13,362 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:66, output treesize:50 [2018-02-02 18:50:13,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2018-02-02 18:50:13,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 47 [2018-02-02 18:50:13,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:13,398 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:13,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2018-02-02 18:50:13,410 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:13,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-02-02 18:50:13,410 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:13,415 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:13,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:13,422 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:69, output treesize:61 [2018-02-02 18:50:13,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 43 [2018-02-02 18:50:13,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2018-02-02 18:50:13,547 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-02 18:50:13,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-02 18:50:13,580 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:13,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-02 18:50:13,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2018-02-02 18:50:13,631 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:13,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-02-02 18:50:13,632 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:13,636 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:13,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2018-02-02 18:50:13,657 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:13,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-02 18:50:13,661 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-02-02 18:50:13,672 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:50:13,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-02-02 18:50:13,683 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:13,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-02 18:50:13,687 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-02-02 18:50:13,700 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:50:13,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 5 xjuncts. [2018-02-02 18:50:13,729 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:81, output treesize:108 [2018-02-02 18:50:13,809 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:50:13,827 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:50:13,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 26 [2018-02-02 18:50:13,827 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 18:50:13,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 18:50:13,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=631, Unknown=0, NotChecked=0, Total=702 [2018-02-02 18:50:13,827 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 27 states. [2018-02-02 18:50:17,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:50:17,012 INFO L93 Difference]: Finished difference Result 272 states and 298 transitions. [2018-02-02 18:50:17,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-02-02 18:50:17,012 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 36 [2018-02-02 18:50:17,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:50:17,013 INFO L225 Difference]: With dead ends: 272 [2018-02-02 18:50:17,013 INFO L226 Difference]: Without dead ends: 272 [2018-02-02 18:50:17,014 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2572 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1358, Invalid=7384, Unknown=0, NotChecked=0, Total=8742 [2018-02-02 18:50:17,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-02-02 18:50:17,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 133. [2018-02-02 18:50:17,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-02-02 18:50:17,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 159 transitions. [2018-02-02 18:50:17,017 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 159 transitions. Word has length 36 [2018-02-02 18:50:17,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:50:17,017 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 159 transitions. [2018-02-02 18:50:17,017 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 18:50:17,017 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 159 transitions. [2018-02-02 18:50:17,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 18:50:17,018 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:50:17,018 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:50:17,018 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 18:50:17,018 INFO L82 PathProgramCache]: Analyzing trace with hash 993040720, now seen corresponding path program 1 times [2018-02-02 18:50:17,018 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:50:17,018 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:50:17,019 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:17,019 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:50:17,019 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:17,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:50:17,027 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:50:17,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:50:17,147 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:50:17,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 18:50:17,147 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 18:50:17,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 18:50:17,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-02-02 18:50:17,148 INFO L87 Difference]: Start difference. First operand 133 states and 159 transitions. Second operand 11 states. [2018-02-02 18:50:17,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:50:17,364 INFO L93 Difference]: Finished difference Result 147 states and 172 transitions. [2018-02-02 18:50:17,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 18:50:17,364 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-02-02 18:50:17,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:50:17,365 INFO L225 Difference]: With dead ends: 147 [2018-02-02 18:50:17,365 INFO L226 Difference]: Without dead ends: 147 [2018-02-02 18:50:17,365 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2018-02-02 18:50:17,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-02-02 18:50:17,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 134. [2018-02-02 18:50:17,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-02 18:50:17,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 159 transitions. [2018-02-02 18:50:17,367 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 159 transitions. Word has length 37 [2018-02-02 18:50:17,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:50:17,367 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 159 transitions. [2018-02-02 18:50:17,367 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 18:50:17,367 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 159 transitions. [2018-02-02 18:50:17,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 18:50:17,367 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:50:17,367 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:50:17,367 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 18:50:17,367 INFO L82 PathProgramCache]: Analyzing trace with hash -400917400, now seen corresponding path program 1 times [2018-02-02 18:50:17,367 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:50:17,368 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:50:17,368 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:17,368 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:50:17,368 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:17,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:50:17,373 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:50:17,452 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:50:17,452 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:50:17,452 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:50:17,459 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:50:17,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:50:17,474 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:50:17,482 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:17,483 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:17,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 18:50:17,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:17,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:17,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-02-02 18:50:17,507 INFO L477 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 11 treesize of output 8 [2018-02-02 18:50:17,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-02-02 18:50:17,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:17,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:17,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:17,514 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:19 [2018-02-02 18:50:17,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-02-02 18:50:17,531 INFO L477 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 14 treesize of output 13 [2018-02-02 18:50:17,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:17,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:17,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:50:17,539 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-02-02 18:50:17,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2018-02-02 18:50:17,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 37 [2018-02-02 18:50:17,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:17,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:17,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:50:17,569 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-02-02 18:50:17,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2018-02-02 18:50:17,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-02 18:50:17,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:17,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 25 [2018-02-02 18:50:17,658 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-02-02 18:50:17,667 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-02 18:50:17,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-02 18:50:17,679 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:50, output treesize:26 [2018-02-02 18:50:17,716 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:50:17,733 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:50:17,734 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 22 [2018-02-02 18:50:17,734 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 18:50:17,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 18:50:17,734 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2018-02-02 18:50:17,734 INFO L87 Difference]: Start difference. First operand 134 states and 159 transitions. Second operand 22 states. [2018-02-02 18:50:18,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:50:18,306 INFO L93 Difference]: Finished difference Result 156 states and 178 transitions. [2018-02-02 18:50:18,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 18:50:18,306 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 37 [2018-02-02 18:50:18,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:50:18,307 INFO L225 Difference]: With dead ends: 156 [2018-02-02 18:50:18,307 INFO L226 Difference]: Without dead ends: 156 [2018-02-02 18:50:18,308 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=278, Invalid=1614, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 18:50:18,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-02-02 18:50:18,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 134. [2018-02-02 18:50:18,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-02 18:50:18,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 157 transitions. [2018-02-02 18:50:18,311 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 157 transitions. Word has length 37 [2018-02-02 18:50:18,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:50:18,311 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 157 transitions. [2018-02-02 18:50:18,311 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 18:50:18,311 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 157 transitions. [2018-02-02 18:50:18,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 18:50:18,311 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:50:18,312 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:50:18,312 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 18:50:18,312 INFO L82 PathProgramCache]: Analyzing trace with hash -58648115, now seen corresponding path program 1 times [2018-02-02 18:50:18,312 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:50:18,312 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:50:18,313 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:18,313 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:50:18,313 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:18,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:50:18,326 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:50:18,596 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:50:18,596 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:50:18,596 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:50:18,601 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:50:18,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:50:18,616 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:50:18,630 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:18,630 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:18,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 18:50:18,631 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:18,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:18,633 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-02-02 18:50:18,641 INFO L477 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 18:50:18,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-02-02 18:50:18,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:18,649 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:18,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:18,652 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:19 [2018-02-02 18:50:18,673 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-02-02 18:50:18,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2018-02-02 18:50:18,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:18,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:18,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:50:18,689 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:38 [2018-02-02 18:50:18,714 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:18,715 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:18,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 33 [2018-02-02 18:50:18,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:18,725 INFO L267 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. [2018-02-02 18:50:18,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:55 [2018-02-02 18:50:18,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2018-02-02 18:50:18,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 46 [2018-02-02 18:50:18,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:18,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:18,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:50:18,764 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:64 [2018-02-02 18:50:18,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 59 [2018-02-02 18:50:18,905 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:18,907 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:18,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 61 [2018-02-02 18:50:18,922 INFO L267 ElimStorePlain]: Start of recursive call 3: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-02-02 18:50:19,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-02 18:50:19,022 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:19,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-02-02 18:50:19,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-02-02 18:50:19,124 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:86, output treesize:226 [2018-02-02 18:50:19,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2018-02-02 18:50:19,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:19,232 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:19,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 36 [2018-02-02 18:50:19,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:19,252 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:19,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 47 [2018-02-02 18:50:19,259 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-02-02 18:50:19,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: 8 dim-0 vars, and 5 xjuncts. [2018-02-02 18:50:19,295 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:103, output treesize:122 [2018-02-02 18:50:19,344 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:19,345 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:19,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 30 [2018-02-02 18:50:19,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:19,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 18:50:19,352 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:24 [2018-02-02 18:50:19,377 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:50:19,394 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:50:19,394 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 28 [2018-02-02 18:50:19,394 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 18:50:19,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 18:50:19,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=723, Unknown=0, NotChecked=0, Total=812 [2018-02-02 18:50:19,394 INFO L87 Difference]: Start difference. First operand 134 states and 157 transitions. Second operand 29 states. [2018-02-02 18:50:21,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:50:21,260 INFO L93 Difference]: Finished difference Result 154 states and 173 transitions. [2018-02-02 18:50:21,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 18:50:21,260 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 40 [2018-02-02 18:50:21,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:50:21,261 INFO L225 Difference]: With dead ends: 154 [2018-02-02 18:50:21,261 INFO L226 Difference]: Without dead ends: 154 [2018-02-02 18:50:21,261 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=708, Invalid=2832, Unknown=0, NotChecked=0, Total=3540 [2018-02-02 18:50:21,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-02-02 18:50:21,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 128. [2018-02-02 18:50:21,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-02-02 18:50:21,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 149 transitions. [2018-02-02 18:50:21,264 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 149 transitions. Word has length 40 [2018-02-02 18:50:21,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:50:21,264 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 149 transitions. [2018-02-02 18:50:21,264 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 18:50:21,264 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 149 transitions. [2018-02-02 18:50:21,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 18:50:21,264 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:50:21,265 INFO L351 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:50:21,265 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 18:50:21,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1617180596, now seen corresponding path program 1 times [2018-02-02 18:50:21,265 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:50:21,265 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:50:21,266 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:21,266 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:50:21,266 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:50:21,277 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:50:21,654 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:50:21,654 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:50:21,654 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:50:21,662 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:50:21,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:50:21,688 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:50:21,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-02 18:50:21,707 INFO L477 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 10 treesize of output 9 [2018-02-02 18:50:21,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:21,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:21,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-02 18:50:21,720 INFO L477 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 12 treesize of output 11 [2018-02-02 18:50:21,721 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:21,722 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:21,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:21,727 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2018-02-02 18:50:21,736 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:21,737 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:21,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 18:50:21,738 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:21,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:21,743 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:37 [2018-02-02 18:50:21,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-02-02 18:50:21,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-02-02 18:50:21,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:21,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:21,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2018-02-02 18:50:21,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 18:50:21,812 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:21,816 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:21,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:21,826 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:62, output treesize:55 [2018-02-02 18:50:21,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 75 [2018-02-02 18:50:21,863 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:21,864 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:21,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 61 [2018-02-02 18:50:21,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:21,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:21,884 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:21,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 39 [2018-02-02 18:50:21,889 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:21,889 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:21,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 57 [2018-02-02 18:50:21,890 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:21,896 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:21,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:21,903 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:95, output treesize:89 [2018-02-02 18:50:21,956 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:21,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 50 [2018-02-02 18:50:21,962 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:21,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-02-02 18:50:21,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:21,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:21,980 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:21,981 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:21,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 89 [2018-02-02 18:50:21,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 106 [2018-02-02 18:50:21,985 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:21,993 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:22,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:22,012 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:108, output treesize:100 [2018-02-02 18:50:22,363 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:50:22,364 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:22,365 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:22,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 85 [2018-02-02 18:50:22,368 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:50:22,376 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 51 [2018-02-02 18:50:22,378 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-02 18:50:22,394 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:22,395 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:50:22,395 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:22,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 39 [2018-02-02 18:50:22,396 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:22,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:22,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 18:50:22,412 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:138, output treesize:64 [2018-02-02 18:50:22,491 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:50:22,509 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:50:22,509 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 31 [2018-02-02 18:50:22,509 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 18:50:22,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 18:50:22,510 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=825, Unknown=9, NotChecked=0, Total=930 [2018-02-02 18:50:22,510 INFO L87 Difference]: Start difference. First operand 128 states and 149 transitions. Second operand 31 states. [2018-02-02 18:50:24,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:50:24,776 INFO L93 Difference]: Finished difference Result 207 states and 231 transitions. [2018-02-02 18:50:24,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 18:50:24,776 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 41 [2018-02-02 18:50:24,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:50:24,777 INFO L225 Difference]: With dead ends: 207 [2018-02-02 18:50:24,777 INFO L226 Difference]: Without dead ends: 207 [2018-02-02 18:50:24,777 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 24 SyntacticMatches, 6 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1093 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=745, Invalid=3791, Unknown=20, NotChecked=0, Total=4556 [2018-02-02 18:50:24,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-02-02 18:50:24,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 169. [2018-02-02 18:50:24,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-02-02 18:50:24,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 197 transitions. [2018-02-02 18:50:24,781 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 197 transitions. Word has length 41 [2018-02-02 18:50:24,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:50:24,781 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 197 transitions. [2018-02-02 18:50:24,781 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-02 18:50:24,781 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 197 transitions. [2018-02-02 18:50:24,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 18:50:24,782 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:50:24,782 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:50:24,782 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 18:50:24,782 INFO L82 PathProgramCache]: Analyzing trace with hash -659016960, now seen corresponding path program 2 times [2018-02-02 18:50:24,782 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:50:24,782 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:50:24,782 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:24,783 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:50:24,783 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:24,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:50:24,792 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:50:25,017 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:50:25,017 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:50:25,017 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:50:25,023 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 18:50:25,039 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 18:50:25,039 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:50:25,041 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:50:25,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 18:50:25,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 18:50:25,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:25,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:25,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 18:50:25,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 18:50:25,056 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:25,056 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:25,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:25,060 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2018-02-02 18:50:25,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-02-02 18:50:25,081 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:25,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-02 18:50:25,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:25,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:25,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-02-02 18:50:25,095 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:25,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-02 18:50:25,095 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:25,097 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:25,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:25,102 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:59, output treesize:41 [2018-02-02 18:50:25,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-02-02 18:50:25,125 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:25,125 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:25,126 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:25,127 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:25,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 60 [2018-02-02 18:50:25,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:25,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:25,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-02-02 18:50:25,147 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:25,147 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:25,148 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:25,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-02-02 18:50:25,149 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:25,153 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:25,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:25,160 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:69, output treesize:61 [2018-02-02 18:50:25,203 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:25,203 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:25,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 18:50:25,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:25,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:25,211 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:53 [2018-02-02 18:50:25,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-02-02 18:50:25,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 18:50:25,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:25,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:25,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-02-02 18:50:25,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-02-02 18:50:25,293 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:25,297 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:25,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:25,307 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:78, output treesize:67 [2018-02-02 18:50:25,341 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:50:25,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 48 [2018-02-02 18:50:25,343 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:25,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 49 [2018-02-02 18:50:25,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:25,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:25,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 76 [2018-02-02 18:50:25,366 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:25,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 50 [2018-02-02 18:50:25,368 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:25,375 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:25,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:25,384 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:127, output treesize:89 [2018-02-02 18:50:25,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 55 [2018-02-02 18:50:25,421 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:25,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-02-02 18:50:25,421 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:25,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:25,442 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:25,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 79 [2018-02-02 18:50:25,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 98 [2018-02-02 18:50:25,444 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:25,452 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:25,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:25,462 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:108, output treesize:104 [2018-02-02 18:50:25,761 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:50:25,761 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:25,770 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:25,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 86 [2018-02-02 18:50:25,780 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:25,797 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 27 treesize of output 73 [2018-02-02 18:50:25,798 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-02-02 18:50:25,827 INFO L267 ElimStorePlain]: Start of recursive call 3: 88 dim-0 vars, End of recursive call: 88 dim-0 vars, and 96 xjuncts. [2018-02-02 18:50:26,178 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:50:26,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 48 [2018-02-02 18:50:26,179 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:26,181 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:50:26,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2018-02-02 18:50:26,182 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:50:26,183 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:50:26,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2018-02-02 18:50:26,184 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:50:26,196 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:50:26,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2018-02-02 18:50:26,198 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:50:26,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-02-02 18:50:26,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 47 [2018-02-02 18:50:26,334 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:26,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-02-02 18:50:26,335 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:26,338 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:26,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 46 [2018-02-02 18:50:26,363 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:26,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2018-02-02 18:50:26,367 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-02-02 18:50:26,383 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:50:26,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 43 [2018-02-02 18:50:26,391 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:26,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2018-02-02 18:50:26,395 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-02-02 18:50:26,408 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:50:26,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 46 [2018-02-02 18:50:26,417 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:26,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2018-02-02 18:50:26,421 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-02-02 18:50:26,434 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:50:26,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-02-02 18:50:26,488 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:138, output treesize:120 [2018-02-02 18:50:26,586 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:50:26,616 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:50:26,616 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 22] total 32 [2018-02-02 18:50:26,616 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 18:50:26,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 18:50:26,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=903, Unknown=0, NotChecked=0, Total=992 [2018-02-02 18:50:26,617 INFO L87 Difference]: Start difference. First operand 169 states and 197 transitions. Second operand 32 states. [2018-02-02 18:50:28,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:50:28,203 INFO L93 Difference]: Finished difference Result 187 states and 215 transitions. [2018-02-02 18:50:28,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 18:50:28,203 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 43 [2018-02-02 18:50:28,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:50:28,204 INFO L225 Difference]: With dead ends: 187 [2018-02-02 18:50:28,204 INFO L226 Difference]: Without dead ends: 187 [2018-02-02 18:50:28,205 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=407, Invalid=3373, Unknown=2, NotChecked=0, Total=3782 [2018-02-02 18:50:28,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-02 18:50:28,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 173. [2018-02-02 18:50:28,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-02-02 18:50:28,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 201 transitions. [2018-02-02 18:50:28,214 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 201 transitions. Word has length 43 [2018-02-02 18:50:28,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:50:28,214 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 201 transitions. [2018-02-02 18:50:28,214 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 18:50:28,214 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 201 transitions. [2018-02-02 18:50:28,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 18:50:28,214 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:50:28,214 INFO L351 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:50:28,214 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 18:50:28,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1045309665, now seen corresponding path program 2 times [2018-02-02 18:50:28,215 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:50:28,215 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:50:28,215 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:28,215 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 18:50:28,215 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:28,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:50:28,225 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:50:28,558 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:50:28,559 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:50:28,559 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:50:28,564 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 18:50:28,580 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 18:50:28,580 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:50:28,582 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:50:28,675 INFO L477 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 11 treesize of output 8 [2018-02-02 18:50:28,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 18:50:28,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:28,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:28,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:28,683 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:37 [2018-02-02 18:50:28,710 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:28,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 60 [2018-02-02 18:50:28,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 13 [2018-02-02 18:50:28,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:28,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:28,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:50:28,728 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:55 [2018-02-02 18:50:28,759 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:28,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 57 [2018-02-02 18:50:28,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 63 [2018-02-02 18:50:28,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:28,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:28,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:50:28,774 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:59 [2018-02-02 18:50:28,875 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:28,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 57 [2018-02-02 18:50:28,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-02 18:50:28,877 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:28,886 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:28,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 43 [2018-02-02 18:50:28,891 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-02 18:50:28,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-02 18:50:28,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-02 18:50:28,938 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:72, output treesize:112 [2018-02-02 18:50:29,223 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~y~0.base Int) (v_prenex_117 Int)) (let ((.cse0 (store |c_old(#valid)| main_~y~0.base 1))) (and (not (= v_prenex_117 0)) (not (= main_~y~0.base 0)) (= |c_#valid| (store (store .cse0 v_prenex_117 0) main_~y~0.base 0)) (= (select |c_old(#valid)| main_~y~0.base) 0) (= (select .cse0 v_prenex_117) 0)))) is different from true [2018-02-02 18:50:29,236 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2018-02-02 18:50:29,266 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:50:29,266 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 31 [2018-02-02 18:50:29,267 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 18:50:29,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 18:50:29,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=841, Unknown=19, NotChecked=58, Total=992 [2018-02-02 18:50:29,267 INFO L87 Difference]: Start difference. First operand 173 states and 201 transitions. Second operand 32 states. [2018-02-02 18:50:30,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:50:30,591 INFO L93 Difference]: Finished difference Result 186 states and 213 transitions. [2018-02-02 18:50:30,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 18:50:30,592 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 44 [2018-02-02 18:50:30,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:50:30,592 INFO L225 Difference]: With dead ends: 186 [2018-02-02 18:50:30,592 INFO L226 Difference]: Without dead ends: 168 [2018-02-02 18:50:30,593 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=223, Invalid=1924, Unknown=19, NotChecked=90, Total=2256 [2018-02-02 18:50:30,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-02-02 18:50:30,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2018-02-02 18:50:30,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-02-02 18:50:30,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 194 transitions. [2018-02-02 18:50:30,595 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 194 transitions. Word has length 44 [2018-02-02 18:50:30,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:50:30,595 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 194 transitions. [2018-02-02 18:50:30,595 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 18:50:30,595 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 194 transitions. [2018-02-02 18:50:30,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 18:50:30,595 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:50:30,595 INFO L351 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:50:30,595 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 18:50:30,595 INFO L82 PathProgramCache]: Analyzing trace with hash 731145119, now seen corresponding path program 1 times [2018-02-02 18:50:30,596 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:50:30,596 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:50:30,596 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:30,596 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 18:50:30,596 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:30,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:50:30,605 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:50:30,721 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 18:50:30,721 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:50:30,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 18:50:30,721 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 18:50:30,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 18:50:30,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-02 18:50:30,722 INFO L87 Difference]: Start difference. First operand 167 states and 194 transitions. Second operand 10 states. [2018-02-02 18:50:30,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:50:30,930 INFO L93 Difference]: Finished difference Result 180 states and 204 transitions. [2018-02-02 18:50:30,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 18:50:30,931 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-02-02 18:50:30,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:50:30,931 INFO L225 Difference]: With dead ends: 180 [2018-02-02 18:50:30,931 INFO L226 Difference]: Without dead ends: 180 [2018-02-02 18:50:30,931 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2018-02-02 18:50:30,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-02-02 18:50:30,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 167. [2018-02-02 18:50:30,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-02-02 18:50:30,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 191 transitions. [2018-02-02 18:50:30,933 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 191 transitions. Word has length 45 [2018-02-02 18:50:30,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:50:30,933 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 191 transitions. [2018-02-02 18:50:30,933 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 18:50:30,933 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 191 transitions. [2018-02-02 18:50:30,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 18:50:30,934 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:50:30,934 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:50:30,934 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 18:50:30,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1902183403, now seen corresponding path program 1 times [2018-02-02 18:50:30,934 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:50:30,934 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:50:30,934 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:30,935 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:50:30,935 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:30,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:50:30,944 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:50:32,160 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:50:32,161 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:50:32,161 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:50:32,165 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:50:32,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:50:32,186 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:50:32,316 INFO L477 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 11 treesize of output 8 [2018-02-02 18:50:32,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 18:50:32,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:32,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:32,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:32,326 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:37 [2018-02-02 18:50:32,356 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:32,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 60 [2018-02-02 18:50:32,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 13 [2018-02-02 18:50:32,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:32,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:32,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:50:32,370 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:55 [2018-02-02 18:50:32,462 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:32,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 73 [2018-02-02 18:50:32,467 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:32,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 89 [2018-02-02 18:50:32,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:32,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:32,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:50:32,484 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:85, output treesize:86 [2018-02-02 18:50:32,750 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:32,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 85 [2018-02-02 18:50:32,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-02 18:50:32,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:32,764 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:32,765 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:32,768 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:32,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 83 [2018-02-02 18:50:32,779 INFO L267 ElimStorePlain]: Start of recursive call 4: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-02-02 18:50:32,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-02-02 18:50:33,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-02-02 18:50:33,058 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:108, output treesize:334 [2018-02-02 18:50:33,548 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~y~0.base Int) (v_prenex_130 Int) (v_prenex_129 Int)) (let ((.cse1 (store |c_old(#valid)| main_~y~0.base 1))) (let ((.cse0 (store .cse1 v_prenex_129 1))) (and (= 0 (select .cse0 v_prenex_130)) (not (= main_~y~0.base 0)) (= (select |c_old(#valid)| main_~y~0.base) 0) (= (store (store (store .cse0 v_prenex_130 0) v_prenex_129 0) main_~y~0.base 0) |c_#valid|) (not (= v_prenex_129 0)) (= (select .cse1 v_prenex_129) 0) (not (= v_prenex_130 0)))))) is different from true [2018-02-02 18:50:33,560 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2018-02-02 18:50:33,590 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:50:33,590 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2018-02-02 18:50:33,590 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-02 18:50:33,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-02 18:50:33,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1445, Unknown=23, NotChecked=76, Total=1640 [2018-02-02 18:50:33,591 INFO L87 Difference]: Start difference. First operand 167 states and 191 transitions. Second operand 41 states. [2018-02-02 18:50:35,373 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 157 DAG size of output 79 [2018-02-02 18:50:36,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:50:36,021 INFO L93 Difference]: Finished difference Result 171 states and 194 transitions. [2018-02-02 18:50:36,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 18:50:36,022 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 48 [2018-02-02 18:50:36,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:50:36,022 INFO L225 Difference]: With dead ends: 171 [2018-02-02 18:50:36,022 INFO L226 Difference]: Without dead ends: 150 [2018-02-02 18:50:36,023 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=299, Invalid=3338, Unknown=27, NotChecked=118, Total=3782 [2018-02-02 18:50:36,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-02 18:50:36,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2018-02-02 18:50:36,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-02 18:50:36,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 171 transitions. [2018-02-02 18:50:36,025 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 171 transitions. Word has length 48 [2018-02-02 18:50:36,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:50:36,025 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 171 transitions. [2018-02-02 18:50:36,026 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-02 18:50:36,026 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 171 transitions. [2018-02-02 18:50:36,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 18:50:36,026 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:50:36,026 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:50:36,026 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 18:50:36,027 INFO L82 PathProgramCache]: Analyzing trace with hash -2055869351, now seen corresponding path program 3 times [2018-02-02 18:50:36,027 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:50:36,027 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:50:36,027 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:36,028 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:50:36,028 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:36,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:50:36,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:50:36,176 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:50:36,176 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:50:36,176 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:50:36,184 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 18:50:36,233 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-02-02 18:50:36,233 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:50:36,235 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:50:36,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 18:50:36,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-02-02 18:50:36,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:36,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:36,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:36,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-02-02 18:50:36,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 39 [2018-02-02 18:50:36,281 INFO L477 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 31 treesize of output 30 [2018-02-02 18:50:36,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:36,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:36,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:50:36,298 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:25 [2018-02-02 18:50:36,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 46 [2018-02-02 18:50:36,365 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:36,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 45 [2018-02-02 18:50:36,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:36,390 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:36,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 40 [2018-02-02 18:50:36,392 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:36,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:36,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:50:36,408 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:38, output treesize:34 [2018-02-02 18:50:36,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 44 [2018-02-02 18:50:36,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-02-02 18:50:36,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:36,533 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:36,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2018-02-02 18:50:36,538 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-02 18:50:36,569 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:36,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-02-02 18:50:36,571 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:36,583 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:36,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 44 [2018-02-02 18:50:36,607 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:36,608 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:36,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2018-02-02 18:50:36,609 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:36,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2018-02-02 18:50:36,633 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:36,647 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:36,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2018-02-02 18:50:36,651 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-02-02 18:50:36,659 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:36,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:50:36,665 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:97, output treesize:20 [2018-02-02 18:50:36,689 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:50:36,706 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:50:36,706 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 20 [2018-02-02 18:50:36,706 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 18:50:36,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 18:50:36,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2018-02-02 18:50:36,706 INFO L87 Difference]: Start difference. First operand 148 states and 171 transitions. Second operand 20 states. [2018-02-02 18:50:43,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:50:43,552 INFO L93 Difference]: Finished difference Result 196 states and 218 transitions. [2018-02-02 18:50:43,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 18:50:43,552 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 48 [2018-02-02 18:50:43,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:50:43,553 INFO L225 Difference]: With dead ends: 196 [2018-02-02 18:50:43,553 INFO L226 Difference]: Without dead ends: 196 [2018-02-02 18:50:43,553 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=601, Invalid=1751, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 18:50:43,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-02-02 18:50:43,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 148. [2018-02-02 18:50:43,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-02 18:50:43,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 167 transitions. [2018-02-02 18:50:43,556 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 167 transitions. Word has length 48 [2018-02-02 18:50:43,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:50:43,556 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 167 transitions. [2018-02-02 18:50:43,556 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 18:50:43,556 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 167 transitions. [2018-02-02 18:50:43,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 18:50:43,557 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:50:43,557 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:50:43,557 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 18:50:43,557 INFO L82 PathProgramCache]: Analyzing trace with hash 692593450, now seen corresponding path program 1 times [2018-02-02 18:50:43,558 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:50:43,558 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:50:43,558 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:43,558 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 18:50:43,558 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:50:43,569 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:50:43,785 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:50:43,785 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:50:43,785 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:50:43,803 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:50:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:50:43,830 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:50:43,832 INFO L477 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 [2018-02-02 18:50:43,832 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:43,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:43,835 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 18:50:43,846 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:43,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-02 18:50:43,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:43,856 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:43,857 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:43,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 18:50:43,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:43,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:43,863 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-02-02 18:50:43,901 INFO L477 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 11 treesize of output 8 [2018-02-02 18:50:43,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 18:50:43,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:43,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:43,918 INFO L477 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 11 treesize of output 8 [2018-02-02 18:50:43,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-02-02 18:50:43,920 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:43,922 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:43,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:43,932 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:46, output treesize:35 [2018-02-02 18:50:43,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-02-02 18:50:43,968 INFO L477 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 12 treesize of output 11 [2018-02-02 18:50:43,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:43,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:43,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-02-02 18:50:43,991 INFO L477 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 12 treesize of output 11 [2018-02-02 18:50:43,992 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:43,998 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:44,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:44,009 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:55 [2018-02-02 18:50:44,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2018-02-02 18:50:44,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 47 [2018-02-02 18:50:44,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:44,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:44,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2018-02-02 18:50:44,068 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:44,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-02-02 18:50:44,068 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:44,073 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:44,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:44,080 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:74, output treesize:66 [2018-02-02 18:50:44,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 43 [2018-02-02 18:50:44,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2018-02-02 18:50:44,150 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-02 18:50:44,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-02 18:50:44,172 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:44,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-02 18:50:44,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-02-02 18:50:44,213 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:44,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-02 18:50:44,215 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-02-02 18:50:44,223 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:50:44,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2018-02-02 18:50:44,228 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:44,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-02-02 18:50:44,228 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:44,232 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:44,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2018-02-02 18:50:44,237 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:44,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-02 18:50:44,239 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-02-02 18:50:44,247 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:50:44,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2018-02-02 18:50:44,273 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:86, output treesize:145 [2018-02-02 18:50:44,410 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:50:44,427 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:50:44,427 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 25 [2018-02-02 18:50:44,427 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 18:50:44,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 18:50:44,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2018-02-02 18:50:44,427 INFO L87 Difference]: Start difference. First operand 148 states and 167 transitions. Second operand 26 states. [2018-02-02 18:50:46,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:50:46,228 INFO L93 Difference]: Finished difference Result 224 states and 240 transitions. [2018-02-02 18:50:46,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-02 18:50:46,228 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 49 [2018-02-02 18:50:46,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:50:46,229 INFO L225 Difference]: With dead ends: 224 [2018-02-02 18:50:46,229 INFO L226 Difference]: Without dead ends: 224 [2018-02-02 18:50:46,230 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 928 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1004, Invalid=2902, Unknown=0, NotChecked=0, Total=3906 [2018-02-02 18:50:46,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-02-02 18:50:46,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 138. [2018-02-02 18:50:46,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-02-02 18:50:46,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 151 transitions. [2018-02-02 18:50:46,232 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 151 transitions. Word has length 49 [2018-02-02 18:50:46,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:50:46,233 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 151 transitions. [2018-02-02 18:50:46,233 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 18:50:46,233 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 151 transitions. [2018-02-02 18:50:46,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 18:50:46,233 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:50:46,233 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:50:46,233 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 18:50:46,233 INFO L82 PathProgramCache]: Analyzing trace with hash -722803741, now seen corresponding path program 1 times [2018-02-02 18:50:46,233 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:50:46,233 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:50:46,234 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:46,234 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:50:46,234 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:50:46,245 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:50:46,514 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:50:46,514 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:50:46,514 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:50:46,519 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:50:46,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:50:46,538 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:50:46,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-02 18:50:46,652 INFO L477 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 10 treesize of output 9 [2018-02-02 18:50:46,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:46,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:46,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:46,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-02-02 18:50:46,661 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:46,662 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:46,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 18:50:46,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:46,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:46,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:24 [2018-02-02 18:50:46,704 INFO L477 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 18:50:46,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-02-02 18:50:46,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:46,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:46,716 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2018-02-02 18:50:46,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 18:50:46,718 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:46,720 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:46,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:46,726 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:42 [2018-02-02 18:50:46,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2018-02-02 18:50:46,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 11 [2018-02-02 18:50:46,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:46,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:46,769 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-02-02 18:50:46,770 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:46,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-02-02 18:50:46,771 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:46,775 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:46,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:46,780 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:74, output treesize:58 [2018-02-02 18:50:46,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 47 [2018-02-02 18:50:46,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 51 [2018-02-02 18:50:46,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:46,809 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:46,818 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:46,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 59 [2018-02-02 18:50:46,820 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:46,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-02-02 18:50:46,820 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:46,826 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:46,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:46,832 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:77, output treesize:61 [2018-02-02 18:50:46,897 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:46,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 47 [2018-02-02 18:50:46,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-02 18:50:46,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:46,907 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:46,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2018-02-02 18:50:46,912 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-02 18:50:46,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-02 18:50:46,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-02-02 18:50:46,945 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:81, output treesize:164 [2018-02-02 18:50:47,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 58 treesize of output 57 [2018-02-02 18:50:47,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:47,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 18:50:47,142 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 10 variables, input treesize:179, output treesize:53 [2018-02-02 18:50:47,202 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:47,203 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:47,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 18:50:47,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:47,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 18:50:47,214 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:61, output treesize:48 [2018-02-02 18:50:47,253 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:47,254 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:47,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2018-02-02 18:50:47,256 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:50:47,257 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:47,263 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 45 [2018-02-02 18:50:47,264 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-02 18:50:47,271 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:47,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-02-02 18:50:47,272 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:47,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:47,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:47,277 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:54, output treesize:3 [2018-02-02 18:50:47,286 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:50:47,303 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:50:47,303 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 30 [2018-02-02 18:50:47,303 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 18:50:47,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 18:50:47,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=833, Unknown=0, NotChecked=0, Total=930 [2018-02-02 18:50:47,304 INFO L87 Difference]: Start difference. First operand 138 states and 151 transitions. Second operand 31 states. [2018-02-02 18:50:49,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:50:49,494 INFO L93 Difference]: Finished difference Result 227 states and 246 transitions. [2018-02-02 18:50:49,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-02 18:50:49,494 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 53 [2018-02-02 18:50:49,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:50:49,495 INFO L225 Difference]: With dead ends: 227 [2018-02-02 18:50:49,495 INFO L226 Difference]: Without dead ends: 227 [2018-02-02 18:50:49,496 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1310 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=886, Invalid=4664, Unknown=0, NotChecked=0, Total=5550 [2018-02-02 18:50:49,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-02-02 18:50:49,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 179. [2018-02-02 18:50:49,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-02-02 18:50:49,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 197 transitions. [2018-02-02 18:50:49,498 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 197 transitions. Word has length 53 [2018-02-02 18:50:49,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:50:49,499 INFO L432 AbstractCegarLoop]: Abstraction has 179 states and 197 transitions. [2018-02-02 18:50:49,499 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-02 18:50:49,499 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 197 transitions. [2018-02-02 18:50:49,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 18:50:49,499 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:50:49,499 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:50:49,499 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 18:50:49,500 INFO L82 PathProgramCache]: Analyzing trace with hash -722803740, now seen corresponding path program 1 times [2018-02-02 18:50:49,500 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:50:49,500 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:50:49,500 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:49,500 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:50:49,501 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:49,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:50:49,512 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:50:49,929 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:50:49,929 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:50:49,929 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:50:49,935 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:50:49,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:50:49,954 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:50:49,958 INFO L477 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 [2018-02-02 18:50:49,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:49,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:49,960 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 18:50:49,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-02 18:50:49,965 INFO L477 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 10 treesize of output 9 [2018-02-02 18:50:49,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:49,965 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:49,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:49,969 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-02-02 18:50:49,977 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:49,977 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:49,978 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:49,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 48 [2018-02-02 18:50:49,979 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:49,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:49,986 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:46 [2018-02-02 18:50:50,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 18:50:50,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 18:50:50,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:50,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:50,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-02-02 18:50:50,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-02-02 18:50:50,044 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:50,047 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:50,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:50,055 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:60 [2018-02-02 18:50:50,080 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-02-02 18:50:50,082 INFO L477 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 12 treesize of output 11 [2018-02-02 18:50:50,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:50,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:50,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 61 [2018-02-02 18:50:50,098 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:50,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 47 [2018-02-02 18:50:50,099 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:50,105 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:50,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:50,114 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:104, output treesize:88 [2018-02-02 18:50:50,145 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2018-02-02 18:50:50,146 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:50,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-02-02 18:50:50,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:50,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:50,168 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:50,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 73 [2018-02-02 18:50:50,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 88 [2018-02-02 18:50:50,170 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:50,178 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:50,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:50,188 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:107, output treesize:91 [2018-02-02 18:50:50,286 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:50,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-02-02 18:50:50,291 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:50,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 17 [2018-02-02 18:50:50,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-02-02 18:50:50,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-02 18:50:50,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-02-02 18:50:50,324 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:111, output treesize:260 [2018-02-02 18:50:50,519 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:50,520 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:50,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 94 [2018-02-02 18:50:50,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:50,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 18:50:50,556 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:278, output treesize:68 [2018-02-02 18:50:50,677 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:50,677 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:50:50,678 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:50,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 54 [2018-02-02 18:50:50,681 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:50:50,687 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 39 [2018-02-02 18:50:50,688 INFO L267 ElimStorePlain]: Start of recursive call 3: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-02-02 18:50:50,707 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:50:50,709 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:50,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 48 [2018-02-02 18:50:50,712 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-02 18:50:50,713 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:50:50,713 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:50,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-02-02 18:50:50,714 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:50,715 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:50,716 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:50:50,717 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:50,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 48 [2018-02-02 18:50:50,721 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-02-02 18:50:50,763 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-02-02 18:50:50,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-02-02 18:50:50,776 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:69, output treesize:61 [2018-02-02 18:50:50,830 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:50:50,847 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:50:50,848 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 33 [2018-02-02 18:50:50,848 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 18:50:50,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 18:50:50,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1009, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 18:50:50,849 INFO L87 Difference]: Start difference. First operand 179 states and 197 transitions. Second operand 34 states. [2018-02-02 18:50:52,480 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 159 DAG size of output 85 [2018-02-02 18:50:53,833 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 162 DAG size of output 88 [2018-02-02 18:50:54,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:50:54,222 INFO L93 Difference]: Finished difference Result 209 states and 229 transitions. [2018-02-02 18:50:54,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-02 18:50:54,222 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 53 [2018-02-02 18:50:54,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:50:54,223 INFO L225 Difference]: With dead ends: 209 [2018-02-02 18:50:54,223 INFO L226 Difference]: Without dead ends: 209 [2018-02-02 18:50:54,224 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1156 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1068, Invalid=4632, Unknown=0, NotChecked=0, Total=5700 [2018-02-02 18:50:54,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-02-02 18:50:54,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 197. [2018-02-02 18:50:54,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-02-02 18:50:54,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 218 transitions. [2018-02-02 18:50:54,226 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 218 transitions. Word has length 53 [2018-02-02 18:50:54,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:50:54,226 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 218 transitions. [2018-02-02 18:50:54,226 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-02 18:50:54,226 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 218 transitions. [2018-02-02 18:50:54,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 18:50:54,227 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:50:54,227 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:50:54,227 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 18:50:54,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1715612209, now seen corresponding path program 3 times [2018-02-02 18:50:54,227 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:50:54,227 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:50:54,228 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:54,228 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:50:54,228 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:54,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:50:54,237 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:50:54,683 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:50:54,683 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:50:54,683 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:50:54,688 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 18:50:54,719 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-02-02 18:50:54,719 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:50:54,721 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:50:54,726 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:54,727 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:54,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 18:50:54,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:54,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:54,729 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-02 18:50:54,754 INFO L477 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 11 treesize of output 8 [2018-02-02 18:50:54,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-02-02 18:50:54,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:54,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:54,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:54,760 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-02-02 18:50:54,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-02-02 18:50:54,781 INFO L477 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 14 treesize of output 13 [2018-02-02 18:50:54,781 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:54,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:54,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:50:54,787 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-02-02 18:50:54,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-02-02 18:50:54,814 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:54,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 46 [2018-02-02 18:50:54,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:54,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:54,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:50:54,825 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:48 [2018-02-02 18:50:54,879 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:54,880 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:54,880 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:54,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 50 [2018-02-02 18:50:54,881 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:54,891 INFO L267 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. [2018-02-02 18:50:54,891 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:66 [2018-02-02 18:50:54,966 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:54,967 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 70 [2018-02-02 18:50:54,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 16 [2018-02-02 18:50:54,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:54,975 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:54,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:50:54,985 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:69 [2018-02-02 18:50:55,023 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:55,024 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:55,025 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:55,027 INFO L477 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 102 [2018-02-02 18:50:55,032 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:55,034 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:55,045 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 160 [2018-02-02 18:50:55,046 INFO L267 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-02-02 18:50:55,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-02-02 18:50:55,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2018-02-02 18:50:55,162 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:119, output treesize:448 [2018-02-02 18:50:55,268 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:55,269 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:55,272 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:55,272 INFO L477 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 120 [2018-02-02 18:50:55,275 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:55,282 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 160 [2018-02-02 18:50:55,283 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-02 18:50:55,308 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:55,335 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:55,336 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:55,338 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:55,339 INFO L477 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 106 [2018-02-02 18:50:55,342 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:55,348 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 143 [2018-02-02 18:50:55,348 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-02 18:50:55,384 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:55,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-02-02 18:50:55,410 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:229, output treesize:221 [2018-02-02 18:50:55,873 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:55,874 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:55,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 140 [2018-02-02 18:50:55,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:55,907 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:55,907 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:55,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 150 [2018-02-02 18:50:55,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:55,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-02-02 18:50:55,938 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:257, output treesize:221 [2018-02-02 18:50:56,116 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,116 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:50:56,117 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,117 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 124 [2018-02-02 18:50:56,124 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,129 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,150 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 51 treesize of output 108 [2018-02-02 18:50:56,151 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-02-02 18:50:56,180 INFO L267 ElimStorePlain]: Start of recursive call 3: 66 dim-0 vars, End of recursive call: 66 dim-0 vars, and 39 xjuncts. [2018-02-02 18:50:56,636 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,637 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,637 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:50:56,639 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 79 [2018-02-02 18:50:56,640 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:56,642 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,643 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:50:56,644 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 89 [2018-02-02 18:50:56,649 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-02 18:50:56,651 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,651 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,651 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:50:56,653 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 73 [2018-02-02 18:50:56,653 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:56,656 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,657 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,657 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:50:56,658 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 82 [2018-02-02 18:50:56,661 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-02 18:50:56,663 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,664 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,664 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,664 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:50:56,665 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,667 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 75 [2018-02-02 18:50:56,667 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:56,670 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,670 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,670 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:50:56,672 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 77 [2018-02-02 18:50:56,675 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-02-02 18:50:56,677 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,678 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:50:56,679 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 83 [2018-02-02 18:50:56,684 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-02-02 18:50:56,685 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,685 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:50:56,686 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 49 [2018-02-02 18:50:56,686 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:56,688 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,689 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,689 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:50:56,689 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 77 [2018-02-02 18:50:56,691 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:56,692 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,692 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:50:56,693 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 59 [2018-02-02 18:50:56,694 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:56,697 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,697 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,697 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:50:56,699 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 85 [2018-02-02 18:50:56,703 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-02-02 18:50:56,712 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,713 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:50:56,715 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 86 [2018-02-02 18:50:56,719 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-02-02 18:50:56,722 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,723 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,724 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:50:56,725 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 76 [2018-02-02 18:50:56,727 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:56,731 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,732 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,732 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:50:56,734 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 83 [2018-02-02 18:50:56,739 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-02-02 18:50:56,742 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,742 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,743 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,743 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:50:56,744 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,746 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 79 [2018-02-02 18:50:56,747 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:56,749 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,749 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:50:56,750 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 56 [2018-02-02 18:50:56,750 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:56,753 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,754 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,754 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:50:56,756 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 85 [2018-02-02 18:50:56,760 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-02-02 18:50:56,761 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,762 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,763 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,763 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:50:56,763 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,765 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 73 [2018-02-02 18:50:56,766 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:56,768 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,768 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:50:56,769 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2018-02-02 18:50:56,769 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:56,771 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,772 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,772 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:50:56,774 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 74 [2018-02-02 18:50:56,775 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:57,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-02-02 18:50:57,227 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:57,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 32 [2018-02-02 18:50:57,229 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:57,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 44 [2018-02-02 18:50:57,230 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:57,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 46 [2018-02-02 18:50:57,232 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:57,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 33 [2018-02-02 18:50:57,233 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:57,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 44 [2018-02-02 18:50:57,235 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:57,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 44 [2018-02-02 18:50:57,236 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:57,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 47 [2018-02-02 18:50:57,238 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:57,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2018-02-02 18:50:57,239 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:57,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 46 [2018-02-02 18:50:57,241 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:57,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 46 [2018-02-02 18:50:57,242 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:57,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2018-02-02 18:50:57,244 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:57,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 29 [2018-02-02 18:50:57,245 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:57,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 46 [2018-02-02 18:50:57,247 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:57,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2018-02-02 18:50:57,248 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:57,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 42 [2018-02-02 18:50:57,249 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:57,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2018-02-02 18:50:57,251 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:57,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 42 [2018-02-02 18:50:57,252 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:57,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 44 [2018-02-02 18:50:57,254 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:57,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2018-02-02 18:50:57,256 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:57,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 19 dim-0 vars, and 20 xjuncts. [2018-02-02 18:50:57,992 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:57,993 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:57,993 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:50:57,994 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:57,994 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:57,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 105 [2018-02-02 18:50:57,998 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,009 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 58 [2018-02-02 18:50:58,011 INFO L267 ElimStorePlain]: Start of recursive call 45: 11 dim-0 vars, End of recursive call: 11 dim-0 vars, and 7 xjuncts. [2018-02-02 18:50:58,080 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 53 [2018-02-02 18:50:58,084 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 2 xjuncts. [2018-02-02 18:50:58,085 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,086 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,087 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 52 [2018-02-02 18:50:58,087 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:58,090 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 56 [2018-02-02 18:50:58,093 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 2 xjuncts. [2018-02-02 18:50:58,094 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2018-02-02 18:50:58,095 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:58,100 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2018-02-02 18:50:58,101 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:58,102 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2018-02-02 18:50:58,103 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:58,105 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 57 [2018-02-02 18:50:58,109 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 2 xjuncts. [2018-02-02 18:50:58,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2018-02-02 18:50:58,187 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:58,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2018-02-02 18:50:58,189 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:58,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-02-02 18:50:58,190 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:58,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 25 [2018-02-02 18:50:58,191 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:58,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-02-02 18:50:58,193 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:58,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-02-02 18:50:58,194 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:58,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 18 [2018-02-02 18:50:58,195 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:58,244 INFO L267 ElimStorePlain]: Start of recursive call 44: 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 7 xjuncts. [2018-02-02 18:50:58,815 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,816 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,816 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:50:58,817 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,818 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 105 [2018-02-02 18:50:58,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-02-02 18:50:58,821 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:58,839 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,840 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-02-02 18:50:58,840 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:58,854 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 30 [2018-02-02 18:50:58,865 INFO L267 ElimStorePlain]: Start of recursive call 63: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-02 18:50:58,892 INFO L267 ElimStorePlain]: Start of recursive call 60: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-02 18:50:59,487 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:50:59,488 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:59,488 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:59,489 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:59,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 117 [2018-02-02 18:50:59,495 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:59,495 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:50:59,497 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:59,501 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 68 [2018-02-02 18:50:59,502 INFO L267 ElimStorePlain]: Start of recursive call 65: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-02 18:50:59,531 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:59,532 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:59,533 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:59,534 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:59,535 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:59,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 75 [2018-02-02 18:50:59,542 INFO L267 ElimStorePlain]: Start of recursive call 66: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-02-02 18:50:59,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-02-02 18:50:59,593 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:59,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 23 [2018-02-02 18:50:59,594 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:59,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 25 [2018-02-02 18:50:59,595 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:59,621 INFO L267 ElimStorePlain]: Start of recursive call 64: 3 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-02-02 18:51:00,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 18 dim-0 vars, 4 dim-2 vars, End of recursive call: 51 dim-0 vars, and 33 xjuncts. [2018-02-02 18:51:00,279 INFO L202 ElimStorePlain]: Needed 69 recursive calls to eliminate 22 variables, input treesize:529, output treesize:1341 [2018-02-02 18:51:00,552 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:00,552 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:00,559 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:00,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-02-02 18:51:00,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:00,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 18:51:00,578 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:28 [2018-02-02 18:51:00,667 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:51:00,684 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:51:00,684 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 42 [2018-02-02 18:51:00,684 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-02 18:51:00,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-02 18:51:00,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1650, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 18:51:00,685 INFO L87 Difference]: Start difference. First operand 197 states and 218 transitions. Second operand 43 states. [2018-02-02 18:51:02,223 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 180 DAG size of output 78 [2018-02-02 18:51:02,564 WARN L146 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 147 DAG size of output 63 [2018-02-02 18:51:03,122 WARN L146 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 162 DAG size of output 76 [2018-02-02 18:51:03,259 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 109 DAG size of output 90 [2018-02-02 18:51:03,408 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 111 DAG size of output 92 [2018-02-02 18:51:03,590 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 120 DAG size of output 86 [2018-02-02 18:51:04,304 WARN L146 SmtUtils]: Spent 207ms on a formula simplification. DAG size of input: 209 DAG size of output 73 [2018-02-02 18:51:04,582 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 105 DAG size of output 90 [2018-02-02 18:51:04,955 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 153 DAG size of output 73 [2018-02-02 18:51:05,741 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 192 DAG size of output 86 [2018-02-02 18:51:06,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:51:06,751 INFO L93 Difference]: Finished difference Result 261 states and 282 transitions. [2018-02-02 18:51:06,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-02-02 18:51:06,751 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 54 [2018-02-02 18:51:06,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:51:06,752 INFO L225 Difference]: With dead ends: 261 [2018-02-02 18:51:06,752 INFO L226 Difference]: Without dead ends: 261 [2018-02-02 18:51:06,753 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2381 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=1546, Invalid=7960, Unknown=0, NotChecked=0, Total=9506 [2018-02-02 18:51:06,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-02-02 18:51:06,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 210. [2018-02-02 18:51:06,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-02-02 18:51:06,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 234 transitions. [2018-02-02 18:51:06,756 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 234 transitions. Word has length 54 [2018-02-02 18:51:06,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:51:06,756 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 234 transitions. [2018-02-02 18:51:06,757 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-02 18:51:06,757 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 234 transitions. [2018-02-02 18:51:06,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 18:51:06,757 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:51:06,757 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:51:06,757 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 18:51:06,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1715612210, now seen corresponding path program 2 times [2018-02-02 18:51:06,758 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:51:06,758 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:51:06,758 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:06,758 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 18:51:06,759 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:06,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:51:06,768 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:51:07,203 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:51:07,203 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:51:07,203 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:51:07,208 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 18:51:07,228 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 18:51:07,228 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:51:07,230 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:51:07,232 INFO L477 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 [2018-02-02 18:51:07,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:07,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:07,234 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 18:51:07,239 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:07,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-02 18:51:07,240 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:07,247 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:07,248 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:07,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-02 18:51:07,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:07,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:07,255 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:31 [2018-02-02 18:51:07,300 INFO L477 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 11 treesize of output 8 [2018-02-02 18:51:07,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-02-02 18:51:07,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:07,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:07,317 INFO L477 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 11 treesize of output 8 [2018-02-02 18:51:07,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 18:51:07,318 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:07,319 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:07,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:07,327 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:56, output treesize:45 [2018-02-02 18:51:07,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-02-02 18:51:07,356 INFO L477 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 12 treesize of output 11 [2018-02-02 18:51:07,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:07,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:07,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 53 [2018-02-02 18:51:07,372 INFO L477 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 12 treesize of output 11 [2018-02-02 18:51:07,372 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:07,376 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:07,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:07,384 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:85, output treesize:69 [2018-02-02 18:51:07,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2018-02-02 18:51:07,435 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:07,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-02-02 18:51:07,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:07,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:07,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 50 [2018-02-02 18:51:07,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 56 [2018-02-02 18:51:07,460 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:07,466 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:07,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:07,474 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:88, output treesize:80 [2018-02-02 18:51:07,544 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:07,545 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:07,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 40 [2018-02-02 18:51:07,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:07,565 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:07,566 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:07,571 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:07,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-02-02 18:51:07,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:07,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:07,585 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:86 [2018-02-02 18:51:07,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 54 [2018-02-02 18:51:07,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 18:51:07,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:07,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:07,703 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:07,704 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 79 [2018-02-02 18:51:07,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 16 [2018-02-02 18:51:07,706 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:07,716 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:07,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:07,732 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:111, output treesize:96 [2018-02-02 18:51:07,781 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:07,783 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:07,784 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:07,787 INFO L477 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 164 [2018-02-02 18:51:07,796 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:07,816 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 94 treesize of output 168 [2018-02-02 18:51:07,821 INFO L267 ElimStorePlain]: Start of recursive call 3: 18 dim-0 vars, End of recursive call: 18 dim-0 vars, and 20 xjuncts. [2018-02-02 18:51:08,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 9 xjuncts. [2018-02-02 18:51:08,285 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:08,286 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:08,287 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:08,288 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:08,289 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 227 [2018-02-02 18:51:08,293 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:08,302 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 5 case distinctions, treesize of input 62 treesize of output 107 [2018-02-02 18:51:08,302 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-02 18:51:08,345 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-02 18:51:08,347 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:08,348 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:08,349 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:08,351 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:08,352 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 178 [2018-02-02 18:51:08,355 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:08,355 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:08,358 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:08,367 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 61 treesize of output 126 [2018-02-02 18:51:08,367 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-02 18:51:08,410 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-02 18:51:08,412 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:08,414 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:08,414 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:08,417 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:08,417 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 198 [2018-02-02 18:51:08,420 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:08,432 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 5 case distinctions, treesize of input 62 treesize of output 107 [2018-02-02 18:51:08,432 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-02 18:51:08,470 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-02 18:51:08,472 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:08,473 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:08,474 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:08,476 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:08,476 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 204 [2018-02-02 18:51:08,479 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:08,489 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 5 case distinctions, treesize of input 62 treesize of output 107 [2018-02-02 18:51:08,490 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-02 18:51:08,535 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-02 18:51:08,537 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:08,538 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:08,538 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:08,540 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:08,541 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:08,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 168 [2018-02-02 18:51:08,545 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:08,546 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:08,549 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:08,557 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 61 treesize of output 126 [2018-02-02 18:51:08,558 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-02 18:51:08,593 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-02 18:51:08,599 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:08,599 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:08,601 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:08,602 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:08,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 210 [2018-02-02 18:51:08,606 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:08,607 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:08,610 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:08,623 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 61 treesize of output 106 [2018-02-02 18:51:08,624 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:51:08,643 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:51:08,645 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:08,647 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:08,647 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:08,650 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:08,650 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 211 [2018-02-02 18:51:08,652 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:08,664 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 5 case distinctions, treesize of input 62 treesize of output 107 [2018-02-02 18:51:08,665 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-02 18:51:08,708 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-02 18:51:08,710 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:08,711 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:08,712 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:08,714 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:08,715 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 185 [2018-02-02 18:51:08,718 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:08,718 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:08,721 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:08,730 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 61 treesize of output 126 [2018-02-02 18:51:08,731 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-02 18:51:08,767 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-02 18:51:08,768 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:08,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 153 [2018-02-02 18:51:08,775 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:08,776 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:08,776 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:08,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 80 [2018-02-02 18:51:08,777 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:08,792 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:09,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 35 dim-0 vars, and 20 xjuncts. [2018-02-02 18:51:09,328 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 2 variables, input treesize:180, output treesize:3728 [2018-02-02 18:51:09,775 WARN L146 SmtUtils]: Spent 204ms on a formula simplification. DAG size of input: 464 DAG size of output 87 [2018-02-02 18:51:09,782 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:09,783 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:09,784 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:09,787 INFO L477 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 199 treesize of output 177 [2018-02-02 18:51:09,791 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:09,801 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 168 treesize of output 219 [2018-02-02 18:51:09,802 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-02 18:51:09,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:09,943 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:09,945 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:09,947 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:09,948 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 217 [2018-02-02 18:51:09,952 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:09,957 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 92 [2018-02-02 18:51:09,957 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-02 18:51:09,997 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:10,094 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:10,096 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:10,099 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:10,099 INFO L477 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 167 [2018-02-02 18:51:10,109 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 161 treesize of output 206 [2018-02-02 18:51:10,110 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-02 18:51:10,148 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:10,226 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:10,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 180 [2018-02-02 18:51:10,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 42 [2018-02-02 18:51:10,232 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:10,249 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:10,324 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:10,324 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:10,327 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:10,329 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:10,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 158 [2018-02-02 18:51:10,333 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:10,345 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 109 treesize of output 183 [2018-02-02 18:51:10,346 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-02 18:51:10,380 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:10,445 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:10,448 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:10,449 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:10,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 179 [2018-02-02 18:51:10,455 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:10,460 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 140 treesize of output 175 [2018-02-02 18:51:10,460 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-02 18:51:10,492 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:10,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 6 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-02 18:51:10,551 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:530, output treesize:524 [2018-02-02 18:51:11,603 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:11,603 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:11,604 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:11,604 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:11,604 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:11,607 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:11,607 INFO L477 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 225 treesize of output 194 [2018-02-02 18:51:11,612 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:11,633 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 88 treesize of output 138 [2018-02-02 18:51:11,633 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-02-02 18:51:11,648 INFO L267 ElimStorePlain]: Start of recursive call 3: 42 dim-0 vars, End of recursive call: 42 dim-0 vars, and 37 xjuncts. [2018-02-02 18:51:11,976 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:11,980 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:12,036 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:12,036 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:12,040 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:12,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 126 treesize of output 155 [2018-02-02 18:51:12,047 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-02-02 18:51:12,050 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:12,051 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:12,053 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:12,053 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:12,057 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:12,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 129 treesize of output 162 [2018-02-02 18:51:12,067 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 8 xjuncts. [2018-02-02 18:51:12,069 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:12,070 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:12,071 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:12,073 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:12,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 101 treesize of output 114 [2018-02-02 18:51:12,076 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-02-02 18:51:12,079 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:12,080 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:12,081 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:12,081 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:12,082 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:12,086 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:12,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 153 [2018-02-02 18:51:12,098 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-02-02 18:51:12,100 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:12,102 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:12,103 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:12,105 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:12,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 122 [2018-02-02 18:51:12,108 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-02-02 18:51:12,111 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:12,113 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:12,115 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:12,115 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:12,119 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:12,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 122 treesize of output 155 [2018-02-02 18:51:12,128 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 8 xjuncts. [2018-02-02 18:51:12,131 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:12,133 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:12,133 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:12,134 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:12,134 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:12,138 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:12,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 160 [2018-02-02 18:51:12,144 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-02-02 18:51:12,147 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:12,148 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:12,150 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:12,150 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:12,154 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:12,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 133 treesize of output 162 [2018-02-02 18:51:12,160 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-02-02 18:51:12,162 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:12,164 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:12,164 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:12,165 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:12,165 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:12,168 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:12,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 133 treesize of output 156 [2018-02-02 18:51:12,173 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-02-02 18:51:12,175 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:12,177 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:12,177 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:12,178 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:12,178 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:12,186 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:12,187 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:12,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 116 treesize of output 143 [2018-02-02 18:51:12,192 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-02-02 18:51:12,194 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:12,195 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:12,195 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:12,197 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:12,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 115 [2018-02-02 18:51:12,201 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-02-02 18:51:12,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 108 treesize of output 98 [2018-02-02 18:51:12,834 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:51:12,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 112 treesize of output 102 [2018-02-02 18:51:12,836 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:51:12,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 99 treesize of output 89 [2018-02-02 18:51:12,838 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:51:12,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 87 treesize of output 77 [2018-02-02 18:51:12,840 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:51:12,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 112 treesize of output 102 [2018-02-02 18:51:12,841 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:51:12,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 86 treesize of output 76 [2018-02-02 18:51:12,843 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:51:12,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 94 treesize of output 84 [2018-02-02 18:51:12,845 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:51:12,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 112 treesize of output 102 [2018-02-02 18:51:12,847 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:51:12,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 101 treesize of output 91 [2018-02-02 18:51:12,848 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:51:12,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 105 treesize of output 95 [2018-02-02 18:51:12,850 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:51:12,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 99 treesize of output 89 [2018-02-02 18:51:12,852 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:51:13,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 21 dim-0 vars, and 11 xjuncts. [2018-02-02 18:51:13,472 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:13,472 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:13,473 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:13,473 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:13,476 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:13,476 INFO L477 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 205 [2018-02-02 18:51:13,480 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:13,487 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 79 [2018-02-02 18:51:13,488 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-02 18:51:13,523 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:13,525 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:13,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 63 [2018-02-02 18:51:13,531 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 4 xjuncts. [2018-02-02 18:51:13,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 54 treesize of output 44 [2018-02-02 18:51:13,577 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:51:13,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 47 [2018-02-02 18:51:13,579 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:13,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 61 treesize of output 51 [2018-02-02 18:51:13,580 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:51:13,612 INFO L267 ElimStorePlain]: Start of recursive call 26: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-02 18:51:14,088 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:14,090 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:14,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 92 [2018-02-02 18:51:14,092 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:14,093 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:14,095 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:14,105 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 55 [2018-02-02 18:51:14,106 INFO L267 ElimStorePlain]: Start of recursive call 33: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 8 xjuncts. [2018-02-02 18:51:14,135 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:14,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 8 [2018-02-02 18:51:14,136 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:14,137 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:14,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2018-02-02 18:51:14,137 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:14,156 INFO L267 ElimStorePlain]: Start of recursive call 32: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:51:14,157 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:14,159 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:14,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 91 [2018-02-02 18:51:14,162 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:14,163 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:14,166 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 24 [2018-02-02 18:51:14,167 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-02 18:51:14,194 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:14,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-02 18:51:14,196 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 2 xjuncts. [2018-02-02 18:51:14,211 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:51:14,213 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:14,214 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:14,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 96 [2018-02-02 18:51:14,218 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:14,219 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:14,220 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:14,227 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 51 [2018-02-02 18:51:14,228 INFO L267 ElimStorePlain]: Start of recursive call 40: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-02-02 18:51:14,246 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:14,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 4 [2018-02-02 18:51:14,247 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:14,256 INFO L267 ElimStorePlain]: Start of recursive call 39: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:14,712 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:14,713 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:14,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2018-02-02 18:51:14,718 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:14,722 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 32 [2018-02-02 18:51:14,723 INFO L267 ElimStorePlain]: Start of recursive call 43: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-02 18:51:14,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 17 [2018-02-02 18:51:14,746 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 2 xjuncts. [2018-02-02 18:51:14,765 INFO L267 ElimStorePlain]: Start of recursive call 42: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:51:14,766 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:14,767 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:14,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2018-02-02 18:51:14,773 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:14,777 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 32 [2018-02-02 18:51:14,778 INFO L267 ElimStorePlain]: Start of recursive call 46: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-02 18:51:14,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 17 [2018-02-02 18:51:14,806 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 2 xjuncts. [2018-02-02 18:51:14,839 INFO L267 ElimStorePlain]: Start of recursive call 45: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:51:14,841 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:14,842 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:14,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 99 [2018-02-02 18:51:14,847 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:14,859 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 55 [2018-02-02 18:51:14,860 INFO L267 ElimStorePlain]: Start of recursive call 49: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-02-02 18:51:14,888 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:14,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 9 [2018-02-02 18:51:14,888 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:14,901 INFO L267 ElimStorePlain]: Start of recursive call 48: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:14,903 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:14,905 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:14,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2018-02-02 18:51:14,910 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:14,924 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 59 [2018-02-02 18:51:14,926 INFO L267 ElimStorePlain]: Start of recursive call 52: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 8 xjuncts. [2018-02-02 18:51:14,962 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:14,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2018-02-02 18:51:14,963 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:14,964 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:14,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 12 [2018-02-02 18:51:14,965 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:14,986 INFO L267 ElimStorePlain]: Start of recursive call 51: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:51:14,988 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:14,989 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:14,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 99 [2018-02-02 18:51:14,994 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:15,004 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 55 [2018-02-02 18:51:15,005 INFO L267 ElimStorePlain]: Start of recursive call 56: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-02-02 18:51:15,029 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:15,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2018-02-02 18:51:15,030 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:15,042 INFO L267 ElimStorePlain]: Start of recursive call 55: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:15,043 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:15,045 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:15,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 91 [2018-02-02 18:51:15,050 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:15,062 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 59 [2018-02-02 18:51:15,063 INFO L267 ElimStorePlain]: Start of recursive call 59: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 8 xjuncts. [2018-02-02 18:51:15,095 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:15,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 9 [2018-02-02 18:51:15,096 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:15,113 INFO L267 ElimStorePlain]: Start of recursive call 58: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:51:15,114 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:15,115 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:15,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 99 [2018-02-02 18:51:15,120 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:15,125 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 36 [2018-02-02 18:51:15,126 INFO L267 ElimStorePlain]: Start of recursive call 62: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-02 18:51:15,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2018-02-02 18:51:15,147 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:15,157 INFO L267 ElimStorePlain]: Start of recursive call 61: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:15,158 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:15,164 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:15,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2018-02-02 18:51:15,168 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:15,171 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 32 [2018-02-02 18:51:15,172 INFO L267 ElimStorePlain]: Start of recursive call 65: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-02 18:51:15,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 17 [2018-02-02 18:51:15,197 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 2 xjuncts. [2018-02-02 18:51:15,214 INFO L267 ElimStorePlain]: Start of recursive call 64: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:51:15,216 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:15,217 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:15,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2018-02-02 18:51:15,221 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:15,233 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 59 [2018-02-02 18:51:15,235 INFO L267 ElimStorePlain]: Start of recursive call 68: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 8 xjuncts. [2018-02-02 18:51:15,265 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:15,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 9 [2018-02-02 18:51:15,265 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:15,267 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:15,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 8 [2018-02-02 18:51:15,267 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:15,281 INFO L267 ElimStorePlain]: Start of recursive call 67: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:51:15,283 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:15,284 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:15,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 99 [2018-02-02 18:51:15,288 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:15,297 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 55 [2018-02-02 18:51:15,298 INFO L267 ElimStorePlain]: Start of recursive call 72: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-02-02 18:51:15,319 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:15,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2018-02-02 18:51:15,320 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:15,330 INFO L267 ElimStorePlain]: Start of recursive call 71: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:15,332 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:15,333 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:15,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 99 [2018-02-02 18:51:15,338 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:15,342 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 36 [2018-02-02 18:51:15,343 INFO L267 ElimStorePlain]: Start of recursive call 75: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-02 18:51:15,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2018-02-02 18:51:15,363 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:15,382 INFO L267 ElimStorePlain]: Start of recursive call 74: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:15,831 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:15,832 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:15,832 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:15,832 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:15,833 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:15,835 INFO L477 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 209 treesize of output 180 [2018-02-02 18:51:15,841 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:15,845 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:15,862 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 66 treesize of output 133 [2018-02-02 18:51:15,862 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-02-02 18:51:15,874 INFO L267 ElimStorePlain]: Start of recursive call 78: 58 dim-0 vars, End of recursive call: 58 dim-0 vars, and 35 xjuncts. [2018-02-02 18:51:16,444 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,444 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,444 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:16,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 126 [2018-02-02 18:51:16,449 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 2 xjuncts. [2018-02-02 18:51:16,450 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,451 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:16,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 109 [2018-02-02 18:51:16,451 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:16,453 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,454 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,454 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:16,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 139 [2018-02-02 18:51:16,456 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:16,458 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,458 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:16,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 113 [2018-02-02 18:51:16,459 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:16,461 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,462 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,462 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:16,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 145 [2018-02-02 18:51:16,466 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 2 xjuncts. [2018-02-02 18:51:16,468 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,469 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,469 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,469 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:16,470 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 136 [2018-02-02 18:51:16,472 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:16,474 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,475 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,475 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:16,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 133 [2018-02-02 18:51:16,477 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:16,479 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,480 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,480 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:16,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 130 [2018-02-02 18:51:16,484 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 2 xjuncts. [2018-02-02 18:51:16,486 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,487 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,487 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:16,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 120 [2018-02-02 18:51:16,494 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:16,496 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,497 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,498 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,498 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:16,498 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 136 [2018-02-02 18:51:16,500 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:16,502 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,503 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,503 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:16,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 138 [2018-02-02 18:51:16,507 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 2 xjuncts. [2018-02-02 18:51:16,509 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,509 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,510 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:16,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 126 [2018-02-02 18:51:16,511 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:16,513 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,513 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:16,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 142 treesize of output 145 [2018-02-02 18:51:16,521 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 2 xjuncts. [2018-02-02 18:51:16,523 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,524 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,524 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,524 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:16,525 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 126 [2018-02-02 18:51:16,527 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:16,529 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,530 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,530 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:16,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 130 [2018-02-02 18:51:16,534 INFO L267 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 2 xjuncts. [2018-02-02 18:51:16,536 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,536 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:16,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 106 [2018-02-02 18:51:16,537 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:16,539 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,540 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:16,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 143 treesize of output 130 [2018-02-02 18:51:16,546 INFO L267 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 2 xjuncts. [2018-02-02 18:51:16,548 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,549 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,549 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:16,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 122 [2018-02-02 18:51:16,550 INFO L267 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:16,552 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,553 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:16,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 100 [2018-02-02 18:51:16,553 INFO L267 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:16,557 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,557 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:16,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 135 treesize of output 138 [2018-02-02 18:51:16,562 INFO L267 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 2 xjuncts. [2018-02-02 18:51:17,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 106 [2018-02-02 18:51:17,349 INFO L267 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:17,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 88 [2018-02-02 18:51:17,350 INFO L267 ElimStorePlain]: Start of recursive call 100: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:51:17,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 106 [2018-02-02 18:51:17,352 INFO L267 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:17,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 106 [2018-02-02 18:51:17,354 INFO L267 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:17,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 93 [2018-02-02 18:51:17,355 INFO L267 ElimStorePlain]: Start of recursive call 103: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:51:17,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 104 [2018-02-02 18:51:17,357 INFO L267 ElimStorePlain]: Start of recursive call 104: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:51:17,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 110 [2018-02-02 18:51:17,359 INFO L267 ElimStorePlain]: Start of recursive call 105: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:51:17,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 110 [2018-02-02 18:51:17,361 INFO L267 ElimStorePlain]: Start of recursive call 106: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:51:17,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 103 [2018-02-02 18:51:17,363 INFO L267 ElimStorePlain]: Start of recursive call 107: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:51:17,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 103 [2018-02-02 18:51:17,365 INFO L267 ElimStorePlain]: Start of recursive call 108: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:51:17,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 103 [2018-02-02 18:51:17,366 INFO L267 ElimStorePlain]: Start of recursive call 109: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:51:17,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 88 [2018-02-02 18:51:17,368 INFO L267 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:17,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 102 [2018-02-02 18:51:17,369 INFO L267 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:17,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 100 [2018-02-02 18:51:17,371 INFO L267 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:17,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 97 [2018-02-02 18:51:17,372 INFO L267 ElimStorePlain]: Start of recursive call 113: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:51:17,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 110 [2018-02-02 18:51:17,374 INFO L267 ElimStorePlain]: Start of recursive call 114: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:51:17,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 106 [2018-02-02 18:51:17,377 INFO L267 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:17,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 85 [2018-02-02 18:51:17,379 INFO L267 ElimStorePlain]: Start of recursive call 116: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:51:17,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 92 [2018-02-02 18:51:17,381 INFO L267 ElimStorePlain]: Start of recursive call 117: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:51:17,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 103 [2018-02-02 18:51:17,383 INFO L267 ElimStorePlain]: Start of recursive call 118: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:51:18,045 INFO L267 ElimStorePlain]: Start of recursive call 77: 3 dim-1 vars, End of recursive call: 32 dim-0 vars, and 20 xjuncts. [2018-02-02 18:51:19,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 93 [2018-02-02 18:51:19,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2018-02-02 18:51:19,553 INFO L267 ElimStorePlain]: Start of recursive call 120: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:51:19,576 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:19,576 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:19,578 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:19,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 31 [2018-02-02 18:51:19,581 INFO L267 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 2 xjuncts. [2018-02-02 18:51:19,606 INFO L267 ElimStorePlain]: Start of recursive call 119: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:51:19,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 93 [2018-02-02 18:51:19,611 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:19,612 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:19,613 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:19,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 37 [2018-02-02 18:51:19,617 INFO L267 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 2 xjuncts. [2018-02-02 18:51:19,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2018-02-02 18:51:19,645 INFO L267 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:19,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-02-02 18:51:19,647 INFO L267 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:19,662 INFO L267 ElimStorePlain]: Start of recursive call 122: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:19,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 93 [2018-02-02 18:51:19,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2018-02-02 18:51:19,667 INFO L267 ElimStorePlain]: Start of recursive call 127: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:51:19,691 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:19,692 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:19,694 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:19,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 31 [2018-02-02 18:51:19,696 INFO L267 ElimStorePlain]: Start of recursive call 128: End of recursive call: and 2 xjuncts. [2018-02-02 18:51:19,720 INFO L267 ElimStorePlain]: Start of recursive call 126: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:51:19,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 94 [2018-02-02 18:51:19,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2018-02-02 18:51:19,726 INFO L267 ElimStorePlain]: Start of recursive call 130: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:51:19,744 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:19,744 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:19,746 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:19,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 31 [2018-02-02 18:51:19,749 INFO L267 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 2 xjuncts. [2018-02-02 18:51:19,773 INFO L267 ElimStorePlain]: Start of recursive call 129: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:51:19,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 93 [2018-02-02 18:51:19,779 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:19,779 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:19,781 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:19,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 37 [2018-02-02 18:51:19,784 INFO L267 ElimStorePlain]: Start of recursive call 133: End of recursive call: and 2 xjuncts. [2018-02-02 18:51:19,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2018-02-02 18:51:19,813 INFO L267 ElimStorePlain]: Start of recursive call 134: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:19,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-02-02 18:51:19,815 INFO L267 ElimStorePlain]: Start of recursive call 135: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:19,829 INFO L267 ElimStorePlain]: Start of recursive call 132: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:19,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 101 [2018-02-02 18:51:19,835 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:19,836 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:19,838 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:19,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 33 [2018-02-02 18:51:19,839 INFO L267 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:19,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2018-02-02 18:51:19,857 INFO L267 ElimStorePlain]: Start of recursive call 138: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:19,869 INFO L267 ElimStorePlain]: Start of recursive call 136: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:19,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 98 [2018-02-02 18:51:19,874 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:19,875 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:19,877 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:19,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 33 [2018-02-02 18:51:19,877 INFO L267 ElimStorePlain]: Start of recursive call 140: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:19,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2018-02-02 18:51:19,896 INFO L267 ElimStorePlain]: Start of recursive call 141: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:19,906 INFO L267 ElimStorePlain]: Start of recursive call 139: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:19,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 93 [2018-02-02 18:51:19,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2018-02-02 18:51:19,911 INFO L267 ElimStorePlain]: Start of recursive call 143: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:51:19,929 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:19,929 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:19,931 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:19,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 31 [2018-02-02 18:51:19,933 INFO L267 ElimStorePlain]: Start of recursive call 144: End of recursive call: and 2 xjuncts. [2018-02-02 18:51:19,959 INFO L267 ElimStorePlain]: Start of recursive call 142: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:51:19,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 93 [2018-02-02 18:51:19,965 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:19,965 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:19,967 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:19,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 37 [2018-02-02 18:51:19,970 INFO L267 ElimStorePlain]: Start of recursive call 146: End of recursive call: and 2 xjuncts. [2018-02-02 18:51:20,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2018-02-02 18:51:20,001 INFO L267 ElimStorePlain]: Start of recursive call 147: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:20,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 23 [2018-02-02 18:51:20,004 INFO L267 ElimStorePlain]: Start of recursive call 148: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:20,017 INFO L267 ElimStorePlain]: Start of recursive call 145: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:20,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 98 [2018-02-02 18:51:20,022 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:20,023 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:20,025 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:20,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 33 [2018-02-02 18:51:20,025 INFO L267 ElimStorePlain]: Start of recursive call 150: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:20,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2018-02-02 18:51:20,041 INFO L267 ElimStorePlain]: Start of recursive call 151: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:20,050 INFO L267 ElimStorePlain]: Start of recursive call 149: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:20,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 94 [2018-02-02 18:51:20,056 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:20,057 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:20,059 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:20,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 37 [2018-02-02 18:51:20,061 INFO L267 ElimStorePlain]: Start of recursive call 153: End of recursive call: and 2 xjuncts. [2018-02-02 18:51:20,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2018-02-02 18:51:20,088 INFO L267 ElimStorePlain]: Start of recursive call 154: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:20,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2018-02-02 18:51:20,090 INFO L267 ElimStorePlain]: Start of recursive call 155: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:20,105 INFO L267 ElimStorePlain]: Start of recursive call 152: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:51:20,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 98 [2018-02-02 18:51:20,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2018-02-02 18:51:20,110 INFO L267 ElimStorePlain]: Start of recursive call 157: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:51:20,130 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:20,131 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:20,133 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:20,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2018-02-02 18:51:20,134 INFO L267 ElimStorePlain]: Start of recursive call 158: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:20,147 INFO L267 ElimStorePlain]: Start of recursive call 156: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:20,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 94 [2018-02-02 18:51:20,153 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:20,153 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:20,155 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:20,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 37 [2018-02-02 18:51:20,158 INFO L267 ElimStorePlain]: Start of recursive call 160: End of recursive call: and 2 xjuncts. [2018-02-02 18:51:20,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2018-02-02 18:51:20,185 INFO L267 ElimStorePlain]: Start of recursive call 161: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:20,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2018-02-02 18:51:20,187 INFO L267 ElimStorePlain]: Start of recursive call 162: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:20,200 INFO L267 ElimStorePlain]: Start of recursive call 159: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:51:20,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 94 [2018-02-02 18:51:20,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2018-02-02 18:51:20,206 INFO L267 ElimStorePlain]: Start of recursive call 164: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:51:20,238 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:20,239 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:20,241 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:20,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 31 [2018-02-02 18:51:20,244 INFO L267 ElimStorePlain]: Start of recursive call 165: End of recursive call: and 2 xjuncts. [2018-02-02 18:51:20,269 INFO L267 ElimStorePlain]: Start of recursive call 163: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:51:20,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 94 [2018-02-02 18:51:20,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2018-02-02 18:51:20,279 INFO L267 ElimStorePlain]: Start of recursive call 167: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:51:20,297 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:20,298 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:20,300 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:20,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 31 [2018-02-02 18:51:20,307 INFO L267 ElimStorePlain]: Start of recursive call 168: End of recursive call: and 2 xjuncts. [2018-02-02 18:51:20,331 INFO L267 ElimStorePlain]: Start of recursive call 166: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:51:20,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 98 [2018-02-02 18:51:20,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2018-02-02 18:51:20,345 INFO L267 ElimStorePlain]: Start of recursive call 170: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:51:20,365 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:20,366 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:20,368 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:20,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2018-02-02 18:51:20,368 INFO L267 ElimStorePlain]: Start of recursive call 171: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:20,382 INFO L267 ElimStorePlain]: Start of recursive call 169: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:20,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 94 [2018-02-02 18:51:20,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2018-02-02 18:51:20,389 INFO L267 ElimStorePlain]: Start of recursive call 173: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:51:20,406 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:20,407 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:20,409 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:20,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 31 [2018-02-02 18:51:20,411 INFO L267 ElimStorePlain]: Start of recursive call 174: End of recursive call: and 2 xjuncts. [2018-02-02 18:51:20,435 INFO L267 ElimStorePlain]: Start of recursive call 172: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:51:20,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 94 [2018-02-02 18:51:20,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2018-02-02 18:51:20,441 INFO L267 ElimStorePlain]: Start of recursive call 176: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:51:20,461 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:20,461 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:20,463 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:20,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 31 [2018-02-02 18:51:20,465 INFO L267 ElimStorePlain]: Start of recursive call 177: End of recursive call: and 2 xjuncts. [2018-02-02 18:51:20,489 INFO L267 ElimStorePlain]: Start of recursive call 175: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:51:20,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 98 [2018-02-02 18:51:20,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2018-02-02 18:51:20,495 INFO L267 ElimStorePlain]: Start of recursive call 179: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:51:20,523 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:20,524 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:20,526 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:20,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2018-02-02 18:51:20,526 INFO L267 ElimStorePlain]: Start of recursive call 180: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:20,544 INFO L267 ElimStorePlain]: Start of recursive call 178: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:20,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 98 [2018-02-02 18:51:20,550 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:20,550 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:20,552 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:20,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 33 [2018-02-02 18:51:20,553 INFO L267 ElimStorePlain]: Start of recursive call 182: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:20,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2018-02-02 18:51:20,569 INFO L267 ElimStorePlain]: Start of recursive call 183: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:20,578 INFO L267 ElimStorePlain]: Start of recursive call 181: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:21,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 6 dim-2 vars, End of recursive call: 109 dim-0 vars, and 49 xjuncts. [2018-02-02 18:51:21,943 INFO L202 ElimStorePlain]: Needed 183 recursive calls to eliminate 17 variables, input treesize:626, output treesize:2111 [2018-02-02 18:51:22,405 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 788 DAG size of output 46 [2018-02-02 18:51:22,574 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:51:22,590 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:51:22,591 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 25] total 40 [2018-02-02 18:51:22,591 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-02 18:51:22,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-02 18:51:22,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1528, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 18:51:22,591 INFO L87 Difference]: Start difference. First operand 210 states and 234 transitions. Second operand 41 states. [2018-02-02 18:51:24,584 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 143 DAG size of output 84 [2018-02-02 18:51:25,745 WARN L146 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 247 DAG size of output 83 [2018-02-02 18:51:26,421 WARN L146 SmtUtils]: Spent 171ms on a formula simplification. DAG size of input: 242 DAG size of output 76 [2018-02-02 18:51:27,387 WARN L146 SmtUtils]: Spent 309ms on a formula simplification. DAG size of input: 471 DAG size of output 119 Received shutdown request... [2018-02-02 18:51:28,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 18:51:28,159 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 18:51:28,164 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 18:51:28,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 06:51:28 BoogieIcfgContainer [2018-02-02 18:51:28,164 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 18:51:28,164 INFO L168 Benchmark]: Toolchain (without parser) took 81848.76 ms. Allocated memory was 397.9 MB in the beginning and 799.5 MB in the end (delta: 401.6 MB). Free memory was 354.8 MB in the beginning and 533.2 MB in the end (delta: -178.4 MB). Peak memory consumption was 223.2 MB. Max. memory is 5.3 GB. [2018-02-02 18:51:28,165 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 397.9 MB. Free memory is still 360.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 18:51:28,165 INFO L168 Benchmark]: CACSL2BoogieTranslator took 148.61 ms. Allocated memory is still 397.9 MB. Free memory was 354.8 MB in the beginning and 344.2 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 18:51:28,165 INFO L168 Benchmark]: Boogie Preprocessor took 26.14 ms. Allocated memory is still 397.9 MB. Free memory was 344.2 MB in the beginning and 341.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 18:51:28,166 INFO L168 Benchmark]: RCFGBuilder took 240.72 ms. Allocated memory is still 397.9 MB. Free memory was 341.6 MB in the beginning and 319.6 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 5.3 GB. [2018-02-02 18:51:28,166 INFO L168 Benchmark]: TraceAbstraction took 81430.41 ms. Allocated memory was 397.9 MB in the beginning and 799.5 MB in the end (delta: 401.6 MB). Free memory was 319.6 MB in the beginning and 533.2 MB in the end (delta: -213.6 MB). Peak memory consumption was 188.0 MB. Max. memory is 5.3 GB. [2018-02-02 18:51:28,167 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 397.9 MB. Free memory is still 360.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 148.61 ms. Allocated memory is still 397.9 MB. Free memory was 354.8 MB in the beginning and 344.2 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.14 ms. Allocated memory is still 397.9 MB. Free memory was 344.2 MB in the beginning and 341.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 240.72 ms. Allocated memory is still 397.9 MB. Free memory was 341.6 MB in the beginning and 319.6 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 81430.41 ms. Allocated memory was 397.9 MB in the beginning and 799.5 MB in the end (delta: 401.6 MB). Free memory was 319.6 MB in the beginning and 533.2 MB in the end (delta: -213.6 MB). Peak memory consumption was 188.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 26 states, 41 states before enhancement), while ReachableStatesComputation was computing reachable states (52 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 26 states, 41 states before enhancement), while ReachableStatesComputation was computing reachable states (52 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 26 states, 41 states before enhancement), while ReachableStatesComputation was computing reachable states (52 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 26 states, 41 states before enhancement), while ReachableStatesComputation was computing reachable states (52 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 26 states, 41 states before enhancement), while ReachableStatesComputation was computing reachable states (52 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 661). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 26 states, 41 states before enhancement), while ReachableStatesComputation was computing reachable states (52 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 26 states, 41 states before enhancement), while ReachableStatesComputation was computing reachable states (52 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 26 states, 41 states before enhancement), while ReachableStatesComputation was computing reachable states (52 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 26 states, 41 states before enhancement), while ReachableStatesComputation was computing reachable states (52 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 26 states, 41 states before enhancement), while ReachableStatesComputation was computing reachable states (52 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 26 states, 41 states before enhancement), while ReachableStatesComputation was computing reachable states (52 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 26 states, 41 states before enhancement), while ReachableStatesComputation was computing reachable states (52 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 26 states, 41 states before enhancement), while ReachableStatesComputation was computing reachable states (52 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 26 states, 41 states before enhancement), while ReachableStatesComputation was computing reachable states (52 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 26 states, 41 states before enhancement), while ReachableStatesComputation was computing reachable states (52 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 26 states, 41 states before enhancement), while ReachableStatesComputation was computing reachable states (52 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 26 states, 41 states before enhancement), while ReachableStatesComputation was computing reachable states (52 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 631]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 631). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 26 states, 41 states before enhancement), while ReachableStatesComputation was computing reachable states (52 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 26 states, 41 states before enhancement), while ReachableStatesComputation was computing reachable states (52 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 661). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 26 states, 41 states before enhancement), while ReachableStatesComputation was computing reachable states (52 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 26 states, 41 states before enhancement), while ReachableStatesComputation was computing reachable states (52 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 26 states, 41 states before enhancement), while ReachableStatesComputation was computing reachable states (52 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 26 states, 41 states before enhancement), while ReachableStatesComputation was computing reachable states (52 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 26 states, 41 states before enhancement), while ReachableStatesComputation was computing reachable states (52 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 26 states, 41 states before enhancement), while ReachableStatesComputation was computing reachable states (52 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 65 locations, 25 error locations. TIMEOUT Result, 81.3s OverallTime, 33 OverallIterations, 3 TraceHistogramMax, 43.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1351 SDtfs, 6005 SDslu, 9390 SDs, 0 SdLazy, 14309 SolverSat, 2534 SolverUnsat, 79 SolverUnknown, 0 SolverNotchecked, 16.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1685 GetRequests, 531 SyntacticMatches, 78 SemanticMatches, 1076 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 13985 ImplicationChecksByTransitivity, 38.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=210occurred in iteration=32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 32 MinimizatonAttempts, 977 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 36.8s InterpolantComputationTime, 1804 NumberOfCodeBlocks, 1804 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 1755 ConstructedInterpolants, 228 QuantifiedInterpolants, 2313592 SizeOfPredicates, 251 NumberOfNonLiveVariables, 3018 ConjunctsInSsa, 707 ConjunctsInUnsatCore, 49 InterpolantComputations, 17 PerfectInterpolantSequences, 127/487 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll_extends_pointer_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_18-51-28-173.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll_extends_pointer_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_18-51-28-173.csv Completed graceful shutdown