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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/memsafety/test-0504_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 09:00:53,401 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 09:00:53,402 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 09:00:53,415 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 09:00:53,415 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 09:00:53,416 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 09:00:53,416 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 09:00:53,418 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 09:00:53,420 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 09:00:53,420 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 09:00:53,421 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 09:00:53,421 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 09:00:53,422 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 09:00:53,423 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 09:00:53,423 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 09:00:53,425 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 09:00:53,427 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 09:00:53,428 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 09:00:53,429 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 09:00:53,430 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 09:00:53,431 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 09:00:53,432 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 09:00:53,432 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 09:00:53,433 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 09:00:53,433 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 09:00:53,434 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 09:00:53,434 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 09:00:53,435 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 09:00:53,435 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 09:00:53,435 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 09:00:53,435 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 09:00:53,436 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 09:00:53,444 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 09:00:53,444 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 09:00:53,445 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 09:00:53,445 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 09:00:53,445 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 09:00:53,445 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 09:00:53,445 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 09:00:53,445 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 09:00:53,445 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 09:00:53,446 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 09:00:53,446 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 09:00:53,446 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 09:00:53,446 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 09:00:53,446 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 09:00:53,446 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 09:00:53,446 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 09:00:53,446 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 09:00:53,446 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 09:00:53,446 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 09:00:53,447 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 09:00:53,447 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 09:00:53,447 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 09:00:53,447 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 09:00:53,447 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 09:00:53,447 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 09:00:53,473 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 09:00:53,481 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 09:00:53,483 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 09:00:53,484 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 09:00:53,485 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 09:00:53,485 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0504_true-valid-memsafety.i [2018-02-02 09:00:53,624 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 09:00:53,625 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 09:00:53,625 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 09:00:53,625 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 09:00:53,630 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 09:00:53,631 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:00:53" (1/1) ... [2018-02-02 09:00:53,633 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@679e69c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:00:53, skipping insertion in model container [2018-02-02 09:00:53,634 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:00:53" (1/1) ... [2018-02-02 09:00:53,646 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:00:53,672 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:00:53,769 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:00:53,788 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:00:53,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:00:53 WrapperNode [2018-02-02 09:00:53,795 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 09:00:53,795 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 09:00:53,795 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 09:00:53,796 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 09:00:53,808 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:00:53" (1/1) ... [2018-02-02 09:00:53,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:00:53" (1/1) ... [2018-02-02 09:00:53,818 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:00:53" (1/1) ... [2018-02-02 09:00:53,818 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:00:53" (1/1) ... [2018-02-02 09:00:53,821 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:00:53" (1/1) ... [2018-02-02 09:00:53,825 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:00:53" (1/1) ... [2018-02-02 09:00:53,826 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:00:53" (1/1) ... [2018-02-02 09:00:53,828 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 09:00:53,828 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 09:00:53,828 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 09:00:53,828 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 09:00:53,829 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:00:53" (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 09:00:53,867 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 09:00:53,867 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 09:00:53,868 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 09:00:53,868 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 09:00:53,868 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 09:00:53,868 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 09:00:53,868 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 09:00:53,868 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 09:00:53,868 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 09:00:53,868 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 09:00:53,868 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 09:00:53,868 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 09:00:53,868 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-02 09:00:53,869 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 09:00:53,869 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 09:00:53,869 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 09:00:53,869 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 09:00:54,143 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 09:00:54,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:00:54 BoogieIcfgContainer [2018-02-02 09:00:54,144 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 09:00:54,144 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 09:00:54,144 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 09:00:54,146 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 09:00:54,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:00:53" (1/3) ... [2018-02-02 09:00:54,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64bc95aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:00:54, skipping insertion in model container [2018-02-02 09:00:54,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:00:53" (2/3) ... [2018-02-02 09:00:54,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64bc95aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:00:54, skipping insertion in model container [2018-02-02 09:00:54,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:00:54" (3/3) ... [2018-02-02 09:00:54,148 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0504_true-valid-memsafety.i [2018-02-02 09:00:54,153 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 09:00:54,157 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 39 error locations. [2018-02-02 09:00:54,187 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 09:00:54,187 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 09:00:54,187 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 09:00:54,187 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 09:00:54,187 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 09:00:54,187 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 09:00:54,188 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 09:00:54,188 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 09:00:54,188 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 09:00:54,200 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states. [2018-02-02 09:00:54,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-02 09:00:54,208 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:00:54,209 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:00:54,210 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 09:00:54,213 INFO L82 PathProgramCache]: Analyzing trace with hash 23857872, now seen corresponding path program 1 times [2018-02-02 09:00:54,214 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:00:54,215 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:00:54,245 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:00:54,245 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:00:54,245 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:00:54,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:00:54,278 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:00:54,298 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 09:00:54,300 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:00:54,300 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 09:00:54,302 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-02 09:00:54,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-02 09:00:54,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 09:00:54,315 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 2 states. [2018-02-02 09:00:54,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:00:54,398 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2018-02-02 09:00:54,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-02 09:00:54,399 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-02-02 09:00:54,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:00:54,405 INFO L225 Difference]: With dead ends: 94 [2018-02-02 09:00:54,406 INFO L226 Difference]: Without dead ends: 91 [2018-02-02 09:00:54,407 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 09:00:54,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-02 09:00:54,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-02-02 09:00:54,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-02 09:00:54,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2018-02-02 09:00:54,428 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 10 [2018-02-02 09:00:54,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:00:54,429 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2018-02-02 09:00:54,429 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-02 09:00:54,429 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-02-02 09:00:54,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-02 09:00:54,429 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:00:54,429 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:00:54,430 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 09:00:54,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1271008375, now seen corresponding path program 1 times [2018-02-02 09:00:54,430 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:00:54,430 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:00:54,431 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:00:54,432 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:00:54,432 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:00:54,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:00:54,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:00:54,471 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 09:00:54,472 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:00:54,472 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:00:54,473 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 09:00:54,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 09:00:54,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:00:54,474 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand 3 states. [2018-02-02 09:00:54,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:00:54,506 INFO L93 Difference]: Finished difference Result 146 states and 152 transitions. [2018-02-02 09:00:54,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 09:00:54,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-02-02 09:00:54,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:00:54,508 INFO L225 Difference]: With dead ends: 146 [2018-02-02 09:00:54,508 INFO L226 Difference]: Without dead ends: 146 [2018-02-02 09:00:54,509 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:00:54,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-02 09:00:54,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 122. [2018-02-02 09:00:54,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-02 09:00:54,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 152 transitions. [2018-02-02 09:00:54,515 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 152 transitions. Word has length 12 [2018-02-02 09:00:54,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:00:54,515 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 152 transitions. [2018-02-02 09:00:54,515 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 09:00:54,516 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 152 transitions. [2018-02-02 09:00:54,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 09:00:54,516 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:00:54,516 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:00:54,516 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 09:00:54,516 INFO L82 PathProgramCache]: Analyzing trace with hash -746554717, now seen corresponding path program 1 times [2018-02-02 09:00:54,516 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:00:54,516 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:00:54,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:00:54,517 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:00:54,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:00:54,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:00:54,523 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:00:54,541 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 09:00:54,541 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:00:54,541 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 09:00:54,541 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 09:00:54,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 09:00:54,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:00:54,542 INFO L87 Difference]: Start difference. First operand 122 states and 152 transitions. Second operand 3 states. [2018-02-02 09:00:54,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:00:54,623 INFO L93 Difference]: Finished difference Result 124 states and 153 transitions. [2018-02-02 09:00:54,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 09:00:54,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-02-02 09:00:54,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:00:54,625 INFO L225 Difference]: With dead ends: 124 [2018-02-02 09:00:54,625 INFO L226 Difference]: Without dead ends: 120 [2018-02-02 09:00:54,625 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:00:54,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-02 09:00:54,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-02-02 09:00:54,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-02 09:00:54,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 149 transitions. [2018-02-02 09:00:54,632 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 149 transitions. Word has length 13 [2018-02-02 09:00:54,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:00:54,632 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 149 transitions. [2018-02-02 09:00:54,632 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 09:00:54,633 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 149 transitions. [2018-02-02 09:00:54,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 09:00:54,633 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:00:54,633 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:00:54,633 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 09:00:54,634 INFO L82 PathProgramCache]: Analyzing trace with hash -747420669, now seen corresponding path program 1 times [2018-02-02 09:00:54,634 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:00:54,634 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:00:54,635 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:00:54,635 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:00:54,635 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:00:54,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:00:54,645 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:00:54,668 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 09:00:54,668 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:00:54,668 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:00:54,669 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:00:54,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:00:54,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:00:54,669 INFO L87 Difference]: Start difference. First operand 120 states and 149 transitions. Second operand 4 states. [2018-02-02 09:00:54,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:00:54,784 INFO L93 Difference]: Finished difference Result 137 states and 160 transitions. [2018-02-02 09:00:54,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:00:54,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-02 09:00:54,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:00:54,785 INFO L225 Difference]: With dead ends: 137 [2018-02-02 09:00:54,786 INFO L226 Difference]: Without dead ends: 137 [2018-02-02 09:00:54,786 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 09:00:54,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-02-02 09:00:54,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 112. [2018-02-02 09:00:54,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-02 09:00:54,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 134 transitions. [2018-02-02 09:00:54,793 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 134 transitions. Word has length 13 [2018-02-02 09:00:54,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:00:54,793 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 134 transitions. [2018-02-02 09:00:54,793 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:00:54,793 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 134 transitions. [2018-02-02 09:00:54,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 09:00:54,794 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:00:54,794 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:00:54,794 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 09:00:54,794 INFO L82 PathProgramCache]: Analyzing trace with hash -747420668, now seen corresponding path program 1 times [2018-02-02 09:00:54,794 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:00:54,794 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:00:54,795 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:00:54,795 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:00:54,796 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:00:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:00:54,806 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:00:54,881 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 09:00:54,881 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:00:54,882 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:00:54,882 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:00:54,882 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:00:54,882 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:00:54,883 INFO L87 Difference]: Start difference. First operand 112 states and 134 transitions. Second operand 4 states. [2018-02-02 09:00:54,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:00:54,970 INFO L93 Difference]: Finished difference Result 152 states and 174 transitions. [2018-02-02 09:00:54,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:00:54,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-02 09:00:54,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:00:54,971 INFO L225 Difference]: With dead ends: 152 [2018-02-02 09:00:54,971 INFO L226 Difference]: Without dead ends: 152 [2018-02-02 09:00:54,971 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 09:00:54,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-02 09:00:54,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 113. [2018-02-02 09:00:54,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-02 09:00:54,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 134 transitions. [2018-02-02 09:00:54,975 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 134 transitions. Word has length 13 [2018-02-02 09:00:54,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:00:54,975 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 134 transitions. [2018-02-02 09:00:54,975 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:00:54,975 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 134 transitions. [2018-02-02 09:00:54,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 09:00:54,976 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:00:54,976 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, 1, 1] [2018-02-02 09:00:54,976 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 09:00:54,976 INFO L82 PathProgramCache]: Analyzing trace with hash 2050240790, now seen corresponding path program 1 times [2018-02-02 09:00:54,976 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:00:54,976 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:00:54,977 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:00:54,977 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:00:54,977 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:00:54,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:00:54,997 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:00:55,073 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 09:00:55,073 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:00:55,073 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:00:55,073 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:00:55,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:00:55,073 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:00:55,073 INFO L87 Difference]: Start difference. First operand 113 states and 134 transitions. Second operand 5 states. [2018-02-02 09:00:55,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:00:55,190 INFO L93 Difference]: Finished difference Result 198 states and 220 transitions. [2018-02-02 09:00:55,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 09:00:55,190 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-02-02 09:00:55,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:00:55,191 INFO L225 Difference]: With dead ends: 198 [2018-02-02 09:00:55,191 INFO L226 Difference]: Without dead ends: 198 [2018-02-02 09:00:55,192 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 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 09:00:55,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-02-02 09:00:55,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 104. [2018-02-02 09:00:55,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-02-02 09:00:55,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 119 transitions. [2018-02-02 09:00:55,197 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 119 transitions. Word has length 25 [2018-02-02 09:00:55,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:00:55,197 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 119 transitions. [2018-02-02 09:00:55,197 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:00:55,197 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 119 transitions. [2018-02-02 09:00:55,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 09:00:55,198 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:00:55,198 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, 1, 1, 1] [2018-02-02 09:00:55,198 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 09:00:55,198 INFO L82 PathProgramCache]: Analyzing trace with hash -867044953, now seen corresponding path program 1 times [2018-02-02 09:00:55,198 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:00:55,198 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:00:55,199 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:00:55,199 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:00:55,199 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:00:55,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:00:55,213 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:00:55,240 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 09:00:55,240 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:00:55,240 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:00:55,241 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:00:55,241 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:00:55,241 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:00:55,241 INFO L87 Difference]: Start difference. First operand 104 states and 119 transitions. Second operand 4 states. [2018-02-02 09:00:55,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:00:55,337 INFO L93 Difference]: Finished difference Result 152 states and 168 transitions. [2018-02-02 09:00:55,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:00:55,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-02-02 09:00:55,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:00:55,339 INFO L225 Difference]: With dead ends: 152 [2018-02-02 09:00:55,339 INFO L226 Difference]: Without dead ends: 152 [2018-02-02 09:00:55,339 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 09:00:55,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-02 09:00:55,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 100. [2018-02-02 09:00:55,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-02 09:00:55,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2018-02-02 09:00:55,343 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 26 [2018-02-02 09:00:55,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:00:55,344 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2018-02-02 09:00:55,344 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:00:55,344 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2018-02-02 09:00:55,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 09:00:55,344 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:00:55,344 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, 1, 1, 1] [2018-02-02 09:00:55,344 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 09:00:55,345 INFO L82 PathProgramCache]: Analyzing trace with hash -867044952, now seen corresponding path program 1 times [2018-02-02 09:00:55,345 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:00:55,345 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:00:55,346 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:00:55,346 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:00:55,346 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:00:55,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:00:55,357 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:00:55,409 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 09:00:55,409 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:00:55,409 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:00:55,409 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:00:55,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:00:55,410 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:00:55,410 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand 4 states. [2018-02-02 09:00:55,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:00:55,486 INFO L93 Difference]: Finished difference Result 140 states and 152 transitions. [2018-02-02 09:00:55,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:00:55,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-02-02 09:00:55,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:00:55,487 INFO L225 Difference]: With dead ends: 140 [2018-02-02 09:00:55,487 INFO L226 Difference]: Without dead ends: 140 [2018-02-02 09:00:55,487 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 09:00:55,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-02-02 09:00:55,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 96. [2018-02-02 09:00:55,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-02 09:00:55,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2018-02-02 09:00:55,491 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 26 [2018-02-02 09:00:55,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:00:55,491 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2018-02-02 09:00:55,491 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:00:55,491 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2018-02-02 09:00:55,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 09:00:55,492 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:00:55,492 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] [2018-02-02 09:00:55,492 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 09:00:55,492 INFO L82 PathProgramCache]: Analyzing trace with hash -2023715676, now seen corresponding path program 1 times [2018-02-02 09:00:55,492 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:00:55,492 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:00:55,493 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:00:55,493 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:00:55,493 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:00:55,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:00:55,503 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:00:55,528 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 09:00:55,528 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:00:55,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:00:55,528 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:00:55,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:00:55,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:00:55,529 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand 4 states. [2018-02-02 09:00:55,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:00:55,605 INFO L93 Difference]: Finished difference Result 122 states and 128 transitions. [2018-02-02 09:00:55,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:00:55,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-02-02 09:00:55,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:00:55,606 INFO L225 Difference]: With dead ends: 122 [2018-02-02 09:00:55,606 INFO L226 Difference]: Without dead ends: 122 [2018-02-02 09:00:55,607 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 09:00:55,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-02 09:00:55,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 99. [2018-02-02 09:00:55,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-02 09:00:55,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2018-02-02 09:00:55,610 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 28 [2018-02-02 09:00:55,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:00:55,610 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2018-02-02 09:00:55,610 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:00:55,611 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2018-02-02 09:00:55,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 09:00:55,611 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:00:55,611 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] [2018-02-02 09:00:55,611 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 09:00:55,612 INFO L82 PathProgramCache]: Analyzing trace with hash -2023715675, now seen corresponding path program 1 times [2018-02-02 09:00:55,612 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:00:55,612 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:00:55,613 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:00:55,613 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:00:55,613 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:00:55,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:00:55,622 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:00:55,691 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 09:00:55,692 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:00:55,692 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:00:55,692 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:00:55,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:00:55,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:00:55,693 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand 5 states. [2018-02-02 09:00:55,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:00:55,777 INFO L93 Difference]: Finished difference Result 176 states and 195 transitions. [2018-02-02 09:00:55,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:00:55,778 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-02-02 09:00:55,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:00:55,780 INFO L225 Difference]: With dead ends: 176 [2018-02-02 09:00:55,780 INFO L226 Difference]: Without dead ends: 176 [2018-02-02 09:00:55,780 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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 09:00:55,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-02 09:00:55,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 129. [2018-02-02 09:00:55,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-02 09:00:55,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 147 transitions. [2018-02-02 09:00:55,783 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 147 transitions. Word has length 28 [2018-02-02 09:00:55,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:00:55,784 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 147 transitions. [2018-02-02 09:00:55,784 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:00:55,784 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 147 transitions. [2018-02-02 09:00:55,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 09:00:55,785 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:00:55,785 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 09:00:55,785 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 09:00:55,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1689322728, now seen corresponding path program 1 times [2018-02-02 09:00:55,785 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:00:55,785 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:00:55,786 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:00:55,786 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:00:55,786 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:00:55,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:00:55,794 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:00:55,827 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 09:00:55,827 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:00:55,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:00:55,827 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:00:55,828 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:00:55,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:00:55,828 INFO L87 Difference]: Start difference. First operand 129 states and 147 transitions. Second operand 5 states. [2018-02-02 09:00:55,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:00:55,891 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2018-02-02 09:00:55,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:00:55,898 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-02-02 09:00:55,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:00:55,899 INFO L225 Difference]: With dead ends: 133 [2018-02-02 09:00:55,899 INFO L226 Difference]: Without dead ends: 133 [2018-02-02 09:00:55,899 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 09:00:55,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-02 09:00:55,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 125. [2018-02-02 09:00:55,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-02 09:00:55,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2018-02-02 09:00:55,902 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 137 transitions. Word has length 29 [2018-02-02 09:00:55,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:00:55,902 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 137 transitions. [2018-02-02 09:00:55,903 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:00:55,903 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 137 transitions. [2018-02-02 09:00:55,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 09:00:55,903 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:00:55,903 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, 1, 1, 1, 1, 1, 1] [2018-02-02 09:00:55,903 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 09:00:55,904 INFO L82 PathProgramCache]: Analyzing trace with hash -202845861, now seen corresponding path program 1 times [2018-02-02 09:00:55,904 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:00:55,904 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:00:55,904 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:00:55,904 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:00:55,905 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:00:55,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:00:55,914 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:00:55,960 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 09:00:55,960 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:00:55,961 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:00:55,961 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:00:55,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:00:55,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:00:55,961 INFO L87 Difference]: Start difference. First operand 125 states and 137 transitions. Second operand 6 states. [2018-02-02 09:00:56,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:00:56,091 INFO L93 Difference]: Finished difference Result 194 states and 211 transitions. [2018-02-02 09:00:56,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:00:56,092 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-02-02 09:00:56,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:00:56,092 INFO L225 Difference]: With dead ends: 194 [2018-02-02 09:00:56,093 INFO L226 Difference]: Without dead ends: 194 [2018-02-02 09:00:56,093 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:00:56,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-02-02 09:00:56,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 144. [2018-02-02 09:00:56,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-02 09:00:56,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 159 transitions. [2018-02-02 09:00:56,096 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 159 transitions. Word has length 29 [2018-02-02 09:00:56,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:00:56,096 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 159 transitions. [2018-02-02 09:00:56,096 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:00:56,097 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 159 transitions. [2018-02-02 09:00:56,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 09:00:56,097 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:00:56,097 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, 1, 1, 1, 1, 1, 1] [2018-02-02 09:00:56,097 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 09:00:56,098 INFO L82 PathProgramCache]: Analyzing trace with hash -202845860, now seen corresponding path program 1 times [2018-02-02 09:00:56,098 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:00:56,098 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:00:56,099 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:00:56,099 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:00:56,099 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:00:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:00:56,109 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:00:56,281 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 09:00:56,281 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:00:56,281 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 09:00:56,281 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 09:00:56,282 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 09:00:56,282 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:00:56,282 INFO L87 Difference]: Start difference. First operand 144 states and 159 transitions. Second operand 10 states. [2018-02-02 09:00:56,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:00:56,593 INFO L93 Difference]: Finished difference Result 221 states and 237 transitions. [2018-02-02 09:00:56,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 09:00:56,593 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-02-02 09:00:56,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:00:56,594 INFO L225 Difference]: With dead ends: 221 [2018-02-02 09:00:56,594 INFO L226 Difference]: Without dead ends: 221 [2018-02-02 09:00:56,595 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2018-02-02 09:00:56,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-02-02 09:00:56,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 144. [2018-02-02 09:00:56,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-02 09:00:56,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 157 transitions. [2018-02-02 09:00:56,598 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 157 transitions. Word has length 29 [2018-02-02 09:00:56,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:00:56,599 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 157 transitions. [2018-02-02 09:00:56,599 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 09:00:56,599 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 157 transitions. [2018-02-02 09:00:56,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 09:00:56,599 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:00:56,600 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 09:00:56,600 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 09:00:56,600 INFO L82 PathProgramCache]: Analyzing trace with hash 829423013, now seen corresponding path program 1 times [2018-02-02 09:00:56,600 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:00:56,601 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:00:56,601 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:00:56,601 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:00:56,602 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:00:56,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:00:56,609 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:00:56,624 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 09:00:56,624 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:00:56,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:00:56,625 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:00:56,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:00:56,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:00:56,626 INFO L87 Difference]: Start difference. First operand 144 states and 157 transitions. Second operand 4 states. [2018-02-02 09:00:56,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:00:56,673 INFO L93 Difference]: Finished difference Result 154 states and 168 transitions. [2018-02-02 09:00:56,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:00:56,673 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-02-02 09:00:56,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:00:56,674 INFO L225 Difference]: With dead ends: 154 [2018-02-02 09:00:56,674 INFO L226 Difference]: Without dead ends: 154 [2018-02-02 09:00:56,674 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 09:00:56,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-02-02 09:00:56,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 146. [2018-02-02 09:00:56,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-02 09:00:56,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 161 transitions. [2018-02-02 09:00:56,676 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 161 transitions. Word has length 30 [2018-02-02 09:00:56,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:00:56,676 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 161 transitions. [2018-02-02 09:00:56,676 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:00:56,676 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 161 transitions. [2018-02-02 09:00:56,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 09:00:56,677 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:00:56,677 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 09:00:56,677 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 09:00:56,677 INFO L82 PathProgramCache]: Analyzing trace with hash 829423014, now seen corresponding path program 1 times [2018-02-02 09:00:56,677 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:00:56,678 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:00:56,678 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:00:56,678 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:00:56,679 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:00:56,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:00:56,686 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:00:56,733 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 09:00:56,733 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:00:56,733 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:00:56,733 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:00:56,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:00:56,734 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:00:56,734 INFO L87 Difference]: Start difference. First operand 146 states and 161 transitions. Second operand 6 states. [2018-02-02 09:00:56,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:00:56,902 INFO L93 Difference]: Finished difference Result 212 states and 232 transitions. [2018-02-02 09:00:56,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 09:00:56,903 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-02-02 09:00:56,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:00:56,904 INFO L225 Difference]: With dead ends: 212 [2018-02-02 09:00:56,904 INFO L226 Difference]: Without dead ends: 212 [2018-02-02 09:00:56,904 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:00:56,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-02-02 09:00:56,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 158. [2018-02-02 09:00:56,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-02 09:00:56,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 180 transitions. [2018-02-02 09:00:56,911 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 180 transitions. Word has length 30 [2018-02-02 09:00:56,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:00:56,912 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 180 transitions. [2018-02-02 09:00:56,912 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:00:56,912 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 180 transitions. [2018-02-02 09:00:56,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 09:00:56,915 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:00:56,915 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 09:00:56,915 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 09:00:56,915 INFO L82 PathProgramCache]: Analyzing trace with hash -664393622, now seen corresponding path program 1 times [2018-02-02 09:00:56,915 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:00:56,915 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:00:56,916 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:00:56,916 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:00:56,916 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:00:56,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:00:56,924 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:00:56,986 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 09:00:56,986 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:00:56,987 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 09:00:56,987 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:00:56,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:00:56,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:00:56,987 INFO L87 Difference]: Start difference. First operand 158 states and 180 transitions. Second operand 8 states. [2018-02-02 09:00:57,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:00:57,220 INFO L93 Difference]: Finished difference Result 221 states and 250 transitions. [2018-02-02 09:00:57,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 09:00:57,220 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-02-02 09:00:57,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:00:57,221 INFO L225 Difference]: With dead ends: 221 [2018-02-02 09:00:57,221 INFO L226 Difference]: Without dead ends: 221 [2018-02-02 09:00:57,221 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-02-02 09:00:57,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-02-02 09:00:57,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 170. [2018-02-02 09:00:57,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-02-02 09:00:57,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 195 transitions. [2018-02-02 09:00:57,225 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 195 transitions. Word has length 34 [2018-02-02 09:00:57,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:00:57,225 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 195 transitions. [2018-02-02 09:00:57,225 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:00:57,225 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 195 transitions. [2018-02-02 09:00:57,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 09:00:57,225 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:00:57,226 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 09:00:57,226 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 09:00:57,226 INFO L82 PathProgramCache]: Analyzing trace with hash -664393621, now seen corresponding path program 1 times [2018-02-02 09:00:57,226 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:00:57,226 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:00:57,227 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:00:57,228 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:00:57,228 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:00:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:00:57,237 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:00:57,344 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 09:00:57,345 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:00:57,345 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 09:00:57,345 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 09:00:57,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 09:00:57,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:00:57,346 INFO L87 Difference]: Start difference. First operand 170 states and 195 transitions. Second operand 7 states. [2018-02-02 09:00:57,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:00:57,489 INFO L93 Difference]: Finished difference Result 220 states and 248 transitions. [2018-02-02 09:00:57,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 09:00:57,489 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-02-02 09:00:57,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:00:57,490 INFO L225 Difference]: With dead ends: 220 [2018-02-02 09:00:57,490 INFO L226 Difference]: Without dead ends: 220 [2018-02-02 09:00:57,490 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:00:57,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-02-02 09:00:57,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 169. [2018-02-02 09:00:57,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-02-02 09:00:57,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 192 transitions. [2018-02-02 09:00:57,494 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 192 transitions. Word has length 34 [2018-02-02 09:00:57,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:00:57,495 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 192 transitions. [2018-02-02 09:00:57,495 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 09:00:57,495 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 192 transitions. [2018-02-02 09:00:57,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 09:00:57,495 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:00:57,495 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] [2018-02-02 09:00:57,495 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 09:00:57,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1742572463, now seen corresponding path program 1 times [2018-02-02 09:00:57,496 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:00:57,496 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:00:57,497 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:00:57,497 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:00:57,497 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:00:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:00:57,508 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:00:57,667 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:00:57,667 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:00:57,668 INFO L209 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 09:00:57,673 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:00:57,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:00:57,715 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:00:57,762 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 09:00:57,764 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 09:00:57,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:00:57,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:00:57,775 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 09:00:57,777 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 09:00:57,777 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:00:57,778 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:00:57,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:00:57,782 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-02-02 09:00:57,796 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 23 treesize of output 18 [2018-02-02 09:00:57,798 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:57,801 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 18 treesize of output 27 [2018-02-02 09:00:57,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:00:57,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:00:57,813 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 23 treesize of output 18 [2018-02-02 09:00:57,816 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:57,816 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 18 treesize of output 27 [2018-02-02 09:00:57,816 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:00:57,825 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:00:57,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:00:57,831 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2018-02-02 09:00:57,866 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 09:00:57,870 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:57,871 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:57,872 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:57,876 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 09:00:57,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:00:57,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:00:57,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, 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 09:00:57,905 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:57,906 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:57,907 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:57,908 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:00:57,909 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 55 [2018-02-02 09:00:57,909 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:00:57,928 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:00:57,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:00:57,939 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:65, output treesize:57 [2018-02-02 09:00:57,982 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 39 treesize of output 30 [2018-02-02 09:00:57,986 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:57,986 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:57,987 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:57,988 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:57,989 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:57,990 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:58,003 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 30 treesize of output 77 [2018-02-02 09:00:58,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:00:58,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:00:58,032 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 39 treesize of output 30 [2018-02-02 09:00:58,037 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:58,038 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:58,039 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:58,039 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:58,040 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:58,040 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:58,041 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:00:58,041 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 30 treesize of output 92 [2018-02-02 09:00:58,042 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:00:58,055 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:00:58,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:00:58,070 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:83, output treesize:81 [2018-02-02 09:00:58,098 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 54 treesize of output 43 [2018-02-02 09:00:58,101 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:58,102 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:58,103 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:58,103 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:58,104 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:58,105 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:58,105 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:58,106 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:58,107 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:58,107 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:58,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 107 [2018-02-02 09:00:58,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:00:58,133 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:00:58,151 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 60 treesize of output 47 [2018-02-02 09:00:58,154 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:58,154 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:58,155 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:58,155 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:58,156 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:58,156 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:58,157 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:58,157 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:58,158 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:58,159 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:58,159 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:00:58,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 128 [2018-02-02 09:00:58,163 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:00:58,176 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:00:58,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:00:58,185 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:119, output treesize:81 [2018-02-02 09:00:58,291 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 44 treesize of output 34 [2018-02-02 09:00:58,295 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:58,296 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:58,297 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:58,298 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:58,300 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:58,301 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:58,302 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:58,304 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:58,320 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 81 [2018-02-02 09:00:58,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 09:00:58,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 09:00:58,369 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 50 treesize of output 38 [2018-02-02 09:00:58,371 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:58,372 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:58,372 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:58,372 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:58,373 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:58,374 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:58,374 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:58,377 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:00:58,377 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:00:58,385 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 84 [2018-02-02 09:00:58,385 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-02 09:00:58,409 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 09:00:58,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-02 09:00:58,422 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:105, output treesize:31 [2018-02-02 09:00:58,465 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:00:58,492 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:00:58,492 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13] total 18 [2018-02-02 09:00:58,492 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 09:00:58,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 09:00:58,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=252, Unknown=1, NotChecked=0, Total=306 [2018-02-02 09:00:58,492 INFO L87 Difference]: Start difference. First operand 169 states and 192 transitions. Second operand 18 states. [2018-02-02 09:01:00,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:01:00,884 INFO L93 Difference]: Finished difference Result 202 states and 223 transitions. [2018-02-02 09:01:01,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 09:01:01,095 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 37 [2018-02-02 09:01:01,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:01:01,095 INFO L225 Difference]: With dead ends: 202 [2018-02-02 09:01:01,095 INFO L226 Difference]: Without dead ends: 202 [2018-02-02 09:01:01,096 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 28 SyntacticMatches, 8 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=345, Invalid=986, Unknown=1, NotChecked=0, Total=1332 [2018-02-02 09:01:01,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-02-02 09:01:01,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 172. [2018-02-02 09:01:01,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-02-02 09:01:01,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 195 transitions. [2018-02-02 09:01:01,098 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 195 transitions. Word has length 37 [2018-02-02 09:01:01,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:01:01,098 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 195 transitions. [2018-02-02 09:01:01,098 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 09:01:01,098 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 195 transitions. [2018-02-02 09:01:01,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 09:01:01,098 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:01:01,099 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, 1] [2018-02-02 09:01:01,099 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 09:01:01,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1814827739, now seen corresponding path program 1 times [2018-02-02 09:01:01,099 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:01:01,099 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:01:01,099 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:01,099 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:01:01,099 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:01,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:01:01,113 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:01:01,193 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 09:01:01,193 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:01:01,193 INFO L209 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 09:01:01,200 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:01:01,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:01:01,225 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:01:01,299 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~x~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| main_~x~1.base 0)) (= 0 (select |c_old(#valid)| main_~x~1.base)) (not (= 0 main_~x~1.base)))) is different from true [2018-02-02 09:01:01,304 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-02-02 09:01:01,324 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:01:01,324 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 13 [2018-02-02 09:01:01,325 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 09:01:01,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 09:01:01,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=130, Unknown=1, NotChecked=22, Total=182 [2018-02-02 09:01:01,325 INFO L87 Difference]: Start difference. First operand 172 states and 195 transitions. Second operand 14 states. [2018-02-02 09:01:01,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:01:01,648 INFO L93 Difference]: Finished difference Result 175 states and 197 transitions. [2018-02-02 09:01:01,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 09:01:01,648 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2018-02-02 09:01:01,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:01:01,649 INFO L225 Difference]: With dead ends: 175 [2018-02-02 09:01:01,649 INFO L226 Difference]: Without dead ends: 162 [2018-02-02 09:01:01,649 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=257, Unknown=1, NotChecked=34, Total=380 [2018-02-02 09:01:01,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-02 09:01:01,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2018-02-02 09:01:01,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-02-02 09:01:01,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 183 transitions. [2018-02-02 09:01:01,651 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 183 transitions. Word has length 38 [2018-02-02 09:01:01,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:01:01,652 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 183 transitions. [2018-02-02 09:01:01,652 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 09:01:01,652 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 183 transitions. [2018-02-02 09:01:01,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 09:01:01,652 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:01:01,652 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:01:01,652 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 09:01:01,652 INFO L82 PathProgramCache]: Analyzing trace with hash 686838870, now seen corresponding path program 1 times [2018-02-02 09:01:01,652 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:01:01,652 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:01:01,653 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:01,653 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:01:01,653 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:01,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:01:01,658 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:01:01,714 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:01:01,715 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:01:01,715 INFO L209 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 09:01:01,724 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:01:01,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:01:01,765 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:01:01,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-02 09:01:01,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:01,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:01,785 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-02 09:01:01,804 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:01:01,857 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:01:01,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2018-02-02 09:01:01,858 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:01:01,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:01:01,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:01:01,858 INFO L87 Difference]: Start difference. First operand 161 states and 183 transitions. Second operand 9 states. [2018-02-02 09:01:01,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:01:01,991 INFO L93 Difference]: Finished difference Result 181 states and 204 transitions. [2018-02-02 09:01:01,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:01:01,991 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-02-02 09:01:01,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:01:01,992 INFO L225 Difference]: With dead ends: 181 [2018-02-02 09:01:01,992 INFO L226 Difference]: Without dead ends: 181 [2018-02-02 09:01:01,992 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-02-02 09:01:01,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-02-02 09:01:01,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 160. [2018-02-02 09:01:01,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-02-02 09:01:01,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 181 transitions. [2018-02-02 09:01:01,995 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 181 transitions. Word has length 39 [2018-02-02 09:01:01,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:01:01,995 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 181 transitions. [2018-02-02 09:01:01,996 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:01:01,996 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 181 transitions. [2018-02-02 09:01:01,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 09:01:01,996 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:01:01,996 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:01:01,996 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 09:01:01,996 INFO L82 PathProgramCache]: Analyzing trace with hash 686838871, now seen corresponding path program 1 times [2018-02-02 09:01:01,996 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:01:01,997 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:01:01,997 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:01,997 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:01:01,997 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:01:02,005 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:01:02,077 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:01:02,077 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:01:02,077 INFO L209 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 09:01:02,096 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:01:02,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:01:02,120 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:01:02,190 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:02,193 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 14 treesize of output 17 [2018-02-02 09:01:02,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:02,208 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:02,210 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:02,211 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 09:01:02,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:02,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:02,219 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-02-02 09:01:02,273 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:01:02,291 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:01:02,291 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2018-02-02 09:01:02,291 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 09:01:02,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 09:01:02,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-02-02 09:01:02,292 INFO L87 Difference]: Start difference. First operand 160 states and 181 transitions. Second operand 11 states. [2018-02-02 09:01:02,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:01:02,647 INFO L93 Difference]: Finished difference Result 235 states and 262 transitions. [2018-02-02 09:01:02,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 09:01:02,647 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2018-02-02 09:01:02,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:01:02,648 INFO L225 Difference]: With dead ends: 235 [2018-02-02 09:01:02,648 INFO L226 Difference]: Without dead ends: 235 [2018-02-02 09:01:02,648 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2018-02-02 09:01:02,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-02-02 09:01:02,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 159. [2018-02-02 09:01:02,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-02 09:01:02,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 179 transitions. [2018-02-02 09:01:02,652 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 179 transitions. Word has length 39 [2018-02-02 09:01:02,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:01:02,652 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 179 transitions. [2018-02-02 09:01:02,652 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 09:01:02,652 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 179 transitions. [2018-02-02 09:01:02,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 09:01:02,652 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:01:02,653 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, 1, 1, 1, 1] [2018-02-02 09:01:02,653 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 09:01:02,653 INFO L82 PathProgramCache]: Analyzing trace with hash -927394694, now seen corresponding path program 1 times [2018-02-02 09:01:02,653 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:01:02,653 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:01:02,654 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:02,654 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:01:02,654 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:01:02,666 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:01:02,795 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:01:02,795 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:01:02,795 INFO L209 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 09:01:02,799 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:01:02,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:01:02,819 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:01:02,873 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:02,874 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:02,875 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 09:01:02,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:02,884 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:02,885 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:02,885 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 09:01:02,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:02,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:02,916 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:21 [2018-02-02 09:01:02,968 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:01:02,985 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:01:02,985 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9] total 13 [2018-02-02 09:01:02,985 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 09:01:02,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 09:01:02,986 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:01:02,986 INFO L87 Difference]: Start difference. First operand 159 states and 179 transitions. Second operand 14 states. [2018-02-02 09:01:03,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:01:03,439 INFO L93 Difference]: Finished difference Result 264 states and 296 transitions. [2018-02-02 09:01:03,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:01:03,441 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-02-02 09:01:03,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:01:03,442 INFO L225 Difference]: With dead ends: 264 [2018-02-02 09:01:03,442 INFO L226 Difference]: Without dead ends: 264 [2018-02-02 09:01:03,442 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2018-02-02 09:01:03,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-02-02 09:01:03,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 181. [2018-02-02 09:01:03,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-02-02 09:01:03,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 203 transitions. [2018-02-02 09:01:03,445 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 203 transitions. Word has length 44 [2018-02-02 09:01:03,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:01:03,445 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 203 transitions. [2018-02-02 09:01:03,445 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 09:01:03,445 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 203 transitions. [2018-02-02 09:01:03,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 09:01:03,445 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:01:03,445 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1] [2018-02-02 09:01:03,446 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 09:01:03,446 INFO L82 PathProgramCache]: Analyzing trace with hash -576633818, now seen corresponding path program 1 times [2018-02-02 09:01:03,446 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:01:03,446 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:01:03,446 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:03,446 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:01:03,447 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:03,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:01:03,455 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:01:03,546 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:01:03,547 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:01:03,547 INFO L209 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 09:01:03,564 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:01:03,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:01:03,605 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:01:03,672 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 09:01:03,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, 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 09:01:03,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:03,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:03,679 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 09:01:03,679 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-02-02 09:01:03,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-02-02 09:01:03,688 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:03,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:03,692 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-02-02 09:01:03,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-02-02 09:01:03,737 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 26 treesize of output 25 [2018-02-02 09:01:03,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:03,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:03,826 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 09:01:03,826 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-02-02 09:01:03,835 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 17 treesize of output 13 [2018-02-02 09:01:03,836 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 13 treesize of output 5 [2018-02-02 09:01:03,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:03,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:03,840 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 09:01:03,840 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:11 [2018-02-02 09:01:03,847 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:01:03,867 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:01:03,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-02-02 09:01:03,868 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 09:01:03,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 09:01:03,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:01:03,868 INFO L87 Difference]: Start difference. First operand 181 states and 203 transitions. Second operand 12 states. [2018-02-02 09:01:04,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:01:04,119 INFO L93 Difference]: Finished difference Result 199 states and 224 transitions. [2018-02-02 09:01:04,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 09:01:04,119 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-02-02 09:01:04,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:01:04,120 INFO L225 Difference]: With dead ends: 199 [2018-02-02 09:01:04,120 INFO L226 Difference]: Without dead ends: 199 [2018-02-02 09:01:04,120 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2018-02-02 09:01:04,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-02-02 09:01:04,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 180. [2018-02-02 09:01:04,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-02-02 09:01:04,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 201 transitions. [2018-02-02 09:01:04,123 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 201 transitions. Word has length 45 [2018-02-02 09:01:04,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:01:04,123 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 201 transitions. [2018-02-02 09:01:04,124 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 09:01:04,124 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 201 transitions. [2018-02-02 09:01:04,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 09:01:04,124 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:01:04,124 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1] [2018-02-02 09:01:04,124 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 09:01:04,125 INFO L82 PathProgramCache]: Analyzing trace with hash -576633817, now seen corresponding path program 1 times [2018-02-02 09:01:04,125 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:01:04,125 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:01:04,125 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:04,125 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:01:04,125 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:04,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:01:04,139 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:01:04,243 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:01:04,243 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:01:04,243 INFO L209 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 09:01:04,250 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:01:04,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:01:04,278 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:01:04,282 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 09:01:04,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:04,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:04,284 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 09:01:04,314 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 09:01:04,316 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 09:01:04,316 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:04,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:04,327 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 09:01:04,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 8 treesize of output 7 [2018-02-02 09:01:04,331 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:04,332 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:04,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:04,347 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:40, output treesize:34 [2018-02-02 09:01:04,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, 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 22 [2018-02-02 09:01:04,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:04,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:04,372 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:31 [2018-02-02 09:01:04,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 40 [2018-02-02 09:01:04,446 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 33 treesize of output 32 [2018-02-02 09:01:04,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:04,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:04,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-02-02 09:01:04,526 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 26 treesize of output 25 [2018-02-02 09:01:04,526 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:04,551 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:04,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 09:01:04,560 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:61, output treesize:53 [2018-02-02 09:01:04,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-02-02 09:01:04,598 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 09:01:04,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:04,608 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 17 treesize of output 10 [2018-02-02 09:01:04,608 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:04,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-02-02 09:01:04,617 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:04,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:04,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2018-02-02 09:01:04,671 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 29 treesize of output 22 [2018-02-02 09:01:04,671 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:04,686 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 22 treesize of output 13 [2018-02-02 09:01:04,686 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:04,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2018-02-02 09:01:04,699 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:04,706 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:04,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:01:04,712 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:67, output treesize:19 [2018-02-02 09:01:04,737 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:01:04,767 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:01:04,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 16 [2018-02-02 09:01:04,768 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 09:01:04,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 09:01:04,768 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=228, Unknown=1, NotChecked=0, Total=272 [2018-02-02 09:01:04,768 INFO L87 Difference]: Start difference. First operand 180 states and 201 transitions. Second operand 17 states. [2018-02-02 09:01:05,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:01:05,345 INFO L93 Difference]: Finished difference Result 261 states and 290 transitions. [2018-02-02 09:01:05,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 09:01:05,346 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 45 [2018-02-02 09:01:05,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:01:05,347 INFO L225 Difference]: With dead ends: 261 [2018-02-02 09:01:05,347 INFO L226 Difference]: Without dead ends: 261 [2018-02-02 09:01:05,347 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=477, Unknown=2, NotChecked=0, Total=650 [2018-02-02 09:01:05,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-02-02 09:01:05,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 160. [2018-02-02 09:01:05,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-02-02 09:01:05,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 179 transitions. [2018-02-02 09:01:05,350 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 179 transitions. Word has length 45 [2018-02-02 09:01:05,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:01:05,351 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 179 transitions. [2018-02-02 09:01:05,351 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 09:01:05,351 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 179 transitions. [2018-02-02 09:01:05,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 09:01:05,351 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:01:05,351 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, 1, 1, 1, 1, 1, 1] [2018-02-02 09:01:05,352 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 09:01:05,352 INFO L82 PathProgramCache]: Analyzing trace with hash 2126898235, now seen corresponding path program 1 times [2018-02-02 09:01:05,352 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:01:05,352 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:01:05,352 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:05,353 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:01:05,353 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:05,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:01:05,364 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:01:05,435 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 09:01:05,435 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:01:05,435 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 09:01:05,435 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 09:01:05,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 09:01:05,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:01:05,436 INFO L87 Difference]: Start difference. First operand 160 states and 179 transitions. Second operand 7 states. [2018-02-02 09:01:05,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:01:05,551 INFO L93 Difference]: Finished difference Result 183 states and 203 transitions. [2018-02-02 09:01:05,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:01:05,551 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-02-02 09:01:05,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:01:05,552 INFO L225 Difference]: With dead ends: 183 [2018-02-02 09:01:05,552 INFO L226 Difference]: Without dead ends: 183 [2018-02-02 09:01:05,552 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:01:05,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-02-02 09:01:05,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 138. [2018-02-02 09:01:05,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-02-02 09:01:05,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 155 transitions. [2018-02-02 09:01:05,555 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 155 transitions. Word has length 46 [2018-02-02 09:01:05,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:01:05,555 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 155 transitions. [2018-02-02 09:01:05,555 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 09:01:05,555 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 155 transitions. [2018-02-02 09:01:05,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 09:01:05,556 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:01:05,556 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:01:05,556 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 09:01:05,556 INFO L82 PathProgramCache]: Analyzing trace with hash 613203071, now seen corresponding path program 1 times [2018-02-02 09:01:05,556 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:01:05,556 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:01:05,557 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:05,557 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:01:05,557 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:05,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:01:05,566 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:01:05,612 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:01:05,613 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:01:05,613 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 09:01:05,613 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:01:05,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:01:05,613 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:01:05,613 INFO L87 Difference]: Start difference. First operand 138 states and 155 transitions. Second operand 8 states. [2018-02-02 09:01:05,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:01:05,768 INFO L93 Difference]: Finished difference Result 168 states and 186 transitions. [2018-02-02 09:01:05,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 09:01:05,768 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-02-02 09:01:05,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:01:05,769 INFO L225 Difference]: With dead ends: 168 [2018-02-02 09:01:05,769 INFO L226 Difference]: Without dead ends: 168 [2018-02-02 09:01:05,769 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-02-02 09:01:05,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-02-02 09:01:05,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 150. [2018-02-02 09:01:05,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-02 09:01:05,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 170 transitions. [2018-02-02 09:01:05,772 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 170 transitions. Word has length 50 [2018-02-02 09:01:05,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:01:05,772 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 170 transitions. [2018-02-02 09:01:05,772 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:01:05,773 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 170 transitions. [2018-02-02 09:01:05,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 09:01:05,773 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:01:05,773 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:01:05,773 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 09:01:05,773 INFO L82 PathProgramCache]: Analyzing trace with hash 613203072, now seen corresponding path program 1 times [2018-02-02 09:01:05,774 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:01:05,774 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:01:05,774 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:05,774 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:01:05,774 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:05,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:01:05,784 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:01:05,902 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:01:05,902 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:01:05,902 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 09:01:05,902 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:01:05,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:01:05,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:01:05,902 INFO L87 Difference]: Start difference. First operand 150 states and 170 transitions. Second operand 9 states. [2018-02-02 09:01:06,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:01:06,257 INFO L93 Difference]: Finished difference Result 271 states and 307 transitions. [2018-02-02 09:01:06,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 09:01:06,258 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-02-02 09:01:06,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:01:06,259 INFO L225 Difference]: With dead ends: 271 [2018-02-02 09:01:06,259 INFO L226 Difference]: Without dead ends: 271 [2018-02-02 09:01:06,259 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-02-02 09:01:06,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-02-02 09:01:06,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 150. [2018-02-02 09:01:06,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-02 09:01:06,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 169 transitions. [2018-02-02 09:01:06,263 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 169 transitions. Word has length 50 [2018-02-02 09:01:06,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:01:06,263 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 169 transitions. [2018-02-02 09:01:06,263 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:01:06,263 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 169 transitions. [2018-02-02 09:01:06,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 09:01:06,264 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:01:06,264 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:01:06,264 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 09:01:06,264 INFO L82 PathProgramCache]: Analyzing trace with hash 877634816, now seen corresponding path program 1 times [2018-02-02 09:01:06,264 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:01:06,265 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:01:06,265 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:06,265 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:01:06,265 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:06,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:01:06,274 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:01:06,342 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:01:06,342 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:01:06,342 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 09:01:06,343 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 09:01:06,343 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 09:01:06,343 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:01:06,343 INFO L87 Difference]: Start difference. First operand 150 states and 169 transitions. Second operand 10 states. [2018-02-02 09:01:06,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:01:06,616 INFO L93 Difference]: Finished difference Result 340 states and 379 transitions. [2018-02-02 09:01:06,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 09:01:06,616 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2018-02-02 09:01:06,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:01:06,617 INFO L225 Difference]: With dead ends: 340 [2018-02-02 09:01:06,617 INFO L226 Difference]: Without dead ends: 340 [2018-02-02 09:01:06,618 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2018-02-02 09:01:06,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-02-02 09:01:06,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 152. [2018-02-02 09:01:06,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-02 09:01:06,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 172 transitions. [2018-02-02 09:01:06,620 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 172 transitions. Word has length 52 [2018-02-02 09:01:06,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:01:06,620 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 172 transitions. [2018-02-02 09:01:06,620 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 09:01:06,620 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 172 transitions. [2018-02-02 09:01:06,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 09:01:06,620 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:01:06,620 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:01:06,621 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 09:01:06,621 INFO L82 PathProgramCache]: Analyzing trace with hash 877634817, now seen corresponding path program 1 times [2018-02-02 09:01:06,621 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:01:06,621 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:01:06,621 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:06,621 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:01:06,621 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:06,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:01:06,626 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:01:06,642 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 09:01:06,642 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:01:06,642 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:01:06,642 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:01:06,642 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:01:06,643 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:01:06,643 INFO L87 Difference]: Start difference. First operand 152 states and 172 transitions. Second operand 4 states. [2018-02-02 09:01:06,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:01:06,679 INFO L93 Difference]: Finished difference Result 151 states and 169 transitions. [2018-02-02 09:01:06,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:01:06,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2018-02-02 09:01:06,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:01:06,680 INFO L225 Difference]: With dead ends: 151 [2018-02-02 09:01:06,680 INFO L226 Difference]: Without dead ends: 151 [2018-02-02 09:01:06,681 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 09:01:06,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-02 09:01:06,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-02-02 09:01:06,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-02 09:01:06,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 169 transitions. [2018-02-02 09:01:06,683 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 169 transitions. Word has length 52 [2018-02-02 09:01:06,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:01:06,683 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 169 transitions. [2018-02-02 09:01:06,684 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:01:06,684 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 169 transitions. [2018-02-02 09:01:06,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 09:01:06,684 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:01:06,684 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, 1, 1, 1, 1] [2018-02-02 09:01:06,684 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 09:01:06,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1507118755, now seen corresponding path program 1 times [2018-02-02 09:01:06,685 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:01:06,685 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:01:06,685 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:06,685 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:01:06,685 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:06,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:01:06,698 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:01:06,985 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 09:01:06,985 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:01:06,985 INFO L209 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 09:01:06,991 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:01:07,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:01:07,015 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:01:07,050 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 09:01:07,052 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 09:01:07,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:07,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:07,059 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 09:01:07,060 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 09:01:07,060 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:07,062 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:07,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:07,066 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-02-02 09:01:07,085 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 09:01:07,086 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,087 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 09:01:07,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:07,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:07,099 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 09:01:07,101 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,101 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 09:01:07,102 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:07,104 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:07,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:07,110 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:44 [2018-02-02 09:01:07,131 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 36 treesize of output 29 [2018-02-02 09:01:07,133 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,133 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,134 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,135 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 29 treesize of output 37 [2018-02-02 09:01:07,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:07,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:07,153 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 36 treesize of output 29 [2018-02-02 09:01:07,155 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,155 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,156 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,157 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 29 treesize of output 37 [2018-02-02 09:01:07,157 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:07,161 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:07,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:07,167 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:82, output treesize:44 [2018-02-02 09:01:07,194 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,194 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,195 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 09:01:07,195 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:07,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:07,203 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:49 [2018-02-02 09:01:07,249 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 31 [2018-02-02 09:01:07,251 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 09:01:07,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:07,255 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:07,269 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 31 [2018-02-02 09:01:07,271 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 09:01:07,271 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:07,281 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:07,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:07,292 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:80, output treesize:72 [2018-02-02 09:01:07,329 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 39 treesize of output 38 [2018-02-02 09:01:07,331 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,332 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 18 treesize of output 27 [2018-02-02 09:01:07,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:07,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:07,362 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 39 treesize of output 38 [2018-02-02 09:01:07,364 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,365 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 18 treesize of output 27 [2018-02-02 09:01:07,365 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:07,370 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:07,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:07,383 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:98, output treesize:90 [2018-02-02 09:01:07,425 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,425 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 46 treesize of output 52 [2018-02-02 09:01:07,428 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,428 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,429 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,431 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 32 treesize of output 54 [2018-02-02 09:01:07,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:07,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:07,468 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 46 treesize of output 43 [2018-02-02 09:01:07,470 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,471 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,471 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,472 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:07,472 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 55 [2018-02-02 09:01:07,472 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:07,481 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:07,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:07,498 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:115, output treesize:107 [2018-02-02 09:01:07,543 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,545 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,545 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 55 treesize of output 67 [2018-02-02 09:01:07,550 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,550 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,552 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,552 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,554 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,555 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,569 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 47 treesize of output 106 [2018-02-02 09:01:07,570 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 09:01:07,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:07,627 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 55 treesize of output 50 [2018-02-02 09:01:07,630 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,630 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,631 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,631 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,632 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,632 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,632 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:07,633 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 30 treesize of output 92 [2018-02-02 09:01:07,633 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:07,656 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:07,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:07,681 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:133, output treesize:131 [2018-02-02 09:01:07,741 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,743 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,743 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 70 treesize of output 86 [2018-02-02 09:01:07,747 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,747 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,748 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,750 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,750 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,751 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,753 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,754 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,755 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,757 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,779 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 136 [2018-02-02 09:01:07,780 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 09:01:07,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:07,873 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 76 treesize of output 67 [2018-02-02 09:01:07,875 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,876 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,877 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,877 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,878 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,878 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,879 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,879 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,880 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,881 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,881 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:07,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 128 [2018-02-02 09:01:07,898 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:07,917 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:07,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:07,939 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:169, output treesize:131 [2018-02-02 09:01:07,972 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,973 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:07,975 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 64 treesize of output 78 [2018-02-02 09:01:07,980 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:08,002 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 93 [2018-02-02 09:01:08,005 INFO L267 ElimStorePlain]: Start of recursive call 3: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 14 xjuncts. [2018-02-02 09:01:08,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-02 09:01:08,116 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 70 treesize of output 67 [2018-02-02 09:01:08,126 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:08,127 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:08,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 35 [2018-02-02 09:01:08,128 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:08,145 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:08,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-02 09:01:08,188 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:157, output treesize:444 [2018-02-02 09:01:08,414 WARN L146 SmtUtils]: Spent 191ms on a formula simplification. DAG size of input: 68 DAG size of output 68 [2018-02-02 09:01:08,430 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:08,432 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 310 treesize of output 289 [2018-02-02 09:01:08,435 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:08,435 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:08,436 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:08,436 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:08,437 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:08,438 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:08,438 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:08,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 265 [2018-02-02 09:01:08,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:08,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:08,643 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:08,644 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:08,646 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 342 treesize of output 327 [2018-02-02 09:01:08,651 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:08,653 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:08,654 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:08,654 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:08,655 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:08,656 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:08,656 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:08,666 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:08,675 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 108 treesize of output 304 [2018-02-02 09:01:08,677 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 09:01:08,764 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 09:01:09,094 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:09,096 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:09,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 322 treesize of output 299 [2018-02-02 09:01:09,100 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:09,100 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:09,101 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:09,101 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:09,102 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:09,103 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:09,103 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:09,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 277 [2018-02-02 09:01:09,104 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:09,135 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:09,139 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:09,140 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 327 treesize of output 294 [2018-02-02 09:01:09,143 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:09,144 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:09,144 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:09,145 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:09,146 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:09,146 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:09,147 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:09,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 277 [2018-02-02 09:01:09,148 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:09,184 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:09,187 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:09,190 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:09,190 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 331 treesize of output 308 [2018-02-02 09:01:09,194 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:09,195 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:09,195 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:09,196 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:09,196 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:09,197 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:09,197 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:09,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 277 [2018-02-02 09:01:09,198 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:09,229 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:09,478 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:09,479 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:09,488 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 364 treesize of output 349 [2018-02-02 09:01:09,491 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:09,492 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:09,493 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:09,496 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:09,497 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:09,498 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:09,505 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:09,517 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 108 treesize of output 294 [2018-02-02 09:01:09,518 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-02 09:01:09,609 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-02 09:01:09,929 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:09,932 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 353 treesize of output 314 [2018-02-02 09:01:09,935 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:09,935 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:09,936 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:09,936 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:09,937 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:09,937 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:09,938 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:09,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 263 [2018-02-02 09:01:09,942 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:09,977 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:09,979 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:09,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 354 treesize of output 315 [2018-02-02 09:01:09,985 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:09,985 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:09,986 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:09,986 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:09,987 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:09,987 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:09,988 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:09,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 263 [2018-02-02 09:01:09,991 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:10,027 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:10,029 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:10,032 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 353 treesize of output 314 [2018-02-02 09:01:10,034 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:10,034 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:10,035 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:10,035 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:10,036 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:10,036 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:10,036 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:10,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 263 [2018-02-02 09:01:10,040 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:10,079 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:10,339 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:10,340 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:10,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, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 274 treesize of output 269 [2018-02-02 09:01:10,344 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:10,345 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:10,345 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:10,346 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:10,347 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:10,348 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:10,350 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:10,353 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:10,367 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 102 treesize of output 301 [2018-02-02 09:01:10,369 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-02 09:01:10,440 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-02 09:01:10,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: 9 dim-0 vars, and 9 xjuncts. [2018-02-02 09:01:10,711 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 7 variables, input treesize:1017, output treesize:2576 [2018-02-02 09:01:15,397 WARN L146 SmtUtils]: Spent 4589ms on a formula simplification. DAG size of input: 241 DAG size of output 132 [2018-02-02 09:01:15,564 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:15,565 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:15,565 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 293 treesize of output 252 [2018-02-02 09:01:15,572 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:15,574 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:15,574 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:15,575 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:15,578 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:15,579 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:15,579 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:15,580 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:15,587 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:15,613 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 284 [2018-02-02 09:01:15,613 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-02-02 09:01:15,649 INFO L267 ElimStorePlain]: Start of recursive call 3: 49 dim-0 vars, End of recursive call: 49 dim-0 vars, and 53 xjuncts. [2018-02-02 09:01:15,879 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 153 treesize of output 136 [2018-02-02 09:01:15,881 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-02 09:01:15,886 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:15,897 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 142 [2018-02-02 09:01:15,898 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-02 09:01:15,900 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 155 treesize of output 130 [2018-02-02 09:01:15,901 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 09:01:15,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 5 xjuncts. [2018-02-02 09:01:16,244 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:16,245 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 281 treesize of output 225 [2018-02-02 09:01:16,248 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:16,248 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:16,248 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:16,249 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 170 treesize of output 115 [2018-02-02 09:01:16,249 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:16,273 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:16,273 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:16,274 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:16,274 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:16,274 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:16,275 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:16,275 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:16,276 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 49 [2018-02-02 09:01:16,276 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:16,293 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:16,455 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:16,455 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:16,456 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 112 treesize of output 80 [2018-02-02 09:01:16,459 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:16,461 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:16,463 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:16,463 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:16,467 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:16,467 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:16,468 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:16,468 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:16,474 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:16,502 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 140 [2018-02-02 09:01:16,503 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-02-02 09:01:16,526 INFO L267 ElimStorePlain]: Start of recursive call 11: 41 dim-0 vars, End of recursive call: 41 dim-0 vars, and 45 xjuncts. [2018-02-02 09:01:16,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 36 treesize of output 26 [2018-02-02 09:01:16,728 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:16,735 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 36 treesize of output 38 [2018-02-02 09:01:16,736 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-02-02 09:01:16,755 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:16,965 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 162 treesize of output 130 [2018-02-02 09:01:16,967 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:16,968 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:16,968 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:16,968 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 102 treesize of output 59 [2018-02-02 09:01:16,969 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:17,003 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,003 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,004 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,005 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,005 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,005 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,006 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 49 [2018-02-02 09:01:17,007 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:17,020 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:17,023 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 160 treesize of output 128 [2018-02-02 09:01:17,025 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,025 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,026 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,026 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,027 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,028 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,028 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 101 [2018-02-02 09:01:17,029 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:17,049 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,049 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,050 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:17,050 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 46 treesize of output 31 [2018-02-02 09:01:17,050 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:17,059 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:17,061 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 166 treesize of output 130 [2018-02-02 09:01:17,064 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,065 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,065 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:17,065 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 59 [2018-02-02 09:01:17,066 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:17,095 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,096 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,097 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,097 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,098 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,099 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,100 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 49 [2018-02-02 09:01:17,101 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:17,118 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:17,120 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 168 treesize of output 130 [2018-02-02 09:01:17,122 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,123 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,123 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,124 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,124 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,125 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,126 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 101 [2018-02-02 09:01:17,126 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:17,144 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,145 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,145 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:17,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 56 treesize of output 37 [2018-02-02 09:01:17,146 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:17,158 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:17,168 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 166 treesize of output 128 [2018-02-02 09:01:17,171 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,171 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,172 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:17,172 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 110 treesize of output 63 [2018-02-02 09:01:17,172 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:17,192 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,193 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,193 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,194 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,194 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,195 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,195 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 49 [2018-02-02 09:01:17,196 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:17,209 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:17,305 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,306 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 324 treesize of output 262 [2018-02-02 09:01:17,309 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,309 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,310 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,310 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,311 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,312 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,314 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 0 case distinctions, treesize of input 55 treesize of output 102 [2018-02-02 09:01:17,315 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:17,349 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,350 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,351 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,351 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,352 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,352 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:17,353 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 0 case distinctions, treesize of input 140 treesize of output 118 [2018-02-02 09:01:17,353 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:17,377 INFO L267 ElimStorePlain]: Start of recursive call 29: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:17,460 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,461 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,461 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 138 treesize of output 103 [2018-02-02 09:01:17,466 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,466 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,467 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,469 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,469 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,470 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,474 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,497 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 47 treesize of output 159 [2018-02-02 09:01:17,498 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-02-02 09:01:17,515 INFO L267 ElimStorePlain]: Start of recursive call 33: 46 dim-0 vars, End of recursive call: 46 dim-0 vars, and 50 xjuncts. [2018-02-02 09:01:17,745 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,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 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 71 [2018-02-02 09:01:17,761 INFO L267 ElimStorePlain]: Start of recursive call 34: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-02-02 09:01:17,763 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:17,763 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 0 case distinctions, treesize of input 47 treesize of output 45 [2018-02-02 09:01:17,763 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:01:17,820 INFO L267 ElimStorePlain]: Start of recursive call 32: 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-02-02 09:01:17,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-2 vars, End of recursive call: 9 dim-0 vars, and 10 xjuncts. [2018-02-02 09:01:17,943 INFO L202 ElimStorePlain]: Needed 35 recursive calls to eliminate 10 variables, input treesize:899, output treesize:212 [2018-02-02 09:01:18,114 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:01:18,131 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:01:18,131 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 32 [2018-02-02 09:01:18,131 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 09:01:18,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 09:01:18,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=918, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 09:01:18,132 INFO L87 Difference]: Start difference. First operand 151 states and 169 transitions. Second operand 33 states. [2018-02-02 09:01:19,120 WARN L146 SmtUtils]: Spent 147ms on a formula simplification. DAG size of input: 85 DAG size of output 74 [2018-02-02 09:01:19,282 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 174 DAG size of output 135 [2018-02-02 09:01:19,443 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 152 DAG size of output 121 [2018-02-02 09:01:19,713 WARN L146 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 272 DAG size of output 128 [2018-02-02 09:01:20,082 WARN L146 SmtUtils]: Spent 172ms on a formula simplification. DAG size of input: 274 DAG size of output 130 [2018-02-02 09:01:22,955 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 174 DAG size of output 127 [2018-02-02 09:01:23,134 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 173 DAG size of output 127 [2018-02-02 09:01:23,411 WARN L146 SmtUtils]: Spent 175ms on a formula simplification. DAG size of input: 155 DAG size of output 146 [2018-02-02 09:01:23,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:01:23,623 INFO L93 Difference]: Finished difference Result 241 states and 263 transitions. [2018-02-02 09:01:23,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 09:01:23,623 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 53 [2018-02-02 09:01:23,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:01:23,624 INFO L225 Difference]: With dead ends: 241 [2018-02-02 09:01:23,624 INFO L226 Difference]: Without dead ends: 241 [2018-02-02 09:01:23,624 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 38 SyntacticMatches, 11 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=582, Invalid=2724, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 09:01:23,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-02-02 09:01:23,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 178. [2018-02-02 09:01:23,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-02-02 09:01:23,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 198 transitions. [2018-02-02 09:01:23,626 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 198 transitions. Word has length 53 [2018-02-02 09:01:23,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:01:23,626 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 198 transitions. [2018-02-02 09:01:23,626 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 09:01:23,627 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 198 transitions. [2018-02-02 09:01:23,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 09:01:23,627 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:01:23,627 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:01:23,627 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 09:01:23,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1435298844, now seen corresponding path program 1 times [2018-02-02 09:01:23,627 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:01:23,627 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:01:23,628 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:23,628 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:01:23,628 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:23,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:01:23,633 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:01:23,718 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:01:23,718 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:01:23,718 INFO L209 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 09:01:23,725 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:01:23,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:01:23,758 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:01:23,807 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:23,808 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:23,808 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 09:01:23,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:23,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:23,812 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-02-02 09:01:23,835 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 09:01:23,836 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 09:01:23,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:23,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:23,841 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 09:01:23,841 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:15 [2018-02-02 09:01:23,893 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 16 treesize of output 12 [2018-02-02 09:01:23,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 13 [2018-02-02 09:01:23,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 09:01:23,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 09:01:23,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 09:01:23,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:22 [2018-02-02 09:01:23,971 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:01:23,997 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:01:23,997 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14] total 22 [2018-02-02 09:01:23,997 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 09:01:23,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 09:01:23,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2018-02-02 09:01:23,997 INFO L87 Difference]: Start difference. First operand 178 states and 198 transitions. Second operand 22 states. [2018-02-02 09:01:24,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:01:24,731 INFO L93 Difference]: Finished difference Result 314 states and 347 transitions. [2018-02-02 09:01:24,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 09:01:24,732 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 53 [2018-02-02 09:01:24,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:01:24,733 INFO L225 Difference]: With dead ends: 314 [2018-02-02 09:01:24,733 INFO L226 Difference]: Without dead ends: 314 [2018-02-02 09:01:24,733 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=292, Invalid=1114, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 09:01:24,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-02-02 09:01:24,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 178. [2018-02-02 09:01:24,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-02-02 09:01:24,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 197 transitions. [2018-02-02 09:01:24,737 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 197 transitions. Word has length 53 [2018-02-02 09:01:24,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:01:24,737 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 197 transitions. [2018-02-02 09:01:24,737 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 09:01:24,737 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 197 transitions. [2018-02-02 09:01:24,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 09:01:24,738 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:01:24,738 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:01:24,738 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 09:01:24,738 INFO L82 PathProgramCache]: Analyzing trace with hash -2142007066, now seen corresponding path program 1 times [2018-02-02 09:01:24,738 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:01:24,738 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:01:24,739 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:24,739 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:01:24,739 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:24,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:01:24,747 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:01:24,894 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:01:24,895 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:01:24,895 INFO L209 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 09:01:24,902 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:01:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:01:24,921 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:01:24,965 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 09:01:24,966 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 09:01:24,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:24,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:24,971 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 09:01:24,971 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-02-02 09:01:25,006 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 16 treesize of output 12 [2018-02-02 09:01:25,007 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 12 treesize of output 4 [2018-02-02 09:01:25,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:25,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:25,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:25,011 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:13 [2018-02-02 09:01:25,039 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:25,040 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 09:01:25,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:25,044 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 09:01:25,044 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-02-02 09:01:25,062 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:01:25,079 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:01:25,079 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 23 [2018-02-02 09:01:25,080 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 09:01:25,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 09:01:25,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2018-02-02 09:01:25,080 INFO L87 Difference]: Start difference. First operand 178 states and 197 transitions. Second operand 24 states. [2018-02-02 09:01:25,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:01:25,784 INFO L93 Difference]: Finished difference Result 337 states and 376 transitions. [2018-02-02 09:01:25,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 09:01:25,785 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 55 [2018-02-02 09:01:25,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:01:25,785 INFO L225 Difference]: With dead ends: 337 [2018-02-02 09:01:25,785 INFO L226 Difference]: Without dead ends: 337 [2018-02-02 09:01:25,786 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=470, Invalid=1600, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 09:01:25,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-02-02 09:01:25,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 178. [2018-02-02 09:01:25,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-02-02 09:01:25,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 197 transitions. [2018-02-02 09:01:25,788 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 197 transitions. Word has length 55 [2018-02-02 09:01:25,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:01:25,788 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 197 transitions. [2018-02-02 09:01:25,789 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 09:01:25,789 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 197 transitions. [2018-02-02 09:01:25,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 09:01:25,789 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:01:25,789 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:01:25,789 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 09:01:25,790 INFO L82 PathProgramCache]: Analyzing trace with hash -2142007015, now seen corresponding path program 1 times [2018-02-02 09:01:25,790 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:01:25,790 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:01:25,790 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:25,790 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:01:25,791 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:25,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:01:25,801 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:01:26,170 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:01:26,170 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:01:26,170 INFO L209 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 09:01:26,174 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:01:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:01:26,192 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:01:26,210 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 09:01:26,211 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 09:01:26,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:26,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:26,216 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 09:01:26,216 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 09:01:26,217 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:26,217 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:26,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:26,220 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-02-02 09:01:26,225 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 09:01:26,229 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:26,229 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 09:01:26,229 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:26,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:26,237 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 09:01:26,240 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:26,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 16 treesize of output 23 [2018-02-02 09:01:26,240 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:26,243 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:26,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:26,247 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:54, output treesize:36 [2018-02-02 09:01:26,265 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 36 treesize of output 29 [2018-02-02 09:01:26,266 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:26,266 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:26,267 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:26,268 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 29 treesize of output 37 [2018-02-02 09:01:26,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:26,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:26,279 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 36 treesize of output 29 [2018-02-02 09:01:26,280 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:26,281 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:26,281 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:26,282 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 29 treesize of output 37 [2018-02-02 09:01:26,282 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:26,286 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:26,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:26,290 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:74, output treesize:36 [2018-02-02 09:01:26,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 40 [2018-02-02 09:01:26,376 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 33 treesize of output 32 [2018-02-02 09:01:26,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:26,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:26,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 40 [2018-02-02 09:01:26,407 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 33 treesize of output 32 [2018-02-02 09:01:26,407 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:26,420 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:26,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:26,428 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:72, output treesize:64 [2018-02-02 09:01:26,492 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:26,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 69 [2018-02-02 09:01:26,505 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:26,506 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:26,507 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:26,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 57 [2018-02-02 09:01:26,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:26,528 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:26,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 74 [2018-02-02 09:01:26,539 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-02-02 09:01:26,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-02 09:01:26,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 109 [2018-02-02 09:01:26,612 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:26,613 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:26,613 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:26,613 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:26,614 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 88 treesize of output 158 [2018-02-02 09:01:26,614 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:26,653 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:26,656 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:26,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 100 [2018-02-02 09:01:26,666 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:26,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 113 [2018-02-02 09:01:26,667 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:26,681 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:26,685 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:26,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 82 [2018-02-02 09:01:26,693 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:26,693 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:26,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 105 [2018-02-02 09:01:26,694 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:26,702 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:26,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-02-02 09:01:26,734 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:106, output treesize:277 [2018-02-02 09:01:26,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 102 [2018-02-02 09:01:26,815 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:26,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 101 treesize of output 112 [2018-02-02 09:01:26,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:26,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 09:01:26,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 146 treesize of output 134 [2018-02-02 09:01:26,959 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:26,959 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 137 treesize of output 152 [2018-02-02 09:01:26,959 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:26,994 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:27,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 142 treesize of output 124 [2018-02-02 09:01:27,095 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:27,095 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:27,096 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 135 treesize of output 177 [2018-02-02 09:01:27,096 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:27,122 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:27,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 102 treesize of output 104 [2018-02-02 09:01:27,206 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:27,206 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:27,206 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 103 treesize of output 137 [2018-02-02 09:01:27,207 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:27,238 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 09:01:27,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 98 [2018-02-02 09:01:27,312 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:27,312 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 97 treesize of output 108 [2018-02-02 09:01:27,312 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:27,334 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:27,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 98 treesize of output 100 [2018-02-02 09:01:27,394 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:27,394 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:27,395 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 99 treesize of output 127 [2018-02-02 09:01:27,395 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:27,424 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 09:01:27,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-02-02 09:01:27,471 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:355, output treesize:329 [2018-02-02 09:01:27,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 164 treesize of output 156 [2018-02-02 09:01:27,570 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:27,571 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:27,571 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:27,574 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 155 treesize of output 169 [2018-02-02 09:01:27,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:27,661 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:27,663 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:27,664 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:27,665 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:27,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 114 [2018-02-02 09:01:27,675 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-02 09:01:27,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 09:01:27,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 138 [2018-02-02 09:01:27,922 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:27,922 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:27,923 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:27,925 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 135 treesize of output 147 [2018-02-02 09:01:27,925 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:27,973 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:28,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, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 123 treesize of output 131 [2018-02-02 09:01:28,102 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:28,102 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:28,103 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:28,105 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 116 treesize of output 159 [2018-02-02 09:01:28,105 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:28,143 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:28,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 145 treesize of output 147 [2018-02-02 09:01:28,235 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:28,235 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:28,236 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:28,237 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 138 treesize of output 181 [2018-02-02 09:01:28,237 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:28,285 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:28,286 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:28,287 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:28,288 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:28,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 153 [2018-02-02 09:01:28,295 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-02-02 09:01:28,334 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 09:01:28,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 136 treesize of output 132 [2018-02-02 09:01:28,416 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:28,417 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:28,417 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:28,419 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 129 treesize of output 141 [2018-02-02 09:01:28,420 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:28,490 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:28,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 117 treesize of output 125 [2018-02-02 09:01:28,557 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:28,557 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:28,558 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:28,558 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:28,560 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 112 treesize of output 170 [2018-02-02 09:01:28,561 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:28,597 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:28,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-02-02 09:01:28,645 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 7 variables, input treesize:443, output treesize:337 [2018-02-02 09:01:28,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 114 [2018-02-02 09:01:28,712 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 107 [2018-02-02 09:01:28,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:28,749 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:28,749 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:28,750 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:28,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 68 [2018-02-02 09:01:28,750 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:28,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:28,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 175 treesize of output 140 [2018-02-02 09:01:28,884 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:28,885 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 158 treesize of output 194 [2018-02-02 09:01:28,885 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:28,941 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:28,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 150 treesize of output 135 [2018-02-02 09:01:28,950 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-02 09:01:29,005 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 09:01:29,120 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:29,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 118 treesize of output 99 [2018-02-02 09:01:29,129 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:29,129 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:29,129 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:29,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 83 [2018-02-02 09:01:29,130 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:29,149 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:29,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 147 treesize of output 122 [2018-02-02 09:01:29,256 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 134 treesize of output 152 [2018-02-02 09:01:29,257 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:29,290 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-02 09:01:29,403 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:29,403 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:29,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 109 [2018-02-02 09:01:29,405 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:29,406 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:29,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 59 [2018-02-02 09:01:29,408 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:29,424 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:29,428 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:29,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 170 treesize of output 131 [2018-02-02 09:01:29,437 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:29,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 114 [2018-02-02 09:01:29,438 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:29,454 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:29,546 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:29,547 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:29,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 75 [2018-02-02 09:01:29,549 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:29,549 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:29,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 38 [2018-02-02 09:01:29,550 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:29,558 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:29,560 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:29,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 128 [2018-02-02 09:01:29,567 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:29,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 73 [2018-02-02 09:01:29,568 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:29,581 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:29,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-2 vars, End of recursive call: 8 dim-0 vars, and 5 xjuncts. [2018-02-02 09:01:29,644 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 10 variables, input treesize:456, output treesize:569 [2018-02-02 09:01:30,204 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:30,205 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 137 treesize of output 104 [2018-02-02 09:01:30,207 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:30,212 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 67 [2018-02-02 09:01:30,213 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-02-02 09:01:30,241 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:30,242 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:30,285 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 104 [2018-02-02 09:01:30,287 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 8 xjuncts. [2018-02-02 09:01:30,289 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:30,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 72 [2018-02-02 09:01:30,298 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-02 09:01:30,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 5 xjuncts. [2018-02-02 09:01:30,559 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:30,559 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 154 treesize of output 117 [2018-02-02 09:01:30,562 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:30,570 INFO L477 Elim1Store]: Elim1 applied some 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 85 [2018-02-02 09:01:30,573 INFO L267 ElimStorePlain]: Start of recursive call 7: 7 dim-0 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2018-02-02 09:01:30,624 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:30,624 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:30,639 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 88 treesize of output 111 [2018-02-02 09:01:30,640 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 8 xjuncts. [2018-02-02 09:01:30,657 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:30,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 79 [2018-02-02 09:01:30,666 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-02-02 09:01:30,668 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:30,688 INFO L477 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 5 case distinctions, treesize of input 82 treesize of output 109 [2018-02-02 09:01:30,689 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 8 xjuncts. [2018-02-02 09:01:30,691 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:30,691 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:30,704 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 86 treesize of output 109 [2018-02-02 09:01:30,705 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 8 xjuncts. [2018-02-02 09:01:30,960 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: 11 dim-0 vars, and 11 xjuncts. [2018-02-02 09:01:31,242 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 61 treesize of output 47 [2018-02-02 09:01:31,244 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:31,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-02-02 09:01:31,244 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:31,251 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:31,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 28 [2018-02-02 09:01:31,258 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-02-02 09:01:31,269 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 09:01:31,271 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 72 treesize of output 58 [2018-02-02 09:01:31,273 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:31,274 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 30 treesize of output 40 [2018-02-02 09:01:31,275 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:31,284 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:31,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2018-02-02 09:01:31,285 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:31,290 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:31,292 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 68 treesize of output 54 [2018-02-02 09:01:31,293 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:31,294 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 30 treesize of output 40 [2018-02-02 09:01:31,294 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:31,302 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:31,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2018-02-02 09:01:31,303 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:31,307 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:31,308 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 68 treesize of output 54 [2018-02-02 09:01:31,310 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:31,311 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 30 treesize of output 40 [2018-02-02 09:01:31,311 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:31,320 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:31,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2018-02-02 09:01:31,320 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:31,324 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:31,325 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 61 treesize of output 47 [2018-02-02 09:01:31,327 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:31,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-02-02 09:01:31,327 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:31,334 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:31,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 28 [2018-02-02 09:01:31,340 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2018-02-02 09:01:31,350 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 09:01:31,352 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 61 treesize of output 47 [2018-02-02 09:01:31,353 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:31,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 60 [2018-02-02 09:01:31,359 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 2 xjuncts. [2018-02-02 09:01:31,374 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:31,374 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 38 treesize of output 20 [2018-02-02 09:01:31,374 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:31,375 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:31,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2018-02-02 09:01:31,376 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:31,387 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 09:01:31,389 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 68 treesize of output 54 [2018-02-02 09:01:31,390 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:31,391 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 30 treesize of output 40 [2018-02-02 09:01:31,391 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:31,398 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:31,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2018-02-02 09:01:31,399 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:31,403 INFO L267 ElimStorePlain]: Start of recursive call 31: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:31,405 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 72 treesize of output 58 [2018-02-02 09:01:31,406 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:31,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-02-02 09:01:31,407 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:31,416 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:31,417 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 23 treesize of output 20 [2018-02-02 09:01:31,417 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:31,422 INFO L267 ElimStorePlain]: Start of recursive call 34: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:31,423 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 72 treesize of output 58 [2018-02-02 09:01:31,425 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:31,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-02-02 09:01:31,425 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:31,434 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:31,435 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 23 treesize of output 20 [2018-02-02 09:01:31,435 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:31,443 INFO L267 ElimStorePlain]: Start of recursive call 37: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:31,445 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 68 treesize of output 54 [2018-02-02 09:01:31,446 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:31,447 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 30 treesize of output 40 [2018-02-02 09:01:31,447 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:31,454 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:31,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2018-02-02 09:01:31,454 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:31,459 INFO L267 ElimStorePlain]: Start of recursive call 40: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:31,460 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 61 treesize of output 47 [2018-02-02 09:01:31,462 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:31,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 60 [2018-02-02 09:01:31,468 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 2 xjuncts. [2018-02-02 09:01:31,483 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:31,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, 1 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 09:01:31,483 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:31,484 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:31,485 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 38 treesize of output 20 [2018-02-02 09:01:31,485 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:31,501 INFO L267 ElimStorePlain]: Start of recursive call 43: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 09:01:31,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 150 treesize of output 113 [2018-02-02 09:01:31,696 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:31,696 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 92 [2018-02-02 09:01:31,697 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:01:31,742 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:31,743 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:31,743 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:31,747 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 67 [2018-02-02 09:01:31,747 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 2 xjuncts. [2018-02-02 09:01:31,784 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:31,785 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:31,788 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 79 treesize of output 78 [2018-02-02 09:01:31,788 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 2 xjuncts. [2018-02-02 09:01:31,823 INFO L267 ElimStorePlain]: Start of recursive call 47: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-02-02 09:01:32,057 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 67 treesize of output 55 [2018-02-02 09:01:32,058 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:32,059 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:32,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2018-02-02 09:01:32,059 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:32,069 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:32,070 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 18 treesize of output 17 [2018-02-02 09:01:32,070 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:32,076 INFO L267 ElimStorePlain]: Start of recursive call 51: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:32,077 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 60 treesize of output 48 [2018-02-02 09:01:32,078 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:32,080 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:32,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 33 [2018-02-02 09:01:32,086 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 2 xjuncts. [2018-02-02 09:01:32,101 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:32,101 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:32,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, 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 20 [2018-02-02 09:01:32,102 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:32,103 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:32,103 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:32,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-02 09:01:32,103 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:32,115 INFO L267 ElimStorePlain]: Start of recursive call 54: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 09:01:32,116 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 60 treesize of output 48 [2018-02-02 09:01:32,118 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:32,120 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:32,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 33 [2018-02-02 09:01:32,126 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 2 xjuncts. [2018-02-02 09:01:32,142 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:32,142 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 20 [2018-02-02 09:01:32,142 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:32,143 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:32,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-02-02 09:01:32,144 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:32,154 INFO L267 ElimStorePlain]: Start of recursive call 58: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 09:01:32,156 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 71 treesize of output 59 [2018-02-02 09:01:32,158 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:32,158 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:32,159 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 25 treesize of output 25 [2018-02-02 09:01:32,159 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:32,169 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:32,169 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:32,169 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 13 treesize of output 10 [2018-02-02 09:01:32,169 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:32,177 INFO L267 ElimStorePlain]: Start of recursive call 62: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:32,178 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 67 treesize of output 55 [2018-02-02 09:01:32,180 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:32,180 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:32,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, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2018-02-02 09:01:32,182 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:32,191 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:32,191 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:32,192 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 13 treesize of output 10 [2018-02-02 09:01:32,192 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:32,198 INFO L267 ElimStorePlain]: Start of recursive call 65: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:32,396 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 37 treesize of output 31 [2018-02-02 09:01:32,397 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:32,401 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 18 treesize of output 21 [2018-02-02 09:01:32,401 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 2 xjuncts. [2018-02-02 09:01:32,411 INFO L267 ElimStorePlain]: Start of recursive call 68: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 09:01:32,411 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 40 treesize of output 34 [2018-02-02 09:01:32,413 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:32,414 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 18 treesize of output 17 [2018-02-02 09:01:32,414 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:32,418 INFO L267 ElimStorePlain]: Start of recursive call 70: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:32,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 58 [2018-02-02 09:01:32,423 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:32,424 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 54 treesize of output 51 [2018-02-02 09:01:32,424 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:32,443 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:32,444 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 36 treesize of output 27 [2018-02-02 09:01:32,444 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:32,455 INFO L267 ElimStorePlain]: Start of recursive call 72: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:32,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 6 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-02-02 09:01:32,627 INFO L202 ElimStorePlain]: Needed 74 recursive calls to eliminate 9 variables, input treesize:442, output treesize:84 [2018-02-02 09:01:32,748 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:01:32,764 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:01:32,764 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22] total 38 [2018-02-02 09:01:32,764 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-02 09:01:32,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-02 09:01:32,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1236, Unknown=1, NotChecked=0, Total=1406 [2018-02-02 09:01:32,765 INFO L87 Difference]: Start difference. First operand 178 states and 197 transitions. Second operand 38 states. [2018-02-02 09:01:35,158 WARN L146 SmtUtils]: Spent 149ms on a formula simplification. DAG size of input: 132 DAG size of output 131 [2018-02-02 09:01:35,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:01:35,790 INFO L93 Difference]: Finished difference Result 380 states and 428 transitions. [2018-02-02 09:01:35,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 09:01:35,790 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 55 [2018-02-02 09:01:35,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:01:35,791 INFO L225 Difference]: With dead ends: 380 [2018-02-02 09:01:35,791 INFO L226 Difference]: Without dead ends: 380 [2018-02-02 09:01:35,792 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 40 SyntacticMatches, 7 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1616 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=799, Invalid=4900, Unknown=1, NotChecked=0, Total=5700 [2018-02-02 09:01:35,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-02-02 09:01:35,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 209. [2018-02-02 09:01:35,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-02-02 09:01:35,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 230 transitions. [2018-02-02 09:01:35,794 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 230 transitions. Word has length 55 [2018-02-02 09:01:35,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:01:35,795 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 230 transitions. [2018-02-02 09:01:35,795 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-02 09:01:35,795 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 230 transitions. [2018-02-02 09:01:35,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 09:01:35,795 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:01:35,796 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 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, 1, 1, 1, 1, 1, 1] [2018-02-02 09:01:35,796 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 09:01:35,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1011802750, now seen corresponding path program 1 times [2018-02-02 09:01:35,796 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:01:35,796 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:01:35,797 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:35,797 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:01:35,797 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:01:35,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:01:35,808 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:01:36,369 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:01:36,369 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:01:36,369 INFO L209 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 09:01:36,374 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:01:36,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:01:36,396 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:01:36,467 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 39 treesize of output 36 [2018-02-02 09:01:36,468 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 09:01:36,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:36,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:36,476 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 39 treesize of output 36 [2018-02-02 09:01:36,478 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 09:01:36,478 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:36,487 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:36,521 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 35 treesize of output 32 [2018-02-02 09:01:36,522 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 09:01:36,522 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:36,527 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:36,529 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 35 treesize of output 32 [2018-02-02 09:01:36,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 10 treesize of output 9 [2018-02-02 09:01:36,531 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:36,536 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:36,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 09:01:36,552 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:79, output treesize:63 [2018-02-02 09:01:36,589 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 57 treesize of output 52 [2018-02-02 09:01:36,591 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:36,591 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 18 treesize of output 27 [2018-02-02 09:01:36,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:36,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:36,664 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 53 treesize of output 48 [2018-02-02 09:01:36,666 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:36,666 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 18 treesize of output 27 [2018-02-02 09:01:36,666 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:36,673 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:36,697 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 57 treesize of output 52 [2018-02-02 09:01:36,699 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:36,700 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 18 treesize of output 27 [2018-02-02 09:01:36,700 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:36,709 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:36,731 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 53 treesize of output 48 [2018-02-02 09:01:36,732 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:36,733 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 18 treesize of output 27 [2018-02-02 09:01:36,733 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:36,740 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:36,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 09:01:36,757 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:115, output treesize:99 [2018-02-02 09:01:36,790 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-02 09:01:36,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:36,805 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 30 treesize of output 23 [2018-02-02 09:01:36,807 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:36,807 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:36,808 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:36,808 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:36,808 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 55 [2018-02-02 09:01:36,809 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:36,815 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:36,839 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 30 treesize of output 23 [2018-02-02 09:01:36,840 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:36,841 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:36,841 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:36,841 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 23 treesize of output 46 [2018-02-02 09:01:36,842 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:36,846 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:36,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:36,855 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:149, output treesize:66 [2018-02-02 09:01:36,885 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 39 treesize of output 30 [2018-02-02 09:01:36,887 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:36,887 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:36,888 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:36,888 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:36,889 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:36,889 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:36,889 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:36,890 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 30 treesize of output 92 [2018-02-02 09:01:36,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:36,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:36,917 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 39 treesize of output 30 [2018-02-02 09:01:36,919 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:36,919 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:36,920 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:36,920 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:36,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-02-02 09:01:36,921 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:36,929 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:36,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:36,941 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:92, output treesize:90 [2018-02-02 09:01:36,980 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 60 treesize of output 47 [2018-02-02 09:01:36,982 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:36,983 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:36,983 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:36,984 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:36,985 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:36,985 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:36,986 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:36,986 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:36,987 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:36,988 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:36,988 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:36,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 128 [2018-02-02 09:01:36,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:37,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:37,024 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 54 treesize of output 43 [2018-02-02 09:01:37,026 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,026 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,027 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,027 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,028 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,028 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,029 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,030 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,030 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,031 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,032 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 123 [2018-02-02 09:01:37,036 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:37,048 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:37,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:37,059 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:90 [2018-02-02 09:01:37,111 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,111 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,112 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 09:01:37,112 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:37,135 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 09:01:37,135 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:104, output treesize:98 [2018-02-02 09:01:37,198 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 54 treesize of output 55 [2018-02-02 09:01:37,200 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 09:01:37,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:37,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:37,234 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 48 treesize of output 49 [2018-02-02 09:01:37,236 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 09:01:37,236 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:37,241 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:37,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:01:37,269 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:129, output treesize:121 [2018-02-02 09:01:37,317 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 57 treesize of output 56 [2018-02-02 09:01:37,319 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,320 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 18 treesize of output 27 [2018-02-02 09:01:37,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:37,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:37,379 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 63 treesize of output 62 [2018-02-02 09:01:37,382 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,382 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 18 treesize of output 27 [2018-02-02 09:01:37,383 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:37,391 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:37,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:01:37,418 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:147, output treesize:139 [2018-02-02 09:01:37,484 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,485 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 64 treesize of output 70 [2018-02-02 09:01:37,488 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,488 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,489 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,491 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 32 treesize of output 54 [2018-02-02 09:01:37,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:37,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:37,554 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 70 treesize of output 67 [2018-02-02 09:01:37,556 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,556 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,557 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,557 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:37,557 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 55 [2018-02-02 09:01:37,558 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:37,568 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:37,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:01:37,595 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:164, output treesize:156 [2018-02-02 09:01:37,648 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,650 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,650 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 73 treesize of output 85 [2018-02-02 09:01:37,653 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,654 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,656 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,656 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,657 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,657 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,658 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,659 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,670 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 118 [2018-02-02 09:01:37,671 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 09:01:37,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:37,742 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 79 treesize of output 74 [2018-02-02 09:01:37,744 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,745 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,745 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,746 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,746 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,747 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,747 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:37,747 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 30 treesize of output 92 [2018-02-02 09:01:37,748 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:37,763 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:37,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:01:37,794 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:182, output treesize:180 [2018-02-02 09:01:37,858 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 100 treesize of output 91 [2018-02-02 09:01:37,861 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,861 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,862 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,862 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,863 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,863 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,864 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,865 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,865 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,866 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,866 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:37,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 128 [2018-02-02 09:01:37,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:37,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:37,939 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,941 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,941 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 88 treesize of output 104 [2018-02-02 09:01:37,946 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,947 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,949 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,949 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,950 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,950 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,951 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,952 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,953 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,953 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,954 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,954 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:37,972 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 66 treesize of output 148 [2018-02-02 09:01:37,973 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 09:01:38,008 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:38,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:01:38,040 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:218, output treesize:180 [2018-02-02 09:01:38,093 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:38,094 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:38,096 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 82 treesize of output 92 [2018-02-02 09:01:38,100 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:38,101 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:38,104 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:38,105 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:38,106 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:38,108 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:38,109 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:38,111 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:38,119 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:38,151 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 12 case distinctions, treesize of input 54 treesize of output 179 [2018-02-02 09:01:38,151 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-02-02 09:01:38,161 INFO L267 ElimStorePlain]: Start of recursive call 3: 32 dim-0 vars, End of recursive call: 32 dim-0 vars, and 56 xjuncts. [2018-02-02 09:01:38,583 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 9 xjuncts. [2018-02-02 09:01:38,799 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 94 treesize of output 85 [2018-02-02 09:01:38,804 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:38,804 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:38,805 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:38,811 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:38,812 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:38,813 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:38,816 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:38,816 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:38,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 92 [2018-02-02 09:01:38,817 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:38,835 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:38,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 9 dim-0 vars, and 9 xjuncts. [2018-02-02 09:01:38,987 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:206, output treesize:1778 [2018-02-02 09:01:39,878 WARN L146 SmtUtils]: Spent 777ms on a formula simplification. DAG size of input: 259 DAG size of output 145 [2018-02-02 09:01:39,889 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:39,890 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:39,891 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:39,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 399 treesize of output 398 [2018-02-02 09:01:39,895 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:39,896 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:39,898 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:39,899 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:39,900 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:39,901 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:39,902 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:39,902 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:39,903 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:39,914 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:39,916 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 301 [2018-02-02 09:01:39,917 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:01:39,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:01:41,341 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:41,341 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:41,342 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:41,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 399 treesize of output 398 [2018-02-02 09:01:41,346 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:41,348 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:41,349 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:41,350 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:41,351 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:41,351 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:41,352 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:41,353 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:41,354 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:41,358 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:41,366 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 301 [2018-02-02 09:01:41,366 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 09:01:41,432 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:01:42,690 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:42,692 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:42,693 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:42,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 388 treesize of output 380 [2018-02-02 09:01:42,696 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:42,697 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:42,698 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:42,699 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:42,700 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:42,700 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:42,701 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:42,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 248 [2018-02-02 09:01:42,701 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:42,753 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:43,557 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:43,558 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:43,559 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:43,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 423 treesize of output 422 [2018-02-02 09:01:43,563 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:43,564 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:43,564 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:43,565 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:43,566 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:43,566 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:43,567 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:43,568 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:43,577 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:43,581 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 122 treesize of output 289 [2018-02-02 09:01:43,581 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:01:43,650 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:01:44,312 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:44,313 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:44,315 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 379 treesize of output 353 [2018-02-02 09:01:44,317 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:44,318 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:44,319 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:44,320 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:44,320 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:44,321 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:44,321 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:44,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 270 [2018-02-02 09:01:44,322 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:44,372 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:44,922 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:44,925 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:45,219 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:45,219 INFO L303 Elim1Store]: Index analysis took 299 ms [2018-02-02 09:01:45,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 412 treesize of output 404 [2018-02-02 09:01:45,223 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:45,224 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:45,224 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:45,225 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:45,226 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:45,226 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:45,227 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:45,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 273 [2018-02-02 09:01:45,227 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:45,294 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:45,714 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:45,715 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:45,716 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:45,717 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:45,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 352 treesize of output 361 [2018-02-02 09:01:45,720 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:45,721 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:45,722 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:45,723 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:45,723 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:45,724 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:45,726 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:45,737 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:45,740 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 122 treesize of output 297 [2018-02-02 09:01:45,741 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 09:01:45,785 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 09:01:46,187 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:46,190 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:46,191 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:46,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 381 treesize of output 373 [2018-02-02 09:01:46,194 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:46,195 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:46,196 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:46,196 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:46,197 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:46,198 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:46,198 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:46,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 287 [2018-02-02 09:01:46,199 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:46,250 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:46,574 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:46,575 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:46,576 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:46,577 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:46,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 341 treesize of output 350 [2018-02-02 09:01:46,580 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:46,581 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:46,581 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:46,582 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:46,582 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:46,583 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:46,584 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:46,592 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:46,603 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 122 treesize of output 320 [2018-02-02 09:01:46,604 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-02 09:01:46,698 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-02 09:01:47,105 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:47,107 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:47,108 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:47,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 388 treesize of output 380 [2018-02-02 09:01:47,111 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:47,112 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:47,112 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:47,113 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:47,114 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:47,114 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:47,115 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:01:47,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 275 [2018-02-02 09:01:47,115 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:47,164 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:01:47,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 10 dim-2 vars, End of recursive call: 14 dim-0 vars, and 7 xjuncts. [2018-02-02 09:01:47,509 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 16 variables, input treesize:1982, output treesize:2446 [2018-02-02 09:01:48,386 WARN L146 SmtUtils]: Spent 682ms on a formula simplification. DAG size of input: 413 DAG size of output 358 [2018-02-02 09:01:49,190 WARN L143 SmtUtils]: Spent 572ms on a formula simplification that was a NOOP. DAG size: 362 [2018-02-02 09:01:49,201 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:49,202 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:49,202 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 387 treesize of output 323 [2018-02-02 09:01:49,205 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:49,206 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:49,206 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:49,207 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:49,208 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:49,208 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:49,209 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:49,211 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:49,211 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:49,212 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:49,213 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:49,215 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:49,215 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:49,216 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:49,217 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:49,242 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 19 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 219 treesize of output 267 [2018-02-02 09:01:49,242 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-02-02 09:01:49,245 INFO L267 ElimStorePlain]: Start of recursive call 3: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 8 xjuncts. [2018-02-02 09:01:49,360 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:49,360 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 96 treesize of output 76 [2018-02-02 09:01:49,360 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:49,362 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:49,363 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 117 treesize of output 97 [2018-02-02 09:01:49,363 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:01:49,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 09:01:49,797 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:49,798 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:49,798 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 382 treesize of output 331 [2018-02-02 09:01:49,803 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:49,804 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:49,807 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:49,811 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:49,812 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:49,814 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:49,817 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:49,824 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:49,860 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 79 treesize of output 327 [2018-02-02 09:01:49,860 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-02-02 09:01:49,884 INFO L267 ElimStorePlain]: Start of recursive call 7: 32 dim-0 vars, End of recursive call: 32 dim-0 vars, and 36 xjuncts. [2018-02-02 09:01:50,084 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:50,085 INFO L700 Elim1Store]: detected not equals via solver Received shutdown request... [2018-02-02 09:01:50,342 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:50,343 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:50,344 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:50,344 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:50,346 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:01:50,348 INFO L303 Elim1Store]: Index analysis took 265 ms [2018-02-02 09:01:50,350 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-02-02 09:01:50,350 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 09:01:50,353 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 09:01:50,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:01:50 BoogieIcfgContainer [2018-02-02 09:01:50,354 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 09:01:50,354 INFO L168 Benchmark]: Toolchain (without parser) took 56730.25 ms. Allocated memory was 408.4 MB in the beginning and 928.5 MB in the end (delta: 520.1 MB). Free memory was 365.3 MB in the beginning and 803.5 MB in the end (delta: -438.2 MB). Peak memory consumption was 454.2 MB. Max. memory is 5.3 GB. [2018-02-02 09:01:50,355 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 408.4 MB. Free memory is still 371.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 09:01:50,355 INFO L168 Benchmark]: CACSL2BoogieTranslator took 169.73 ms. Allocated memory is still 408.4 MB. Free memory was 365.3 MB in the beginning and 354.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 09:01:50,355 INFO L168 Benchmark]: Boogie Preprocessor took 32.71 ms. Allocated memory is still 408.4 MB. Free memory was 354.7 MB in the beginning and 352.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 09:01:50,355 INFO L168 Benchmark]: RCFGBuilder took 315.82 ms. Allocated memory is still 408.4 MB. Free memory was 352.1 MB in the beginning and 323.2 MB in the end (delta: 28.9 MB). Peak memory consumption was 28.9 MB. Max. memory is 5.3 GB. [2018-02-02 09:01:50,356 INFO L168 Benchmark]: TraceAbstraction took 56209.36 ms. Allocated memory was 408.4 MB in the beginning and 928.5 MB in the end (delta: 520.1 MB). Free memory was 323.2 MB in the beginning and 803.5 MB in the end (delta: -480.4 MB). Peak memory consumption was 412.0 MB. Max. memory is 5.3 GB. [2018-02-02 09:01:50,357 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.11 ms. Allocated memory is still 408.4 MB. Free memory is still 371.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 169.73 ms. Allocated memory is still 408.4 MB. Free memory was 365.3 MB in the beginning and 354.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.71 ms. Allocated memory is still 408.4 MB. Free memory was 354.7 MB in the beginning and 352.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 315.82 ms. Allocated memory is still 408.4 MB. Free memory was 352.1 MB in the beginning and 323.2 MB in the end (delta: 28.9 MB). Peak memory consumption was 28.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 56209.36 ms. Allocated memory was 408.4 MB in the beginning and 928.5 MB in the end (delta: 520.1 MB). Free memory was 323.2 MB in the beginning and 803.5 MB in the end (delta: -480.4 MB). Peak memory consumption was 412.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 639). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 672). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 670). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 620]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 620). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 670). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 672). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 94 locations, 39 error locations. TIMEOUT Result, 56.1s OverallTime, 34 OverallIterations, 3 TraceHistogramMax, 17.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2108 SDtfs, 7454 SDslu, 8691 SDs, 0 SdLazy, 8280 SolverSat, 773 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 9.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1031 GetRequests, 469 SyntacticMatches, 55 SemanticMatches, 507 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3565 ImplicationChecksByTransitivity, 15.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=209occurred in iteration=33, 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, 33 MinimizatonAttempts, 1879 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 22.6s InterpolantComputationTime, 1665 NumberOfCodeBlocks, 1665 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 1621 ConstructedInterpolants, 96 QuantifiedInterpolants, 1391810 SizeOfPredicates, 109 NumberOfNonLiveVariables, 2251 ConjunctsInSsa, 280 ConjunctsInUnsatCore, 44 InterpolantComputations, 22 PerfectInterpolantSequences, 179/289 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/test-0504_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_09-01-50-362.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_09-01-50-362.csv Completed graceful shutdown