java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength2_true-valid-memsafety.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 18:52:12,101 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 18:52:12,102 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 18:52:12,113 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 18:52:12,113 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 18:52:12,114 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 18:52:12,115 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 18:52:12,116 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 18:52:12,118 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 18:52:12,118 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 18:52:12,119 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 18:52:12,119 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 18:52:12,120 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 18:52:12,121 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 18:52:12,122 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 18:52:12,123 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 18:52:12,125 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 18:52:12,126 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 18:52:12,127 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 18:52:12,128 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 18:52:12,130 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 18:52:12,130 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 18:52:12,130 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 18:52:12,131 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 18:52:12,132 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 18:52:12,132 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 18:52:12,132 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 18:52:12,133 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 18:52:12,133 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 18:52:12,133 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 18:52:12,134 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 18:52:12,134 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 18:52:12,143 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 18:52:12,143 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 18:52:12,144 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 18:52:12,144 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 18:52:12,145 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 18:52:12,145 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 18:52:12,145 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 18:52:12,145 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 18:52:12,145 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 18:52:12,145 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 18:52:12,145 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 18:52:12,146 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 18:52:12,146 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 18:52:12,146 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 18:52:12,146 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 18:52:12,146 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 18:52:12,146 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 18:52:12,147 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 18:52:12,147 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 18:52:12,147 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 18:52:12,147 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 18:52:12,147 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 18:52:12,147 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 18:52:12,147 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 18:52:12,176 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 18:52:12,186 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 18:52:12,189 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 18:52:12,191 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 18:52:12,191 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 18:52:12,192 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength2_true-valid-memsafety.c [2018-02-04 18:52:12,301 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 18:52:12,302 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 18:52:12,303 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 18:52:12,303 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 18:52:12,309 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 18:52:12,310 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 06:52:12" (1/1) ... [2018-02-04 18:52:12,313 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26458554 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:52:12, skipping insertion in model container [2018-02-04 18:52:12,313 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 06:52:12" (1/1) ... [2018-02-04 18:52:12,327 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 18:52:12,341 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 18:52:12,431 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 18:52:12,443 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 18:52:12,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:52:12 WrapperNode [2018-02-04 18:52:12,447 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 18:52:12,448 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 18:52:12,448 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 18:52:12,448 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 18:52:12,456 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:52:12" (1/1) ... [2018-02-04 18:52:12,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:52:12" (1/1) ... [2018-02-04 18:52:12,462 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:52:12" (1/1) ... [2018-02-04 18:52:12,463 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:52:12" (1/1) ... [2018-02-04 18:52:12,464 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:52:12" (1/1) ... [2018-02-04 18:52:12,467 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:52:12" (1/1) ... [2018-02-04 18:52:12,468 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:52:12" (1/1) ... [2018-02-04 18:52:12,469 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 18:52:12,469 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 18:52:12,470 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 18:52:12,470 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 18:52:12,471 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:52:12" (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-04 18:52:12,512 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 18:52:12,512 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 18:52:12,512 INFO L136 BoogieDeclarations]: Found implementation of procedure bar [2018-02-04 18:52:12,512 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-04 18:52:12,512 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 18:52:12,513 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 18:52:12,513 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 18:52:12,513 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 18:52:12,513 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 18:52:12,513 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 18:52:12,513 INFO L128 BoogieDeclarations]: Found specification of procedure bar [2018-02-04 18:52:12,513 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-04 18:52:12,513 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 18:52:12,513 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 18:52:12,513 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 18:52:12,672 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 18:52:12,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 06:52:12 BoogieIcfgContainer [2018-02-04 18:52:12,673 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 18:52:12,673 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 18:52:12,673 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 18:52:12,675 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 18:52:12,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 06:52:12" (1/3) ... [2018-02-04 18:52:12,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dfec515 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 06:52:12, skipping insertion in model container [2018-02-04 18:52:12,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:52:12" (2/3) ... [2018-02-04 18:52:12,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dfec515 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 06:52:12, skipping insertion in model container [2018-02-04 18:52:12,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 06:52:12" (3/3) ... [2018-02-04 18:52:12,678 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength2_true-valid-memsafety.c [2018-02-04 18:52:12,683 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 18:52:12,687 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-02-04 18:52:12,714 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 18:52:12,714 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 18:52:12,715 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 18:52:12,715 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 18:52:12,715 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 18:52:12,715 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 18:52:12,715 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 18:52:12,715 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 18:52:12,716 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 18:52:12,728 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2018-02-04 18:52:12,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 18:52:12,736 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:12,737 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:12,737 INFO L371 AbstractCegarLoop]: === Iteration 1 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:52:12,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1613294992, now seen corresponding path program 1 times [2018-02-04 18:52:12,743 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:12,744 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:12,787 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:12,787 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:12,787 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:12,817 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:12,838 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-04 18:52:12,839 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:52:12,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 18:52:12,841 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-04 18:52:12,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-04 18:52:12,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 18:52:12,850 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 2 states. [2018-02-04 18:52:12,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:12,863 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-02-04 18:52:12,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-04 18:52:12,864 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-02-04 18:52:12,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:12,870 INFO L225 Difference]: With dead ends: 68 [2018-02-04 18:52:12,870 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 18:52:12,872 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-04 18:52:12,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 18:52:12,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-02-04 18:52:12,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-04 18:52:12,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-02-04 18:52:12,896 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 13 [2018-02-04 18:52:12,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:12,897 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-02-04 18:52:12,897 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-04 18:52:12,897 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-02-04 18:52:12,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 18:52:12,897 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:12,897 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:12,897 INFO L371 AbstractCegarLoop]: === Iteration 2 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:52:12,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1969953325, now seen corresponding path program 1 times [2018-02-04 18:52:12,898 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:12,898 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:12,898 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:12,898 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:12,899 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:12,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:12,911 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:12,990 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-04 18:52:12,991 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:52:12,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:52:12,992 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 18:52:12,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 18:52:12,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 18:52:12,992 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 3 states. [2018-02-04 18:52:13,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:13,022 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2018-02-04 18:52:13,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 18:52:13,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-02-04 18:52:13,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:13,024 INFO L225 Difference]: With dead ends: 71 [2018-02-04 18:52:13,024 INFO L226 Difference]: Without dead ends: 71 [2018-02-04 18:52:13,025 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-04 18:52:13,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-02-04 18:52:13,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2018-02-04 18:52:13,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 18:52:13,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-02-04 18:52:13,030 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 14 [2018-02-04 18:52:13,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:13,030 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-02-04 18:52:13,030 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 18:52:13,030 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-02-04 18:52:13,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 18:52:13,031 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:13,031 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:13,031 INFO L371 AbstractCegarLoop]: === Iteration 3 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:52:13,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1297061679, now seen corresponding path program 1 times [2018-02-04 18:52:13,031 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:13,031 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:13,032 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:13,032 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:13,032 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:13,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:13,048 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:13,129 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-04 18:52:13,129 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:52:13,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 18:52:13,130 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 18:52:13,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 18:52:13,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 18:52:13,130 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 6 states. [2018-02-04 18:52:13,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:13,221 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2018-02-04 18:52:13,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 18:52:13,221 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-02-04 18:52:13,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:13,222 INFO L225 Difference]: With dead ends: 85 [2018-02-04 18:52:13,222 INFO L226 Difference]: Without dead ends: 85 [2018-02-04 18:52:13,223 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-02-04 18:52:13,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-04 18:52:13,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2018-02-04 18:52:13,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-02-04 18:52:13,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-02-04 18:52:13,229 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 17 [2018-02-04 18:52:13,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:13,229 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-02-04 18:52:13,229 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 18:52:13,229 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-02-04 18:52:13,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 18:52:13,230 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:13,230 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] [2018-02-04 18:52:13,230 INFO L371 AbstractCegarLoop]: === Iteration 4 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:52:13,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1600184185, now seen corresponding path program 1 times [2018-02-04 18:52:13,230 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:13,230 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:13,231 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:13,232 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:13,232 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:13,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:13,246 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:13,275 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-04 18:52:13,275 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:52:13,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 18:52:13,275 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 18:52:13,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 18:52:13,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:52:13,276 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 5 states. [2018-02-04 18:52:13,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:13,333 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2018-02-04 18:52:13,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:52:13,333 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-02-04 18:52:13,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:13,335 INFO L225 Difference]: With dead ends: 77 [2018-02-04 18:52:13,335 INFO L226 Difference]: Without dead ends: 77 [2018-02-04 18:52:13,336 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 18:52:13,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-04 18:52:13,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-02-04 18:52:13,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 18:52:13,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-02-04 18:52:13,340 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 21 [2018-02-04 18:52:13,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:13,340 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-02-04 18:52:13,340 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 18:52:13,341 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-02-04 18:52:13,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 18:52:13,341 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:13,341 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] [2018-02-04 18:52:13,341 INFO L371 AbstractCegarLoop]: === Iteration 5 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:52:13,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1600184184, now seen corresponding path program 1 times [2018-02-04 18:52:13,341 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:13,341 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:13,342 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:13,342 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:13,342 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:13,354 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:13,405 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-04 18:52:13,405 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:52:13,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 18:52:13,405 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 18:52:13,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 18:52:13,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 18:52:13,406 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 7 states. [2018-02-04 18:52:13,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:13,513 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-02-04 18:52:13,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 18:52:13,514 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-02-04 18:52:13,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:13,514 INFO L225 Difference]: With dead ends: 89 [2018-02-04 18:52:13,514 INFO L226 Difference]: Without dead ends: 89 [2018-02-04 18:52:13,515 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-04 18:52:13,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-04 18:52:13,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2018-02-04 18:52:13,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-04 18:52:13,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-02-04 18:52:13,519 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 21 [2018-02-04 18:52:13,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:13,519 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-02-04 18:52:13,519 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 18:52:13,520 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-02-04 18:52:13,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 18:52:13,520 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:13,520 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, 1, 1] [2018-02-04 18:52:13,520 INFO L371 AbstractCegarLoop]: === Iteration 6 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:52:13,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1759981910, now seen corresponding path program 1 times [2018-02-04 18:52:13,520 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:13,520 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:13,521 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:13,521 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:13,521 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:13,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:13,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:13,559 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-04 18:52:13,560 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:52:13,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 18:52:13,560 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 18:52:13,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 18:52:13,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:52:13,561 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 5 states. [2018-02-04 18:52:13,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:13,584 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2018-02-04 18:52:13,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:52:13,584 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-02-04 18:52:13,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:13,585 INFO L225 Difference]: With dead ends: 91 [2018-02-04 18:52:13,585 INFO L226 Difference]: Without dead ends: 91 [2018-02-04 18:52:13,585 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 18:52:13,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-04 18:52:13,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2018-02-04 18:52:13,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-04 18:52:13,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2018-02-04 18:52:13,593 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 31 [2018-02-04 18:52:13,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:13,593 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2018-02-04 18:52:13,593 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 18:52:13,593 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2018-02-04 18:52:13,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 18:52:13,594 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:13,594 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, 1, 1] [2018-02-04 18:52:13,594 INFO L371 AbstractCegarLoop]: === Iteration 7 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:52:13,594 INFO L82 PathProgramCache]: Analyzing trace with hash 216183673, now seen corresponding path program 1 times [2018-02-04 18:52:13,595 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:13,595 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:13,595 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:13,596 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:13,596 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:13,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:13,613 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:13,619 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:52:13,619 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:52:13,620 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:52:13,620 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:13,653 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:13,684 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-04 18:52:13,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:13,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:13,689 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 18:52:13,706 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:13,708 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 13 [2018-02-04 18:52:13,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:13,711 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-04 18:52:13,711 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-04 18:52:13,750 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~0.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |foo_~#a~0.base| 0)) (<= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) is different from true [2018-02-04 18:52:13,759 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:13,760 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:13,761 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:13,762 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 30 [2018-02-04 18:52:13,763 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:13,773 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-04 18:52:13,773 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-02-04 18:52:13,792 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-04 18:52:13,793 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:52:13,793 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 18:52:13,793 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 18:52:13,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 18:52:13,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2018-02-04 18:52:13,794 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand 8 states. [2018-02-04 18:52:13,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:13,901 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2018-02-04 18:52:13,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 18:52:13,902 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-02-04 18:52:13,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:13,903 INFO L225 Difference]: With dead ends: 105 [2018-02-04 18:52:13,903 INFO L226 Difference]: Without dead ends: 105 [2018-02-04 18:52:13,903 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=38, Unknown=1, NotChecked=12, Total=72 [2018-02-04 18:52:13,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-04 18:52:13,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 91. [2018-02-04 18:52:13,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-04 18:52:13,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2018-02-04 18:52:13,910 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 31 [2018-02-04 18:52:13,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:13,910 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2018-02-04 18:52:13,911 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 18:52:13,911 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2018-02-04 18:52:13,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 18:52:13,911 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:13,912 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, 1, 1] [2018-02-04 18:52:13,912 INFO L371 AbstractCegarLoop]: === Iteration 8 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:52:13,912 INFO L82 PathProgramCache]: Analyzing trace with hash 216183674, now seen corresponding path program 1 times [2018-02-04 18:52:13,912 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:13,912 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:13,913 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:13,913 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:13,913 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:13,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:13,925 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:13,929 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:52:13,929 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:52:13,929 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:52:13,930 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:13,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:13,948 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:13,954 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-04 18:52:13,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:13,964 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-04 18:52:13,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:13,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:13,968 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 18:52:13,994 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (<= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) is different from true [2018-02-04 18:52:14,001 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-04 18:52:14,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:14,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-02-04 18:52:14,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:14,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:14,009 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-02-04 18:52:14,027 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (and (= (store |c_old(#length)| v_prenex_1 (* 4 v_prenex_2)) |c_#length|) (<= (select |c_old(#valid)| v_prenex_1) 0))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |foo_~#a~0.base|)))) is different from true [2018-02-04 18:52:14,043 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:14,045 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-04 18:52:14,046 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:14,063 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:14,063 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:14,064 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 11 treesize of output 12 [2018-02-04 18:52:14,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:14,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:14,072 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:37, output treesize:30 [2018-02-04 18:52:14,097 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-04 18:52:14,098 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:52:14,098 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 18:52:14,098 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 18:52:14,098 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 18:52:14,098 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=29, Unknown=2, NotChecked=22, Total=72 [2018-02-04 18:52:14,098 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand 9 states. [2018-02-04 18:52:14,127 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |foo_~#a~0.base|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (<= (select |c_old(#valid)| |foo_~#a~0.base|) 0)))) is different from true [2018-02-04 18:52:14,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:14,285 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2018-02-04 18:52:14,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 18:52:14,285 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-02-04 18:52:14,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:14,285 INFO L225 Difference]: With dead ends: 136 [2018-02-04 18:52:14,285 INFO L226 Difference]: Without dead ends: 136 [2018-02-04 18:52:14,286 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=50, Unknown=3, NotChecked=48, Total=132 [2018-02-04 18:52:14,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-02-04 18:52:14,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 102. [2018-02-04 18:52:14,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-04 18:52:14,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2018-02-04 18:52:14,289 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 31 [2018-02-04 18:52:14,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:14,289 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2018-02-04 18:52:14,290 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 18:52:14,290 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2018-02-04 18:52:14,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 18:52:14,290 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:14,290 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:14,290 INFO L371 AbstractCegarLoop]: === Iteration 9 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:52:14,290 INFO L82 PathProgramCache]: Analyzing trace with hash -231887552, now seen corresponding path program 1 times [2018-02-04 18:52:14,291 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:14,291 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:14,291 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:14,291 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:14,291 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:14,300 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:14,303 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:52:14,303 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:52:14,303 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:52:14,304 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:14,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:14,332 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:14,334 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-04 18:52:14,334 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:14,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:14,335 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 18:52:14,345 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:14,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-02-04 18:52:14,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:14,347 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-04 18:52:14,347 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-04 18:52:14,365 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~0.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |foo_~#a~0.base| 0)) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) is different from true [2018-02-04 18:52:14,369 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:14,369 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:14,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 18:52:14,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:14,373 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-04 18:52:14,373 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-02-04 18:52:14,398 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:14,400 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:14,407 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 2 case distinctions, treesize of input 17 treesize of output 24 [2018-02-04 18:52:14,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:52:14,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-02-04 18:52:14,427 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:32 [2018-02-04 18:52:14,468 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:52:14,468 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:52:14,468 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 18:52:14,469 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 18:52:14,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 18:52:14,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=66, Unknown=1, NotChecked=16, Total=110 [2018-02-04 18:52:14,469 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand 11 states. [2018-02-04 18:52:14,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:14,622 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2018-02-04 18:52:14,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 18:52:14,622 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2018-02-04 18:52:14,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:14,623 INFO L225 Difference]: With dead ends: 100 [2018-02-04 18:52:14,623 INFO L226 Difference]: Without dead ends: 100 [2018-02-04 18:52:14,623 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=157, Unknown=1, NotChecked=26, Total=240 [2018-02-04 18:52:14,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-02-04 18:52:14,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2018-02-04 18:52:14,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 18:52:14,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2018-02-04 18:52:14,626 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 42 [2018-02-04 18:52:14,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:14,626 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2018-02-04 18:52:14,626 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 18:52:14,626 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2018-02-04 18:52:14,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 18:52:14,627 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:14,627 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:14,627 INFO L371 AbstractCegarLoop]: === Iteration 10 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:52:14,627 INFO L82 PathProgramCache]: Analyzing trace with hash -231887551, now seen corresponding path program 1 times [2018-02-04 18:52:14,627 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:14,627 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:14,628 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:14,628 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:14,628 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:14,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:14,635 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:14,637 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:52:14,637 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:52:14,637 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:52:14,638 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:14,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:14,661 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:14,704 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:14,705 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 21 [2018-02-04 18:52:14,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:14,719 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:14,720 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:14,721 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-04 18:52:14,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:14,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:14,730 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:34, output treesize:27 [2018-02-04 18:52:14,765 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:52:14,765 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:52:14,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 18:52:14,765 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 18:52:14,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 18:52:14,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 18:52:14,766 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand 9 states. [2018-02-04 18:52:14,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:14,947 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2018-02-04 18:52:14,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 18:52:14,947 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-02-04 18:52:14,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:14,948 INFO L225 Difference]: With dead ends: 114 [2018-02-04 18:52:14,949 INFO L226 Difference]: Without dead ends: 114 [2018-02-04 18:52:14,949 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-02-04 18:52:14,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-04 18:52:14,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 99. [2018-02-04 18:52:14,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-04 18:52:14,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2018-02-04 18:52:14,953 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 42 [2018-02-04 18:52:14,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:14,954 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2018-02-04 18:52:14,954 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 18:52:14,954 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2018-02-04 18:52:14,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 18:52:14,955 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:14,955 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:14,955 INFO L371 AbstractCegarLoop]: === Iteration 11 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:52:14,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1401420489, now seen corresponding path program 1 times [2018-02-04 18:52:14,956 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:14,956 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:14,956 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:14,957 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:14,957 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:14,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:14,966 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:15,038 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 18:52:15,038 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:52:15,039 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 18:52:15,039 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 18:52:15,039 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 18:52:15,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 18:52:15,039 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 8 states. [2018-02-04 18:52:15,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:15,116 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2018-02-04 18:52:15,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 18:52:15,117 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2018-02-04 18:52:15,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:15,117 INFO L225 Difference]: With dead ends: 98 [2018-02-04 18:52:15,117 INFO L226 Difference]: Without dead ends: 98 [2018-02-04 18:52:15,118 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-02-04 18:52:15,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-04 18:52:15,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-02-04 18:52:15,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-04 18:52:15,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2018-02-04 18:52:15,120 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 43 [2018-02-04 18:52:15,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:15,120 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2018-02-04 18:52:15,120 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 18:52:15,120 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2018-02-04 18:52:15,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 18:52:15,121 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:15,121 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:15,121 INFO L371 AbstractCegarLoop]: === Iteration 12 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:52:15,121 INFO L82 PathProgramCache]: Analyzing trace with hash 2000127404, now seen corresponding path program 1 times [2018-02-04 18:52:15,121 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:15,121 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:15,122 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:15,122 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:15,122 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:15,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:15,127 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:15,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:52:15,154 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:52:15,154 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:52:15,155 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:15,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:15,166 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:15,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:52:15,173 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:52:15,173 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-02-04 18:52:15,173 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 18:52:15,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 18:52:15,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:52:15,174 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand 5 states. [2018-02-04 18:52:15,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:15,193 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2018-02-04 18:52:15,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 18:52:15,193 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-02-04 18:52:15,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:15,194 INFO L225 Difference]: With dead ends: 99 [2018-02-04 18:52:15,194 INFO L226 Difference]: Without dead ends: 99 [2018-02-04 18:52:15,194 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:52:15,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-02-04 18:52:15,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 93. [2018-02-04 18:52:15,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-04 18:52:15,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2018-02-04 18:52:15,198 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 44 [2018-02-04 18:52:15,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:15,198 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2018-02-04 18:52:15,198 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 18:52:15,198 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2018-02-04 18:52:15,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 18:52:15,199 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:15,199 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:15,199 INFO L371 AbstractCegarLoop]: === Iteration 13 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:52:15,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1644784265, now seen corresponding path program 1 times [2018-02-04 18:52:15,199 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:15,200 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:15,200 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:15,200 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:15,200 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:15,208 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:15,262 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:52:15,262 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:52:15,262 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:52:15,263 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:15,277 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:15,309 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:52:15,309 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:52:15,309 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2018-02-04 18:52:15,310 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 18:52:15,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 18:52:15,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-02-04 18:52:15,310 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand 9 states. [2018-02-04 18:52:15,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:15,393 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2018-02-04 18:52:15,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 18:52:15,393 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2018-02-04 18:52:15,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:15,394 INFO L225 Difference]: With dead ends: 96 [2018-02-04 18:52:15,394 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 18:52:15,394 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-02-04 18:52:15,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 18:52:15,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2018-02-04 18:52:15,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-04 18:52:15,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2018-02-04 18:52:15,397 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 46 [2018-02-04 18:52:15,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:15,398 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2018-02-04 18:52:15,398 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 18:52:15,398 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2018-02-04 18:52:15,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 18:52:15,399 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:15,399 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:15,399 INFO L371 AbstractCegarLoop]: === Iteration 14 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:52:15,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1169266089, now seen corresponding path program 1 times [2018-02-04 18:52:15,399 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:15,399 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:15,400 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:15,400 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:15,400 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:15,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:15,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:15,469 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:52:15,469 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:52:15,469 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:52:15,470 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:15,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:15,484 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:15,552 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:52:15,552 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:52:15,552 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-02-04 18:52:15,553 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 18:52:15,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 18:52:15,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-02-04 18:52:15,553 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand 15 states. [2018-02-04 18:52:15,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:15,744 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2018-02-04 18:52:15,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 18:52:15,744 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48 [2018-02-04 18:52:15,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:15,745 INFO L225 Difference]: With dead ends: 121 [2018-02-04 18:52:15,745 INFO L226 Difference]: Without dead ends: 121 [2018-02-04 18:52:15,745 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-02-04 18:52:15,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-04 18:52:15,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 116. [2018-02-04 18:52:15,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-04 18:52:15,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 124 transitions. [2018-02-04 18:52:15,749 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 124 transitions. Word has length 48 [2018-02-04 18:52:15,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:15,749 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 124 transitions. [2018-02-04 18:52:15,749 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 18:52:15,749 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 124 transitions. [2018-02-04 18:52:15,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 18:52:15,750 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:15,750 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:15,750 INFO L371 AbstractCegarLoop]: === Iteration 15 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:52:15,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1096362099, now seen corresponding path program 1 times [2018-02-04 18:52:15,750 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:15,751 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:15,751 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:15,751 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:15,751 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:15,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:15,761 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:15,843 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 18:52:15,844 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:52:15,844 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 18:52:15,844 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 18:52:15,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 18:52:15,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 18:52:15,844 INFO L87 Difference]: Start difference. First operand 116 states and 124 transitions. Second operand 8 states. [2018-02-04 18:52:15,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:15,982 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2018-02-04 18:52:15,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 18:52:15,983 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2018-02-04 18:52:15,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:15,984 INFO L225 Difference]: With dead ends: 119 [2018-02-04 18:52:15,984 INFO L226 Difference]: Without dead ends: 119 [2018-02-04 18:52:15,984 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-02-04 18:52:15,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-04 18:52:15,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-02-04 18:52:15,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-04 18:52:15,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 125 transitions. [2018-02-04 18:52:15,988 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 125 transitions. Word has length 52 [2018-02-04 18:52:15,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:15,989 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 125 transitions. [2018-02-04 18:52:15,989 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 18:52:15,989 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 125 transitions. [2018-02-04 18:52:15,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-04 18:52:15,990 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:15,990 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:15,990 INFO L371 AbstractCegarLoop]: === Iteration 16 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:52:15,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1224161946, now seen corresponding path program 1 times [2018-02-04 18:52:15,990 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:15,990 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:15,991 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:15,991 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:15,992 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:16,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:16,002 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:16,100 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 18:52:16,100 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:52:16,101 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:52:16,101 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:16,117 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:16,171 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 18:52:16,171 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:52:16,171 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2018-02-04 18:52:16,172 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 18:52:16,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 18:52:16,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-02-04 18:52:16,172 INFO L87 Difference]: Start difference. First operand 117 states and 125 transitions. Second operand 16 states. [2018-02-04 18:52:16,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:16,510 INFO L93 Difference]: Finished difference Result 171 states and 181 transitions. [2018-02-04 18:52:16,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 18:52:16,510 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 57 [2018-02-04 18:52:16,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:16,511 INFO L225 Difference]: With dead ends: 171 [2018-02-04 18:52:16,511 INFO L226 Difference]: Without dead ends: 171 [2018-02-04 18:52:16,512 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=627, Unknown=0, NotChecked=0, Total=756 [2018-02-04 18:52:16,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-02-04 18:52:16,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 151. [2018-02-04 18:52:16,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-04 18:52:16,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2018-02-04 18:52:16,517 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 57 [2018-02-04 18:52:16,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:16,517 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2018-02-04 18:52:16,518 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 18:52:16,518 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2018-02-04 18:52:16,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-04 18:52:16,518 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:16,518 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 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] [2018-02-04 18:52:16,520 INFO L371 AbstractCegarLoop]: === Iteration 17 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:52:16,520 INFO L82 PathProgramCache]: Analyzing trace with hash -227989441, now seen corresponding path program 1 times [2018-02-04 18:52:16,520 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:16,520 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:16,521 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:16,521 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:16,521 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:16,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:16,533 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:16,618 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 18:52:16,618 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:52:16,618 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:52:16,619 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:16,633 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:16,680 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 18:52:16,680 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:52:16,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2018-02-04 18:52:16,680 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 18:52:16,680 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 18:52:16,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-04 18:52:16,681 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand 12 states. [2018-02-04 18:52:16,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:16,803 INFO L93 Difference]: Finished difference Result 149 states and 155 transitions. [2018-02-04 18:52:16,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 18:52:16,804 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2018-02-04 18:52:16,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:16,804 INFO L225 Difference]: With dead ends: 149 [2018-02-04 18:52:16,804 INFO L226 Difference]: Without dead ends: 140 [2018-02-04 18:52:16,805 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-02-04 18:52:16,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-02-04 18:52:16,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2018-02-04 18:52:16,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-02-04 18:52:16,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 144 transitions. [2018-02-04 18:52:16,807 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 144 transitions. Word has length 62 [2018-02-04 18:52:16,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:16,807 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 144 transitions. [2018-02-04 18:52:16,807 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 18:52:16,807 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 144 transitions. [2018-02-04 18:52:16,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 18:52:16,808 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:16,808 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:16,808 INFO L371 AbstractCegarLoop]: === Iteration 18 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:52:16,808 INFO L82 PathProgramCache]: Analyzing trace with hash 897277161, now seen corresponding path program 1 times [2018-02-04 18:52:16,808 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:16,808 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:16,809 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:16,809 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:16,809 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:16,822 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:16,835 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:52:16,835 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:52:16,835 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:52:16,836 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:16,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:16,854 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:16,868 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-04 18:52:16,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:16,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:16,871 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:52:16,891 WARN L1033 $PredicateComparison]: unable to prove that (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) is different from true [2018-02-04 18:52:16,896 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-04 18:52:16,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:16,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:16,898 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:52:16,912 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_3| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_3|))) (exists ((v_prenex_5 Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_5)) |c_#length|))) is different from true [2018-02-04 18:52:16,918 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-04 18:52:16,918 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:16,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:16,926 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:52:16,928 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (v_prenex_5 Int)) (and (= 0 (select |c_#valid| |foo_~#a~0.base|)) (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_5)) |c_#length|))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_3| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_3|)))) is different from true [2018-02-04 18:52:16,945 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 2 case distinctions, treesize of input 14 treesize of output 17 [2018-02-04 18:52:16,946 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:52:16,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-02-04 18:52:16,963 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:58 [2018-02-04 18:52:17,087 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) is different from true [2018-02-04 18:52:17,098 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-04 18:52:17,098 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:17,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 18:52:17,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:17,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:17,104 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-02-04 18:52:17,128 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (= (* 4 v_prenex_9) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_3|)))) is different from true [2018-02-04 18:52:17,140 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:17,141 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:17,143 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:17,143 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 16 treesize of output 9 [2018-02-04 18:52:17,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:17,169 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 2 case distinctions, treesize of input 21 treesize of output 32 [2018-02-04 18:52:17,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 18:52:17,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-02-04 18:52:17,197 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:49, output treesize:72 [2018-02-04 18:52:17,235 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 10 not checked. [2018-02-04 18:52:17,235 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:52:17,235 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 18:52:17,235 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 18:52:17,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 18:52:17,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=82, Unknown=5, NotChecked=110, Total=240 [2018-02-04 18:52:17,235 INFO L87 Difference]: Start difference. First operand 138 states and 144 transitions. Second operand 16 states. [2018-02-04 18:52:17,266 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_3| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_3|))) (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|))) is different from true [2018-02-04 18:52:17,267 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|))) is different from true [2018-02-04 18:52:17,278 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (= (* 4 v_prenex_9) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_3|))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_3| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_3|))) (exists ((v_prenex_5 Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_5)) |c_#length|))) is different from true [2018-02-04 18:52:17,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:17,378 INFO L93 Difference]: Finished difference Result 161 states and 170 transitions. [2018-02-04 18:52:17,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 18:52:17,379 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2018-02-04 18:52:17,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:17,379 INFO L225 Difference]: With dead ends: 161 [2018-02-04 18:52:17,379 INFO L226 Difference]: Without dead ends: 161 [2018-02-04 18:52:17,380 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=119, Unknown=8, NotChecked=232, Total=420 [2018-02-04 18:52:17,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-04 18:52:17,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 151. [2018-02-04 18:52:17,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-04 18:52:17,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 159 transitions. [2018-02-04 18:52:17,383 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 159 transitions. Word has length 67 [2018-02-04 18:52:17,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:17,384 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 159 transitions. [2018-02-04 18:52:17,384 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 18:52:17,384 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 159 transitions. [2018-02-04 18:52:17,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 18:52:17,384 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:17,384 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 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, 1] [2018-02-04 18:52:17,385 INFO L371 AbstractCegarLoop]: === Iteration 19 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:52:17,385 INFO L82 PathProgramCache]: Analyzing trace with hash -646521076, now seen corresponding path program 1 times [2018-02-04 18:52:17,385 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:17,385 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:17,386 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:17,386 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:17,386 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:17,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:17,396 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:17,405 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:52:17,405 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:52:17,405 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:52:17,406 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:17,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:17,422 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:17,447 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-04 18:52:17,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:17,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:17,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:52:17,460 WARN L1033 $PredicateComparison]: unable to prove that (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) is different from true [2018-02-04 18:52:17,462 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-04 18:52:17,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:17,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:17,463 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:52:17,474 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_4| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_4|))) (exists ((v_prenex_15 Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_15)) |c_#length|))) is different from true [2018-02-04 18:52:17,477 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-04 18:52:17,477 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:17,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:17,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:52:17,483 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_4| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_4|))) (exists ((v_prenex_15 Int) (|foo_~#a~0.base| Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_15)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:52:17,493 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 2 case distinctions, treesize of input 14 treesize of output 17 [2018-02-04 18:52:17,493 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:52:17,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-02-04 18:52:17,506 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:58 [2018-02-04 18:52:17,582 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) is different from true [2018-02-04 18:52:17,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 18:52:17,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:17,590 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-04 18:52:17,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:17,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:17,591 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-02-04 18:52:17,601 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_4| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_4|))) (exists ((|foo_~#a~0.base| Int) (v_prenex_19 Int)) (and (= (select |c_old(#valid)| |foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_19)))))) is different from true [2018-02-04 18:52:17,610 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:17,611 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:17,623 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 2 case distinctions, treesize of input 21 treesize of output 32 [2018-02-04 18:52:17,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:52:17,649 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:17,650 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:17,651 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:17,652 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 16 treesize of output 9 [2018-02-04 18:52:17,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:17,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-02-04 18:52:17,666 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:49, output treesize:72 [2018-02-04 18:52:17,701 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 12 not checked. [2018-02-04 18:52:17,701 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:52:17,701 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 18:52:17,701 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 18:52:17,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 18:52:17,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=82, Unknown=5, NotChecked=110, Total=240 [2018-02-04 18:52:17,702 INFO L87 Difference]: Start difference. First operand 151 states and 159 transitions. Second operand 16 states. [2018-02-04 18:52:17,735 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_4| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_4|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|))) is different from true [2018-02-04 18:52:17,737 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|))) is different from true [2018-02-04 18:52:17,745 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_4| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_4|))) (exists ((v_prenex_15 Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_15)) |c_#length|)) (exists ((|foo_~#a~0.base| Int) (v_prenex_19 Int)) (and (= (select |c_old(#valid)| |foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_19)))))) is different from true [2018-02-04 18:52:17,747 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_4| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_4|))) (exists ((v_prenex_15 Int) (|foo_~#a~0.base| Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_15)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|)))) (exists ((|foo_~#a~0.base| Int) (v_prenex_19 Int)) (and (= (select |c_old(#valid)| |foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_19)))))) is different from true [2018-02-04 18:52:17,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:17,834 INFO L93 Difference]: Finished difference Result 172 states and 183 transitions. [2018-02-04 18:52:17,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 18:52:17,834 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2018-02-04 18:52:17,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:17,835 INFO L225 Difference]: With dead ends: 172 [2018-02-04 18:52:17,835 INFO L226 Difference]: Without dead ends: 172 [2018-02-04 18:52:17,835 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=120, Unknown=9, NotChecked=270, Total=462 [2018-02-04 18:52:17,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-02-04 18:52:17,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 149. [2018-02-04 18:52:17,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-02-04 18:52:17,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 157 transitions. [2018-02-04 18:52:17,839 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 157 transitions. Word has length 67 [2018-02-04 18:52:17,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:17,839 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 157 transitions. [2018-02-04 18:52:17,839 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 18:52:17,839 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 157 transitions. [2018-02-04 18:52:17,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-04 18:52:17,840 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:17,840 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:17,840 INFO L371 AbstractCegarLoop]: === Iteration 20 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:52:17,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1591994525, now seen corresponding path program 1 times [2018-02-04 18:52:17,840 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:17,840 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:17,841 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:17,841 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:17,841 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:17,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:17,850 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:17,886 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-04 18:52:17,887 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:52:17,887 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:52:17,888 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:17,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:17,902 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:17,914 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-04 18:52:17,914 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:52:17,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-02-04 18:52:17,915 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 18:52:17,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 18:52:17,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-04 18:52:17,915 INFO L87 Difference]: Start difference. First operand 149 states and 157 transitions. Second operand 6 states. [2018-02-04 18:52:17,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:17,942 INFO L93 Difference]: Finished difference Result 150 states and 157 transitions. [2018-02-04 18:52:17,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:52:17,944 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2018-02-04 18:52:17,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:17,945 INFO L225 Difference]: With dead ends: 150 [2018-02-04 18:52:17,945 INFO L226 Difference]: Without dead ends: 150 [2018-02-04 18:52:17,945 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-04 18:52:17,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-04 18:52:17,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 144. [2018-02-04 18:52:17,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-04 18:52:17,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 150 transitions. [2018-02-04 18:52:17,949 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 150 transitions. Word has length 80 [2018-02-04 18:52:17,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:17,950 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 150 transitions. [2018-02-04 18:52:17,950 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 18:52:17,950 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 150 transitions. [2018-02-04 18:52:17,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-04 18:52:17,950 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:17,950 INFO L351 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2018-02-04 18:52:17,951 INFO L371 AbstractCegarLoop]: === Iteration 21 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:52:17,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1581116616, now seen corresponding path program 1 times [2018-02-04 18:52:17,951 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:17,951 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:17,951 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:17,952 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:17,952 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:17,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:17,964 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:17,970 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:52:17,970 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:52:17,970 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:52:17,970 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:18,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:18,004 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:18,026 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-04 18:52:18,028 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-04 18:52:18,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:18,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:18,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:18,032 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-02-04 18:52:18,118 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 15 treesize of output 28 [2018-02-04 18:52:18,119 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 17 treesize of output 16 [2018-02-04 18:52:18,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:18,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:18,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:18,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:19, output treesize:15 [2018-02-04 18:52:18,205 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~0.base| Int) (foo_~b.offset Int) (bar_~b.offset Int) (bar_~i~0 Int)) (let ((.cse0 (+ bar_~b.offset (* 4 bar_~i~0)))) (and (= (store |c_old(#memory_int)| |foo_~#a~0.base| (store (select |c_old(#memory_int)| |foo_~#a~0.base|) 0 (select (select |c_old(#memory_int)| |c_foo_#in~b.base|) foo_~b.offset))) |c_#memory_int|) (<= 0 foo_~b.offset) (<= 0 .cse0) (= (select (select |c_#memory_int| |foo_~#a~0.base|) .cse0) |c_foo_#t~ret5|) (<= bar_~b.offset 0) (<= bar_~i~0 0) (<= foo_~b.offset |c_foo_#in~b.offset|)))) is different from true [2018-02-04 18:52:18,249 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 45 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2018-02-04 18:52:18,250 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:52:18,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 18:52:18,250 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 18:52:18,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 18:52:18,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=283, Unknown=13, NotChecked=34, Total=380 [2018-02-04 18:52:18,250 INFO L87 Difference]: Start difference. First operand 144 states and 150 transitions. Second operand 20 states. [2018-02-04 18:52:18,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:18,843 INFO L93 Difference]: Finished difference Result 167 states and 174 transitions. [2018-02-04 18:52:18,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 18:52:18,843 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 84 [2018-02-04 18:52:18,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:18,844 INFO L225 Difference]: With dead ends: 167 [2018-02-04 18:52:18,844 INFO L226 Difference]: Without dead ends: 163 [2018-02-04 18:52:18,844 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=959, Unknown=33, NotChecked=64, Total=1190 [2018-02-04 18:52:18,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-04 18:52:18,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 142. [2018-02-04 18:52:18,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-04 18:52:18,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 147 transitions. [2018-02-04 18:52:18,847 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 147 transitions. Word has length 84 [2018-02-04 18:52:18,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:18,847 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 147 transitions. [2018-02-04 18:52:18,847 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 18:52:18,847 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 147 transitions. [2018-02-04 18:52:18,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-04 18:52:18,847 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:18,847 INFO L351 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2018-02-04 18:52:18,847 INFO L371 AbstractCegarLoop]: === Iteration 22 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:52:18,848 INFO L82 PathProgramCache]: Analyzing trace with hash -999779067, now seen corresponding path program 1 times [2018-02-04 18:52:18,848 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:18,848 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:18,848 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:18,848 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:18,848 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:18,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:18,856 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:18,859 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:52:18,859 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:52:18,859 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:52:18,860 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:18,880 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:18,901 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-04 18:52:18,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:18,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:18,905 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:52:18,914 WARN L1033 $PredicateComparison]: unable to prove that (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) is different from true [2018-02-04 18:52:18,917 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-04 18:52:18,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:18,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:18,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:52:18,930 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) (exists ((v_prenex_26 Int) (|v_foo_~#a~0.base_BEFORE_CALL_6| Int)) (= (* 4 v_prenex_26) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_6|)))) is different from true [2018-02-04 18:52:18,935 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-04 18:52:18,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:18,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:18,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:52:18,942 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_26 Int) (|v_foo_~#a~0.base_BEFORE_CALL_6| Int)) (= (* 4 v_prenex_26) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_6|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:52:18,954 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 2 case distinctions, treesize of input 14 treesize of output 17 [2018-02-04 18:52:18,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:52:18,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-02-04 18:52:18,966 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:29, output treesize:52 [2018-02-04 18:52:19,011 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:19,012 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:19,012 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 26 treesize of output 20 [2018-02-04 18:52:19,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:19,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:19,022 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:20 [2018-02-04 18:52:19,046 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-04 18:52:19,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:19,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:19,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:52:19,064 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) (exists ((v_prenex_31 Int) (|v_foo_~#a~0.base_BEFORE_CALL_6| Int)) (= (* 4 v_prenex_31) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_6|)))) is different from true [2018-02-04 18:52:19,069 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-04 18:52:19,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:19,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:19,075 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:52:19,077 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_31 Int) (|v_foo_~#a~0.base_BEFORE_CALL_6| Int)) (= (* 4 v_prenex_31) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_6|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:52:19,099 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 21 treesize of output 32 [2018-02-04 18:52:19,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:52:19,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-02-04 18:52:19,131 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:40, output treesize:106 [2018-02-04 18:52:19,263 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:19,264 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:19,270 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 2 case distinctions, treesize of input 21 treesize of output 32 [2018-02-04 18:52:19,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:52:19,287 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:19,288 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:19,289 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:19,289 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 16 treesize of output 9 [2018-02-04 18:52:19,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:19,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-04 18:52:19,300 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:39, output treesize:52 [2018-02-04 18:52:19,406 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 25 not checked. [2018-02-04 18:52:19,406 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:52:19,406 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 18:52:19,407 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 18:52:19,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 18:52:19,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=166, Unknown=5, NotChecked=150, Total=380 [2018-02-04 18:52:19,407 INFO L87 Difference]: Start difference. First operand 142 states and 147 transitions. Second operand 20 states. [2018-02-04 18:52:19,444 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) (exists ((foo_~n Int) (|v_foo_~#a~0.base_BEFORE_CALL_6| Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_6|)))) is different from true [2018-02-04 18:52:19,473 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) (exists ((v_prenex_31 Int) (|v_foo_~#a~0.base_BEFORE_CALL_6| Int)) (= (* 4 v_prenex_31) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_6|))) (exists ((v_prenex_26 Int) (|v_foo_~#a~0.base_BEFORE_CALL_6| Int)) (= (* 4 v_prenex_26) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_6|)))) is different from true [2018-02-04 18:52:19,477 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_31 Int) (|v_foo_~#a~0.base_BEFORE_CALL_6| Int)) (= (* 4 v_prenex_31) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_6|))) (exists ((v_prenex_26 Int) (|v_foo_~#a~0.base_BEFORE_CALL_6| Int)) (= (* 4 v_prenex_26) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_6|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:52:19,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:19,994 INFO L93 Difference]: Finished difference Result 228 states and 244 transitions. [2018-02-04 18:52:19,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 18:52:19,996 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 84 [2018-02-04 18:52:19,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:19,996 INFO L225 Difference]: With dead ends: 228 [2018-02-04 18:52:19,996 INFO L226 Difference]: Without dead ends: 228 [2018-02-04 18:52:19,997 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=126, Invalid=483, Unknown=23, NotChecked=424, Total=1056 [2018-02-04 18:52:19,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-02-04 18:52:20,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 179. [2018-02-04 18:52:20,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-02-04 18:52:20,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 192 transitions. [2018-02-04 18:52:20,001 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 192 transitions. Word has length 84 [2018-02-04 18:52:20,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:20,002 INFO L432 AbstractCegarLoop]: Abstraction has 179 states and 192 transitions. [2018-02-04 18:52:20,002 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 18:52:20,002 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 192 transitions. [2018-02-04 18:52:20,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-02-04 18:52:20,003 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:20,003 INFO L351 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2018-02-04 18:52:20,003 INFO L371 AbstractCegarLoop]: === Iteration 23 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:52:20,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1195020517, now seen corresponding path program 2 times [2018-02-04 18:52:20,003 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:20,003 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:20,004 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:20,004 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:20,004 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:20,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:20,015 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:20,111 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 40 proven. 18 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-02-04 18:52:20,111 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:52:20,111 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:52:20,112 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:52:20,133 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 18:52:20,133 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:52:20,136 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:20,217 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 45 proven. 13 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-02-04 18:52:20,217 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:52:20,217 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-02-04 18:52:20,218 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 18:52:20,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 18:52:20,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2018-02-04 18:52:20,218 INFO L87 Difference]: Start difference. First operand 179 states and 192 transitions. Second operand 19 states. [2018-02-04 18:52:20,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:20,446 INFO L93 Difference]: Finished difference Result 228 states and 247 transitions. [2018-02-04 18:52:20,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 18:52:20,446 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 90 [2018-02-04 18:52:20,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:20,447 INFO L225 Difference]: With dead ends: 228 [2018-02-04 18:52:20,447 INFO L226 Difference]: Without dead ends: 228 [2018-02-04 18:52:20,447 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2018-02-04 18:52:20,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-02-04 18:52:20,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 209. [2018-02-04 18:52:20,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-02-04 18:52:20,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 226 transitions. [2018-02-04 18:52:20,450 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 226 transitions. Word has length 90 [2018-02-04 18:52:20,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:20,451 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 226 transitions. [2018-02-04 18:52:20,451 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 18:52:20,451 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 226 transitions. [2018-02-04 18:52:20,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-04 18:52:20,451 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:20,451 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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-04 18:52:20,451 INFO L371 AbstractCegarLoop]: === Iteration 24 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:52:20,451 INFO L82 PathProgramCache]: Analyzing trace with hash -832613802, now seen corresponding path program 2 times [2018-02-04 18:52:20,451 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:20,452 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:20,452 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:20,452 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:52:20,452 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:20,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:20,461 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:20,569 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 54 proven. 7 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-02-04 18:52:20,569 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:52:20,569 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:52:20,570 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:52:20,589 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 18:52:20,589 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:52:20,592 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:20,611 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-04 18:52:20,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:20,616 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-04 18:52:20,617 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-02-04 18:52:20,739 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 54 proven. 1 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-02-04 18:52:20,739 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:52:20,739 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-02-04 18:52:20,740 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 18:52:20,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 18:52:20,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-02-04 18:52:20,740 INFO L87 Difference]: Start difference. First operand 209 states and 226 transitions. Second operand 16 states. [2018-02-04 18:52:21,410 WARN L146 SmtUtils]: Spent 407ms on a formula simplification. DAG size of input: 25 DAG size of output 24 [2018-02-04 18:52:21,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:21,599 INFO L93 Difference]: Finished difference Result 233 states and 256 transitions. [2018-02-04 18:52:21,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 18:52:21,599 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 99 [2018-02-04 18:52:21,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:21,601 INFO L225 Difference]: With dead ends: 233 [2018-02-04 18:52:21,601 INFO L226 Difference]: Without dead ends: 233 [2018-02-04 18:52:21,601 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2018-02-04 18:52:21,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-02-04 18:52:21,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 207. [2018-02-04 18:52:21,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-02-04 18:52:21,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 224 transitions. [2018-02-04 18:52:21,605 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 224 transitions. Word has length 99 [2018-02-04 18:52:21,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:21,606 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 224 transitions. [2018-02-04 18:52:21,606 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 18:52:21,606 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 224 transitions. [2018-02-04 18:52:21,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-02-04 18:52:21,606 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:21,606 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-02-04 18:52:21,607 INFO L371 AbstractCegarLoop]: === Iteration 25 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:52:21,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1370708101, now seen corresponding path program 2 times [2018-02-04 18:52:21,607 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:21,607 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:21,608 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:21,608 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:52:21,608 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:21,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:21,622 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:21,769 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 45 proven. 37 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-02-04 18:52:21,769 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:52:21,769 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:52:21,770 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:52:21,783 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 18:52:21,784 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:52:21,786 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:21,824 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 47 proven. 2 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-02-04 18:52:21,824 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:52:21,825 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 17 [2018-02-04 18:52:21,825 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 18:52:21,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 18:52:21,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-02-04 18:52:21,826 INFO L87 Difference]: Start difference. First operand 207 states and 224 transitions. Second operand 17 states. [2018-02-04 18:52:22,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:22,152 INFO L93 Difference]: Finished difference Result 243 states and 258 transitions. [2018-02-04 18:52:22,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 18:52:22,153 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 103 [2018-02-04 18:52:22,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:22,154 INFO L225 Difference]: With dead ends: 243 [2018-02-04 18:52:22,154 INFO L226 Difference]: Without dead ends: 201 [2018-02-04 18:52:22,154 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=703, Unknown=0, NotChecked=0, Total=870 [2018-02-04 18:52:22,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-02-04 18:52:22,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 193. [2018-02-04 18:52:22,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-04 18:52:22,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 205 transitions. [2018-02-04 18:52:22,158 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 205 transitions. Word has length 103 [2018-02-04 18:52:22,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:22,159 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 205 transitions. [2018-02-04 18:52:22,159 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 18:52:22,159 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 205 transitions. [2018-02-04 18:52:22,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-02-04 18:52:22,160 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:22,160 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:22,160 INFO L371 AbstractCegarLoop]: === Iteration 26 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:52:22,160 INFO L82 PathProgramCache]: Analyzing trace with hash -52037211, now seen corresponding path program 3 times [2018-02-04 18:52:22,160 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:22,160 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:22,161 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:22,161 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:52:22,161 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:22,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:22,173 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:22,318 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 68 proven. 9 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-02-04 18:52:22,319 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:52:22,319 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:52:22,319 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 18:52:22,345 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-02-04 18:52:22,345 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:52:22,349 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:22,435 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 78 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-02-04 18:52:22,436 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:52:22,436 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2018-02-04 18:52:22,436 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 18:52:22,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 18:52:22,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-02-04 18:52:22,437 INFO L87 Difference]: Start difference. First operand 193 states and 205 transitions. Second operand 19 states. [2018-02-04 18:52:22,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:22,682 INFO L93 Difference]: Finished difference Result 232 states and 245 transitions. [2018-02-04 18:52:22,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 18:52:22,682 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 109 [2018-02-04 18:52:22,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:22,683 INFO L225 Difference]: With dead ends: 232 [2018-02-04 18:52:22,683 INFO L226 Difference]: Without dead ends: 201 [2018-02-04 18:52:22,683 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2018-02-04 18:52:22,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-02-04 18:52:22,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2018-02-04 18:52:22,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-02-04 18:52:22,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 210 transitions. [2018-02-04 18:52:22,687 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 210 transitions. Word has length 109 [2018-02-04 18:52:22,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:22,687 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 210 transitions. [2018-02-04 18:52:22,688 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 18:52:22,688 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 210 transitions. [2018-02-04 18:52:22,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-02-04 18:52:22,688 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:22,688 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:22,688 INFO L371 AbstractCegarLoop]: === Iteration 27 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:52:22,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1577506560, now seen corresponding path program 4 times [2018-02-04 18:52:22,689 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:22,689 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:22,689 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:22,689 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:52:22,690 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:22,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:22,703 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:22,718 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:52:22,718 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:52:22,718 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:52:22,719 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 18:52:22,763 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 18:52:22,763 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:52:22,769 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:22,776 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-04 18:52:22,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:22,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:22,780 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:52:22,796 WARN L1033 $PredicateComparison]: unable to prove that (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) is different from true [2018-02-04 18:52:22,800 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-04 18:52:22,800 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:22,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:22,802 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:52:22,813 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_9| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_9|))) (exists ((v_prenex_46 Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_46)) |c_#length|))) is different from true [2018-02-04 18:52:22,817 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-04 18:52:22,817 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:22,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:22,823 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:52:22,826 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_9| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_9|))) (exists ((|foo_~#a~0.base| Int) (v_prenex_46 Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_46)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:52:22,844 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 2 case distinctions, treesize of input 14 treesize of output 17 [2018-02-04 18:52:22,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:52:22,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-02-04 18:52:22,860 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:58 [2018-02-04 18:52:22,892 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:52:22,892 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:22,900 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:22,901 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:22,901 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-04 18:52:22,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:22,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:22,907 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:68, output treesize:30 [2018-02-04 18:52:22,936 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-04 18:52:22,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:22,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:22,937 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:52:22,947 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_9| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_9|))) (exists ((v_prenex_51 Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_51)) |c_#length|))) is different from true [2018-02-04 18:52:22,951 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-04 18:52:22,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:22,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:22,956 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:52:22,958 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_9| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_9|))) (exists ((|foo_~#a~0.base| Int) (v_prenex_51 Int)) (and (= 0 (select |c_#valid| |foo_~#a~0.base|)) (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_51)) |c_#length|)))) is different from true [2018-02-04 18:52:22,976 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 21 treesize of output 32 [2018-02-04 18:52:22,977 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:52:23,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-02-04 18:52:23,002 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:50, output treesize:136 [2018-02-04 18:52:23,118 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (<= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) is different from true [2018-02-04 18:52:23,151 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-04 18:52:23,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:23,155 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-02-04 18:52:23,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:23,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:23,157 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-02-04 18:52:23,188 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_9| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_9|))) (exists ((|foo_~#a~0.base| Int) (v_prenex_62 Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_62)) |c_#length|) (<= (select |c_old(#valid)| |foo_~#a~0.base|) 0)))) is different from true [2018-02-04 18:52:23,195 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:23,196 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:23,197 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:23,198 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:23,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 24 [2018-02-04 18:52:23,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:52:23,240 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 2 case distinctions, treesize of input 21 treesize of output 32 [2018-02-04 18:52:23,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 18:52:23,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-02-04 18:52:23,261 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:56, output treesize:86 [2018-02-04 18:52:23,322 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 71 trivial. 44 not checked. [2018-02-04 18:52:23,322 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:52:23,322 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 18:52:23,322 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 18:52:23,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 18:52:23,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=144, Unknown=7, NotChecked=210, Total=420 [2018-02-04 18:52:23,323 INFO L87 Difference]: Start difference. First operand 198 states and 210 transitions. Second operand 21 states. [2018-02-04 18:52:23,385 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_9| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_9|))) (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (<= (select |c_old(#valid)| |foo_~#a~0.base|) 0)))) is different from true [2018-02-04 18:52:23,387 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (<= (select |c_old(#valid)| |foo_~#a~0.base|) 0)))) is different from true [2018-02-04 18:52:23,404 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_9| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_9|))) (exists ((v_prenex_46 Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_46)) |c_#length|)) (exists ((v_prenex_51 Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_51)) |c_#length|)) (exists ((|foo_~#a~0.base| Int) (v_prenex_62 Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_62)) |c_#length|) (<= (select |c_old(#valid)| |foo_~#a~0.base|) 0)))) is different from true [2018-02-04 18:52:23,406 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_9| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_9|))) (exists ((v_prenex_46 Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_46)) |c_#length|)) (exists ((v_prenex_51 Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_51)) |c_#length|))) is different from true [2018-02-04 18:52:23,408 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_9| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_9|))) (exists ((|foo_~#a~0.base| Int) (v_prenex_46 Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_46)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|)))) (exists ((|foo_~#a~0.base| Int) (v_prenex_51 Int)) (and (= 0 (select |c_#valid| |foo_~#a~0.base|)) (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_51)) |c_#length|)))) is different from true [2018-02-04 18:52:23,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:23,616 INFO L93 Difference]: Finished difference Result 220 states and 235 transitions. [2018-02-04 18:52:23,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 18:52:23,616 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 114 [2018-02-04 18:52:23,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:23,617 INFO L225 Difference]: With dead ends: 220 [2018-02-04 18:52:23,617 INFO L226 Difference]: Without dead ends: 220 [2018-02-04 18:52:23,617 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=12, NotChecked=516, Total=870 [2018-02-04 18:52:23,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-02-04 18:52:23,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 200. [2018-02-04 18:52:23,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-02-04 18:52:23,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 212 transitions. [2018-02-04 18:52:23,622 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 212 transitions. Word has length 114 [2018-02-04 18:52:23,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:23,623 INFO L432 AbstractCegarLoop]: Abstraction has 200 states and 212 transitions. [2018-02-04 18:52:23,623 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 18:52:23,623 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 212 transitions. [2018-02-04 18:52:23,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-02-04 18:52:23,624 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:23,624 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:23,624 INFO L371 AbstractCegarLoop]: === Iteration 28 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:52:23,624 INFO L82 PathProgramCache]: Analyzing trace with hash 33708323, now seen corresponding path program 2 times [2018-02-04 18:52:23,624 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:23,624 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:23,625 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:23,625 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:52:23,625 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:23,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:23,639 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:23,654 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:52:23,654 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:52:23,654 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:52:23,654 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:52:23,676 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 18:52:23,676 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:52:23,680 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:23,695 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-04 18:52:23,695 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:23,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:23,699 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:52:23,720 WARN L1033 $PredicateComparison]: unable to prove that (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) is different from true [2018-02-04 18:52:23,722 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-04 18:52:23,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:23,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:23,723 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:52:23,730 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_11| Int) (foo_~n Int)) (= (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_11|) (* 4 foo_~n))) (exists ((v_prenex_68 Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_68)) |c_#length|))) is different from true [2018-02-04 18:52:23,736 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-04 18:52:23,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:23,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:23,751 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:52:23,753 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_11| Int) (foo_~n Int)) (= (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_11|) (* 4 foo_~n))) (exists ((|foo_~#a~0.base| Int) (v_prenex_68 Int)) (and (= 0 (select |c_#valid| |foo_~#a~0.base|)) (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_68)) |c_#length|)))) is different from true [2018-02-04 18:52:23,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 17 [2018-02-04 18:52:23,762 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:52:23,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-02-04 18:52:23,773 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:58 [2018-02-04 18:52:23,815 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:52:23,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:23,835 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:23,835 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:23,836 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-04 18:52:23,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:23,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:23,840 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:54, output treesize:23 [2018-02-04 18:52:23,886 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-04 18:52:23,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:23,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:23,889 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:52:23,923 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_11| Int) (foo_~n Int)) (= (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_11|) (* 4 foo_~n))) (exists ((v_prenex_73 Int)) (= |c_#length| (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_73))))) is different from true [2018-02-04 18:52:23,926 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-04 18:52:23,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:23,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:23,931 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:52:23,933 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_11| Int) (foo_~n Int)) (= (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_11|) (* 4 foo_~n))) (exists ((|foo_~#a~0.base| Int) (v_prenex_73 Int)) (and (= 0 (select |c_#valid| |foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_73)))))) is different from true [2018-02-04 18:52:23,949 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 21 treesize of output 32 [2018-02-04 18:52:23,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:52:23,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-02-04 18:52:23,977 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-02-04 18:52:24,113 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) is different from true [2018-02-04 18:52:24,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 18:52:24,124 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:24,126 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-04 18:52:24,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:24,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:24,128 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-02-04 18:52:24,144 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_11| Int) (v_prenex_84 Int)) (= (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_11|) (* 4 v_prenex_84)))) is different from true [2018-02-04 18:52:24,152 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:24,161 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 2 case distinctions, treesize of input 21 treesize of output 32 [2018-02-04 18:52:24,162 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:52:24,189 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:24,191 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:24,191 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:24,192 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 16 treesize of output 9 [2018-02-04 18:52:24,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:24,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-02-04 18:52:24,206 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:53, output treesize:72 [2018-02-04 18:52:24,272 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 71 trivial. 48 not checked. [2018-02-04 18:52:24,272 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:52:24,272 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 18:52:24,273 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 18:52:24,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 18:52:24,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=144, Unknown=7, NotChecked=210, Total=420 [2018-02-04 18:52:24,273 INFO L87 Difference]: Start difference. First operand 200 states and 212 transitions. Second operand 21 states. [2018-02-04 18:52:24,321 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_11| Int) (foo_~n Int)) (= (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_11|) (* 4 foo_~n))) (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|))) is different from true [2018-02-04 18:52:24,323 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|))) is different from true [2018-02-04 18:52:24,341 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_11| Int) (foo_~n Int)) (= (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_11|) (* 4 foo_~n))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_11| Int) (v_prenex_84 Int)) (= (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_11|) (* 4 v_prenex_84))) (exists ((v_prenex_73 Int)) (= |c_#length| (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_73)))) (exists ((v_prenex_68 Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_68)) |c_#length|))) is different from true [2018-02-04 18:52:24,344 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_11| Int) (foo_~n Int)) (= (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_11|) (* 4 foo_~n))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_11| Int) (v_prenex_84 Int)) (= (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_11|) (* 4 v_prenex_84))) (exists ((|foo_~#a~0.base| Int) (v_prenex_68 Int)) (and (= 0 (select |c_#valid| |foo_~#a~0.base|)) (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_68)) |c_#length|))) (exists ((|foo_~#a~0.base| Int) (v_prenex_73 Int)) (and (= 0 (select |c_#valid| |foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_73)))))) is different from true [2018-02-04 18:52:24,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:24,650 INFO L93 Difference]: Finished difference Result 221 states and 236 transitions. [2018-02-04 18:52:24,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 18:52:24,651 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 114 [2018-02-04 18:52:24,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:24,651 INFO L225 Difference]: With dead ends: 221 [2018-02-04 18:52:24,651 INFO L226 Difference]: Without dead ends: 221 [2018-02-04 18:52:24,652 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=246, Unknown=11, NotChecked=462, Total=812 [2018-02-04 18:52:24,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-02-04 18:52:24,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 211. [2018-02-04 18:52:24,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-02-04 18:52:24,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 225 transitions. [2018-02-04 18:52:24,657 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 225 transitions. Word has length 114 [2018-02-04 18:52:24,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:24,657 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 225 transitions. [2018-02-04 18:52:24,657 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 18:52:24,657 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 225 transitions. [2018-02-04 18:52:24,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-02-04 18:52:24,658 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:24,658 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:24,658 INFO L371 AbstractCegarLoop]: === Iteration 29 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:52:24,658 INFO L82 PathProgramCache]: Analyzing trace with hash -308556470, now seen corresponding path program 1 times [2018-02-04 18:52:24,658 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:24,658 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:24,659 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:24,659 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:52:24,659 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:24,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:24,672 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:24,765 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-02-04 18:52:24,765 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:52:24,765 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:52:24,765 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:24,777 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:24,785 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-02-04 18:52:24,785 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:52:24,785 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-02-04 18:52:24,785 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 18:52:24,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 18:52:24,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-02-04 18:52:24,786 INFO L87 Difference]: Start difference. First operand 211 states and 225 transitions. Second operand 7 states. [2018-02-04 18:52:24,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:24,829 INFO L93 Difference]: Finished difference Result 221 states and 237 transitions. [2018-02-04 18:52:24,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 18:52:24,829 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 122 [2018-02-04 18:52:24,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:24,830 INFO L225 Difference]: With dead ends: 221 [2018-02-04 18:52:24,830 INFO L226 Difference]: Without dead ends: 221 [2018-02-04 18:52:24,830 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-02-04 18:52:24,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-02-04 18:52:24,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 210. [2018-02-04 18:52:24,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-02-04 18:52:24,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 222 transitions. [2018-02-04 18:52:24,834 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 222 transitions. Word has length 122 [2018-02-04 18:52:24,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:24,835 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 222 transitions. [2018-02-04 18:52:24,835 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 18:52:24,835 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 222 transitions. [2018-02-04 18:52:24,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-02-04 18:52:24,836 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:24,836 INFO L351 BasicCegarLoop]: trace histogram [8, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:24,836 INFO L371 AbstractCegarLoop]: === Iteration 30 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:52:24,836 INFO L82 PathProgramCache]: Analyzing trace with hash 737215377, now seen corresponding path program 2 times [2018-02-04 18:52:24,836 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:24,836 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:24,837 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:24,837 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:24,837 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:24,850 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:24,856 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:52:24,856 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:52:24,856 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:52:24,857 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:52:24,879 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 18:52:24,879 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:52:24,883 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:24,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 18:52:24,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:24,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:24,894 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-02-04 18:52:24,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 18:52:24,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:24,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:24,904 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-02-04 18:52:24,915 WARN L1033 $PredicateComparison]: unable to prove that (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) is different from true [2018-02-04 18:52:24,921 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-04 18:52:24,921 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:24,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:24,923 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:52:24,946 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_13| Int) (v_prenex_89 Int)) (= (* 4 v_prenex_89) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_13|)))) is different from true [2018-02-04 18:52:24,951 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-04 18:52:24,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:24,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:24,957 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:52:24,959 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_13| Int) (v_prenex_89 Int)) (= (* 4 v_prenex_89) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_13|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:52:24,964 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-04 18:52:24,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:24,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:24,972 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:27, output treesize:26 [2018-02-04 18:52:25,056 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:25,057 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:25,065 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 2 case distinctions, treesize of input 26 treesize of output 37 [2018-02-04 18:52:25,066 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:52:25,088 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:25,088 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:25,089 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:25,089 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 16 treesize of output 9 [2018-02-04 18:52:25,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:25,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2018-02-04 18:52:25,101 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:47, output treesize:68 [2018-02-04 18:52:25,183 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 114 proven. 18 refuted. 0 times theorem prover too weak. 45 trivial. 23 not checked. [2018-02-04 18:52:25,183 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:52:25,183 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 18:52:25,184 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 18:52:25,184 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 18:52:25,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=165, Unknown=3, NotChecked=84, Total=306 [2018-02-04 18:52:25,184 INFO L87 Difference]: Start difference. First operand 210 states and 222 transitions. Second operand 18 states. [2018-02-04 18:52:25,230 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_13| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_13|)))) is different from true [2018-02-04 18:52:25,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:25,584 INFO L93 Difference]: Finished difference Result 283 states and 303 transitions. [2018-02-04 18:52:25,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 18:52:25,584 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 131 [2018-02-04 18:52:25,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:25,585 INFO L225 Difference]: With dead ends: 283 [2018-02-04 18:52:25,585 INFO L226 Difference]: Without dead ends: 283 [2018-02-04 18:52:25,586 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 115 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=565, Unknown=14, NotChecked=212, Total=930 [2018-02-04 18:52:25,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-02-04 18:52:25,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 248. [2018-02-04 18:52:25,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-02-04 18:52:25,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 266 transitions. [2018-02-04 18:52:25,592 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 266 transitions. Word has length 131 [2018-02-04 18:52:25,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:25,592 INFO L432 AbstractCegarLoop]: Abstraction has 248 states and 266 transitions. [2018-02-04 18:52:25,593 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 18:52:25,593 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 266 transitions. [2018-02-04 18:52:25,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-02-04 18:52:25,593 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:25,593 INFO L351 BasicCegarLoop]: trace histogram [9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:25,594 INFO L371 AbstractCegarLoop]: === Iteration 31 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:52:25,594 INFO L82 PathProgramCache]: Analyzing trace with hash 900449447, now seen corresponding path program 3 times [2018-02-04 18:52:25,594 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:25,594 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:25,595 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:25,595 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:52:25,595 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:25,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:25,609 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:25,640 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:52:25,640 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:52:25,640 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:52:25,641 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 18:52:25,652 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-04 18:52:25,653 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:52:25,656 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:25,733 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:25,735 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 19 treesize of output 22 [2018-02-04 18:52:25,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:25,751 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:25,752 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:25,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 18:52:25,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:25,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:25,766 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:46, output treesize:43 [2018-02-04 18:52:25,792 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 11 treesize of output 4 [2018-02-04 18:52:25,793 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:25,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:25,802 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:33 [2018-02-04 18:52:25,908 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 85 proven. 9 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2018-02-04 18:52:25,908 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:52:25,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 18:52:25,909 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 18:52:25,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 18:52:25,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-02-04 18:52:25,909 INFO L87 Difference]: Start difference. First operand 248 states and 266 transitions. Second operand 12 states. [2018-02-04 18:52:26,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:26,257 INFO L93 Difference]: Finished difference Result 251 states and 267 transitions. [2018-02-04 18:52:26,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 18:52:26,257 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 137 [2018-02-04 18:52:26,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:26,258 INFO L225 Difference]: With dead ends: 251 [2018-02-04 18:52:26,258 INFO L226 Difference]: Without dead ends: 251 [2018-02-04 18:52:26,258 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2018-02-04 18:52:26,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-02-04 18:52:26,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 165. [2018-02-04 18:52:26,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-04 18:52:26,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 171 transitions. [2018-02-04 18:52:26,261 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 171 transitions. Word has length 137 [2018-02-04 18:52:26,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:26,262 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 171 transitions. [2018-02-04 18:52:26,262 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 18:52:26,262 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 171 transitions. [2018-02-04 18:52:26,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-02-04 18:52:26,262 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:26,263 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:26,263 INFO L371 AbstractCegarLoop]: === Iteration 32 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:52:26,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1558726796, now seen corresponding path program 5 times [2018-02-04 18:52:26,263 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:26,263 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:26,264 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:26,264 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:52:26,264 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:26,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:26,279 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:26,448 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 109 proven. 108 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-02-04 18:52:26,448 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:52:26,448 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:52:26,449 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 18:52:26,515 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-02-04 18:52:26,515 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:52:26,522 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:26,612 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 102 proven. 66 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2018-02-04 18:52:26,612 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:52:26,612 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 21 [2018-02-04 18:52:26,613 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 18:52:26,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 18:52:26,613 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2018-02-04 18:52:26,613 INFO L87 Difference]: Start difference. First operand 165 states and 171 transitions. Second operand 21 states. [2018-02-04 18:52:26,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:26,980 INFO L93 Difference]: Finished difference Result 184 states and 192 transitions. [2018-02-04 18:52:26,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 18:52:26,981 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 161 [2018-02-04 18:52:26,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:26,981 INFO L225 Difference]: With dead ends: 184 [2018-02-04 18:52:26,981 INFO L226 Difference]: Without dead ends: 175 [2018-02-04 18:52:26,982 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=337, Invalid=1223, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 18:52:26,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-02-04 18:52:26,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2018-02-04 18:52:26,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-02-04 18:52:26,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 177 transitions. [2018-02-04 18:52:26,984 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 177 transitions. Word has length 161 [2018-02-04 18:52:26,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:26,985 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 177 transitions. [2018-02-04 18:52:26,985 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 18:52:26,985 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 177 transitions. [2018-02-04 18:52:26,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-02-04 18:52:26,985 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:26,985 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:26,986 INFO L371 AbstractCegarLoop]: === Iteration 33 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:52:26,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1880915746, now seen corresponding path program 6 times [2018-02-04 18:52:26,986 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:26,986 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:26,986 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:26,986 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:52:26,987 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:26,997 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:27,172 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 187 proven. 22 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-02-04 18:52:27,172 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:52:27,172 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:52:27,173 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 18:52:27,211 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-02-04 18:52:27,211 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:52:27,215 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:27,282 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 180 proven. 23 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2018-02-04 18:52:27,282 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:52:27,282 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 21 [2018-02-04 18:52:27,282 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 18:52:27,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 18:52:27,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2018-02-04 18:52:27,283 INFO L87 Difference]: Start difference. First operand 171 states and 177 transitions. Second operand 21 states. [2018-02-04 18:52:27,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:27,521 INFO L93 Difference]: Finished difference Result 182 states and 189 transitions. [2018-02-04 18:52:27,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 18:52:27,522 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 167 [2018-02-04 18:52:27,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:27,522 INFO L225 Difference]: With dead ends: 182 [2018-02-04 18:52:27,522 INFO L226 Difference]: Without dead ends: 182 [2018-02-04 18:52:27,523 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=627, Unknown=0, NotChecked=0, Total=756 [2018-02-04 18:52:27,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-04 18:52:27,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 179. [2018-02-04 18:52:27,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-02-04 18:52:27,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 186 transitions. [2018-02-04 18:52:27,525 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 186 transitions. Word has length 167 [2018-02-04 18:52:27,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:27,526 INFO L432 AbstractCegarLoop]: Abstraction has 179 states and 186 transitions. [2018-02-04 18:52:27,526 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 18:52:27,526 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 186 transitions. [2018-02-04 18:52:27,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-02-04 18:52:27,527 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:27,527 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:27,527 INFO L371 AbstractCegarLoop]: === Iteration 34 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:52:27,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1181300643, now seen corresponding path program 7 times [2018-02-04 18:52:27,527 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:27,527 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:27,528 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:27,528 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:52:27,528 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:27,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:27,541 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:27,546 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:52:27,547 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:52:27,547 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:52:27,547 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:27,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:27,570 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:27,573 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-04 18:52:27,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:27,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:27,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:52:27,593 WARN L1033 $PredicateComparison]: unable to prove that (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) is different from true [2018-02-04 18:52:27,596 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-04 18:52:27,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:27,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:27,597 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:52:27,607 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int) (|v_foo_~#a~0.base_BEFORE_CALL_14| Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_14|))) (exists ((v_prenex_95 Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_95)) |c_#length|))) is different from true [2018-02-04 18:52:27,611 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-04 18:52:27,611 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:27,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:27,616 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:52:27,618 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int) (|v_foo_~#a~0.base_BEFORE_CALL_14| Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_14|))) (exists ((|foo_~#a~0.base| Int) (v_prenex_95 Int)) (and (= 0 (select |c_#valid| |foo_~#a~0.base|)) (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_95)) |c_#length|)))) is different from true [2018-02-04 18:52:27,629 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 2 case distinctions, treesize of input 14 treesize of output 17 [2018-02-04 18:52:27,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:52:27,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-02-04 18:52:27,644 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:58 [2018-02-04 18:52:27,684 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:52:27,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:27,693 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:27,694 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:27,694 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-04 18:52:27,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:27,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:27,702 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:54, output treesize:23 [2018-02-04 18:52:27,743 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-04 18:52:27,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:27,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:27,745 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:52:27,757 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int) (|v_foo_~#a~0.base_BEFORE_CALL_14| Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_14|))) (exists ((v_prenex_100 Int)) (= |c_#length| (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_100))))) is different from true [2018-02-04 18:52:27,761 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-04 18:52:27,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:27,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:27,767 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:52:27,769 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int) (|v_foo_~#a~0.base_BEFORE_CALL_14| Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_14|))) (exists ((|foo_~#a~0.base| Int) (v_prenex_100 Int)) (and (= 0 (select |c_#valid| |foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_100)))))) is different from true [2018-02-04 18:52:27,790 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 21 treesize of output 32 [2018-02-04 18:52:27,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:52:27,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-02-04 18:52:27,826 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-02-04 18:52:27,898 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:27,899 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 33 treesize of output 23 [2018-02-04 18:52:27,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:27,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:27,916 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:69, output treesize:23 [2018-02-04 18:52:28,003 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-04 18:52:28,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:28,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:28,005 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:52:28,020 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int) (|v_foo_~#a~0.base_BEFORE_CALL_14| Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_14|))) (exists ((v_prenex_112 Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_112)) |c_#length|))) is different from true [2018-02-04 18:52:28,024 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-04 18:52:28,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:28,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:28,030 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:52:28,032 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int) (|v_foo_~#a~0.base_BEFORE_CALL_14| Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_14|))) (exists ((|foo_~#a~0.base| Int) (v_prenex_112 Int)) (and (= 0 (select |c_#valid| |foo_~#a~0.base|)) (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_112)) |c_#length|)))) is different from true [2018-02-04 18:52:28,052 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 21 treesize of output 32 [2018-02-04 18:52:28,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:52:28,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-02-04 18:52:28,093 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-02-04 18:52:28,367 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) is different from true [2018-02-04 18:52:28,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 18:52:28,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:28,382 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-04 18:52:28,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:28,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:28,384 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-02-04 18:52:28,415 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int) (|v_foo_~#a~0.base_BEFORE_CALL_14| Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_14|))) (exists ((|foo_~#a~0.base| Int) (v_prenex_123 Int)) (and (= (select |c_old(#valid)| |foo_~#a~0.base|) 0) (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_123)) |c_#length|)))) is different from true [2018-02-04 18:52:28,421 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:28,422 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:28,423 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:28,423 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 16 treesize of output 9 [2018-02-04 18:52:28,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:28,443 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 2 case distinctions, treesize of input 21 treesize of output 32 [2018-02-04 18:52:28,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 18:52:28,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-02-04 18:52:28,465 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:56, output treesize:86 [2018-02-04 18:52:28,599 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 237 trivial. 118 not checked. [2018-02-04 18:52:28,599 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:52:28,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 18:52:28,600 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 18:52:28,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 18:52:28,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=193, Unknown=9, NotChecked=324, Total=600 [2018-02-04 18:52:28,600 INFO L87 Difference]: Start difference. First operand 179 states and 186 transitions. Second operand 25 states. [2018-02-04 18:52:28,657 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int) (|v_foo_~#a~0.base_BEFORE_CALL_14| Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_14|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|))) is different from true [2018-02-04 18:52:28,659 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|))) is different from true [2018-02-04 18:52:28,679 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int) (|v_foo_~#a~0.base_BEFORE_CALL_14| Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_14|))) (exists ((v_prenex_100 Int)) (= |c_#length| (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_100)))) (exists ((|foo_~#a~0.base| Int) (v_prenex_123 Int)) (and (= (select |c_old(#valid)| |foo_~#a~0.base|) 0) (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_123)) |c_#length|))) (exists ((v_prenex_95 Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_95)) |c_#length|)) (exists ((v_prenex_112 Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_112)) |c_#length|))) is different from true [2018-02-04 18:52:28,681 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int) (|v_foo_~#a~0.base_BEFORE_CALL_14| Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_14|))) (exists ((v_prenex_100 Int)) (= |c_#length| (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_100)))) (exists ((v_prenex_95 Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_95)) |c_#length|))) is different from true [2018-02-04 18:52:28,682 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int) (|v_foo_~#a~0.base_BEFORE_CALL_14| Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_14|))) (exists ((|foo_~#a~0.base| Int) (v_prenex_100 Int)) (and (= 0 (select |c_#valid| |foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_100))))) (exists ((|foo_~#a~0.base| Int) (v_prenex_95 Int)) (and (= 0 (select |c_#valid| |foo_~#a~0.base|)) (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_95)) |c_#length|)))) is different from true [2018-02-04 18:52:28,851 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int) (|v_foo_~#a~0.base_BEFORE_CALL_14| Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_14|))) (exists ((|foo_~#a~0.base| Int) (v_prenex_123 Int)) (and (= (select |c_old(#valid)| |foo_~#a~0.base|) 0) (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_123)) |c_#length|))) (exists ((v_prenex_112 Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_112)) |c_#length|))) is different from true [2018-02-04 18:52:28,853 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int) (|v_foo_~#a~0.base_BEFORE_CALL_14| Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_14|))) (exists ((|foo_~#a~0.base| Int) (v_prenex_112 Int)) (and (= 0 (select |c_#valid| |foo_~#a~0.base|)) (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_112)) |c_#length|))) (exists ((|foo_~#a~0.base| Int) (v_prenex_123 Int)) (and (= (select |c_old(#valid)| |foo_~#a~0.base|) 0) (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_123)) |c_#length|)))) is different from true [2018-02-04 18:52:29,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:29,027 INFO L93 Difference]: Finished difference Result 210 states and 222 transitions. [2018-02-04 18:52:29,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 18:52:29,028 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 172 [2018-02-04 18:52:29,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:29,029 INFO L225 Difference]: With dead ends: 210 [2018-02-04 18:52:29,029 INFO L226 Difference]: Without dead ends: 210 [2018-02-04 18:52:29,029 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 144 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=153, Invalid=401, Unknown=16, NotChecked=912, Total=1482 [2018-02-04 18:52:29,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-02-04 18:52:29,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 192. [2018-02-04 18:52:29,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-02-04 18:52:29,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 201 transitions. [2018-02-04 18:52:29,033 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 201 transitions. Word has length 172 [2018-02-04 18:52:29,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:29,034 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 201 transitions. [2018-02-04 18:52:29,034 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 18:52:29,034 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 201 transitions. [2018-02-04 18:52:29,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-02-04 18:52:29,035 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:29,035 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:29,035 INFO L371 AbstractCegarLoop]: === Iteration 35 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:52:29,035 INFO L82 PathProgramCache]: Analyzing trace with hash -2055653370, now seen corresponding path program 8 times [2018-02-04 18:52:29,036 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:29,036 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:29,036 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:29,036 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:29,036 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:29,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:29,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:29,065 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:52:29,065 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:52:29,065 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:52:29,065 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:52:29,091 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 18:52:29,091 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:52:29,098 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:29,101 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-04 18:52:29,102 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:29,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:29,105 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:52:29,122 WARN L1033 $PredicateComparison]: unable to prove that (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) is different from true [2018-02-04 18:52:29,125 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-04 18:52:29,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:29,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:29,127 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:52:29,138 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int) (|v_foo_~#a~0.base_BEFORE_CALL_17| Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_17|))) (exists ((v_prenex_129 Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_129)) |c_#length|))) is different from true [2018-02-04 18:52:29,142 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-04 18:52:29,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:29,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:29,148 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:52:29,151 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int) (|v_foo_~#a~0.base_BEFORE_CALL_17| Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_17|))) (exists ((|foo_~#a~0.base| Int) (v_prenex_129 Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_129)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:52:29,163 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 2 case distinctions, treesize of input 14 treesize of output 17 [2018-02-04 18:52:29,163 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:52:29,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-02-04 18:52:29,177 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:58 [2018-02-04 18:52:29,237 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:52:29,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:29,243 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:29,244 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:29,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, 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-04 18:52:29,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:29,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:29,249 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:54, output treesize:23 [2018-02-04 18:52:29,272 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-04 18:52:29,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:29,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:29,274 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:52:29,284 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int) (|v_foo_~#a~0.base_BEFORE_CALL_17| Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_17|))) (exists ((v_prenex_134 Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_134)) |c_#length|))) is different from true [2018-02-04 18:52:29,286 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-04 18:52:29,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:29,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:29,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:52:29,295 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int) (|v_foo_~#a~0.base_BEFORE_CALL_17| Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_17|))) (exists ((|foo_~#a~0.base| Int) (v_prenex_134 Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_134)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:52:29,316 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 21 treesize of output 32 [2018-02-04 18:52:29,316 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:52:29,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-02-04 18:52:29,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-02-04 18:52:29,397 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:52:29,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:29,405 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:29,406 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:29,406 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-04 18:52:29,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:29,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:29,412 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:69, output treesize:23 [2018-02-04 18:52:29,444 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-04 18:52:29,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:29,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:29,446 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:52:29,460 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int) (|v_foo_~#a~0.base_BEFORE_CALL_17| Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_17|))) (exists ((v_prenex_146 Int)) (= |c_#length| (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_146))))) is different from true [2018-02-04 18:52:29,462 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-04 18:52:29,463 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:29,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:29,467 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:52:29,468 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int) (|v_foo_~#a~0.base_BEFORE_CALL_17| Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_17|))) (exists ((|foo_~#a~0.base| Int) (v_prenex_146 Int)) (and (= |c_#length| (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_146))) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:52:29,483 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 21 treesize of output 32 [2018-02-04 18:52:29,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:52:29,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-02-04 18:52:29,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-02-04 18:52:29,640 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) is different from true [2018-02-04 18:52:29,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-04 18:52:29,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:29,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 18:52:29,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:29,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:29,653 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-02-04 18:52:29,693 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (v_prenex_157 Int)) (and (= (select |c_old(#valid)| |foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_157))))) (exists ((foo_~n Int) (|v_foo_~#a~0.base_BEFORE_CALL_17| Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_17|)))) is different from true [2018-02-04 18:52:29,699 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:29,720 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 2 case distinctions, treesize of input 21 treesize of output 32 [2018-02-04 18:52:29,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:52:29,800 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:29,802 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:29,803 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:29,803 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 16 treesize of output 9 [2018-02-04 18:52:29,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:29,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-02-04 18:52:29,825 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:60, output treesize:86 [2018-02-04 18:52:29,938 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 237 trivial. 120 not checked. [2018-02-04 18:52:29,938 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:52:29,938 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 18:52:29,938 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 18:52:29,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 18:52:29,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=193, Unknown=9, NotChecked=324, Total=600 [2018-02-04 18:52:29,939 INFO L87 Difference]: Start difference. First operand 192 states and 201 transitions. Second operand 25 states. [2018-02-04 18:52:29,971 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int) (|v_foo_~#a~0.base_BEFORE_CALL_17| Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_17|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|))) is different from true [2018-02-04 18:52:29,972 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|))) is different from true [2018-02-04 18:52:29,984 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (v_prenex_157 Int)) (and (= (select |c_old(#valid)| |foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_157))))) (exists ((foo_~n Int) (|v_foo_~#a~0.base_BEFORE_CALL_17| Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_17|))) (exists ((v_prenex_134 Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_134)) |c_#length|)) (exists ((v_prenex_146 Int)) (= |c_#length| (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_146)))) (exists ((v_prenex_129 Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_129)) |c_#length|))) is different from true [2018-02-04 18:52:29,986 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int) (|v_foo_~#a~0.base_BEFORE_CALL_17| Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_17|))) (exists ((v_prenex_134 Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_134)) |c_#length|)) (exists ((v_prenex_146 Int)) (= |c_#length| (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_146)))) (exists ((v_prenex_129 Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_129)) |c_#length|))) is different from true [2018-02-04 18:52:29,988 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int) (|v_foo_~#a~0.base_BEFORE_CALL_17| Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_17|))) (exists ((|foo_~#a~0.base| Int) (v_prenex_129 Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_129)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|)))) (exists ((|foo_~#a~0.base| Int) (v_prenex_146 Int)) (and (= |c_#length| (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_146))) (= 0 (select |c_#valid| |foo_~#a~0.base|)))) (exists ((|foo_~#a~0.base| Int) (v_prenex_134 Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_134)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:52:30,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:30,250 INFO L93 Difference]: Finished difference Result 213 states and 227 transitions. [2018-02-04 18:52:30,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 18:52:30,250 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 172 [2018-02-04 18:52:30,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:30,251 INFO L225 Difference]: With dead ends: 213 [2018-02-04 18:52:30,251 INFO L226 Difference]: Without dead ends: 213 [2018-02-04 18:52:30,252 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 144 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=363, Unknown=15, NotChecked=742, Total=1260 [2018-02-04 18:52:30,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-02-04 18:52:30,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 184. [2018-02-04 18:52:30,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-02-04 18:52:30,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 193 transitions. [2018-02-04 18:52:30,255 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 193 transitions. Word has length 172 [2018-02-04 18:52:30,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:30,256 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 193 transitions. [2018-02-04 18:52:30,256 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 18:52:30,256 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 193 transitions. [2018-02-04 18:52:30,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-02-04 18:52:30,257 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:30,257 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:30,257 INFO L371 AbstractCegarLoop]: === Iteration 36 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:52:30,257 INFO L82 PathProgramCache]: Analyzing trace with hash -362497594, now seen corresponding path program 9 times [2018-02-04 18:52:30,258 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:30,258 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:30,258 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:30,258 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:52:30,258 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:30,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:30,278 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:30,283 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:52:30,284 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:52:30,284 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:52:30,284 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 18:52:30,336 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-04 18:52:30,337 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:52:30,344 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:30,351 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-04 18:52:30,351 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:30,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:30,354 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:52:30,368 WARN L1033 $PredicateComparison]: unable to prove that (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) is different from true [2018-02-04 18:52:30,370 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-04 18:52:30,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:30,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:30,372 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:52:30,382 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_162 Int)) (= |c_#length| (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_162)))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_20| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_20|)))) is different from true [2018-02-04 18:52:30,386 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-04 18:52:30,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:30,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:30,391 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:52:30,393 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_20| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_20|))) (exists ((|foo_~#a~0.base| Int) (v_prenex_162 Int)) (and (= 0 (select |c_#valid| |foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_162)))))) is different from true [2018-02-04 18:52:30,404 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 2 case distinctions, treesize of input 14 treesize of output 17 [2018-02-04 18:52:30,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:52:30,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-02-04 18:52:30,420 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:58 [2018-02-04 18:52:30,464 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:30,464 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:30,465 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 29 treesize of output 23 [2018-02-04 18:52:30,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:30,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:30,482 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:23 [2018-02-04 18:52:30,515 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-04 18:52:30,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:30,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:30,517 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:52:30,530 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_20| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_20|))) (exists ((v_prenex_167 Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_167)) |c_#length|))) is different from true [2018-02-04 18:52:30,534 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-04 18:52:30,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:30,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:30,540 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:52:30,541 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_20| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_20|))) (exists ((|foo_~#a~0.base| Int) (v_prenex_167 Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_167)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:52:30,561 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 21 treesize of output 32 [2018-02-04 18:52:30,562 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:52:30,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-02-04 18:52:30,597 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-02-04 18:52:30,662 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:30,663 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 33 treesize of output 23 [2018-02-04 18:52:30,663 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:30,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:30,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:69, output treesize:23 [2018-02-04 18:52:30,717 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-04 18:52:30,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:30,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:30,718 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:52:30,735 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_20| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_20|))) (exists ((v_prenex_179 Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_179)) |c_#length|))) is different from true [2018-02-04 18:52:30,740 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-04 18:52:30,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:30,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:30,745 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:52:30,747 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_20| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_20|))) (exists ((|foo_~#a~0.base| Int) (v_prenex_179 Int)) (and (= 0 (select |c_#valid| |foo_~#a~0.base|)) (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_179)) |c_#length|)))) is different from true [2018-02-04 18:52:30,768 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 21 treesize of output 32 [2018-02-04 18:52:30,768 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:52:30,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-02-04 18:52:30,805 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-02-04 18:52:30,964 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) is different from true [2018-02-04 18:52:30,975 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-04 18:52:30,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:30,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 18:52:30,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:30,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:30,982 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-02-04 18:52:31,001 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_20| Int) (v_prenex_190 Int)) (= (* 4 v_prenex_190) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_20|)))) is different from true [2018-02-04 18:52:31,025 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:31,026 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:31,027 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 16 treesize of output 9 [2018-02-04 18:52:31,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:31,058 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 2 case distinctions, treesize of input 21 treesize of output 32 [2018-02-04 18:52:31,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 18:52:31,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-02-04 18:52:31,083 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:60, output treesize:86 [2018-02-04 18:52:31,182 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 237 trivial. 120 not checked. [2018-02-04 18:52:31,182 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:52:31,183 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 18:52:31,183 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 18:52:31,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 18:52:31,183 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=193, Unknown=9, NotChecked=324, Total=600 [2018-02-04 18:52:31,183 INFO L87 Difference]: Start difference. First operand 184 states and 193 transitions. Second operand 25 states. [2018-02-04 18:52:31,224 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_20| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_20|))) (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|))) is different from true [2018-02-04 18:52:31,225 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|))) is different from true [2018-02-04 18:52:31,241 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_162 Int)) (= |c_#length| (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_162)))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_20| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_20|))) (exists ((v_prenex_179 Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_179)) |c_#length|)) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_20| Int) (v_prenex_190 Int)) (= (* 4 v_prenex_190) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_20|))) (exists ((v_prenex_167 Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_167)) |c_#length|))) is different from true [2018-02-04 18:52:31,243 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_162 Int)) (= |c_#length| (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_162)))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_20| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_20|))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_20| Int) (v_prenex_190 Int)) (= (* 4 v_prenex_190) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_20|))) (exists ((v_prenex_167 Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_167)) |c_#length|))) is different from true [2018-02-04 18:52:31,245 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_20| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_20|))) (exists ((|foo_~#a~0.base| Int) (v_prenex_167 Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_167)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|)))) (exists ((|foo_~#a~0.base| Int) (v_prenex_162 Int)) (and (= 0 (select |c_#valid| |foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_162))))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_20| Int) (v_prenex_190 Int)) (= (* 4 v_prenex_190) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_20|)))) is different from true [2018-02-04 18:52:31,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:31,550 INFO L93 Difference]: Finished difference Result 213 states and 227 transitions. [2018-02-04 18:52:31,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 18:52:31,550 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 172 [2018-02-04 18:52:31,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:31,551 INFO L225 Difference]: With dead ends: 213 [2018-02-04 18:52:31,551 INFO L226 Difference]: Without dead ends: 213 [2018-02-04 18:52:31,552 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 144 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=139, Invalid=365, Unknown=14, NotChecked=742, Total=1260 [2018-02-04 18:52:31,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-02-04 18:52:31,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 193. [2018-02-04 18:52:31,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-04 18:52:31,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 204 transitions. [2018-02-04 18:52:31,556 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 204 transitions. Word has length 172 [2018-02-04 18:52:31,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:31,556 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 204 transitions. [2018-02-04 18:52:31,556 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 18:52:31,557 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 204 transitions. [2018-02-04 18:52:31,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-02-04 18:52:31,558 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:31,558 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:31,558 INFO L371 AbstractCegarLoop]: === Iteration 37 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:52:31,558 INFO L82 PathProgramCache]: Analyzing trace with hash 695515689, now seen corresponding path program 3 times [2018-02-04 18:52:31,558 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:31,558 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:31,559 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:31,559 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:52:31,559 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:31,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:31,578 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:31,584 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:52:31,584 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:52:31,584 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:52:31,585 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 18:52:31,637 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-04 18:52:31,638 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:52:31,645 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:31,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-04 18:52:31,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:31,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:31,651 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:52:31,666 WARN L1033 $PredicateComparison]: unable to prove that (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) is different from true [2018-02-04 18:52:31,669 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-04 18:52:31,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:31,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:31,671 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:52:31,683 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_23| Int) (v_prenex_195 Int)) (= (* 4 v_prenex_195) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_23|)))) is different from true [2018-02-04 18:52:31,686 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-04 18:52:31,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:31,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:31,691 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:52:31,693 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_23| Int) (v_prenex_195 Int)) (= (* 4 v_prenex_195) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_23|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:52:31,703 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 2 case distinctions, treesize of input 14 treesize of output 17 [2018-02-04 18:52:31,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:52:31,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-02-04 18:52:31,714 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:58 [2018-02-04 18:52:31,751 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:52:31,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:31,759 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:31,760 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:31,760 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-04 18:52:31,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:31,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:31,768 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:54, output treesize:23 [2018-02-04 18:52:31,795 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-04 18:52:31,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:31,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:31,803 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:52:31,814 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_23| Int) (v_prenex_200 Int)) (= (* 4 v_prenex_200) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_23|)))) is different from true [2018-02-04 18:52:31,817 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-04 18:52:31,817 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:31,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:31,822 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:52:31,824 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_23| Int) (v_prenex_200 Int)) (= (* 4 v_prenex_200) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_23|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:52:31,839 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 21 treesize of output 32 [2018-02-04 18:52:31,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:52:31,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-02-04 18:52:31,866 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-02-04 18:52:31,931 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:31,932 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:31,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-02-04 18:52:31,933 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:31,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:31,951 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:76, output treesize:34 [2018-02-04 18:52:31,993 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-04 18:52:31,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:31,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:31,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:14, output treesize:13 [2018-02-04 18:52:32,058 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:32,063 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 2 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 18:52:32,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:52:32,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-02-04 18:52:32,073 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:20, output treesize:34 [2018-02-04 18:52:32,076 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((foo_~b.base Int) (foo_~n Int)) (and (= |c_#length| (store |c_old(#length)| foo_~b.base (* 4 foo_~n))) (= 0 (select |c_#valid| foo_~b.base)))) (and (exists ((v_prenex_215 Int) (|foo_~#a~0.base| Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_215)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|)))) (exists ((v_prenex_214 Int)) (= 1 (select |c_#valid| v_prenex_214))))) is different from true [2018-02-04 18:52:32,106 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 36 treesize of output 43 [2018-02-04 18:52:32,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:52:32,193 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 41 treesize of output 48 [2018-02-04 18:52:32,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-02-04 18:52:32,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 21 dim-0 vars, and 6 xjuncts. [2018-02-04 18:52:32,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:78, output treesize:202 [2018-02-04 18:52:32,480 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) is different from true [2018-02-04 18:52:32,500 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-04 18:52:32,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:32,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 18:52:32,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:32,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:32,516 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-02-04 18:52:32,532 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_23| Int) (v_prenex_233 Int)) (= (* 4 v_prenex_233) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_23|)))) is different from true [2018-02-04 18:52:32,540 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:32,551 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 2 case distinctions, treesize of input 21 treesize of output 32 [2018-02-04 18:52:32,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:52:32,581 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:32,583 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:32,584 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:32,584 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 16 treesize of output 9 [2018-02-04 18:52:32,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:32,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-02-04 18:52:32,619 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:60, output treesize:86 [2018-02-04 18:52:32,731 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 38 proven. 82 refuted. 0 times theorem prover too weak. 141 trivial. 144 not checked. [2018-02-04 18:52:32,731 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:52:32,732 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 18:52:32,732 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 18:52:32,732 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 18:52:32,732 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=236, Unknown=21, NotChecked=312, Total=650 [2018-02-04 18:52:32,732 INFO L87 Difference]: Start difference. First operand 193 states and 204 transitions. Second operand 26 states. [2018-02-04 18:52:32,814 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) (exists ((foo_~b.base Int)) (= 1 (select |c_#valid| foo_~b.base)))) is different from true [2018-02-04 18:52:32,816 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|))) is different from true [2018-02-04 18:52:32,836 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_23| Int) (v_prenex_233 Int)) (= (* 4 v_prenex_233) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_23|))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_23| Int) (v_prenex_200 Int)) (= (* 4 v_prenex_200) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_23|))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_23| Int) (v_prenex_195 Int)) (= (* 4 v_prenex_195) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_23|)))) is different from true [2018-02-04 18:52:32,839 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_23| Int) (v_prenex_233 Int)) (= (* 4 v_prenex_233) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_23|))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_23| Int) (v_prenex_200 Int)) (= (* 4 v_prenex_200) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_23|))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_23| Int) (v_prenex_195 Int)) (= (* 4 v_prenex_195) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_23|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:52:32,965 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) (exists ((foo_~b.base Int)) (= 1 (select |c_#valid| foo_~b.base))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_23| Int) (v_prenex_233 Int)) (= (* 4 v_prenex_233) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_23|))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_23| Int) (v_prenex_200 Int)) (= (* 4 v_prenex_200) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_23|))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_23| Int) (v_prenex_195 Int)) (= (* 4 v_prenex_195) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_23|)))) is different from true [2018-02-04 18:52:32,968 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (or (exists ((foo_~b.base Int) (foo_~n Int)) (and (= |c_#length| (store |c_old(#length)| foo_~b.base (* 4 foo_~n))) (= 0 (select |c_#valid| foo_~b.base)))) (and (exists ((v_prenex_215 Int) (|foo_~#a~0.base| Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_215)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|)))) (exists ((v_prenex_214 Int)) (= 1 (select |c_#valid| v_prenex_214))))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_23| Int) (v_prenex_233 Int)) (= (* 4 v_prenex_233) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_23|))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_23| Int) (v_prenex_200 Int)) (= (* 4 v_prenex_200) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_23|))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_23| Int) (v_prenex_195 Int)) (= (* 4 v_prenex_195) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_23|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:52:33,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:33,289 INFO L93 Difference]: Finished difference Result 213 states and 227 transitions. [2018-02-04 18:52:33,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 18:52:33,289 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 172 [2018-02-04 18:52:33,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:33,290 INFO L225 Difference]: With dead ends: 213 [2018-02-04 18:52:33,290 INFO L226 Difference]: Without dead ends: 213 [2018-02-04 18:52:33,290 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 144 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=196, Invalid=638, Unknown=34, NotChecked=938, Total=1806 [2018-02-04 18:52:33,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-02-04 18:52:33,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 182. [2018-02-04 18:52:33,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-02-04 18:52:33,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 190 transitions. [2018-02-04 18:52:33,293 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 190 transitions. Word has length 172 [2018-02-04 18:52:33,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:33,293 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 190 transitions. [2018-02-04 18:52:33,294 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 18:52:33,294 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 190 transitions. [2018-02-04 18:52:33,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-02-04 18:52:33,295 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:33,295 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:33,295 INFO L371 AbstractCegarLoop]: === Iteration 38 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:52:33,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1697700589, now seen corresponding path program 2 times [2018-02-04 18:52:33,295 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:33,295 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:33,296 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:33,296 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:52:33,296 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:33,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:33,331 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:33,411 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-02-04 18:52:33,412 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:52:33,412 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:52:33,412 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:52:33,433 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 18:52:33,434 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:52:33,441 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:33,465 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-02-04 18:52:33,465 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:52:33,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-02-04 18:52:33,465 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 18:52:33,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 18:52:33,466 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-02-04 18:52:33,466 INFO L87 Difference]: Start difference. First operand 182 states and 190 transitions. Second operand 8 states. [2018-02-04 18:52:33,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:33,506 INFO L93 Difference]: Finished difference Result 192 states and 201 transitions. [2018-02-04 18:52:33,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 18:52:33,506 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 180 [2018-02-04 18:52:33,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:33,507 INFO L225 Difference]: With dead ends: 192 [2018-02-04 18:52:33,507 INFO L226 Difference]: Without dead ends: 192 [2018-02-04 18:52:33,507 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-02-04 18:52:33,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-02-04 18:52:33,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 186. [2018-02-04 18:52:33,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-02-04 18:52:33,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 194 transitions. [2018-02-04 18:52:33,510 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 194 transitions. Word has length 180 [2018-02-04 18:52:33,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:33,511 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 194 transitions. [2018-02-04 18:52:33,511 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 18:52:33,511 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 194 transitions. [2018-02-04 18:52:33,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-02-04 18:52:33,512 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:33,512 INFO L351 BasicCegarLoop]: trace histogram [14, 14, 9, 9, 9, 9, 9, 9, 9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:33,512 INFO L371 AbstractCegarLoop]: === Iteration 39 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:52:33,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1624569478, now seen corresponding path program 10 times [2018-02-04 18:52:33,513 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:33,513 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:33,513 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:33,513 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:52:33,513 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:33,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:33,531 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:33,778 INFO L134 CoverageAnalysis]: Checked inductivity of 806 backedges. 228 proven. 200 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-02-04 18:52:33,778 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:52:33,778 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:52:33,779 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 18:52:33,800 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 18:52:33,800 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:52:33,805 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:33,903 INFO L134 CoverageAnalysis]: Checked inductivity of 806 backedges. 246 proven. 24 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2018-02-04 18:52:33,903 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:52:33,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 22 [2018-02-04 18:52:33,904 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 18:52:33,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 18:52:33,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2018-02-04 18:52:33,904 INFO L87 Difference]: Start difference. First operand 186 states and 194 transitions. Second operand 22 states. [2018-02-04 18:52:34,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:34,407 INFO L93 Difference]: Finished difference Result 205 states and 216 transitions. [2018-02-04 18:52:34,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 18:52:34,407 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 230 [2018-02-04 18:52:34,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:34,408 INFO L225 Difference]: With dead ends: 205 [2018-02-04 18:52:34,408 INFO L226 Difference]: Without dead ends: 205 [2018-02-04 18:52:34,408 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=323, Invalid=1237, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 18:52:34,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-02-04 18:52:34,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 201. [2018-02-04 18:52:34,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-02-04 18:52:34,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 212 transitions. [2018-02-04 18:52:34,410 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 212 transitions. Word has length 230 [2018-02-04 18:52:34,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:34,410 INFO L432 AbstractCegarLoop]: Abstraction has 201 states and 212 transitions. [2018-02-04 18:52:34,410 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 18:52:34,410 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 212 transitions. [2018-02-04 18:52:34,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-02-04 18:52:34,411 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:34,411 INFO L351 BasicCegarLoop]: trace histogram [15, 14, 10, 10, 10, 10, 10, 9, 9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:34,411 INFO L371 AbstractCegarLoop]: === Iteration 40 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:52:34,411 INFO L82 PathProgramCache]: Analyzing trace with hash 200929264, now seen corresponding path program 11 times [2018-02-04 18:52:34,411 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:34,411 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:34,412 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:34,412 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:52:34,412 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:34,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:34,422 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:34,666 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 407 proven. 40 refuted. 0 times theorem prover too weak. 423 trivial. 0 not checked. [2018-02-04 18:52:34,666 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:52:34,666 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:52:34,667 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 18:52:34,801 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-02-04 18:52:34,801 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:52:34,817 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:34,927 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 398 proven. 41 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2018-02-04 18:52:34,928 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:52:34,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 25 [2018-02-04 18:52:34,928 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 18:52:34,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 18:52:34,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2018-02-04 18:52:34,929 INFO L87 Difference]: Start difference. First operand 201 states and 212 transitions. Second operand 25 states. [2018-02-04 18:52:35,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:35,178 INFO L93 Difference]: Finished difference Result 212 states and 225 transitions. [2018-02-04 18:52:35,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 18:52:35,178 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 236 [2018-02-04 18:52:35,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:35,179 INFO L225 Difference]: With dead ends: 212 [2018-02-04 18:52:35,179 INFO L226 Difference]: Without dead ends: 212 [2018-02-04 18:52:35,179 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=936, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 18:52:35,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-02-04 18:52:35,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 209. [2018-02-04 18:52:35,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-02-04 18:52:35,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 222 transitions. [2018-02-04 18:52:35,183 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 222 transitions. Word has length 236 [2018-02-04 18:52:35,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:35,183 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 222 transitions. [2018-02-04 18:52:35,183 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 18:52:35,183 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 222 transitions. [2018-02-04 18:52:35,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-02-04 18:52:35,185 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:35,185 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 10, 10, 10, 10, 10, 10, 10, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:35,185 INFO L371 AbstractCegarLoop]: === Iteration 41 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:52:35,185 INFO L82 PathProgramCache]: Analyzing trace with hash 184031125, now seen corresponding path program 12 times [2018-02-04 18:52:35,185 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:35,185 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:35,186 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:35,186 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:52:35,186 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:35,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:35,212 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:35,228 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:52:35,228 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:52:35,228 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:52:35,229 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 18:52:35,361 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-02-04 18:52:35,361 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:52:35,375 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:35,378 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-04 18:52:35,378 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:35,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:35,389 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:52:35,398 WARN L1033 $PredicateComparison]: unable to prove that (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) is different from true [2018-02-04 18:52:35,400 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-04 18:52:35,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:35,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:35,402 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:52:35,412 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int) (|v_foo_~#a~0.base_BEFORE_CALL_26| Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_26|))) (exists ((v_prenex_238 Int)) (= |c_#length| (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_238))))) is different from true [2018-02-04 18:52:35,416 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-04 18:52:35,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:35,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:35,422 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:52:35,424 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int) (|v_foo_~#a~0.base_BEFORE_CALL_26| Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_26|))) (exists ((v_prenex_238 Int) (|foo_~#a~0.base| Int)) (and (= |c_#length| (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_238))) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:52:35,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 17 [2018-02-04 18:52:35,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:52:35,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-02-04 18:52:35,450 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:29, output treesize:52 [2018-02-04 18:52:35,490 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:35,491 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:35,492 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 26 treesize of output 20 [2018-02-04 18:52:35,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:35,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:35,507 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:20 [2018-02-04 18:52:35,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 8 treesize of output 7 [2018-02-04 18:52:35,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:35,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:35,528 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:52:35,604 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 11 treesize of output 9 [2018-02-04 18:52:35,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-02-04 18:52:35,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:35,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:35,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:35,611 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:27, output treesize:16 [2018-02-04 18:52:35,613 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int) (|v_foo_~#a~0.base_BEFORE_CALL_26| Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_26|))) (exists ((v_prenex_243 Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_243)) |c_#length|))) is different from true [2018-02-04 18:52:35,618 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-04 18:52:35,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:35,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:35,624 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:52:35,626 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int) (|v_foo_~#a~0.base_BEFORE_CALL_26| Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_26|))) (exists ((|foo_~#a~0.base| Int) (v_prenex_243 Int)) (and (= 0 (select |c_#valid| |foo_~#a~0.base|)) (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_243)) |c_#length|)))) is different from true [2018-02-04 18:52:35,651 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 21 treesize of output 32 [2018-02-04 18:52:35,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:52:35,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-02-04 18:52:35,687 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:40, output treesize:106 [2018-02-04 18:52:35,785 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:35,786 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:35,786 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 37 treesize of output 31 [2018-02-04 18:52:35,787 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:35,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:35,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:70, output treesize:31 [2018-02-04 18:52:35,826 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-04 18:52:35,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:35,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:35,828 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:52:35,840 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_255 Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_255)) |c_#length|)) (exists ((foo_~n Int) (|v_foo_~#a~0.base_BEFORE_CALL_26| Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_26|)))) is different from true [2018-02-04 18:52:35,852 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-04 18:52:35,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:35,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:35,858 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:52:35,860 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int) (|v_foo_~#a~0.base_BEFORE_CALL_26| Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_26|))) (exists ((|foo_~#a~0.base| Int) (v_prenex_255 Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_255)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:52:35,879 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 21 treesize of output 32 [2018-02-04 18:52:35,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:52:35,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-02-04 18:52:35,913 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:40, output treesize:106 [2018-02-04 18:52:35,980 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:35,981 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:35,982 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 37 treesize of output 31 [2018-02-04 18:52:35,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:36,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:36,005 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:70, output treesize:31 [2018-02-04 18:52:36,027 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-04 18:52:36,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:36,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:36,028 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:52:36,049 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int) (|v_foo_~#a~0.base_BEFORE_CALL_26| Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_26|))) (exists ((v_prenex_267 Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_267)) |c_#length|))) is different from true [2018-02-04 18:52:36,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 6 treesize of output 5 [2018-02-04 18:52:36,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:36,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:36,057 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:52:36,058 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int) (|v_foo_~#a~0.base_BEFORE_CALL_26| Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_26|))) (exists ((|foo_~#a~0.base| Int) (v_prenex_267 Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_267)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:52:36,074 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 21 treesize of output 32 [2018-02-04 18:52:36,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:52:36,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-02-04 18:52:36,101 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:40, output treesize:106 [2018-02-04 18:52:36,350 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-04 18:52:36,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:36,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 18:52:36,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:36,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:36,354 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-02-04 18:52:36,391 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:36,392 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:36,393 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:36,394 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 16 treesize of output 9 [2018-02-04 18:52:36,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:36,410 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 2 case distinctions, treesize of input 21 treesize of output 32 [2018-02-04 18:52:36,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 18:52:36,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-04 18:52:36,427 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:45, output treesize:64 [2018-02-04 18:52:36,583 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 48 proven. 138 refuted. 0 times theorem prover too weak. 487 trivial. 252 not checked. [2018-02-04 18:52:36,583 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:52:36,583 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-04 18:52:36,583 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 18:52:36,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 18:52:36,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=472, Unknown=10, NotChecked=468, Total=1056 [2018-02-04 18:52:36,584 INFO L87 Difference]: Start difference. First operand 209 states and 222 transitions. Second operand 33 states. [2018-02-04 18:52:37,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:37,997 INFO L93 Difference]: Finished difference Result 236 states and 253 transitions. [2018-02-04 18:52:37,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 18:52:37,997 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 241 [2018-02-04 18:52:37,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:37,998 INFO L225 Difference]: With dead ends: 236 [2018-02-04 18:52:37,998 INFO L226 Difference]: Without dead ends: 236 [2018-02-04 18:52:37,999 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 200 SyntacticMatches, 33 SemanticMatches, 56 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1304 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=308, Invalid=2029, Unknown=51, NotChecked=918, Total=3306 [2018-02-04 18:52:37,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-02-04 18:52:38,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 226. [2018-02-04 18:52:38,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-02-04 18:52:38,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 243 transitions. [2018-02-04 18:52:38,003 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 243 transitions. Word has length 241 [2018-02-04 18:52:38,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:38,003 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 243 transitions. [2018-02-04 18:52:38,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 18:52:38,003 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 243 transitions. [2018-02-04 18:52:38,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-02-04 18:52:38,005 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:38,005 INFO L351 BasicCegarLoop]: trace histogram [16, 15, 11, 11, 11, 11, 11, 10, 10, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:38,005 INFO L371 AbstractCegarLoop]: === Iteration 42 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:52:38,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1162086421, now seen corresponding path program 13 times [2018-02-04 18:52:38,005 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:38,006 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:38,006 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:38,006 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:52:38,006 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:38,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:38,026 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:38,339 INFO L134 CoverageAnalysis]: Checked inductivity of 995 backedges. 313 proven. 91 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2018-02-04 18:52:38,339 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:52:38,339 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:52:38,339 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:38,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:38,365 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:38,561 INFO L134 CoverageAnalysis]: Checked inductivity of 995 backedges. 324 proven. 80 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2018-02-04 18:52:38,561 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:52:38,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2018-02-04 18:52:38,562 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 18:52:38,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 18:52:38,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=636, Unknown=0, NotChecked=0, Total=756 [2018-02-04 18:52:38,562 INFO L87 Difference]: Start difference. First operand 226 states and 243 transitions. Second operand 28 states. [2018-02-04 18:52:38,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:38,980 INFO L93 Difference]: Finished difference Result 231 states and 248 transitions. [2018-02-04 18:52:38,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 18:52:38,980 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 247 [2018-02-04 18:52:38,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:38,982 INFO L225 Difference]: With dead ends: 231 [2018-02-04 18:52:38,982 INFO L226 Difference]: Without dead ends: 231 [2018-02-04 18:52:38,982 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=212, Invalid=978, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 18:52:38,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-02-04 18:52:38,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 227. [2018-02-04 18:52:38,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-02-04 18:52:38,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 244 transitions. [2018-02-04 18:52:38,986 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 244 transitions. Word has length 247 [2018-02-04 18:52:38,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:38,987 INFO L432 AbstractCegarLoop]: Abstraction has 227 states and 244 transitions. [2018-02-04 18:52:38,987 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 18:52:38,987 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 244 transitions. [2018-02-04 18:52:38,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-02-04 18:52:38,988 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:38,989 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 10, 10, 10, 10, 10, 10, 10, 10, 10, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:38,989 INFO L371 AbstractCegarLoop]: === Iteration 43 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:52:38,989 INFO L82 PathProgramCache]: Analyzing trace with hash -2128500513, now seen corresponding path program 3 times [2018-02-04 18:52:38,989 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:38,989 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:38,989 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:38,990 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:38,990 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:39,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:39,008 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:39,112 INFO L134 CoverageAnalysis]: Checked inductivity of 943 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 863 trivial. 0 not checked. [2018-02-04 18:52:39,112 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:52:39,113 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:52:39,113 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 18:52:39,120 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-04 18:52:39,121 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:52:39,124 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:39,209 INFO L134 CoverageAnalysis]: Checked inductivity of 943 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 925 trivial. 0 not checked. [2018-02-04 18:52:39,209 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:52:39,209 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2018-02-04 18:52:39,210 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 18:52:39,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 18:52:39,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-02-04 18:52:39,210 INFO L87 Difference]: Start difference. First operand 227 states and 244 transitions. Second operand 13 states. [2018-02-04 18:52:39,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:39,485 INFO L93 Difference]: Finished difference Result 240 states and 259 transitions. [2018-02-04 18:52:39,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 18:52:39,485 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 249 [2018-02-04 18:52:39,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:39,486 INFO L225 Difference]: With dead ends: 240 [2018-02-04 18:52:39,486 INFO L226 Difference]: Without dead ends: 240 [2018-02-04 18:52:39,487 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=296, Invalid=634, Unknown=0, NotChecked=0, Total=930 [2018-02-04 18:52:39,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-02-04 18:52:39,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 232. [2018-02-04 18:52:39,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-02-04 18:52:39,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 249 transitions. [2018-02-04 18:52:39,491 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 249 transitions. Word has length 249 [2018-02-04 18:52:39,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:39,491 INFO L432 AbstractCegarLoop]: Abstraction has 232 states and 249 transitions. [2018-02-04 18:52:39,491 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 18:52:39,491 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 249 transitions. [2018-02-04 18:52:39,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-02-04 18:52:39,493 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:39,493 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 15, 15, 15, 15, 15, 14, 14, 14, 14, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:39,493 INFO L371 AbstractCegarLoop]: === Iteration 44 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:52:39,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1272749241, now seen corresponding path program 14 times [2018-02-04 18:52:39,494 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:39,494 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:39,494 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:39,494 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:52:39,494 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:39,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:39,516 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:39,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1782 backedges. 761 proven. 63 refuted. 0 times theorem prover too weak. 958 trivial. 0 not checked. [2018-02-04 18:52:39,975 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:52:39,975 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:52:39,976 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:52:40,002 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 18:52:40,002 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:52:40,008 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:40,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1782 backedges. 801 proven. 38 refuted. 0 times theorem prover too weak. 943 trivial. 0 not checked. [2018-02-04 18:52:40,233 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:52:40,233 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 31 [2018-02-04 18:52:40,234 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 18:52:40,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 18:52:40,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=799, Unknown=0, NotChecked=0, Total=930 [2018-02-04 18:52:40,234 INFO L87 Difference]: Start difference. First operand 232 states and 249 transitions. Second operand 31 states. [2018-02-04 18:52:40,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:40,887 INFO L93 Difference]: Finished difference Result 275 states and 300 transitions. [2018-02-04 18:52:40,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 18:52:40,887 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 316 [2018-02-04 18:52:40,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:40,888 INFO L225 Difference]: With dead ends: 275 [2018-02-04 18:52:40,888 INFO L226 Difference]: Without dead ends: 267 [2018-02-04 18:52:40,889 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 787 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=406, Invalid=2564, Unknown=0, NotChecked=0, Total=2970 [2018-02-04 18:52:40,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-02-04 18:52:40,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 248. [2018-02-04 18:52:40,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-02-04 18:52:40,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 270 transitions. [2018-02-04 18:52:40,894 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 270 transitions. Word has length 316 [2018-02-04 18:52:40,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:40,894 INFO L432 AbstractCegarLoop]: Abstraction has 248 states and 270 transitions. [2018-02-04 18:52:40,894 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 18:52:40,894 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 270 transitions. [2018-02-04 18:52:40,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-02-04 18:52:40,896 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:40,896 INFO L351 BasicCegarLoop]: trace histogram [22, 21, 16, 16, 16, 16, 15, 15, 15, 15, 15, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:40,896 INFO L371 AbstractCegarLoop]: === Iteration 45 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:52:40,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1900598809, now seen corresponding path program 15 times [2018-02-04 18:52:40,897 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:40,897 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:40,897 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:40,898 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:52:40,898 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:40,923 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:41,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1951 backedges. 512 proven. 375 refuted. 0 times theorem prover too weak. 1064 trivial. 0 not checked. [2018-02-04 18:52:41,270 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:52:41,270 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:52:41,271 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 18:52:41,452 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-02-04 18:52:41,452 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:52:41,476 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:41,479 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-04 18:52:41,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:41,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:41,482 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:52:41,525 WARN L1033 $PredicateComparison]: unable to prove that (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) is different from true [2018-02-04 18:52:41,529 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-04 18:52:41,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:41,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:41,531 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:52:41,547 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_30| Int) (v_prenex_281 Int)) (= (* 4 v_prenex_281) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_30|))) (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|))) is different from true [2018-02-04 18:52:41,550 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-04 18:52:41,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:41,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:41,555 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:52:41,556 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_30| Int) (v_prenex_281 Int)) (= (* 4 v_prenex_281) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_30|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:52:41,565 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 2 case distinctions, treesize of input 14 treesize of output 17 [2018-02-04 18:52:41,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:52:41,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-02-04 18:52:41,578 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:58 [2018-02-04 18:52:41,622 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:41,623 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:41,623 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 29 treesize of output 23 [2018-02-04 18:52:41,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:41,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:41,636 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:23 [2018-02-04 18:52:41,702 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-04 18:52:41,702 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:41,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:41,703 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:52:41,720 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) (exists ((v_prenex_286 Int) (|v_foo_~#a~0.base_BEFORE_CALL_30| Int)) (= (* 4 v_prenex_286) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_30|)))) is different from true [2018-02-04 18:52:41,722 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-04 18:52:41,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:41,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:41,727 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:52:41,729 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_286 Int) (|v_foo_~#a~0.base_BEFORE_CALL_30| Int)) (= (* 4 v_prenex_286) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_30|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:52:41,745 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 21 treesize of output 32 [2018-02-04 18:52:41,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:52:41,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-02-04 18:52:41,791 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-02-04 18:52:41,907 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:41,908 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:41,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-02-04 18:52:41,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:41,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:41,935 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:76, output treesize:34 [2018-02-04 18:52:41,997 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-04 18:52:41,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:41,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:41,998 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:52:42,018 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_299 Int) (|v_foo_~#a~0.base_BEFORE_CALL_30| Int)) (= (* 4 v_prenex_299) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_30|))) (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|))) is different from true [2018-02-04 18:52:42,021 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-04 18:52:42,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:42,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:42,028 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:52:42,030 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_299 Int) (|v_foo_~#a~0.base_BEFORE_CALL_30| Int)) (= (* 4 v_prenex_299) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_30|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:52:42,052 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 21 treesize of output 32 [2018-02-04 18:52:42,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:52:42,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-02-04 18:52:42,088 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-02-04 18:52:42,252 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) is different from true [2018-02-04 18:52:42,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 18:52:42,264 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:42,267 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-04 18:52:42,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:42,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:42,269 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-02-04 18:52:42,290 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((v_prenex_311 Int) (|v_foo_~#a~0.base_BEFORE_CALL_30| Int)) (= (* 4 v_prenex_311) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_30|)))) is different from true [2018-02-04 18:52:42,296 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:42,304 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 2 case distinctions, treesize of input 21 treesize of output 32 [2018-02-04 18:52:42,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:52:42,327 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:42,328 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:42,329 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:42,329 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 16 treesize of output 9 [2018-02-04 18:52:42,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:42,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-02-04 18:52:42,343 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:53, output treesize:72 [2018-02-04 18:52:42,457 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-04 18:52:42,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:42,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 18:52:42,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:42,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:42,461 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-02-04 18:52:42,492 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_30| Int) (v_prenex_316 Int)) (= (* 4 v_prenex_316) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_30|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0)))) is different from true [2018-02-04 18:52:42,498 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:42,505 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 2 case distinctions, treesize of input 21 treesize of output 32 [2018-02-04 18:52:42,505 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:52:42,561 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:42,563 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:42,564 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-04 18:52:42,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:42,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-02-04 18:52:42,588 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:48, output treesize:72 [2018-02-04 18:52:42,759 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-04 18:52:42,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:42,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 18:52:42,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:42,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:42,764 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-02-04 18:52:42,790 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((v_prenex_321 Int) (|v_foo_~#a~0.base_BEFORE_CALL_30| Int)) (= (* 4 v_prenex_321) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_30|)))) is different from true [2018-02-04 18:52:42,796 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:42,804 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 2 case distinctions, treesize of input 21 treesize of output 32 [2018-02-04 18:52:42,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:52:42,831 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:42,832 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:42,832 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-04 18:52:42,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:42,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-02-04 18:52:42,851 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:55, output treesize:86 [2018-02-04 18:52:43,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1951 backedges. 18 proven. 95 refuted. 0 times theorem prover too weak. 1422 trivial. 416 not checked. [2018-02-04 18:52:43,122 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:52:43,122 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 32] total 48 [2018-02-04 18:52:43,123 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-04 18:52:43,123 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-04 18:52:43,123 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1184, Unknown=11, NotChecked=880, Total=2256 [2018-02-04 18:52:43,123 INFO L87 Difference]: Start difference. First operand 248 states and 270 transitions. Second operand 48 states. [2018-02-04 18:52:43,384 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_30| Int) (v_prenex_281 Int)) (= (* 4 v_prenex_281) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_30|))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_30| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_30|))) (exists ((v_prenex_286 Int) (|v_foo_~#a~0.base_BEFORE_CALL_30| Int)) (= (* 4 v_prenex_286) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_30|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:52:43,386 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_30| Int) (v_prenex_281 Int)) (= (* 4 v_prenex_281) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_30|))) (exists ((v_prenex_286 Int) (|v_foo_~#a~0.base_BEFORE_CALL_30| Int)) (= (* 4 v_prenex_286) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_30|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:52:44,196 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_30| Int) (v_prenex_316 Int)) (= (* 4 v_prenex_316) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_30|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((v_prenex_299 Int) (|v_foo_~#a~0.base_BEFORE_CALL_30| Int)) (= (* 4 v_prenex_299) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_30|))) (exists ((v_prenex_321 Int) (|v_foo_~#a~0.base_BEFORE_CALL_30| Int)) (= (* 4 v_prenex_321) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_30|))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_30| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_30|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|)))) (exists ((v_prenex_311 Int) (|v_foo_~#a~0.base_BEFORE_CALL_30| Int)) (= (* 4 v_prenex_311) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_30|)))) is different from true [2018-02-04 18:52:44,208 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_30| Int) (v_prenex_316 Int)) (= (* 4 v_prenex_316) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_30|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((v_prenex_299 Int) (|v_foo_~#a~0.base_BEFORE_CALL_30| Int)) (= (* 4 v_prenex_299) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_30|))) (exists ((v_prenex_321 Int) (|v_foo_~#a~0.base_BEFORE_CALL_30| Int)) (= (* 4 v_prenex_321) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_30|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|)))) (exists ((v_prenex_311 Int) (|v_foo_~#a~0.base_BEFORE_CALL_30| Int)) (= (* 4 v_prenex_311) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_30|)))) is different from true [2018-02-04 18:52:45,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:45,382 INFO L93 Difference]: Finished difference Result 290 states and 318 transitions. [2018-02-04 18:52:45,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-02-04 18:52:45,382 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 326 [2018-02-04 18:52:45,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:45,383 INFO L225 Difference]: With dead ends: 290 [2018-02-04 18:52:45,383 INFO L226 Difference]: Without dead ends: 290 [2018-02-04 18:52:45,385 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 292 SyntacticMatches, 17 SemanticMatches, 95 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 3025 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=734, Invalid=5906, Unknown=62, NotChecked=2610, Total=9312 [2018-02-04 18:52:45,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-02-04 18:52:45,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 269. [2018-02-04 18:52:45,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-02-04 18:52:45,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 294 transitions. [2018-02-04 18:52:45,390 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 294 transitions. Word has length 326 [2018-02-04 18:52:45,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:45,390 INFO L432 AbstractCegarLoop]: Abstraction has 269 states and 294 transitions. [2018-02-04 18:52:45,390 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-04 18:52:45,391 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 294 transitions. [2018-02-04 18:52:45,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-02-04 18:52:45,393 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:45,393 INFO L351 BasicCegarLoop]: trace histogram [21, 21, 15, 15, 15, 15, 15, 15, 15, 15, 15, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:45,393 INFO L371 AbstractCegarLoop]: === Iteration 46 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:52:45,393 INFO L82 PathProgramCache]: Analyzing trace with hash -455441777, now seen corresponding path program 16 times [2018-02-04 18:52:45,394 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:45,394 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:45,394 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:45,394 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:52:45,395 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:45,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:45,427 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:45,445 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:52:45,445 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:52:45,445 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:52:45,445 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 18:52:45,805 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 18:52:45,806 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:52:45,829 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:45,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 18:52:45,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:45,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 18:52:45,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 18:52:45,862 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:45,863 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:45,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:45,867 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:24, output treesize:15 [2018-02-04 18:52:45,933 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-04 18:52:45,935 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-04 18:52:45,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:45,936 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:45,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:45,938 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:11, output treesize:1 [2018-02-04 18:52:45,954 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-04 18:52:45,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:45,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:45,959 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:21, output treesize:20 [2018-02-04 18:52:45,994 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 19 treesize of output 31 [2018-02-04 18:52:45,996 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 20 treesize of output 19 [2018-02-04 18:52:45,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:46,012 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 2 case distinctions, treesize of input 17 treesize of output 22 [2018-02-04 18:52:46,012 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 18:52:46,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:52:46,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 18:52:46,031 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:30, output treesize:32 [2018-02-04 18:52:46,052 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:52:46,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:46,054 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:46,054 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:46,055 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 30 [2018-02-04 18:52:46,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:46,066 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 23 treesize of output 18 [2018-02-04 18:52:46,068 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:46,068 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:46,069 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 18 treesize of output 35 [2018-02-04 18:52:46,069 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:46,073 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:46,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:46,079 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:66, output treesize:22 [2018-02-04 18:52:46,195 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 18 treesize of output 15 [2018-02-04 18:52:46,197 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-02-04 18:52:46,198 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:46,199 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-04 18:52:46,199 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:46,202 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:46,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:46,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:46,208 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:22, output treesize:1 [2018-02-04 18:52:46,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 6 treesize of output 5 [2018-02-04 18:52:46,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:46,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:46,242 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:33, output treesize:32 [2018-02-04 18:52:46,283 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 35 treesize of output 45 [2018-02-04 18:52:46,285 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:46,287 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:46,297 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 4 case distinctions, treesize of input 31 treesize of output 49 [2018-02-04 18:52:46,298 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:52:46,298 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:46,322 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:46,323 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:46,330 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 2 case distinctions, treesize of input 31 treesize of output 58 [2018-02-04 18:52:46,331 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-04 18:52:46,368 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:46,368 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:46,372 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:46,384 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 6 case distinctions, treesize of input 33 treesize of output 70 [2018-02-04 18:52:46,384 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-02-04 18:52:46,438 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:46,438 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:46,439 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:46,441 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 31 treesize of output 56 [2018-02-04 18:52:46,441 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:46,487 INFO L267 ElimStorePlain]: Start of recursive call 3: 4 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-02-04 18:52:46,544 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2018-02-04 18:52:46,546 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:46,547 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-04 18:52:46,547 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:46,552 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:46,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-02-04 18:52:46,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-02-04 18:52:46,646 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:51, output treesize:81 [2018-02-04 18:52:46,695 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:46,696 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:46,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2018-02-04 18:52:46,696 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:46,697 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:52:46,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:46,714 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 32 treesize of output 25 [2018-02-04 18:52:46,716 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:46,717 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:46,717 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:46,718 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:46,718 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:46,719 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:46,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 84 [2018-02-04 18:52:46,719 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:46,728 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:46,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:46,733 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:81, output treesize:31 [2018-02-04 18:52:46,929 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 20 [2018-02-04 18:52:46,930 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-02-04 18:52:46,932 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:46,933 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 31 [2018-02-04 18:52:46,935 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:46,935 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:46,936 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:46,938 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 25 treesize of output 52 [2018-02-04 18:52:46,938 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:46,944 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:46,947 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:46,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:46,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:46,955 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:27, output treesize:1 [2018-02-04 18:52:46,999 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-04 18:52:47,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:47,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:47,006 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:38, output treesize:37 [2018-02-04 18:52:47,068 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 49 treesize of output 57 [2018-02-04 18:52:47,071 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-02-04 18:52:47,073 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:47,074 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 31 [2018-02-04 18:52:47,076 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:47,077 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:47,077 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:47,080 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 25 treesize of output 52 [2018-02-04 18:52:47,080 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:47,086 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:47,094 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:47,127 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:47,127 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:47,128 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:47,130 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:47,131 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:47,132 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:47,152 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 2 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 92 [2018-02-04 18:52:47,160 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:47,161 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:47,170 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:47,189 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 2 new quantified variables, introduced 9 case distinctions, treesize of input 81 treesize of output 106 [2018-02-04 18:52:47,193 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:47,194 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:47,195 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:47,195 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:47,206 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 136 [2018-02-04 18:52:47,207 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-02-04 18:52:47,321 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:47,324 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:47,326 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:47,327 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:47,328 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:47,329 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:47,336 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:47,337 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:47,338 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:47,361 INFO L477 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 12 case distinctions, treesize of input 47 treesize of output 139 [2018-02-04 18:52:47,362 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 8 xjuncts. [2018-02-04 18:52:47,590 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:47,591 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:47,591 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:47,592 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:47,592 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:47,593 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:47,593 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:47,594 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:47,600 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:47,611 INFO L477 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 141 [2018-02-04 18:52:47,612 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-02-04 18:52:47,927 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:47,928 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:47,929 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:47,929 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:47,930 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:47,930 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:47,931 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:47,935 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 47 treesize of output 115 [2018-02-04 18:52:47,935 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:48,122 INFO L267 ElimStorePlain]: Start of recursive call 7: 8 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-02-04 18:52:48,448 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:48,453 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:48,454 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:48,455 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:48,456 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:48,456 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:52:48,460 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:48,462 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 87 [2018-02-04 18:52:48,466 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:48,466 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:48,467 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:48,467 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:48,477 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 92 [2018-02-04 18:52:48,478 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-02-04 18:52:48,507 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:52:48,646 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:48,647 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:48,647 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:48,648 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:48,649 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:48,650 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:48,653 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:48,656 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 95 [2018-02-04 18:52:48,658 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:48,659 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:48,659 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:48,660 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:48,660 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:48,661 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:48,662 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:48,662 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:48,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 142 [2018-02-04 18:52:48,668 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:48,692 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:49,039 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:49,040 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:49,041 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:49,041 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:49,042 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:49,042 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:52:49,045 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:49,047 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 86 [2018-02-04 18:52:49,049 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:49,050 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:49,050 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:49,051 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:49,051 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:49,060 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:49,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 85 [2018-02-04 18:52:49,064 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:49,079 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:49,280 INFO L267 ElimStorePlain]: Start of recursive call 6: 8 dim-1 vars, End of recursive call: and 11 xjuncts. [2018-02-04 18:52:49,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 11 xjuncts. [2018-02-04 18:52:49,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 9 xjuncts. [2018-02-04 18:52:49,497 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 7 variables, input treesize:65, output treesize:218 [2018-02-04 18:52:49,563 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:49,564 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:49,564 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 57 treesize of output 51 [2018-02-04 18:52:49,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:49,565 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:52:49,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:49,582 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 41 treesize of output 32 [2018-02-04 18:52:49,584 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:49,584 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:49,585 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:49,585 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:49,586 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:49,586 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:49,587 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:49,587 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:49,588 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:49,588 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:49,589 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:49,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 11 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 147 [2018-02-04 18:52:49,590 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:49,602 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:49,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:49,614 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:90, output treesize:40 [2018-02-04 18:52:50,115 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 28 treesize of output 25 [2018-02-04 18:52:50,117 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-02-04 18:52:50,119 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:50,120 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 36 [2018-02-04 18:52:50,122 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:50,122 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:50,123 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:50,125 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 52 [2018-02-04 18:52:50,127 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:50,128 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:50,128 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:50,129 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:50,130 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:50,130 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:50,134 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 32 treesize of output 85 [2018-02-04 18:52:50,135 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:50,150 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:50,154 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:50,158 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:50,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:50,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:50,166 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:32, output treesize:1 [2018-02-04 18:52:50,229 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-04 18:52:50,229 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:50,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:50,237 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:44, output treesize:43 [2018-02-04 18:52:50,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 69 [2018-02-04 18:52:50,332 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:50,334 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:50,335 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:50,338 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:50,339 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:50,341 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:50,349 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:50,352 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:50,355 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:50,357 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:50,362 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:50,383 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 3 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 143 [2018-02-04 18:52:50,391 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:50,392 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:50,393 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:50,405 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:50,435 INFO L477 Elim1Store]: Elim1 did not use 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 3 new quantified variables, introduced 12 case distinctions, treesize of input 131 treesize of output 159 [2018-02-04 18:52:50,441 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:52:50,442 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:51,096 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:51,101 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:51,107 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:51,108 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:51,109 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:51,110 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:51,112 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:51,113 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:51,115 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:51,133 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:51,136 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:51,138 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:51,139 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:51,141 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:51,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 16 case distinctions, treesize of input 59 treesize of output 175 [2018-02-04 18:52:51,183 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:52:51,183 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:51,371 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:51,372 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:51,376 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:51,377 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:51,381 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:51,386 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:51,386 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:51,387 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:51,387 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:51,389 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:51,390 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:51,391 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:51,409 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:51,410 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:51,412 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:51,412 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:51,414 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:51,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 20 case distinctions, treesize of input 61 treesize of output 224 [2018-02-04 18:52:51,448 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 16 xjuncts. [2018-02-04 18:52:51,981 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:51,982 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:51,983 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:51,983 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:51,984 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:51,984 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:51,985 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:51,986 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:51,986 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:51,987 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:51,988 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:51,988 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:51,989 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:51,990 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:51,990 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:52:52,000 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:52,000 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:52,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 218 [2018-02-04 18:52:52,006 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:52,144 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:52,145 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:52,146 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:52,146 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:52,147 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:52,148 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:52,148 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:52,149 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:52,150 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:52,150 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:52,151 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:52:52,151 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:52,152 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:52,153 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:52,154 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:52,160 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:52,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 214 [2018-02-04 18:52:52,164 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:53,026 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:53,026 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:53,027 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:53,028 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:53,028 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:53,029 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:53,030 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:53,030 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:52:53,039 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:53,040 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:53,040 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:53,041 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:52:53,042 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:53,044 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:53,046 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:53,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 193 [2018-02-04 18:52:53,054 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:53,244 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:53,245 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:53,246 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:53,247 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:53,247 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:53,248 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:53,249 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:53,250 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:53,250 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:53,251 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:53,252 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:53,253 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:53,254 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:53,254 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:53,255 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:53,256 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:53,257 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:53,257 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:53,258 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:53,259 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:53,259 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:52:53,277 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:53,279 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:53,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 250 [2018-02-04 18:52:53,282 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:53,411 INFO L267 ElimStorePlain]: Start of recursive call 6: 16 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-02-04 18:52:53,993 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:53,994 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:53,994 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:53,995 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:53,996 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:53,996 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:53,997 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:53,998 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:53,998 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:52:54,005 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,006 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,012 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,023 INFO L477 Elim1Store]: Elim1 did not use 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 0 case distinctions, treesize of input 59 treesize of output 149 [2018-02-04 18:52:54,028 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,029 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,030 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,030 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,031 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,032 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,032 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,033 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,034 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 147 [2018-02-04 18:52:54,041 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:54,069 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:54,303 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,304 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,304 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,305 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,306 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,306 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,307 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,308 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,309 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,309 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,311 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,312 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,317 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,321 INFO L477 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 162 [2018-02-04 18:52:54,331 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,331 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,332 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,333 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,333 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,334 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,334 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,335 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,336 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,336 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,337 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,337 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 226 [2018-02-04 18:52:54,345 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:54,395 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:54,633 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,634 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,634 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,635 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,636 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,637 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,637 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,638 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,639 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,639 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,640 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,641 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,641 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,642 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,642 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:52:54,654 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,655 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,658 INFO L477 Elim1Store]: Elim1 did not use 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 0 case distinctions, treesize of input 59 treesize of output 179 [2018-02-04 18:52:54,661 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,662 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,663 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,663 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,664 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,664 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,665 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,666 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,666 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,667 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,667 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,668 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,668 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:52:54,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 176 [2018-02-04 18:52:54,680 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:54,705 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:54,796 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,797 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,798 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,798 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,799 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,799 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,800 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,801 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,802 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,802 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:52:54,804 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,804 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,813 INFO L477 Elim1Store]: Elim1 did not use 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 0 case distinctions, treesize of input 59 treesize of output 147 [2018-02-04 18:52:54,816 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,816 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,817 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,817 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,818 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,818 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,819 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,819 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:54,820 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:52:54,826 INFO L477 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 128 [2018-02-04 18:52:54,826 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:54,849 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:54,932 INFO L267 ElimStorePlain]: Start of recursive call 4: 16 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-02-04 18:52:55,203 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:55,204 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:55,204 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:55,205 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:55,205 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:55,206 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:55,206 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:55,207 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:55,207 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:55,208 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:52:55,211 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:55,213 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:55,214 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 137 [2018-02-04 18:52:55,217 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:55,218 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:55,219 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:55,220 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:55,220 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:55,221 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:55,222 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:55,222 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:52:55,231 INFO L477 Elim1Store]: Elim1 did not use 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 0 case distinctions, treesize of input 60 treesize of output 119 [2018-02-04 18:52:55,233 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:55,234 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:55,234 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:55,235 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:55,235 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:55,236 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:55,236 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:55,237 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:55,237 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:52:55,244 INFO L477 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 117 [2018-02-04 18:52:55,244 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:55,257 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:55,270 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:56,334 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,335 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,336 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,336 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,337 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,337 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,338 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,338 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,339 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,339 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:52:56,345 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,347 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,348 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 138 [2018-02-04 18:52:56,352 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,352 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,353 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,353 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,354 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,354 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,355 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,355 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:52:56,360 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 107 [2018-02-04 18:52:56,363 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,363 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,364 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,365 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,365 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,366 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,366 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,367 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,367 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,368 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 126 [2018-02-04 18:52:56,375 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:56,390 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:56,413 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:56,830 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,831 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,831 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,832 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,832 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,833 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,833 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:52:56,833 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,836 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,836 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,837 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,838 INFO L477 Elim1Store]: Elim1 did not use 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 0 case distinctions, treesize of input 55 treesize of output 146 [2018-02-04 18:52:56,841 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,841 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,841 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,842 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,842 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,843 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,843 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,844 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 130 [2018-02-04 18:52:56,851 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,852 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,852 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,853 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,853 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,854 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,854 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,855 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,855 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,856 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,856 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,857 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,858 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 19 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 191 [2018-02-04 18:52:56,866 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:56,888 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:56,904 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:56,999 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:56,999 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,000 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,001 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,001 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,002 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,002 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,003 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,003 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,004 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,006 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,007 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,008 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 153 [2018-02-04 18:52:57,012 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,013 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,013 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,014 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,014 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,015 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,015 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,016 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 183 [2018-02-04 18:52:57,025 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,026 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,026 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,027 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,027 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,028 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,028 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,029 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,029 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,030 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,030 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,031 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,031 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 262 [2018-02-04 18:52:57,041 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:57,074 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:57,094 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:57,247 INFO L267 ElimStorePlain]: Start of recursive call 3: 16 dim-1 vars, End of recursive call: and 8 xjuncts. [2018-02-04 18:52:57,363 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 62 [2018-02-04 18:52:57,365 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 36 [2018-02-04 18:52:57,368 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,369 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,370 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,372 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 52 [2018-02-04 18:52:57,375 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,376 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,376 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,377 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,379 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,379 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,384 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 32 treesize of output 85 [2018-02-04 18:52:57,384 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:57,393 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:57,398 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:57,407 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:57,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 8 xjuncts. [2018-02-04 18:52:57,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 8 xjuncts. [2018-02-04 18:52:57,601 INFO L202 ElimStorePlain]: Needed 36 recursive calls to eliminate 8 variables, input treesize:80, output treesize:257 [2018-02-04 18:52:57,700 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:52:57,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:57,715 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 50 treesize of output 39 [2018-02-04 18:52:57,717 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,717 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,718 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,718 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,718 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,719 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,719 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,720 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,720 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,721 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,721 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,722 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,723 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,724 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,724 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,725 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,726 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:57,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 17 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 218 [2018-02-04 18:52:57,727 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:57,746 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:52:57,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:57,756 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:105, output treesize:70 [2018-02-04 18:52:57,988 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-04 18:52:57,988 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:57,994 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-04 18:52:57,994 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:28 [2018-02-04 18:53:01,454 WARN L146 SmtUtils]: Spent 1267ms on a formula simplification. DAG size of input: 158 DAG size of output 73 [2018-02-04 18:53:01,457 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-02-04 18:53:01,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:01,564 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 56 treesize of output 53 [2018-02-04 18:53:01,566 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 51 [2018-02-04 18:53:01,568 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 53 [2018-02-04 18:53:01,571 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 55 [2018-02-04 18:53:01,577 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 57 [2018-02-04 18:53:01,585 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 57 treesize of output 64 [2018-02-04 18:53:01,585 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:01,591 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:53:01,597 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:53:01,604 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:53:01,609 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:53:01,616 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:53:01,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 310 treesize of output 171 [2018-02-04 18:53:01,633 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:01,634 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 163 treesize of output 152 [2018-02-04 18:53:01,634 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:01,646 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 148 treesize of output 120 [2018-02-04 18:53:01,671 WARN L288 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:53:01,671 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:01,695 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:01,695 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:53:01,696 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:01,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 127 [2018-02-04 18:53:01,698 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:01,699 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:01,700 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:01,700 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:01,701 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 113 [2018-02-04 18:53:01,703 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:01,703 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:01,704 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:01,705 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:01,705 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:01,706 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:53:01,706 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 145 [2018-02-04 18:53:01,709 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:01,710 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:01,710 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:01,711 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:01,711 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:01,712 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:01,712 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:53:01,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 203 [2018-02-04 18:53:01,713 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:01,728 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:53:01,738 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:53:01,750 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:53:01,759 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:53:01,773 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 92 treesize of output 76 [2018-02-04 18:53:01,791 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:01,792 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 67 treesize of output 73 [2018-02-04 18:53:01,792 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:01,793 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:53:01,793 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:01,798 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:53:01,809 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 62 treesize of output 50 [2018-02-04 18:53:01,819 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:53:01,819 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:01,820 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:01,821 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:53:01,821 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 0 case distinctions, treesize of input 48 treesize of output 39 [2018-02-04 18:53:01,821 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:01,825 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:53:01,831 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:53:01,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 313 treesize of output 174 [2018-02-04 18:53:01,878 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:01,879 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:01,885 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 165 [2018-02-04 18:53:01,885 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:01,903 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 139 treesize of output 131 [2018-02-04 18:53:01,903 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:01,916 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 150 treesize of output 146 [2018-02-04 18:53:01,916 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:01,927 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 154 treesize of output 118 [2018-02-04 18:53:01,945 WARN L288 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:53:01,945 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:01,947 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:01,948 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:01,950 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:01,951 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:01,952 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:01,986 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 119 [2018-02-04 18:53:02,058 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,058 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,059 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,059 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,064 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,064 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,065 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,066 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,069 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 63 treesize of output 137 [2018-02-04 18:53:02,294 WARN L146 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 92 DAG size of output 60 [2018-02-04 18:53:02,296 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,297 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,297 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,298 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,299 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,299 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,300 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,300 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,301 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,301 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,302 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,302 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,303 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:53:02,303 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,304 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,304 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 146 [2018-02-04 18:53:02,319 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,319 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,320 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,320 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,321 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,321 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,322 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,322 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,323 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,323 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,324 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,324 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:53:02,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 17 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 117 [2018-02-04 18:53:02,332 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:02,348 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:53:02,367 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,368 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,368 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,368 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,369 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,369 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,370 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,370 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,371 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,371 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,372 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,372 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,372 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,373 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,373 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,374 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,374 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:53:02,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 160 [2018-02-04 18:53:02,386 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,386 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,387 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,387 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,388 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,388 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,389 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,389 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,389 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,390 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,390 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:53:02,391 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,397 INFO L477 Elim1Store]: Elim1 did not use 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 0 case distinctions, treesize of input 33 treesize of output 121 [2018-02-04 18:53:02,397 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:02,414 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:53:02,434 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,435 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,435 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,436 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,437 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,437 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,441 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,441 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,442 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,444 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,447 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,448 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,449 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,450 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 45 treesize of output 171 [2018-02-04 18:53:02,520 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:53:02,520 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:02,638 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,644 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,644 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,646 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,646 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,647 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,649 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,650 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,651 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,651 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,656 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,657 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,657 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,659 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:02,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 25 disjoint index pairs (out of 36 index pairs), introduced 5 new quantified variables, introduced 20 case distinctions, treesize of input 47 treesize of output 197 [2018-02-04 18:53:02,721 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 16 xjuncts. [2018-02-04 18:53:03,040 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,041 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,041 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,042 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,042 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,043 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,044 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,044 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,045 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,045 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,046 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,047 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,047 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:53:03,047 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 144 [2018-02-04 18:53:03,077 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:03,158 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,159 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,160 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,160 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,161 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,161 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,162 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,162 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,163 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,164 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,164 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,165 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,165 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,166 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,166 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,167 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,167 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,168 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,168 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,169 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,169 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:53:03,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 189 [2018-02-04 18:53:03,189 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:03,262 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,263 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,264 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,264 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,265 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,265 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,266 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,266 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,267 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,267 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,268 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,268 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,269 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,269 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,269 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:53:03,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 150 [2018-02-04 18:53:03,284 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:03,407 INFO L267 ElimStorePlain]: Start of recursive call 35: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-02-04 18:53:03,464 INFO L267 ElimStorePlain]: Start of recursive call 30: 3 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-02-04 18:53:03,509 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,510 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,510 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,511 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,511 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,512 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,512 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,513 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:53:03,528 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 105 [2018-02-04 18:53:03,581 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,581 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,582 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,582 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:53:03,583 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,583 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,584 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,590 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 102 [2018-02-04 18:53:03,592 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,593 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,593 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,594 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,594 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:03,595 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:53:03,598 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 66 [2018-02-04 18:53:03,598 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:03,608 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:53:03,612 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:53:03,646 INFO L267 ElimStorePlain]: Start of recursive call 29: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-02-04 18:53:03,678 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-02-04 18:53:03,713 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-02-04 18:53:03,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 15 dim-0 vars, and 6 xjuncts. [2018-02-04 18:53:03,772 INFO L202 ElimStorePlain]: Needed 43 recursive calls to eliminate 6 variables, input treesize:343, output treesize:285 [2018-02-04 18:53:06,620 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 1 case distinctions, treesize of input 20 treesize of output 18 [2018-02-04 18:53:06,620 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:53:06,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-04 18:53:06,666 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:449, output treesize:865 [2018-02-04 18:53:07,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1862 backedges. 469 proven. 868 refuted. 114 times theorem prover too weak. 411 trivial. 0 not checked. [2018-02-04 18:53:07,552 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:53:07,552 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-02-04 18:53:07,552 INFO L409 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-02-04 18:53:07,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-02-04 18:53:07,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=7034, Unknown=355, NotChecked=0, Total=7656 [2018-02-04 18:53:07,553 INFO L87 Difference]: Start difference. First operand 269 states and 294 transitions. Second operand 88 states. [2018-02-04 18:53:14,686 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 73 DAG size of output 67 [2018-02-04 18:53:17,227 WARN L146 SmtUtils]: Spent 341ms on a formula simplification. DAG size of input: 80 DAG size of output 69 [2018-02-04 18:53:19,387 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 71 DAG size of output 63 [2018-02-04 18:53:20,732 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 79 DAG size of output 70 [2018-02-04 18:53:22,568 WARN L146 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 98 DAG size of output 78 [2018-02-04 18:53:24,326 WARN L146 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 81 DAG size of output 72 [2018-02-04 18:53:25,907 WARN L146 SmtUtils]: Spent 423ms on a formula simplification. DAG size of input: 86 DAG size of output 77 [2018-02-04 18:53:29,281 WARN L143 SmtUtils]: Spent 170ms on a formula simplification that was a NOOP. DAG size: 79 [2018-02-04 18:53:31,435 WARN L143 SmtUtils]: Spent 422ms on a formula simplification that was a NOOP. DAG size: 84 [2018-02-04 18:53:37,606 WARN L143 SmtUtils]: Spent 612ms on a formula simplification that was a NOOP. DAG size: 82 [2018-02-04 18:53:39,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:53:39,166 INFO L93 Difference]: Finished difference Result 300 states and 330 transitions. [2018-02-04 18:53:39,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-02-04 18:53:39,167 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 321 [2018-02-04 18:53:39,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:53:39,168 INFO L225 Difference]: With dead ends: 300 [2018-02-04 18:53:39,168 INFO L226 Difference]: Without dead ends: 300 [2018-02-04 18:53:39,169 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6650 ImplicationChecksByTransitivity, 22.7s TimeCoverageRelationStatistics Valid=851, Invalid=25135, Unknown=746, NotChecked=0, Total=26732 [2018-02-04 18:53:39,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-02-04 18:53:39,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 290. [2018-02-04 18:53:39,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-02-04 18:53:39,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 319 transitions. [2018-02-04 18:53:39,172 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 319 transitions. Word has length 321 [2018-02-04 18:53:39,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:53:39,172 INFO L432 AbstractCegarLoop]: Abstraction has 290 states and 319 transitions. [2018-02-04 18:53:39,172 INFO L433 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-02-04 18:53:39,172 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 319 transitions. [2018-02-04 18:53:39,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-02-04 18:53:39,174 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:53:39,174 INFO L351 BasicCegarLoop]: trace histogram [22, 21, 16, 16, 16, 16, 15, 15, 15, 15, 15, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:53:39,174 INFO L371 AbstractCegarLoop]: === Iteration 47 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:53:39,174 INFO L82 PathProgramCache]: Analyzing trace with hash -497977668, now seen corresponding path program 17 times [2018-02-04 18:53:39,174 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:53:39,175 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:53:39,175 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:53:39,175 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:53:39,175 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:53:39,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:53:39,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:53:39,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1949 backedges. 875 proven. 111 refuted. 0 times theorem prover too weak. 963 trivial. 0 not checked. [2018-02-04 18:53:39,585 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:53:39,585 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:53:39,586 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 18:53:39,717 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-02-04 18:53:39,717 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:53:39,741 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:53:40,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1949 backedges. 894 proven. 229 refuted. 0 times theorem prover too weak. 826 trivial. 0 not checked. [2018-02-04 18:53:40,109 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:53:40,109 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 37 [2018-02-04 18:53:40,110 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 18:53:40,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 18:53:40,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1194, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 18:53:40,111 INFO L87 Difference]: Start difference. First operand 290 states and 319 transitions. Second operand 37 states. [2018-02-04 18:53:40,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:53:40,772 INFO L93 Difference]: Finished difference Result 312 states and 344 transitions. [2018-02-04 18:53:40,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 18:53:40,773 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 326 [2018-02-04 18:53:40,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:53:40,774 INFO L225 Difference]: With dead ends: 312 [2018-02-04 18:53:40,774 INFO L226 Difference]: Without dead ends: 312 [2018-02-04 18:53:40,775 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1191 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=494, Invalid=3538, Unknown=0, NotChecked=0, Total=4032 [2018-02-04 18:53:40,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-02-04 18:53:40,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 299. [2018-02-04 18:53:40,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-02-04 18:53:40,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 331 transitions. [2018-02-04 18:53:40,780 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 331 transitions. Word has length 326 [2018-02-04 18:53:40,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:53:40,781 INFO L432 AbstractCegarLoop]: Abstraction has 299 states and 331 transitions. [2018-02-04 18:53:40,781 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 18:53:40,781 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 331 transitions. [2018-02-04 18:53:40,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-02-04 18:53:40,783 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:53:40,784 INFO L351 BasicCegarLoop]: trace histogram [21, 21, 15, 15, 15, 15, 15, 15, 15, 15, 15, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:53:40,784 INFO L371 AbstractCegarLoop]: === Iteration 48 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:53:40,784 INFO L82 PathProgramCache]: Analyzing trace with hash -2061679473, now seen corresponding path program 18 times [2018-02-04 18:53:40,784 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:53:40,784 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:53:40,785 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:53:40,785 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:53:40,785 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:53:40,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:53:40,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:53:40,832 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:53:40,832 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:53:40,832 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:53:40,832 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 18:53:41,015 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-02-04 18:53:41,015 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:53:41,039 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:53:41,042 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-04 18:53:41,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:41,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:53:41,045 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:53:41,055 WARN L1033 $PredicateComparison]: unable to prove that (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) is different from true [2018-02-04 18:53:41,058 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-04 18:53:41,058 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:41,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:41,060 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:53:41,072 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int) (|v_foo_~#a~0.base_BEFORE_CALL_38| Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_38|))) (exists ((v_prenex_427 Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_427)) |c_#length|))) is different from true [2018-02-04 18:53:41,076 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-04 18:53:41,076 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:41,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:41,082 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:53:41,085 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int) (|v_foo_~#a~0.base_BEFORE_CALL_38| Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_38|))) (exists ((|foo_~#a~0.base| Int) (v_prenex_427 Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_427)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:53:41,097 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 2 case distinctions, treesize of input 14 treesize of output 17 [2018-02-04 18:53:41,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:53:41,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-02-04 18:53:41,121 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:29, output treesize:52 [2018-02-04 18:53:41,162 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:41,163 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:41,164 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 26 treesize of output 20 [2018-02-04 18:53:41,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:41,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:41,179 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:20 [2018-02-04 18:53:41,196 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-04 18:53:41,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:41,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:41,198 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:53:41,210 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int) (|v_foo_~#a~0.base_BEFORE_CALL_38| Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_38|))) (exists ((v_prenex_432 Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_432)) |c_#length|))) is different from true [2018-02-04 18:53:41,214 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-04 18:53:41,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:41,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:41,220 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:53:41,222 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int) (|v_foo_~#a~0.base_BEFORE_CALL_38| Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_38|))) (exists ((|foo_~#a~0.base| Int) (v_prenex_432 Int)) (and (= 0 (select |c_#valid| |foo_~#a~0.base|)) (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_432)) |c_#length|)))) is different from true [2018-02-04 18:53:41,244 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 21 treesize of output 32 [2018-02-04 18:53:41,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:53:41,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-02-04 18:53:41,274 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:40, output treesize:106 [2018-02-04 18:53:41,437 WARN L146 SmtUtils]: Spent 147ms on a formula simplification. DAG size of input: 76 DAG size of output 39 [2018-02-04 18:53:41,439 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:41,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2018-02-04 18:53:41,512 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:41,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:41,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:63, output treesize:20 [2018-02-04 18:53:41,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 8 treesize of output 7 [2018-02-04 18:53:41,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:41,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:41,533 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:53:41,543 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_444 Int)) (= |c_#length| (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_444)))) (exists ((foo_~n Int) (|v_foo_~#a~0.base_BEFORE_CALL_38| Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_38|)))) is different from true [2018-02-04 18:53:41,545 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-04 18:53:41,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:41,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:41,549 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:53:41,550 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int) (|v_foo_~#a~0.base_BEFORE_CALL_38| Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_38|))) (exists ((|foo_~#a~0.base| Int) (v_prenex_444 Int)) (and (= |c_#length| (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_444))) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:53:41,563 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 21 treesize of output 32 [2018-02-04 18:53:41,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:53:41,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-02-04 18:53:41,585 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:40, output treesize:106 [2018-02-04 18:53:41,609 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:41,609 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 30 treesize of output 20 [2018-02-04 18:53:41,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:41,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:41,619 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:63, output treesize:20 [2018-02-04 18:53:41,631 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-04 18:53:41,631 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:41,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:41,632 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:53:41,641 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int) (|v_foo_~#a~0.base_BEFORE_CALL_38| Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_38|))) (exists ((v_prenex_456 Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_456)) |c_#length|))) is different from true [2018-02-04 18:53:41,643 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-04 18:53:41,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:41,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:41,648 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:53:41,650 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (v_prenex_456 Int)) (and (= 0 (select |c_#valid| |foo_~#a~0.base|)) (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_456)) |c_#length|))) (exists ((foo_~n Int) (|v_foo_~#a~0.base_BEFORE_CALL_38| Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_38|)))) is different from true [2018-02-04 18:53:41,663 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 21 treesize of output 32 [2018-02-04 18:53:41,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:53:41,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-02-04 18:53:41,686 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:40, output treesize:106 [2018-02-04 18:53:41,739 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:41,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-02-04 18:53:41,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:41,742 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-04 18:53:41,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:41,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:41,745 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:20, output treesize:13 [2018-02-04 18:53:41,766 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= |c_#valid| (store |c_old(#valid)| |foo_~#a~0.base| 0)) (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) is different from true [2018-02-04 18:53:41,781 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 44 treesize of output 51 [2018-02-04 18:53:41,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:53:41,835 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 46 treesize of output 53 [2018-02-04 18:53:41,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-02-04 18:53:41,913 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 45 treesize of output 39 [2018-02-04 18:53:41,913 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:41,914 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 41 treesize of output 39 [2018-02-04 18:53:41,915 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:41,919 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 36 treesize of output 30 [2018-02-04 18:53:41,919 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:41,984 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 43 treesize of output 37 [2018-02-04 18:53:41,985 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:41,986 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 41 treesize of output 39 [2018-02-04 18:53:41,986 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:41,987 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 34 treesize of output 28 [2018-02-04 18:53:41,987 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:42,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 4 dim-1 vars, End of recursive call: 20 dim-0 vars, and 6 xjuncts. [2018-02-04 18:53:42,043 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 13 variables, input treesize:91, output treesize:193 [2018-02-04 18:53:42,236 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:42,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-02-04 18:53:42,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:42,239 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-04 18:53:42,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:42,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:42,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:20, output treesize:13 [2018-02-04 18:53:42,355 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:42,357 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:42,361 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 2 case distinctions, treesize of input 21 treesize of output 40 [2018-02-04 18:53:42,361 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:53:42,381 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:42,382 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:42,383 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:42,383 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 16 treesize of output 9 [2018-02-04 18:53:42,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:42,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 18:53:42,395 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:49, output treesize:60 [2018-02-04 18:53:42,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1862 backedges. 740 proven. 126 refuted. 0 times theorem prover too weak. 474 trivial. 522 not checked. [2018-02-04 18:53:42,630 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:53:42,630 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-04 18:53:42,630 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 18:53:42,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 18:53:42,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=582, Unknown=11, NotChecked=590, Total=1332 [2018-02-04 18:53:42,631 INFO L87 Difference]: Start difference. First operand 299 states and 331 transitions. Second operand 37 states. [2018-02-04 18:53:42,815 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int) (|v_foo_~#a~0.base_BEFORE_CALL_38| Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_38|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= |c_#valid| (store |c_old(#valid)| |foo_~#a~0.base| 0)) (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((|foo_~#a~0.base| Int) (v_prenex_427 Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_427)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|)))) (exists ((|foo_~#a~0.base| Int) (v_prenex_432 Int)) (and (= 0 (select |c_#valid| |foo_~#a~0.base|)) (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_432)) |c_#length|)))) is different from true [2018-02-04 18:53:43,548 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (v_prenex_456 Int)) (and (= 0 (select |c_#valid| |foo_~#a~0.base|)) (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_456)) |c_#length|))) (exists ((foo_~n Int) (|v_foo_~#a~0.base_BEFORE_CALL_38| Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_38|))) (exists ((|foo_~#a~0.base| Int) (v_prenex_444 Int)) (and (= |c_#length| (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_444))) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:53:43,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:53:43,616 INFO L93 Difference]: Finished difference Result 315 states and 349 transitions. [2018-02-04 18:53:43,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 18:53:43,617 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 321 [2018-02-04 18:53:43,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:53:43,618 INFO L225 Difference]: With dead ends: 315 [2018-02-04 18:53:43,618 INFO L226 Difference]: Without dead ends: 315 [2018-02-04 18:53:43,619 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 275 SyntacticMatches, 37 SemanticMatches, 55 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 1161 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=359, Invalid=1652, Unknown=17, NotChecked=1164, Total=3192 [2018-02-04 18:53:43,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-02-04 18:53:43,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 303. [2018-02-04 18:53:43,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-02-04 18:53:43,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 337 transitions. [2018-02-04 18:53:43,624 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 337 transitions. Word has length 321 [2018-02-04 18:53:43,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:53:43,624 INFO L432 AbstractCegarLoop]: Abstraction has 303 states and 337 transitions. [2018-02-04 18:53:43,624 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 18:53:43,625 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 337 transitions. [2018-02-04 18:53:43,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-02-04 18:53:43,627 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:53:43,627 INFO L351 BasicCegarLoop]: trace histogram [22, 21, 16, 16, 16, 16, 16, 15, 15, 15, 15, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:53:43,627 INFO L371 AbstractCegarLoop]: === Iteration 49 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:53:43,627 INFO L82 PathProgramCache]: Analyzing trace with hash -265293063, now seen corresponding path program 19 times [2018-02-04 18:53:43,628 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:53:43,628 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:53:43,628 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:53:43,628 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:53:43,628 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:53:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:53:43,653 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:53:44,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1964 backedges. 915 proven. 91 refuted. 0 times theorem prover too weak. 958 trivial. 0 not checked. [2018-02-04 18:53:44,026 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:53:44,026 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:53:44,027 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:53:44,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:53:44,051 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:53:44,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1964 backedges. 569 proven. 117 refuted. 0 times theorem prover too weak. 1278 trivial. 0 not checked. [2018-02-04 18:53:44,282 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:53:44,282 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 34 [2018-02-04 18:53:44,283 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 18:53:44,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 18:53:44,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=982, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 18:53:44,283 INFO L87 Difference]: Start difference. First operand 303 states and 337 transitions. Second operand 34 states. [2018-02-04 18:53:44,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:53:44,944 INFO L93 Difference]: Finished difference Result 310 states and 338 transitions. [2018-02-04 18:53:44,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 18:53:44,944 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 327 [2018-02-04 18:53:44,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:53:44,945 INFO L225 Difference]: With dead ends: 310 [2018-02-04 18:53:44,945 INFO L226 Difference]: Without dead ends: 300 [2018-02-04 18:53:44,945 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=393, Invalid=2577, Unknown=0, NotChecked=0, Total=2970 [2018-02-04 18:53:44,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-02-04 18:53:44,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 293. [2018-02-04 18:53:44,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-02-04 18:53:44,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 321 transitions. [2018-02-04 18:53:44,951 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 321 transitions. Word has length 327 [2018-02-04 18:53:44,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:53:44,951 INFO L432 AbstractCegarLoop]: Abstraction has 293 states and 321 transitions. [2018-02-04 18:53:44,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 18:53:44,951 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 321 transitions. [2018-02-04 18:53:44,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-02-04 18:53:44,954 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:53:44,954 INFO L351 BasicCegarLoop]: trace histogram [21, 21, 15, 15, 15, 15, 15, 15, 15, 15, 15, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:53:44,954 INFO L371 AbstractCegarLoop]: === Iteration 50 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:53:44,954 INFO L82 PathProgramCache]: Analyzing trace with hash -130067974, now seen corresponding path program 2 times [2018-02-04 18:53:44,954 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:53:44,954 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:53:44,955 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:53:44,955 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:53:44,955 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:53:44,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:53:44,969 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:53:45,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1886 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 1769 trivial. 0 not checked. [2018-02-04 18:53:45,105 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:53:45,105 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:53:45,105 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:53:45,122 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 18:53:45,122 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:53:45,126 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:53:45,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1886 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 1769 trivial. 0 not checked. [2018-02-04 18:53:45,161 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:53:45,161 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-02-04 18:53:45,161 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 18:53:45,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 18:53:45,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-02-04 18:53:45,162 INFO L87 Difference]: Start difference. First operand 293 states and 321 transitions. Second operand 10 states. [2018-02-04 18:53:45,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:53:45,193 INFO L93 Difference]: Finished difference Result 307 states and 338 transitions. [2018-02-04 18:53:45,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 18:53:45,194 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 334 [2018-02-04 18:53:45,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:53:45,194 INFO L225 Difference]: With dead ends: 307 [2018-02-04 18:53:45,195 INFO L226 Difference]: Without dead ends: 307 [2018-02-04 18:53:45,195 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-02-04 18:53:45,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-02-04 18:53:45,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 299. [2018-02-04 18:53:45,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-02-04 18:53:45,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 327 transitions. [2018-02-04 18:53:45,199 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 327 transitions. Word has length 334 [2018-02-04 18:53:45,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:53:45,199 INFO L432 AbstractCegarLoop]: Abstraction has 299 states and 327 transitions. [2018-02-04 18:53:45,199 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 18:53:45,199 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 327 transitions. [2018-02-04 18:53:45,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-02-04 18:53:45,202 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:53:45,202 INFO L351 BasicCegarLoop]: trace histogram [28, 28, 21, 21, 21, 21, 21, 21, 21, 21, 21, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:53:45,202 INFO L371 AbstractCegarLoop]: === Iteration 51 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:53:45,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1988970696, now seen corresponding path program 20 times [2018-02-04 18:53:45,202 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:53:45,202 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:53:45,203 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:53:45,203 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:53:45,203 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:53:45,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:53:45,256 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:53:45,273 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:53:45,274 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:53:45,274 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:53:45,274 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:53:45,314 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 18:53:45,314 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:53:45,320 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:53:45,343 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-04 18:53:45,344 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:45,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:53:45,347 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:53:45,362 WARN L1033 $PredicateComparison]: unable to prove that (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) is different from true [2018-02-04 18:53:45,364 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-04 18:53:45,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:45,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:45,366 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:53:45,376 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_44| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_44|))) (exists ((v_prenex_484 Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_484)) |c_#length|))) is different from true [2018-02-04 18:53:45,380 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-04 18:53:45,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:45,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:45,395 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:53:45,397 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_44| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_44|))) (exists ((|foo_~#a~0.base| Int) (v_prenex_484 Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_484)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:53:45,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 17 [2018-02-04 18:53:45,411 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:53:45,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-02-04 18:53:45,428 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:58 [2018-02-04 18:53:45,476 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:45,476 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:45,477 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 29 treesize of output 23 [2018-02-04 18:53:45,477 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:45,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:45,495 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:23 [2018-02-04 18:53:45,530 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-04 18:53:45,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:45,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:45,532 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:53:45,545 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_44| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_44|))) (exists ((v_prenex_489 Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_489)) |c_#length|))) is different from true [2018-02-04 18:53:45,548 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-04 18:53:45,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:45,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:45,554 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:53:45,556 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (v_prenex_489 Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_489)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|)))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_44| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_44|)))) is different from true [2018-02-04 18:53:45,578 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 21 treesize of output 32 [2018-02-04 18:53:45,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:53:45,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-02-04 18:53:45,619 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-02-04 18:53:45,685 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:45,685 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:45,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-02-04 18:53:45,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:45,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:45,701 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:76, output treesize:34 [2018-02-04 18:53:45,724 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-04 18:53:45,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:45,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:45,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:53:45,740 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_44| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_44|))) (exists ((v_prenex_501 Int)) (= |c_#length| (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_501))))) is different from true [2018-02-04 18:53:45,742 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-04 18:53:45,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:45,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:45,747 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:53:45,749 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_44| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_44|))) (exists ((v_prenex_501 Int) (|foo_~#a~0.base| Int)) (and (= |c_#length| (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_501))) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:53:45,764 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 21 treesize of output 32 [2018-02-04 18:53:45,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:53:45,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-02-04 18:53:45,798 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-02-04 18:53:45,853 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:53:45,853 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:45,860 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:45,861 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:45,861 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-04 18:53:45,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:45,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:45,865 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:69, output treesize:23 [2018-02-04 18:53:45,897 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-04 18:53:45,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:45,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:45,898 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:53:45,909 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_513 Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_513)) |c_#length|)) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_44| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_44|)))) is different from true [2018-02-04 18:53:45,912 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-04 18:53:45,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:45,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:45,917 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:53:45,919 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_513 Int) (|foo_~#a~0.base| Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_513)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|)))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_44| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_44|)))) is different from true [2018-02-04 18:53:45,935 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 21 treesize of output 32 [2018-02-04 18:53:45,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:53:45,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-02-04 18:53:45,959 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-02-04 18:53:46,042 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:46,043 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:46,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-02-04 18:53:46,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:46,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:46,058 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:76, output treesize:34 [2018-02-04 18:53:46,099 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-04 18:53:46,099 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:46,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:46,100 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:53:46,109 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_44| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_44|))) (exists ((v_prenex_525 Int)) (= |c_#length| (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_525))))) is different from true [2018-02-04 18:53:46,111 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-04 18:53:46,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:46,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:46,115 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:53:46,116 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_44| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_44|))) (exists ((|foo_~#a~0.base| Int) (v_prenex_525 Int)) (and (= |c_#length| (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_525))) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:53:46,129 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 21 treesize of output 32 [2018-02-04 18:53:46,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:53:46,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-02-04 18:53:46,153 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-02-04 18:53:46,243 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:46,243 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 33 treesize of output 23 [2018-02-04 18:53:46,243 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:46,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:46,256 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:69, output treesize:23 [2018-02-04 18:53:46,295 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-04 18:53:46,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:46,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:46,296 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:53:46,309 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_44| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_44|))) (exists ((v_prenex_537 Int)) (= |c_#length| (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_537))))) is different from true [2018-02-04 18:53:46,311 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-04 18:53:46,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:46,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:46,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:53:46,316 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_44| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_44|))) (exists ((|foo_~#a~0.base| Int) (v_prenex_537 Int)) (and (= 0 (select |c_#valid| |foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_537)))))) is different from true [2018-02-04 18:53:46,333 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 21 treesize of output 32 [2018-02-04 18:53:46,333 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:53:46,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-02-04 18:53:46,355 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-02-04 18:53:46,539 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) is different from true [2018-02-04 18:53:46,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 18:53:46,549 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:46,550 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-04 18:53:46,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:46,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:46,551 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-02-04 18:53:46,562 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_44| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_44|))) (exists ((|foo_~#a~0.base| Int) (v_prenex_548 Int)) (and (= |c_#length| (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_548))) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0)))) is different from true [2018-02-04 18:53:46,567 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:46,567 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:46,568 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:46,569 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 16 treesize of output 9 [2018-02-04 18:53:46,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:46,586 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 2 case distinctions, treesize of input 21 treesize of output 32 [2018-02-04 18:53:46,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 18:53:46,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-02-04 18:53:46,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:56, output treesize:86 [2018-02-04 18:53:46,944 INFO L134 CoverageAnalysis]: Checked inductivity of 3391 backedges. 12 proven. 135 refuted. 0 times theorem prover too weak. 2472 trivial. 772 not checked. [2018-02-04 18:53:46,944 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:53:46,944 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-04 18:53:46,945 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 18:53:46,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 18:53:46,945 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=379, Unknown=15, NotChecked=810, Total=1332 [2018-02-04 18:53:46,945 INFO L87 Difference]: Start difference. First operand 299 states and 327 transitions. Second operand 37 states. [2018-02-04 18:53:47,011 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_44| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_44|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|))) is different from true [2018-02-04 18:53:47,013 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|))) is different from true [2018-02-04 18:53:47,029 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_513 Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_513)) |c_#length|)) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_44| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_44|))) (exists ((v_prenex_484 Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_484)) |c_#length|)) (exists ((v_prenex_537 Int)) (= |c_#length| (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_537)))) (exists ((|foo_~#a~0.base| Int) (v_prenex_548 Int)) (and (= |c_#length| (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_548))) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((v_prenex_525 Int)) (= |c_#length| (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_525)))) (exists ((v_prenex_501 Int)) (= |c_#length| (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_501)))) (exists ((v_prenex_489 Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_489)) |c_#length|))) is different from true [2018-02-04 18:53:47,031 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_44| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_44|))) (exists ((v_prenex_484 Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_484)) |c_#length|)) (exists ((v_prenex_489 Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_489)) |c_#length|))) is different from true [2018-02-04 18:53:47,033 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (v_prenex_489 Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_489)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|)))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_44| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_44|))) (exists ((|foo_~#a~0.base| Int) (v_prenex_484 Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_484)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:53:47,237 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_513 Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_513)) |c_#length|)) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_44| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_44|))) (exists ((v_prenex_537 Int)) (= |c_#length| (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_537)))) (exists ((|foo_~#a~0.base| Int) (v_prenex_548 Int)) (and (= |c_#length| (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_548))) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((v_prenex_525 Int)) (= |c_#length| (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_525)))) (exists ((v_prenex_501 Int)) (= |c_#length| (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_501))))) is different from true [2018-02-04 18:53:47,240 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_513 Int) (|foo_~#a~0.base| Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_513)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|)))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_44| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_44|))) (exists ((|foo_~#a~0.base| Int) (v_prenex_537 Int)) (and (= 0 (select |c_#valid| |foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_537))))) (exists ((|foo_~#a~0.base| Int) (v_prenex_548 Int)) (and (= |c_#length| (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_548))) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((|foo_~#a~0.base| Int) (v_prenex_525 Int)) (and (= |c_#length| (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_525))) (= 0 (select |c_#valid| |foo_~#a~0.base|)))) (exists ((v_prenex_501 Int) (|foo_~#a~0.base| Int)) (and (= |c_#length| (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_501))) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:53:48,486 WARN L146 SmtUtils]: Spent 901ms on a formula simplification. DAG size of input: 56 DAG size of output 41 [2018-02-04 18:53:48,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:53:48,763 INFO L93 Difference]: Finished difference Result 329 states and 366 transitions. [2018-02-04 18:53:48,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 18:53:48,763 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 412 [2018-02-04 18:53:48,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:53:48,764 INFO L225 Difference]: With dead ends: 329 [2018-02-04 18:53:48,764 INFO L226 Difference]: Without dead ends: 329 [2018-02-04 18:53:48,764 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 366 SyntacticMatches, 14 SemanticMatches, 55 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=324, Invalid=932, Unknown=22, NotChecked=1914, Total=3192 [2018-02-04 18:53:48,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-02-04 18:53:48,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 308. [2018-02-04 18:53:48,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-02-04 18:53:48,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 340 transitions. [2018-02-04 18:53:48,768 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 340 transitions. Word has length 412 [2018-02-04 18:53:48,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:53:48,769 INFO L432 AbstractCegarLoop]: Abstraction has 308 states and 340 transitions. [2018-02-04 18:53:48,769 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 18:53:48,769 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 340 transitions. [2018-02-04 18:53:48,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-02-04 18:53:48,772 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:53:48,772 INFO L351 BasicCegarLoop]: trace histogram [28, 28, 21, 21, 21, 21, 21, 21, 21, 21, 21, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:53:48,772 INFO L371 AbstractCegarLoop]: === Iteration 52 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:53:48,772 INFO L82 PathProgramCache]: Analyzing trace with hash 762198363, now seen corresponding path program 21 times [2018-02-04 18:53:48,772 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:53:48,772 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:53:48,773 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:53:48,773 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:53:48,773 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:53:48,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:53:48,805 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:53:48,815 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:53:48,816 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:53:48,816 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:53:48,816 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 18:53:48,937 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-02-04 18:53:48,937 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:53:48,951 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:53:48,971 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-04 18:53:48,971 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:48,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:53:48,975 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:53:48,989 WARN L1033 $PredicateComparison]: unable to prove that (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) is different from true [2018-02-04 18:53:48,992 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-04 18:53:48,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:48,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:48,993 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:53:49,004 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_50| Int) (foo_~n Int)) (= (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_50|) (* 4 foo_~n))) (exists ((v_prenex_553 Int)) (= |c_#length| (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_553))))) is different from true [2018-02-04 18:53:49,007 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-04 18:53:49,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:49,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:49,013 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:53:49,015 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_50| Int) (foo_~n Int)) (= (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_50|) (* 4 foo_~n))) (exists ((|foo_~#a~0.base| Int) (v_prenex_553 Int)) (and (= |c_#length| (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_553))) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:53:49,027 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 2 case distinctions, treesize of input 14 treesize of output 17 [2018-02-04 18:53:49,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:53:49,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-02-04 18:53:49,043 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:58 [2018-02-04 18:53:49,082 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:49,083 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:49,083 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 29 treesize of output 23 [2018-02-04 18:53:49,083 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:49,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:49,097 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:23 [2018-02-04 18:53:49,121 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-04 18:53:49,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:49,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:49,122 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:53:49,131 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_50| Int) (foo_~n Int)) (= (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_50|) (* 4 foo_~n))) (exists ((v_prenex_558 Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_558)) |c_#length|))) is different from true [2018-02-04 18:53:49,133 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-04 18:53:49,133 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:49,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:49,136 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:53:49,137 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_50| Int) (foo_~n Int)) (= (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_50|) (* 4 foo_~n))) (exists ((|foo_~#a~0.base| Int) (v_prenex_558 Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_558)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:53:49,150 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 21 treesize of output 32 [2018-02-04 18:53:49,150 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:53:49,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-02-04 18:53:49,173 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-02-04 18:53:49,218 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:49,219 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 33 treesize of output 23 [2018-02-04 18:53:49,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:49,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:49,230 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:69, output treesize:23 [2018-02-04 18:53:49,257 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-04 18:53:49,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:49,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:49,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:53:49,265 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_50| Int) (foo_~n Int)) (= (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_50|) (* 4 foo_~n))) (exists ((v_prenex_570 Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 v_prenex_570)) |c_#length|))) is different from true [2018-02-04 18:53:49,267 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-04 18:53:49,267 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:49,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:49,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:53:49,271 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_50| Int) (foo_~n Int)) (= (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_50|) (* 4 foo_~n))) (exists ((|foo_~#a~0.base| Int) (v_prenex_570 Int)) (and (= 0 (select |c_#valid| |foo_~#a~0.base|)) (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_570)) |c_#length|)))) is different from true [2018-02-04 18:53:49,284 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 21 treesize of output 32 [2018-02-04 18:53:49,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:53:49,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-02-04 18:53:49,308 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-02-04 18:53:49,427 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:49,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-02-04 18:53:49,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:49,431 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-04 18:53:49,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:49,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:49,433 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:20, output treesize:13 [2018-02-04 18:53:49,463 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= |c_#valid| (store |c_old(#valid)| |foo_~#a~0.base| 0)) (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) is different from true [2018-02-04 18:53:49,520 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 8 case distinctions, treesize of input 54 treesize of output 87 [2018-02-04 18:53:49,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 32 xjuncts. [2018-02-04 18:53:49,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2018-02-04 18:53:49,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:49,676 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 55 treesize of output 53 [2018-02-04 18:53:49,676 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:49,677 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 47 treesize of output 41 [2018-02-04 18:53:49,677 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:49,678 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 53 treesize of output 51 [2018-02-04 18:53:49,678 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:49,679 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 47 treesize of output 41 [2018-02-04 18:53:49,680 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:49,681 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 52 treesize of output 46 [2018-02-04 18:53:49,681 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:49,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 56 [2018-02-04 18:53:49,778 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-02-04 18:53:49,891 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 44 treesize of output 42 [2018-02-04 18:53:49,891 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:49,893 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 48 treesize of output 42 [2018-02-04 18:53:49,893 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:49,894 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 39 treesize of output 33 [2018-02-04 18:53:49,895 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:49,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 4 dim-1 vars, End of recursive call: 35 dim-0 vars, and 9 xjuncts. [2018-02-04 18:53:49,994 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 15 variables, input treesize:104, output treesize:346 [2018-02-04 18:53:50,103 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-04 18:53:50,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:50,107 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:50,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-02-04 18:53:50,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:50,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:50,110 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:20, output treesize:13 [2018-02-04 18:53:50,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 56 [2018-02-04 18:53:50,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:53:50,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-02-04 18:53:50,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:50,251 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 39 treesize of output 33 [2018-02-04 18:53:50,251 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:50,253 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 48 treesize of output 42 [2018-02-04 18:53:50,253 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:50,254 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 44 treesize of output 42 [2018-02-04 18:53:50,254 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:50,317 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 8 case distinctions, treesize of input 48 treesize of output 81 [2018-02-04 18:53:50,319 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 32 xjuncts. [2018-02-04 18:53:50,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 4 dim-1 vars, End of recursive call: 35 dim-0 vars, and 9 xjuncts. [2018-02-04 18:53:50,469 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 15 variables, input treesize:104, output treesize:346 [2018-02-04 18:53:50,649 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-04 18:53:50,649 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:50,653 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:50,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-02-04 18:53:50,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:50,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:50,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:20, output treesize:13 [2018-02-04 18:53:50,690 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:50,691 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:50,692 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:50,692 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 0 case distinctions, treesize of input 22 treesize of output 30 [2018-02-04 18:53:50,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:50,704 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:50,705 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:50,711 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 2 case distinctions, treesize of input 21 treesize of output 32 [2018-02-04 18:53:50,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 18:53:50,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-04 18:53:50,727 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:48, output treesize:71 [2018-02-04 18:53:50,790 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) is different from true [2018-02-04 18:53:50,799 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-04 18:53:50,800 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:50,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 18:53:50,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:50,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:50,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-02-04 18:53:50,813 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_50| Int) (foo_~n Int)) (= (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_50|) (* 4 foo_~n))) (exists ((v_prenex_644 Int) (|foo_~#a~0.base| Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_644)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0)))) is different from true [2018-02-04 18:53:50,817 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:50,818 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:50,824 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 2 case distinctions, treesize of input 21 treesize of output 32 [2018-02-04 18:53:50,825 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:53:50,845 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:50,846 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:50,855 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:50,855 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 16 treesize of output 9 [2018-02-04 18:53:50,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:50,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-02-04 18:53:50,870 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:56, output treesize:86 [2018-02-04 18:53:51,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3387 backedges. 348 proven. 573 refuted. 0 times theorem prover too weak. 1374 trivial. 1092 not checked. [2018-02-04 18:53:51,291 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:53:51,291 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-04 18:53:51,291 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 18:53:51,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 18:53:51,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=385, Unknown=10, NotChecked=490, Total=992 [2018-02-04 18:53:51,292 INFO L87 Difference]: Start difference. First operand 308 states and 340 transitions. Second operand 32 states. [2018-02-04 18:53:51,461 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_50| Int) (foo_~n Int)) (= (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_50|) (* 4 foo_~n))) (exists ((|foo_~#a~0.base| Int) (v_prenex_553 Int)) (and (= |c_#length| (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_553))) (= 0 (select |c_#valid| |foo_~#a~0.base|)))) (exists ((v_prenex_644 Int) (|foo_~#a~0.base| Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_644)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((|foo_~#a~0.base| Int) (v_prenex_558 Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_558)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:53:51,720 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_50| Int) (foo_~n Int)) (= (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_50|) (* 4 foo_~n))) (exists ((|foo_~#a~0.base| Int) (v_prenex_570 Int)) (and (= 0 (select |c_#valid| |foo_~#a~0.base|)) (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 v_prenex_570)) |c_#length|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= |c_#valid| (store |c_old(#valid)| |foo_~#a~0.base| 0)) (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0)))) is different from true [2018-02-04 18:53:52,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:53:52,197 INFO L93 Difference]: Finished difference Result 343 states and 384 transitions. [2018-02-04 18:53:52,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 18:53:52,198 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 412 [2018-02-04 18:53:52,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:53:52,199 INFO L225 Difference]: With dead ends: 343 [2018-02-04 18:53:52,199 INFO L226 Difference]: Without dead ends: 343 [2018-02-04 18:53:52,199 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 371 SyntacticMatches, 20 SemanticMatches, 49 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=343, Invalid=1175, Unknown=12, NotChecked=1020, Total=2550 [2018-02-04 18:53:52,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-02-04 18:53:52,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 306. [2018-02-04 18:53:52,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-02-04 18:53:52,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 337 transitions. [2018-02-04 18:53:52,202 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 337 transitions. Word has length 412 [2018-02-04 18:53:52,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:53:52,202 INFO L432 AbstractCegarLoop]: Abstraction has 306 states and 337 transitions. [2018-02-04 18:53:52,202 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 18:53:52,202 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 337 transitions. [2018-02-04 18:53:52,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-02-04 18:53:52,204 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:53:52,204 INFO L351 BasicCegarLoop]: trace histogram [28, 28, 21, 21, 21, 21, 21, 21, 21, 21, 21, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:53:52,204 INFO L371 AbstractCegarLoop]: === Iteration 53 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:53:52,204 INFO L82 PathProgramCache]: Analyzing trace with hash -842302053, now seen corresponding path program 22 times [2018-02-04 18:53:52,204 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:53:52,204 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:53:52,204 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:53:52,204 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:53:52,204 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:53:52,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:53:52,235 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:53:52,245 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:53:52,245 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:53:52,245 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:53:52,245 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 18:53:52,507 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 18:53:52,507 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:53:52,537 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:53:52,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 18:53:52,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:52,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 18:53:52,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 18:53:52,577 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:52,577 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:53:52,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:53:52,580 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:24, output treesize:15 [2018-02-04 18:53:52,617 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-04 18:53:52,617 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-04 18:53:52,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:52,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:53:52,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:53:52,619 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:11, output treesize:1 [2018-02-04 18:53:52,629 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-04 18:53:52,629 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:52,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:52,632 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:21, output treesize:20 [2018-02-04 18:53:52,651 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 19 treesize of output 31 [2018-02-04 18:53:52,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-02-04 18:53:52,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:52,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2018-02-04 18:53:52,666 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 18:53:52,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:53:52,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 18:53:52,681 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:30, output treesize:32 [2018-02-04 18:53:52,698 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:52,699 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:52,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, 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 30 [2018-02-04 18:53:52,699 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:52,700 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:53:52,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:52,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-04 18:53:52,706 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:52,707 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:52,707 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 18 treesize of output 35 [2018-02-04 18:53:52,707 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:52,710 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:53:52,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:53:52,716 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:66, output treesize:22 [2018-02-04 18:53:52,879 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 34 treesize of output 27 [2018-02-04 18:53:52,880 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:52,881 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 25 [2018-02-04 18:53:52,882 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:52,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 34 [2018-02-04 18:53:52,883 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:52,887 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:53:52,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:53:52,894 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 32 treesize of output 29 [2018-02-04 18:53:52,895 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-02-04 18:53:52,896 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 19 [2018-02-04 18:53:52,897 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:52,901 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:53:52,906 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:53:52,915 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 34 treesize of output 44 [2018-02-04 18:53:52,916 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2018-02-04 18:53:52,918 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 19 [2018-02-04 18:53:52,918 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:52,923 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:53:52,938 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:52,938 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:52,941 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 41 [2018-02-04 18:53:52,942 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:52,943 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:52,953 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 23 treesize of output 56 [2018-02-04 18:53:52,954 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 4 xjuncts. [2018-02-04 18:53:52,970 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:53:52,982 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:53:53,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 18:53:53,004 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:40, output treesize:37 [2018-02-04 18:53:53,234 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((bar_~b.offset Int) (bar_~i~0 Int)) (let ((.cse2 (* 4 bar_~i~0))) (let ((.cse0 (+ bar_~b.offset .cse2))) (and (<= bar_~i~0 1) (<= bar_~b.offset 0) (<= 4 .cse0) (<= (let ((.cse1 (select |c_#memory_int| |c_foo_~#a~0.base|))) (+ (select .cse1 (+ bar_~b.offset .cse2 (- 4))) (select .cse1 .cse0))) |c_foo_#t~ret5|))))) (exists ((|foo_#t~mem4| Int)) (let ((.cse3 (store (select |c_old(#memory_int)| |c_foo_~#a~0.base|) 0 (select (select |c_old(#memory_int)| |c_foo_#in~b.base|) |c_foo_#in~b.offset|)))) (and (= (store |c_old(#memory_int)| |c_foo_~#a~0.base| (store .cse3 4 |foo_#t~mem4|)) |c_#memory_int|) (<= (select (select (store |c_old(#memory_int)| |c_foo_~#a~0.base| .cse3) |c_foo_#in~b.base|) (+ |c_foo_#in~b.offset| 4)) |foo_#t~mem4|))))) is different from true [2018-02-04 18:53:53,238 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_#t~mem4| Int)) (let ((.cse0 (store (select |c_old(#memory_int)| |c_foo_~#a~0.base|) 0 (select (select |c_old(#memory_int)| |c_foo_#in~b.base|) |c_foo_#in~b.offset|)))) (and (= (store |c_old(#memory_int)| |c_foo_~#a~0.base| (store .cse0 4 |foo_#t~mem4|)) |c_#memory_int|) (<= (select (select (store |c_old(#memory_int)| |c_foo_~#a~0.base| .cse0) |c_foo_#in~b.base|) (+ |c_foo_#in~b.offset| 4)) |foo_#t~mem4|)))) (exists ((bar_~b.offset Int) (bar_~i~0 Int)) (let ((.cse2 (* 4 bar_~i~0))) (let ((.cse3 (+ bar_~b.offset .cse2))) (and (<= bar_~i~0 1) (<= (let ((.cse1 (select |c_#memory_int| |c_foo_~#a~0.base|))) (+ (select .cse1 (+ bar_~b.offset .cse2 (- 4))) (select .cse1 .cse3))) 0) (<= bar_~b.offset 0) (<= 4 .cse3)))))) is different from true [2018-02-04 18:53:53,240 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-04 18:53:53,240 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:53,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:53,251 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:80 [2018-02-04 18:53:53,254 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~0.base| Int) (bar_~b.offset Int) (bar_~i~0 Int) (|foo_#t~mem4| Int)) (let ((.cse1 (* 4 bar_~i~0))) (let ((.cse2 (+ bar_~b.offset .cse1)) (.cse3 (store (select |c_old(#memory_int)| |foo_~#a~0.base|) 0 (select (select |c_old(#memory_int)| |c_foo_#in~b.base|) |c_foo_#in~b.offset|)))) (and (<= bar_~i~0 1) (<= (let ((.cse0 (select |c_#memory_int| |foo_~#a~0.base|))) (+ (select .cse0 (+ bar_~b.offset .cse1 (- 4))) (select .cse0 .cse2))) 0) (= (store |c_old(#memory_int)| |foo_~#a~0.base| (store .cse3 4 |foo_#t~mem4|)) |c_#memory_int|) (= 0 (select |c_#valid| |foo_~#a~0.base|)) (<= bar_~b.offset 0) (<= 4 .cse2) (<= (select (select (store |c_old(#memory_int)| |foo_~#a~0.base| .cse3) |c_foo_#in~b.base|) (+ |c_foo_#in~b.offset| 4)) |foo_#t~mem4|))))) is different from true [2018-02-04 18:53:53,286 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 60 [2018-02-04 18:53:53,288 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:53,289 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:53,289 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:53:53,290 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:53,290 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 52 treesize of output 65 [2018-02-04 18:53:53,327 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:53:53,328 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:53,328 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:53:53,329 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:53,330 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:53,330 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:53,331 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:53:53,331 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 0 case distinctions, treesize of input 39 treesize of output 39 [2018-02-04 18:53:53,331 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:53,335 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:53:53,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:53:53,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:53:53,346 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:101, output treesize:9 [2018-02-04 18:53:53,368 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:53:53,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:53,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:53:53,369 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:1 [2018-02-04 18:53:53,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3387 backedges. 1176 proven. 65 refuted. 0 times theorem prover too weak. 2134 trivial. 12 not checked. [2018-02-04 18:53:53,500 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:53:53,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-04 18:53:53,500 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 18:53:53,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 18:53:53,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=960, Unknown=14, NotChecked=192, Total=1260 [2018-02-04 18:53:53,501 INFO L87 Difference]: Start difference. First operand 306 states and 337 transitions. Second operand 36 states. [2018-02-04 18:53:55,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:53:55,901 INFO L93 Difference]: Finished difference Result 314 states and 345 transitions. [2018-02-04 18:53:55,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 18:53:55,901 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 412 [2018-02-04 18:53:55,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:53:55,902 INFO L225 Difference]: With dead ends: 314 [2018-02-04 18:53:55,902 INFO L226 Difference]: Without dead ends: 308 [2018-02-04 18:53:55,902 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 376 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=191, Invalid=2445, Unknown=28, NotChecked=306, Total=2970 [2018-02-04 18:53:55,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-02-04 18:53:55,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2018-02-04 18:53:55,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-02-04 18:53:55,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 339 transitions. [2018-02-04 18:53:55,905 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 339 transitions. Word has length 412 [2018-02-04 18:53:55,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:53:55,905 INFO L432 AbstractCegarLoop]: Abstraction has 308 states and 339 transitions. [2018-02-04 18:53:55,905 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 18:53:55,905 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 339 transitions. [2018-02-04 18:53:55,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2018-02-04 18:53:55,906 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:53:55,907 INFO L351 BasicCegarLoop]: trace histogram [29, 28, 22, 22, 22, 22, 21, 21, 21, 21, 21, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:53:55,907 INFO L371 AbstractCegarLoop]: === Iteration 54 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:53:55,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1874717408, now seen corresponding path program 23 times [2018-02-04 18:53:55,907 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:53:55,907 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:53:55,908 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:53:55,908 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:53:55,908 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:53:55,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:53:55,925 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:53:56,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3506 backedges. 157 proven. 677 refuted. 0 times theorem prover too weak. 2672 trivial. 0 not checked. [2018-02-04 18:53:56,266 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:53:56,266 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:53:56,267 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 18:53:56,341 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-02-04 18:53:56,341 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:53:56,350 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:53:56,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3506 backedges. 1306 proven. 43 refuted. 0 times theorem prover too weak. 2157 trivial. 0 not checked. [2018-02-04 18:53:56,540 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:53:56,540 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2018-02-04 18:53:56,541 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 18:53:56,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 18:53:56,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2018-02-04 18:53:56,541 INFO L87 Difference]: Start difference. First operand 308 states and 339 transitions. Second operand 25 states. [2018-02-04 18:53:56,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:53:56,876 INFO L93 Difference]: Finished difference Result 295 states and 319 transitions. [2018-02-04 18:53:56,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 18:53:56,876 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 417 [2018-02-04 18:53:56,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:53:56,877 INFO L225 Difference]: With dead ends: 295 [2018-02-04 18:53:56,877 INFO L226 Difference]: Without dead ends: 295 [2018-02-04 18:53:56,877 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 406 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=248, Invalid=1558, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 18:53:56,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-02-04 18:53:56,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2018-02-04 18:53:56,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-02-04 18:53:56,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 319 transitions. [2018-02-04 18:53:56,880 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 319 transitions. Word has length 417 [2018-02-04 18:53:56,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:53:56,880 INFO L432 AbstractCegarLoop]: Abstraction has 295 states and 319 transitions. [2018-02-04 18:53:56,880 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 18:53:56,880 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 319 transitions. [2018-02-04 18:53:56,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-02-04 18:53:56,881 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:53:56,881 INFO L351 BasicCegarLoop]: trace histogram [28, 28, 21, 21, 21, 21, 21, 21, 21, 21, 21, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:53:56,882 INFO L371 AbstractCegarLoop]: === Iteration 55 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:53:56,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1630565067, now seen corresponding path program 24 times [2018-02-04 18:53:56,882 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:53:56,882 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:53:56,882 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:53:56,882 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:53:56,882 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:53:56,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:53:56,910 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:53:56,919 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:53:56,919 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:53:56,919 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:53:56,919 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 18:53:57,071 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-02-04 18:53:57,071 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:53:57,086 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:53:57,087 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-04 18:53:57,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:57,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:53:57,089 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:53:57,105 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~0.base| Int)) (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 |c_foo_#in~n|)) |c_#length|)) is different from true [2018-02-04 18:53:57,106 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-04 18:53:57,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:57,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:57,108 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:53:57,116 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_651 Int) (|v_foo_#in~n_BEFORE_CALL_3| Int)) (= (select |c_#length| v_prenex_651) (* 4 |v_foo_#in~n_BEFORE_CALL_3|))) (exists ((|foo_~#a~0.base| Int)) (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 |c_foo_#in~n|)) |c_#length|))) is different from true [2018-02-04 18:53:57,120 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:57,124 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 2 case distinctions, treesize of input 14 treesize of output 23 [2018-02-04 18:53:57,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:53:57,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-02-04 18:53:57,137 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:27, output treesize:48 [2018-02-04 18:53:57,239 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-04 18:53:57,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:57,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:57,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:19, output treesize:18 [2018-02-04 18:53:57,275 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:57,278 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 2 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 18:53:57,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:53:57,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-02-04 18:53:57,303 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:44 [2018-02-04 18:53:57,326 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:57,327 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:57,328 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:57,328 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 35 treesize of output 47 [2018-02-04 18:53:57,328 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:57,356 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:57,356 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 30 treesize of output 30 [2018-02-04 18:53:57,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:57,378 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:57,379 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:57,379 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:57,384 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 2 case distinctions, treesize of input 35 treesize of output 52 [2018-02-04 18:53:57,385 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 18:53:57,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2018-02-04 18:53:57,450 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:141, output treesize:117 [2018-02-04 18:53:57,508 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:53:57,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:57,515 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:57,515 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:57,515 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-04 18:53:57,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:57,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:57,520 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:59, output treesize:23 [2018-02-04 18:53:57,614 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_foo_~i~1_63 Int)) (and (<= (+ v_foo_~i~1_63 2) |c_foo_#in~size|) (<= 0 (+ |c_foo_#in~b.offset| (* 4 v_foo_~i~1_63))))) (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|))) is different from true [2018-02-04 18:53:57,617 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-04 18:53:57,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:57,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:57,618 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:53:57,627 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_foo_~i~1_63 Int)) (and (<= (+ v_foo_~i~1_63 2) |c_foo_#in~size|) (<= 0 (+ |c_foo_#in~b.offset| (* 4 v_foo_~i~1_63))))) (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) (exists ((v_prenex_667 Int) (|v_foo_#in~n_BEFORE_CALL_3| Int)) (= (select |c_#length| v_prenex_667) (* 4 |v_foo_#in~n_BEFORE_CALL_3|)))) is different from true [2018-02-04 18:53:57,630 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-04 18:53:57,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:57,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:57,637 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:34, output treesize:33 [2018-02-04 18:53:57,639 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_foo_~i~1_63 Int)) (and (<= (+ v_foo_~i~1_63 2) |c_foo_#in~size|) (<= 0 (+ |c_foo_#in~b.offset| (* 4 v_foo_~i~1_63))))) (exists ((v_prenex_667 Int) (|v_foo_#in~n_BEFORE_CALL_3| Int)) (= (select |c_#length| v_prenex_667) (* 4 |v_foo_#in~n_BEFORE_CALL_3|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:53:57,655 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 21 treesize of output 32 [2018-02-04 18:53:57,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:53:57,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 18 dim-0 vars, and 3 xjuncts. [2018-02-04 18:53:57,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:50, output treesize:136 [2018-02-04 18:53:57,753 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:53:57,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:57,760 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:57,761 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:57,761 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-04 18:53:57,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:57,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:57,766 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:70, output treesize:31 [2018-02-04 18:53:57,800 WARN L1033 $PredicateComparison]: unable to prove that (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) is different from true [2018-02-04 18:53:57,803 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-04 18:53:57,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:57,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:57,804 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:53:57,814 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_682 Int) (|v_foo_#in~n_BEFORE_CALL_3| Int)) (= (select |c_#length| v_prenex_682) (* 4 |v_foo_#in~n_BEFORE_CALL_3|))) (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|))) is different from true [2018-02-04 18:53:57,816 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-04 18:53:57,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:57,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:57,819 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:53:57,821 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_682 Int) (|v_foo_#in~n_BEFORE_CALL_3| Int)) (= (select |c_#length| v_prenex_682) (* 4 |v_foo_#in~n_BEFORE_CALL_3|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:53:57,832 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 21 treesize of output 32 [2018-02-04 18:53:57,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:53:57,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-02-04 18:53:57,854 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:40, output treesize:106 [2018-02-04 18:53:57,984 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-04 18:53:57,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:57,988 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:57,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-02-04 18:53:57,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:57,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:57,992 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:20, output treesize:13 [2018-02-04 18:53:58,269 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 52 treesize of output 46 [2018-02-04 18:53:58,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:58,316 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 46 treesize of output 53 [2018-02-04 18:53:58,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-02-04 18:53:58,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2018-02-04 18:53:58,382 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:58,436 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:58,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 51 treesize of output 90 [2018-02-04 18:53:58,457 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 32 xjuncts. [2018-02-04 18:53:58,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 4 dim-1 vars, End of recursive call: 35 dim-0 vars, and 9 xjuncts. [2018-02-04 18:53:58,645 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 15 variables, input treesize:110, output treesize:361 [2018-02-04 18:53:59,013 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-04 18:53:59,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:59,017 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:59,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-02-04 18:53:59,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:59,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:59,020 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:20, output treesize:13 [2018-02-04 18:53:59,084 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= |c_#valid| (store |c_old(#valid)| |foo_~#a~0.base| 0)) (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) is different from true [2018-02-04 18:53:59,087 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:59,089 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:59,089 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:59,095 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 2 case distinctions, treesize of input 21 treesize of output 40 [2018-02-04 18:53:59,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:53:59,119 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:59,120 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:59,121 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:59,121 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 0 case distinctions, treesize of input 22 treesize of output 30 [2018-02-04 18:53:59,121 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:59,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-04 18:53:59,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:53, output treesize:76 [2018-02-04 18:53:59,428 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-04 18:53:59,429 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:59,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 18:53:59,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:59,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:53:59,432 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-02-04 18:53:59,474 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:59,476 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:59,478 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:59,481 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 2 case distinctions, treesize of input 21 treesize of output 40 [2018-02-04 18:53:59,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:53:59,503 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:59,504 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:59,505 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:53:59,505 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 16 treesize of output 9 [2018-02-04 18:53:59,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:53:59,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 18:53:59,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:45, output treesize:60 [2018-02-04 18:53:59,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3387 backedges. 390 proven. 1636 refuted. 17 times theorem prover too weak. 671 trivial. 673 not checked. [2018-02-04 18:53:59,949 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:53:59,949 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-02-04 18:53:59,949 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-04 18:53:59,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-04 18:53:59,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1964, Unknown=16, NotChecked=882, Total=3080 [2018-02-04 18:53:59,950 INFO L87 Difference]: Start difference. First operand 295 states and 319 transitions. Second operand 56 states. [2018-02-04 18:54:01,868 WARN L146 SmtUtils]: Spent 290ms on a formula simplification. DAG size of input: 35 DAG size of output 31 [2018-02-04 18:54:06,429 WARN L146 SmtUtils]: Spent 2028ms on a formula simplification. DAG size of input: 69 DAG size of output 40 [2018-02-04 18:54:06,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:54:06,649 INFO L93 Difference]: Finished difference Result 322 states and 351 transitions. [2018-02-04 18:54:06,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-02-04 18:54:06,649 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 412 [2018-02-04 18:54:06,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:54:06,650 INFO L225 Difference]: With dead ends: 322 [2018-02-04 18:54:06,650 INFO L226 Difference]: Without dead ends: 322 [2018-02-04 18:54:06,651 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 349 SyntacticMatches, 13 SemanticMatches, 106 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 3152 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=999, Invalid=8707, Unknown=32, NotChecked=1818, Total=11556 [2018-02-04 18:54:06,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-02-04 18:54:06,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 295. [2018-02-04 18:54:06,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-02-04 18:54:06,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 319 transitions. [2018-02-04 18:54:06,654 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 319 transitions. Word has length 412 [2018-02-04 18:54:06,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:54:06,655 INFO L432 AbstractCegarLoop]: Abstraction has 295 states and 319 transitions. [2018-02-04 18:54:06,655 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-04 18:54:06,655 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 319 transitions. [2018-02-04 18:54:06,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-02-04 18:54:06,656 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:54:06,656 INFO L351 BasicCegarLoop]: trace histogram [28, 28, 21, 21, 21, 21, 21, 21, 21, 21, 21, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:54:06,656 INFO L371 AbstractCegarLoop]: === Iteration 56 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:54:06,657 INFO L82 PathProgramCache]: Analyzing trace with hash 621307186, now seen corresponding path program 25 times [2018-02-04 18:54:06,657 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:54:06,657 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:54:06,657 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:54:06,657 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:54:06,657 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:54:06,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:54:06,687 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:54:06,696 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:54:06,696 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:54:06,696 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:54:06,696 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:54:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:54:06,731 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:54:06,735 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-04 18:54:06,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:06,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:06,738 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:54:06,753 WARN L1033 $PredicateComparison]: unable to prove that (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) is different from true [2018-02-04 18:54:06,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-04 18:54:06,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:06,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:06,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:54:06,764 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_63| Int) (v_prenex_729 Int)) (= (* 4 v_prenex_729) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_63|)))) is different from true [2018-02-04 18:54:06,767 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-04 18:54:06,767 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:06,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:06,771 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:54:06,773 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_63| Int) (v_prenex_729 Int)) (= (* 4 v_prenex_729) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_63|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:54:06,784 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 2 case distinctions, treesize of input 14 treesize of output 17 [2018-02-04 18:54:06,784 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:54:06,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-02-04 18:54:06,797 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:58 [2018-02-04 18:54:06,832 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:06,832 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:06,833 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 29 treesize of output 23 [2018-02-04 18:54:06,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:06,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:06,843 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:23 [2018-02-04 18:54:06,863 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-04 18:54:06,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:06,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:06,864 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:54:06,875 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_63| Int) (v_prenex_734 Int)) (= (* 4 v_prenex_734) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_63|)))) is different from true [2018-02-04 18:54:06,877 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-04 18:54:06,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:06,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:06,881 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:54:06,882 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_63| Int) (v_prenex_734 Int)) (= (* 4 v_prenex_734) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_63|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:54:06,894 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 21 treesize of output 32 [2018-02-04 18:54:06,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:54:06,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-02-04 18:54:06,915 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-02-04 18:54:06,967 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:54:06,967 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:06,976 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:06,976 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:06,977 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-04 18:54:06,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:06,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:06,984 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:76, output treesize:34 [2018-02-04 18:54:07,011 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-04 18:54:07,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:07,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:07,013 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:54:07,021 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_63| Int) (v_prenex_746 Int)) (= (* 4 v_prenex_746) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_63|)))) is different from true [2018-02-04 18:54:07,023 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-04 18:54:07,023 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:07,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:07,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:54:07,028 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_63| Int) (v_prenex_746 Int)) (= (* 4 v_prenex_746) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_63|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:54:07,041 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 21 treesize of output 32 [2018-02-04 18:54:07,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:54:07,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-02-04 18:54:07,065 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-02-04 18:54:07,116 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:54:07,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:07,124 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:07,124 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:07,125 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-04 18:54:07,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:07,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:07,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:69, output treesize:23 [2018-02-04 18:54:07,161 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-04 18:54:07,162 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:07,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:07,163 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:54:07,177 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_63| Int) (v_prenex_758 Int)) (= (* 4 v_prenex_758) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_63|))) (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|))) is different from true [2018-02-04 18:54:07,180 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-04 18:54:07,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:07,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:07,184 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:54:07,185 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_63| Int) (v_prenex_758 Int)) (= (* 4 v_prenex_758) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_63|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:54:07,198 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 21 treesize of output 32 [2018-02-04 18:54:07,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:54:07,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-02-04 18:54:07,222 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-02-04 18:54:07,288 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:07,288 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 33 treesize of output 23 [2018-02-04 18:54:07,288 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:07,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:07,299 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:69, output treesize:23 [2018-02-04 18:54:07,329 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-04 18:54:07,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:07,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:07,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:54:07,339 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_770 Int) (|v_foo_~#a~0.base_BEFORE_CALL_63| Int)) (= (* 4 v_prenex_770) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_63|))) (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|))) is different from true [2018-02-04 18:54:07,341 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-04 18:54:07,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:07,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:07,345 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:54:07,346 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_770 Int) (|v_foo_~#a~0.base_BEFORE_CALL_63| Int)) (= (* 4 v_prenex_770) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_63|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:54:07,359 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 21 treesize of output 32 [2018-02-04 18:54:07,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:54:07,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-02-04 18:54:07,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-02-04 18:54:07,458 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:07,459 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:07,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-02-04 18:54:07,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:07,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:07,475 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:76, output treesize:34 [2018-02-04 18:54:07,514 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-04 18:54:07,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:07,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:07,515 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:54:07,524 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_63| Int) (v_prenex_782 Int)) (= (* 4 v_prenex_782) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_63|)))) is different from true [2018-02-04 18:54:07,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 6 treesize of output 5 [2018-02-04 18:54:07,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:07,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:07,530 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:54:07,531 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_63| Int) (v_prenex_782 Int)) (= (* 4 v_prenex_782) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_63|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:54:07,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 32 [2018-02-04 18:54:07,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:54:07,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-02-04 18:54:07,569 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-02-04 18:54:07,731 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) is different from true [2018-02-04 18:54:07,740 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-04 18:54:07,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:07,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 18:54:07,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:07,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:07,745 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-02-04 18:54:07,757 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_63| Int) (v_prenex_793 Int)) (= (* 4 v_prenex_793) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_63|)))) is different from true [2018-02-04 18:54:07,762 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:07,768 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 2 case distinctions, treesize of input 21 treesize of output 32 [2018-02-04 18:54:07,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:54:07,792 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:07,793 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:07,794 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:07,794 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 16 treesize of output 9 [2018-02-04 18:54:07,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:07,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-02-04 18:54:07,811 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:60, output treesize:86 [2018-02-04 18:54:08,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3387 backedges. 12 proven. 135 refuted. 0 times theorem prover too weak. 2472 trivial. 768 not checked. [2018-02-04 18:54:08,165 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:54:08,165 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-04 18:54:08,166 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 18:54:08,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 18:54:08,166 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=379, Unknown=15, NotChecked=810, Total=1332 [2018-02-04 18:54:08,166 INFO L87 Difference]: Start difference. First operand 295 states and 319 transitions. Second operand 37 states. [2018-02-04 18:54:08,258 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_63| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_63|)))) is different from true [2018-02-04 18:54:08,259 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|))) is different from true [2018-02-04 18:54:08,291 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_770 Int) (|v_foo_~#a~0.base_BEFORE_CALL_63| Int)) (= (* 4 v_prenex_770) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_63|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_63| Int) (v_prenex_758 Int)) (= (* 4 v_prenex_758) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_63|))) (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_63| Int) (v_prenex_729 Int)) (= (* 4 v_prenex_729) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_63|))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_63| Int) (v_prenex_746 Int)) (= (* 4 v_prenex_746) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_63|))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_63| Int) (v_prenex_734 Int)) (= (* 4 v_prenex_734) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_63|))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_63| Int) (v_prenex_782 Int)) (= (* 4 v_prenex_782) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_63|))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_63| Int) (v_prenex_793 Int)) (= (* 4 v_prenex_793) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_63|)))) is different from true [2018-02-04 18:54:08,293 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_770 Int) (|v_foo_~#a~0.base_BEFORE_CALL_63| Int)) (= (* 4 v_prenex_770) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_63|))) (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_63| Int) (v_prenex_729 Int)) (= (* 4 v_prenex_729) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_63|))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_63| Int) (v_prenex_734 Int)) (= (* 4 v_prenex_734) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_63|))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_63| Int) (v_prenex_782 Int)) (= (* 4 v_prenex_782) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_63|)))) is different from true [2018-02-04 18:54:08,296 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_770 Int) (|v_foo_~#a~0.base_BEFORE_CALL_63| Int)) (= (* 4 v_prenex_770) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_63|))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_63| Int) (v_prenex_729 Int)) (= (* 4 v_prenex_729) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_63|))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_63| Int) (v_prenex_734 Int)) (= (* 4 v_prenex_734) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_63|))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_63| Int) (v_prenex_782 Int)) (= (* 4 v_prenex_782) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_63|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:54:08,476 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_63| Int) (v_prenex_758 Int)) (= (* 4 v_prenex_758) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_63|))) (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_63| Int) (v_prenex_746 Int)) (= (* 4 v_prenex_746) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_63|))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_63| Int) (v_prenex_793 Int)) (= (* 4 v_prenex_793) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_63|)))) is different from true [2018-02-04 18:54:08,478 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_63| Int) (v_prenex_758 Int)) (= (* 4 v_prenex_758) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_63|))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_63| Int) (v_prenex_746 Int)) (= (* 4 v_prenex_746) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_63|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|)))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_63| Int) (v_prenex_793 Int)) (= (* 4 v_prenex_793) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_63|)))) is different from true [2018-02-04 18:54:09,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:54:09,014 INFO L93 Difference]: Finished difference Result 346 states and 388 transitions. [2018-02-04 18:54:09,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 18:54:09,014 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 412 [2018-02-04 18:54:09,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:54:09,016 INFO L225 Difference]: With dead ends: 346 [2018-02-04 18:54:09,016 INFO L226 Difference]: Without dead ends: 346 [2018-02-04 18:54:09,016 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 366 SyntacticMatches, 12 SemanticMatches, 54 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=309, Invalid=879, Unknown=22, NotChecked=1870, Total=3080 [2018-02-04 18:54:09,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-02-04 18:54:09,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 311. [2018-02-04 18:54:09,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-02-04 18:54:09,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 342 transitions. [2018-02-04 18:54:09,021 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 342 transitions. Word has length 412 [2018-02-04 18:54:09,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:54:09,022 INFO L432 AbstractCegarLoop]: Abstraction has 311 states and 342 transitions. [2018-02-04 18:54:09,022 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 18:54:09,022 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 342 transitions. [2018-02-04 18:54:09,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-02-04 18:54:09,025 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:54:09,025 INFO L351 BasicCegarLoop]: trace histogram [28, 28, 21, 21, 21, 21, 21, 21, 21, 21, 21, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:54:09,025 INFO L371 AbstractCegarLoop]: === Iteration 57 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:54:09,025 INFO L82 PathProgramCache]: Analyzing trace with hash -922491051, now seen corresponding path program 26 times [2018-02-04 18:54:09,025 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:54:09,025 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:54:09,026 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:54:09,026 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:54:09,026 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:54:09,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:54:09,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:54:09,068 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:54:09,069 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:54:09,069 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:54:09,069 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:54:09,104 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 18:54:09,104 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:54:09,110 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:54:09,127 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-04 18:54:09,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:09,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:09,130 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:54:09,142 WARN L1033 $PredicateComparison]: unable to prove that (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) is different from true [2018-02-04 18:54:09,145 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-04 18:54:09,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:09,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:09,147 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:54:09,154 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_799 Int) (|v_foo_~#a~0.base_BEFORE_CALL_69| Int)) (= (* 4 v_prenex_799) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_69|))) (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|))) is different from true [2018-02-04 18:54:09,156 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-04 18:54:09,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:09,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:09,161 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:54:09,162 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_799 Int) (|v_foo_~#a~0.base_BEFORE_CALL_69| Int)) (= (* 4 v_prenex_799) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_69|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:54:09,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 17 [2018-02-04 18:54:09,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:54:09,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-02-04 18:54:09,183 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:58 [2018-02-04 18:54:09,216 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:09,217 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:09,217 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 29 treesize of output 23 [2018-02-04 18:54:09,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:09,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:09,230 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:23 [2018-02-04 18:54:09,254 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-04 18:54:09,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:09,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:09,255 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:54:09,262 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) (exists ((v_prenex_804 Int) (|v_foo_~#a~0.base_BEFORE_CALL_69| Int)) (= (* 4 v_prenex_804) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_69|)))) is different from true [2018-02-04 18:54:09,265 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-04 18:54:09,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:09,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:09,269 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:54:09,270 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|)))) (exists ((v_prenex_804 Int) (|v_foo_~#a~0.base_BEFORE_CALL_69| Int)) (= (* 4 v_prenex_804) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_69|)))) is different from true [2018-02-04 18:54:09,286 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 21 treesize of output 32 [2018-02-04 18:54:09,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:54:09,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-02-04 18:54:09,309 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-02-04 18:54:09,369 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:09,369 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:09,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-02-04 18:54:09,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:09,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:09,385 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:76, output treesize:34 [2018-02-04 18:54:09,418 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-04 18:54:09,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:09,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:09,419 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:54:09,426 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_817 Int) (|v_foo_~#a~0.base_BEFORE_CALL_69| Int)) (= (* 4 v_prenex_817) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_69|))) (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|))) is different from true [2018-02-04 18:54:09,428 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-04 18:54:09,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:09,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:09,431 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:54:09,433 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_817 Int) (|v_foo_~#a~0.base_BEFORE_CALL_69| Int)) (= (* 4 v_prenex_817) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_69|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:54:09,445 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 21 treesize of output 32 [2018-02-04 18:54:09,446 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:54:09,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-02-04 18:54:09,468 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-02-04 18:54:09,526 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:54:09,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:09,533 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:09,533 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:09,534 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-04 18:54:09,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:09,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:09,539 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:69, output treesize:23 [2018-02-04 18:54:09,566 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-04 18:54:09,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:09,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:09,567 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:54:09,575 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_830 Int) (|v_foo_~#a~0.base_BEFORE_CALL_69| Int)) (= (* 4 v_prenex_830) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_69|))) (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|))) is different from true [2018-02-04 18:54:09,577 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-04 18:54:09,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:09,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:09,581 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:54:09,582 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_830 Int) (|v_foo_~#a~0.base_BEFORE_CALL_69| Int)) (= (* 4 v_prenex_830) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_69|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:54:09,594 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 21 treesize of output 32 [2018-02-04 18:54:09,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:54:09,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-02-04 18:54:09,615 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-02-04 18:54:09,663 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:09,664 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 33 treesize of output 23 [2018-02-04 18:54:09,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:09,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:09,674 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:69, output treesize:23 [2018-02-04 18:54:09,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 18:54:09,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:09,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:09,695 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:54:09,704 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_843 Int) (|v_foo_~#a~0.base_BEFORE_CALL_69| Int)) (= (* 4 v_prenex_843) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_69|))) (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|))) is different from true [2018-02-04 18:54:09,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-04 18:54:09,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:09,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:09,709 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:54:09,711 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_843 Int) (|v_foo_~#a~0.base_BEFORE_CALL_69| Int)) (= (* 4 v_prenex_843) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_69|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:54:09,723 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 21 treesize of output 32 [2018-02-04 18:54:09,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:54:09,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-02-04 18:54:09,746 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-02-04 18:54:09,821 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:54:09,822 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:09,829 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:09,830 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:09,830 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-04 18:54:09,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:09,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:09,834 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:69, output treesize:23 [2018-02-04 18:54:09,888 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-04 18:54:09,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:09,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:09,889 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:54:09,898 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_69| Int) (v_prenex_856 Int)) (= (* 4 v_prenex_856) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_69|)))) is different from true [2018-02-04 18:54:09,899 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-04 18:54:09,900 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:09,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:09,903 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:54:09,904 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_69| Int) (v_prenex_856 Int)) (= (* 4 v_prenex_856) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_69|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:54:09,916 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 21 treesize of output 32 [2018-02-04 18:54:09,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:54:09,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-02-04 18:54:09,938 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-02-04 18:54:10,090 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) is different from true [2018-02-04 18:54:10,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 18:54:10,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:10,101 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-04 18:54:10,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:10,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:10,102 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-02-04 18:54:10,112 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((v_prenex_868 Int) (|v_foo_~#a~0.base_BEFORE_CALL_69| Int)) (= (* 4 v_prenex_868) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_69|)))) is different from true [2018-02-04 18:54:10,116 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:10,117 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:10,118 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:10,118 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 16 treesize of output 9 [2018-02-04 18:54:10,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:10,134 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 2 case distinctions, treesize of input 21 treesize of output 32 [2018-02-04 18:54:10,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 18:54:10,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-02-04 18:54:10,152 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:56, output treesize:86 [2018-02-04 18:54:10,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3391 backedges. 12 proven. 135 refuted. 0 times theorem prover too weak. 2472 trivial. 772 not checked. [2018-02-04 18:54:10,534 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:54:10,534 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-04 18:54:10,534 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 18:54:10,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 18:54:10,535 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=379, Unknown=15, NotChecked=810, Total=1332 [2018-02-04 18:54:10,535 INFO L87 Difference]: Start difference. First operand 311 states and 342 transitions. Second operand 37 states. [2018-02-04 18:54:10,584 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) (exists ((foo_~n Int) (|v_foo_~#a~0.base_BEFORE_CALL_69| Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_69|)))) is different from true [2018-02-04 18:54:10,586 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|))) is different from true [2018-02-04 18:54:10,604 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_843 Int) (|v_foo_~#a~0.base_BEFORE_CALL_69| Int)) (= (* 4 v_prenex_843) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_69|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((v_prenex_799 Int) (|v_foo_~#a~0.base_BEFORE_CALL_69| Int)) (= (* 4 v_prenex_799) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_69|))) (exists ((v_prenex_868 Int) (|v_foo_~#a~0.base_BEFORE_CALL_69| Int)) (= (* 4 v_prenex_868) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_69|))) (exists ((v_prenex_817 Int) (|v_foo_~#a~0.base_BEFORE_CALL_69| Int)) (= (* 4 v_prenex_817) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_69|))) (exists ((v_prenex_830 Int) (|v_foo_~#a~0.base_BEFORE_CALL_69| Int)) (= (* 4 v_prenex_830) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_69|))) (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_69| Int) (v_prenex_856 Int)) (= (* 4 v_prenex_856) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_69|))) (exists ((v_prenex_804 Int) (|v_foo_~#a~0.base_BEFORE_CALL_69| Int)) (= (* 4 v_prenex_804) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_69|)))) is different from true [2018-02-04 18:54:10,606 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_843 Int) (|v_foo_~#a~0.base_BEFORE_CALL_69| Int)) (= (* 4 v_prenex_843) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_69|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((v_prenex_799 Int) (|v_foo_~#a~0.base_BEFORE_CALL_69| Int)) (= (* 4 v_prenex_799) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_69|))) (exists ((v_prenex_868 Int) (|v_foo_~#a~0.base_BEFORE_CALL_69| Int)) (= (* 4 v_prenex_868) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_69|))) (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_69| Int) (v_prenex_856 Int)) (= (* 4 v_prenex_856) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_69|))) (exists ((v_prenex_804 Int) (|v_foo_~#a~0.base_BEFORE_CALL_69| Int)) (= (* 4 v_prenex_804) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_69|)))) is different from true [2018-02-04 18:54:10,608 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_843 Int) (|v_foo_~#a~0.base_BEFORE_CALL_69| Int)) (= (* 4 v_prenex_843) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_69|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((v_prenex_799 Int) (|v_foo_~#a~0.base_BEFORE_CALL_69| Int)) (= (* 4 v_prenex_799) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_69|))) (exists ((v_prenex_868 Int) (|v_foo_~#a~0.base_BEFORE_CALL_69| Int)) (= (* 4 v_prenex_868) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_69|))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_69| Int) (v_prenex_856 Int)) (= (* 4 v_prenex_856) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_69|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|)))) (exists ((v_prenex_804 Int) (|v_foo_~#a~0.base_BEFORE_CALL_69| Int)) (= (* 4 v_prenex_804) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_69|)))) is different from true [2018-02-04 18:54:10,797 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_817 Int) (|v_foo_~#a~0.base_BEFORE_CALL_69| Int)) (= (* 4 v_prenex_817) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_69|))) (exists ((v_prenex_830 Int) (|v_foo_~#a~0.base_BEFORE_CALL_69| Int)) (= (* 4 v_prenex_830) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_69|))) (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|))) is different from true [2018-02-04 18:54:10,799 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_817 Int) (|v_foo_~#a~0.base_BEFORE_CALL_69| Int)) (= (* 4 v_prenex_817) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_69|))) (exists ((v_prenex_830 Int) (|v_foo_~#a~0.base_BEFORE_CALL_69| Int)) (= (* 4 v_prenex_830) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_69|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:54:11,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:54:11,291 INFO L93 Difference]: Finished difference Result 345 states and 383 transitions. [2018-02-04 18:54:11,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 18:54:11,292 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 412 [2018-02-04 18:54:11,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:54:11,293 INFO L225 Difference]: With dead ends: 345 [2018-02-04 18:54:11,293 INFO L226 Difference]: Without dead ends: 345 [2018-02-04 18:54:11,293 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 367 SyntacticMatches, 12 SemanticMatches, 55 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=323, Invalid=933, Unknown=22, NotChecked=1914, Total=3192 [2018-02-04 18:54:11,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-02-04 18:54:11,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 302. [2018-02-04 18:54:11,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-02-04 18:54:11,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 328 transitions. [2018-02-04 18:54:11,296 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 328 transitions. Word has length 412 [2018-02-04 18:54:11,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:54:11,296 INFO L432 AbstractCegarLoop]: Abstraction has 302 states and 328 transitions. [2018-02-04 18:54:11,296 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 18:54:11,296 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 328 transitions. [2018-02-04 18:54:11,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-02-04 18:54:11,298 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:54:11,298 INFO L351 BasicCegarLoop]: trace histogram [28, 28, 21, 21, 21, 21, 21, 21, 21, 21, 21, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:54:11,298 INFO L371 AbstractCegarLoop]: === Iteration 58 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:54:11,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1175234728, now seen corresponding path program 27 times [2018-02-04 18:54:11,298 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:54:11,298 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:54:11,298 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:54:11,298 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:54:11,298 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:54:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:54:11,326 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:54:11,335 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:54:11,336 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:54:11,336 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:54:11,336 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 18:54:11,430 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-02-04 18:54:11,430 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:54:11,442 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:54:11,443 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-04 18:54:11,443 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:11,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:11,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:54:11,463 WARN L1033 $PredicateComparison]: unable to prove that (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) is different from true [2018-02-04 18:54:11,464 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-04 18:54:11,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:11,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:11,466 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:54:11,472 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_873 Int) (|v_foo_~#a~0.base_BEFORE_CALL_75| Int)) (= (* 4 v_prenex_873) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_75|))) (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|))) is different from true [2018-02-04 18:54:11,476 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-04 18:54:11,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:11,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:11,480 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:54:11,481 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_873 Int) (|v_foo_~#a~0.base_BEFORE_CALL_75| Int)) (= (* 4 v_prenex_873) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_75|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:54:11,489 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 2 case distinctions, treesize of input 14 treesize of output 17 [2018-02-04 18:54:11,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:54:11,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-02-04 18:54:11,502 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:58 [2018-02-04 18:54:11,533 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:11,534 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:11,534 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 29 treesize of output 23 [2018-02-04 18:54:11,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:11,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:11,544 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:23 [2018-02-04 18:54:11,566 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-04 18:54:11,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:11,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:11,567 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:54:11,575 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_75| Int) (v_prenex_878 Int)) (= (* 4 v_prenex_878) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_75|)))) is different from true [2018-02-04 18:54:11,577 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-04 18:54:11,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:11,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:11,580 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:54:11,581 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_75| Int) (v_prenex_878 Int)) (= (* 4 v_prenex_878) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_75|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:54:11,594 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 21 treesize of output 32 [2018-02-04 18:54:11,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:54:11,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-02-04 18:54:11,617 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-02-04 18:54:11,662 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:54:11,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:11,668 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:11,669 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:11,669 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-04 18:54:11,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:11,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:11,674 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:69, output treesize:23 [2018-02-04 18:54:11,703 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-04 18:54:11,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:11,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:11,704 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:54:11,718 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_75| Int) (v_prenex_891 Int)) (= (* 4 v_prenex_891) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_75|)))) is different from true [2018-02-04 18:54:11,721 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-04 18:54:11,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:11,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:11,727 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:54:11,729 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|)))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_75| Int) (v_prenex_891 Int)) (= (* 4 v_prenex_891) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_75|)))) is different from true [2018-02-04 18:54:11,747 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 21 treesize of output 32 [2018-02-04 18:54:11,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:54:11,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-02-04 18:54:11,776 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-02-04 18:54:11,903 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:11,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-02-04 18:54:11,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:11,907 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-04 18:54:11,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:11,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:11,909 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:20, output treesize:13 [2018-02-04 18:54:11,943 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= |c_#valid| (store |c_old(#valid)| |foo_~#a~0.base| 0)) (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) is different from true [2018-02-04 18:54:11,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-02-04 18:54:11,949 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:11,989 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 49 treesize of output 56 [2018-02-04 18:54:11,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-02-04 18:54:12,050 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 39 treesize of output 33 [2018-02-04 18:54:12,050 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:12,052 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 44 treesize of output 42 [2018-02-04 18:54:12,052 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:12,054 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 48 treesize of output 42 [2018-02-04 18:54:12,055 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:12,119 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 8 case distinctions, treesize of input 48 treesize of output 81 [2018-02-04 18:54:12,121 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 32 xjuncts. [2018-02-04 18:54:12,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 4 dim-1 vars, End of recursive call: 35 dim-0 vars, and 9 xjuncts. [2018-02-04 18:54:12,288 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 15 variables, input treesize:104, output treesize:346 [2018-02-04 18:54:12,461 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:12,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-02-04 18:54:12,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:12,464 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-04 18:54:12,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:12,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:12,466 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:20, output treesize:13 [2018-02-04 18:54:12,498 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 49 treesize of output 43 [2018-02-04 18:54:12,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:12,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-02-04 18:54:12,525 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:12,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 50 [2018-02-04 18:54:12,557 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-02-04 18:54:12,635 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 8 case distinctions, treesize of input 48 treesize of output 81 [2018-02-04 18:54:12,637 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 32 xjuncts. [2018-02-04 18:54:12,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 4 dim-1 vars, End of recursive call: 35 dim-0 vars, and 9 xjuncts. [2018-02-04 18:54:12,828 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 15 variables, input treesize:104, output treesize:346 [2018-02-04 18:54:13,024 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-04 18:54:13,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:13,028 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:13,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-02-04 18:54:13,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:13,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:13,031 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:20, output treesize:13 [2018-02-04 18:54:13,062 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:13,063 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:13,069 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 2 case distinctions, treesize of input 21 treesize of output 32 [2018-02-04 18:54:13,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:54:13,091 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:13,092 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:13,092 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:13,093 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 0 case distinctions, treesize of input 22 treesize of output 30 [2018-02-04 18:54:13,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:13,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-04 18:54:13,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:48, output treesize:71 [2018-02-04 18:54:13,174 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) is different from true [2018-02-04 18:54:13,184 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-04 18:54:13,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:13,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 18:54:13,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:13,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:13,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-02-04 18:54:13,200 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_75| Int) (v_prenex_967 Int)) (= (* 4 v_prenex_967) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_75|)))) is different from true [2018-02-04 18:54:13,205 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:13,205 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:13,212 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 2 case distinctions, treesize of input 21 treesize of output 32 [2018-02-04 18:54:13,212 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:54:13,235 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:13,236 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:13,237 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:13,237 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 16 treesize of output 9 [2018-02-04 18:54:13,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:13,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-02-04 18:54:13,253 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:56, output treesize:86 [2018-02-04 18:54:13,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3387 backedges. 348 proven. 573 refuted. 0 times theorem prover too weak. 1370 trivial. 1096 not checked. [2018-02-04 18:54:13,665 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:54:13,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-04 18:54:13,665 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 18:54:13,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 18:54:13,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=385, Unknown=10, NotChecked=490, Total=992 [2018-02-04 18:54:13,666 INFO L87 Difference]: Start difference. First operand 302 states and 328 transitions. Second operand 32 states. [2018-02-04 18:54:13,807 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_873 Int) (|v_foo_~#a~0.base_BEFORE_CALL_75| Int)) (= (* 4 v_prenex_873) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_75|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= |c_#valid| (store |c_old(#valid)| |foo_~#a~0.base| 0)) (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_75| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_75|))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_75| Int) (v_prenex_878 Int)) (= (* 4 v_prenex_878) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_75|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:54:13,809 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_873 Int) (|v_foo_~#a~0.base_BEFORE_CALL_75| Int)) (= (* 4 v_prenex_873) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_75|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= |c_#valid| (store |c_old(#valid)| |foo_~#a~0.base| 0)) (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_75| Int) (v_prenex_878 Int)) (= (* 4 v_prenex_878) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_75|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:54:14,080 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_75| Int) (v_prenex_967 Int)) (= (* 4 v_prenex_967) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_75|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= |c_#valid| (store |c_old(#valid)| |foo_~#a~0.base| 0)) (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_75| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_75|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|)))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_75| Int) (v_prenex_891 Int)) (= (* 4 v_prenex_891) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_75|)))) is different from true [2018-02-04 18:54:14,083 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_75| Int) (v_prenex_967 Int)) (= (* 4 v_prenex_967) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_75|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= |c_#valid| (store |c_old(#valid)| |foo_~#a~0.base| 0)) (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|)))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_75| Int) (v_prenex_891 Int)) (= (* 4 v_prenex_891) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_75|)))) is different from true [2018-02-04 18:54:14,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:54:14,573 INFO L93 Difference]: Finished difference Result 334 states and 370 transitions. [2018-02-04 18:54:14,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 18:54:14,573 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 412 [2018-02-04 18:54:14,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:54:14,574 INFO L225 Difference]: With dead ends: 334 [2018-02-04 18:54:14,574 INFO L226 Difference]: Without dead ends: 334 [2018-02-04 18:54:14,575 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 369 SyntacticMatches, 23 SemanticMatches, 50 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=337, Invalid=1111, Unknown=14, NotChecked=1190, Total=2652 [2018-02-04 18:54:14,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-02-04 18:54:14,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 305. [2018-02-04 18:54:14,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-02-04 18:54:14,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 336 transitions. [2018-02-04 18:54:14,577 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 336 transitions. Word has length 412 [2018-02-04 18:54:14,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:54:14,578 INFO L432 AbstractCegarLoop]: Abstraction has 305 states and 336 transitions. [2018-02-04 18:54:14,578 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 18:54:14,578 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 336 transitions. [2018-02-04 18:54:14,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-02-04 18:54:14,579 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:54:14,579 INFO L351 BasicCegarLoop]: trace histogram [28, 28, 21, 21, 21, 21, 21, 21, 21, 21, 21, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:54:14,579 INFO L371 AbstractCegarLoop]: === Iteration 59 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:54:14,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1575934331, now seen corresponding path program 28 times [2018-02-04 18:54:14,580 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:54:14,580 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:54:14,580 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:54:14,580 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:54:14,580 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:54:14,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:54:14,610 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:54:14,619 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:54:14,619 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:54:14,619 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:54:14,619 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 18:54:14,852 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 18:54:14,852 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:54:14,866 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:54:14,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 18:54:14,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:14,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 18:54:14,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 18:54:14,879 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:14,880 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:14,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:14,882 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:24, output treesize:15 [2018-02-04 18:54:14,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, 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-04 18:54:14,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-04 18:54:14,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:14,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:14,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:14,921 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:11, output treesize:1 [2018-02-04 18:54:14,932 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-04 18:54:14,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:14,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:14,935 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:21, output treesize:20 [2018-02-04 18:54:14,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 19 treesize of output 31 [2018-02-04 18:54:14,957 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 20 treesize of output 19 [2018-02-04 18:54:14,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:14,971 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 2 case distinctions, treesize of input 17 treesize of output 22 [2018-02-04 18:54:14,972 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 18:54:14,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:54:14,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 18:54:14,988 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:30, output treesize:32 [2018-02-04 18:54:15,007 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:54:15,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:15,008 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:15,008 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:15,009 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 30 [2018-02-04 18:54:15,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:15,014 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 23 treesize of output 18 [2018-02-04 18:54:15,016 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:15,016 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:15,016 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 18 treesize of output 35 [2018-02-04 18:54:15,016 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:15,019 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:15,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:15,027 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:66, output treesize:22 [2018-02-04 18:54:15,096 WARN L1033 $PredicateComparison]: unable to prove that (and (< 1 c_foo_~size) (exists ((v_prenex_974 Int) (|foo_~#a~0.offset| Int) (|foo_#t~mem4| Int)) (= (store |c_old(#memory_int)| |c_foo_~#a~0.base| (store (store (select |c_old(#memory_int)| |c_foo_~#a~0.base|) |foo_~#a~0.offset| v_prenex_974) (+ |foo_~#a~0.offset| 4) |foo_#t~mem4|)) |c_#memory_int|))) is different from true [2018-02-04 18:54:15,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 16 treesize of output 13 [2018-02-04 18:54:15,100 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-02-04 18:54:15,101 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:15,102 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-04 18:54:15,102 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:15,105 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:15,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:15,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:15,110 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:16, output treesize:1 [2018-02-04 18:54:15,133 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-04 18:54:15,133 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:15,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:15,145 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:25 [2018-02-04 18:54:15,187 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 33 treesize of output 43 [2018-02-04 18:54:15,189 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2018-02-04 18:54:15,190 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:15,191 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-04 18:54:15,192 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:15,198 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:15,219 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:15,221 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:15,240 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 4 case distinctions, treesize of input 29 treesize of output 47 [2018-02-04 18:54:15,243 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:15,244 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:15,247 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:15,256 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 6 case distinctions, treesize of input 37 treesize of output 62 [2018-02-04 18:54:15,256 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-02-04 18:54:15,332 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:15,332 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:15,333 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:15,335 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 50 [2018-02-04 18:54:15,335 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:15,369 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:15,369 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:15,370 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:54:15,372 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 29 treesize of output 42 [2018-02-04 18:54:15,372 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:15,400 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-02-04 18:54:15,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-02-04 18:54:15,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-02-04 18:54:15,449 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:44, output treesize:81 [2018-02-04 18:54:15,486 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:15,487 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:15,487 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 48 treesize of output 42 [2018-02-04 18:54:15,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:15,488 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:54:15,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:15,497 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 32 treesize of output 25 [2018-02-04 18:54:15,498 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:15,498 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:15,499 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:15,499 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:15,500 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:15,501 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:15,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 84 [2018-02-04 18:54:15,501 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:15,516 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:15,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:15,528 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:81, output treesize:31 [2018-02-04 18:54:15,905 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 41 treesize of output 38 [2018-02-04 18:54:15,906 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2018-02-04 18:54:15,908 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2018-02-04 18:54:15,911 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 32 [2018-02-04 18:54:15,912 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:15,915 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:15,918 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:15,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:15,925 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 53 treesize of output 42 [2018-02-04 18:54:15,926 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:15,926 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 35 [2018-02-04 18:54:15,936 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:54:15,936 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:15,937 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:15,938 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 39 [2018-02-04 18:54:15,940 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:15,942 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 26 treesize of output 45 [2018-02-04 18:54:15,942 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:15,948 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:15,951 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:15,957 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:15,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 44 [2018-02-04 18:54:15,961 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2018-02-04 18:54:15,963 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2018-02-04 18:54:15,966 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 32 [2018-02-04 18:54:15,966 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:15,970 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:15,974 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:15,979 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:15,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, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2018-02-04 18:54:15,983 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:15,984 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:15,986 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 48 [2018-02-04 18:54:15,998 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:15,998 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:16,000 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:16,001 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:16,001 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:16,013 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 80 [2018-02-04 18:54:16,016 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:16,017 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:16,019 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:16,019 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:16,020 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:16,037 INFO L477 Elim1Store]: Elim1 did not use 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 3 new quantified variables, introduced 7 case distinctions, treesize of input 64 treesize of output 92 [2018-02-04 18:54:16,038 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 4 xjuncts. [2018-02-04 18:54:16,083 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:16,084 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:16,084 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:16,084 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:54:16,087 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 60 [2018-02-04 18:54:16,087 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:16,129 INFO L267 ElimStorePlain]: Start of recursive call 17: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 18:54:16,144 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 18:54:16,159 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 18:54:16,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 5 xjuncts. [2018-02-04 18:54:16,196 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 5 variables, input treesize:64, output treesize:145 [2018-02-04 18:54:16,806 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_979 Int)) (let ((.cse1 (store (select |c_old(#memory_int)| |c_foo_~#a~0.base|) 0 (select (select |c_old(#memory_int)| |c_foo_#in~b.base|) |c_foo_#in~b.offset|)))) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_foo_~#a~0.base| (let ((.cse0 (store .cse1 4 v_prenex_979))) (store .cse0 8 (select (select (store |c_old(#memory_int)| |c_foo_~#a~0.base| .cse0) |c_foo_#in~b.base|) (+ |c_foo_#in~b.offset| 8)))))) (<= (select (select (store |c_old(#memory_int)| |c_foo_~#a~0.base| .cse1) |c_foo_#in~b.base|) (+ |c_foo_#in~b.offset| 4)) v_prenex_979)))) (exists ((bar_~b.offset Int) (bar_~i~0 Int)) (let ((.cse4 (* 4 bar_~i~0))) (let ((.cse2 (+ bar_~b.offset .cse4))) (and (<= 8 .cse2) (<= bar_~i~0 2) (<= (let ((.cse3 (select |c_#memory_int| |c_foo_~#a~0.base|))) (+ (select .cse3 (+ bar_~b.offset .cse4 (- 4))) (select .cse3 .cse2) (select .cse3 (+ bar_~b.offset .cse4 (- 8))))) |c_foo_#t~ret5|) (<= bar_~b.offset 0)))))) is different from true [2018-02-04 18:54:16,810 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_979 Int)) (let ((.cse1 (store (select |c_old(#memory_int)| |c_foo_~#a~0.base|) 0 (select (select |c_old(#memory_int)| |c_foo_#in~b.base|) |c_foo_#in~b.offset|)))) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_foo_~#a~0.base| (let ((.cse0 (store .cse1 4 v_prenex_979))) (store .cse0 8 (select (select (store |c_old(#memory_int)| |c_foo_~#a~0.base| .cse0) |c_foo_#in~b.base|) (+ |c_foo_#in~b.offset| 8)))))) (<= (select (select (store |c_old(#memory_int)| |c_foo_~#a~0.base| .cse1) |c_foo_#in~b.base|) (+ |c_foo_#in~b.offset| 4)) v_prenex_979)))) (exists ((bar_~b.offset Int) (bar_~i~0 Int)) (let ((.cse3 (* 4 bar_~i~0))) (let ((.cse4 (+ bar_~b.offset .cse3))) (and (<= (let ((.cse2 (select |c_#memory_int| |c_foo_~#a~0.base|))) (+ (select .cse2 (+ bar_~b.offset .cse3 (- 4))) (select .cse2 .cse4) (select .cse2 (+ bar_~b.offset .cse3 (- 8))))) 0) (<= 8 .cse4) (<= bar_~i~0 2) (<= bar_~b.offset 0)))))) is different from true [2018-02-04 18:54:16,813 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-04 18:54:16,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:16,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:16,827 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:115, output treesize:114 [2018-02-04 18:54:16,830 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~0.base| Int) (bar_~b.offset Int) (bar_~i~0 Int) (v_prenex_979 Int)) (let ((.cse1 (* 4 bar_~i~0))) (let ((.cse2 (+ bar_~b.offset .cse1)) (.cse4 (store (select |c_old(#memory_int)| |foo_~#a~0.base|) 0 (select (select |c_old(#memory_int)| |c_foo_#in~b.base|) |c_foo_#in~b.offset|)))) (and (<= (let ((.cse0 (select |c_#memory_int| |foo_~#a~0.base|))) (+ (select .cse0 (+ bar_~b.offset .cse1 (- 4))) (select .cse0 .cse2) (select .cse0 (+ bar_~b.offset .cse1 (- 8))))) 0) (<= 8 .cse2) (<= bar_~i~0 2) (= 0 (select |c_#valid| |foo_~#a~0.base|)) (<= bar_~b.offset 0) (= |c_#memory_int| (store |c_old(#memory_int)| |foo_~#a~0.base| (let ((.cse3 (store .cse4 4 v_prenex_979))) (store .cse3 8 (select (select (store |c_old(#memory_int)| |foo_~#a~0.base| .cse3) |c_foo_#in~b.base|) (+ |c_foo_#in~b.offset| 8)))))) (<= (select (select (store |c_old(#memory_int)| |foo_~#a~0.base| .cse4) |c_foo_#in~b.base|) (+ |c_foo_#in~b.offset| 4)) v_prenex_979))))) is different from true [2018-02-04 18:54:16,881 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 128 [2018-02-04 18:54:16,883 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:16,883 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:16,884 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:16,884 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:16,884 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:16,885 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:54:16,885 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:16,886 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:16,886 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:16,887 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 151 [2018-02-04 18:54:16,912 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:16,913 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:16,919 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:16,919 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:16,920 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:54:16,920 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:16,920 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:54:16,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, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 105 [2018-02-04 18:54:16,984 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:16,985 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:16,985 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:16,985 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 34 treesize of output 31 [2018-02-04 18:54:16,986 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:16,987 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:16,988 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:16,988 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:16,989 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:54:16,989 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:16,989 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:16,990 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:16,991 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:16,991 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:16,992 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:54:16,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 127 [2018-02-04 18:54:16,996 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:16,997 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:54:16,997 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:16,998 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:54:16,998 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:17,005 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:17,007 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:17,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:17,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:17,015 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:199, output treesize:5 [2018-02-04 18:54:17,045 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:54:17,045 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:17,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:17,045 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:1 [2018-02-04 18:54:17,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3391 backedges. 1709 proven. 162 refuted. 0 times theorem prover too weak. 1469 trivial. 51 not checked. [2018-02-04 18:54:17,240 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:54:17,240 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-02-04 18:54:17,240 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-04 18:54:17,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-04 18:54:17,241 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=2012, Unknown=30, NotChecked=372, Total=2550 [2018-02-04 18:54:17,241 INFO L87 Difference]: Start difference. First operand 305 states and 336 transitions. Second operand 51 states. [2018-02-04 18:54:20,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:54:20,459 INFO L93 Difference]: Finished difference Result 313 states and 344 transitions. [2018-02-04 18:54:20,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-04 18:54:20,460 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 412 [2018-02-04 18:54:20,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:54:20,460 INFO L225 Difference]: With dead ends: 313 [2018-02-04 18:54:20,460 INFO L226 Difference]: Without dead ends: 307 [2018-02-04 18:54:20,461 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 361 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1333 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=288, Invalid=5496, Unknown=84, NotChecked=612, Total=6480 [2018-02-04 18:54:20,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-02-04 18:54:20,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-02-04 18:54:20,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-02-04 18:54:20,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 338 transitions. [2018-02-04 18:54:20,464 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 338 transitions. Word has length 412 [2018-02-04 18:54:20,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:54:20,464 INFO L432 AbstractCegarLoop]: Abstraction has 307 states and 338 transitions. [2018-02-04 18:54:20,464 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-04 18:54:20,464 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 338 transitions. [2018-02-04 18:54:20,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2018-02-04 18:54:20,465 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:54:20,465 INFO L351 BasicCegarLoop]: trace histogram [29, 28, 22, 22, 22, 22, 21, 21, 21, 21, 21, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:54:20,465 INFO L371 AbstractCegarLoop]: === Iteration 60 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:54:20,466 INFO L82 PathProgramCache]: Analyzing trace with hash 213813146, now seen corresponding path program 29 times [2018-02-04 18:54:20,466 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:54:20,466 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:54:20,466 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:54:20,466 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:54:20,466 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:54:20,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:54:20,482 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:54:20,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3510 backedges. 302 proven. 764 refuted. 0 times theorem prover too weak. 2444 trivial. 0 not checked. [2018-02-04 18:54:20,777 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:54:20,777 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:54:20,777 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 18:54:20,878 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-02-04 18:54:20,878 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:54:20,890 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:54:21,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3510 backedges. 1898 proven. 90 refuted. 0 times theorem prover too weak. 1522 trivial. 0 not checked. [2018-02-04 18:54:21,054 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:54:21,054 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2018-02-04 18:54:21,055 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 18:54:21,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 18:54:21,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=726, Unknown=0, NotChecked=0, Total=812 [2018-02-04 18:54:21,055 INFO L87 Difference]: Start difference. First operand 307 states and 338 transitions. Second operand 29 states. [2018-02-04 18:54:21,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:54:21,497 INFO L93 Difference]: Finished difference Result 280 states and 300 transitions. [2018-02-04 18:54:21,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 18:54:21,497 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 417 [2018-02-04 18:54:21,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:54:21,498 INFO L225 Difference]: With dead ends: 280 [2018-02-04 18:54:21,498 INFO L226 Difference]: Without dead ends: 280 [2018-02-04 18:54:21,498 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 404 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=318, Invalid=2132, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 18:54:21,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-02-04 18:54:21,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 278. [2018-02-04 18:54:21,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-02-04 18:54:21,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 297 transitions. [2018-02-04 18:54:21,500 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 297 transitions. Word has length 417 [2018-02-04 18:54:21,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:54:21,501 INFO L432 AbstractCegarLoop]: Abstraction has 278 states and 297 transitions. [2018-02-04 18:54:21,501 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 18:54:21,501 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 297 transitions. [2018-02-04 18:54:21,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-02-04 18:54:21,502 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:54:21,502 INFO L351 BasicCegarLoop]: trace histogram [27, 27, 20, 20, 20, 20, 20, 20, 20, 20, 20, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:54:21,502 INFO L371 AbstractCegarLoop]: === Iteration 61 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:54:21,502 INFO L82 PathProgramCache]: Analyzing trace with hash -313736061, now seen corresponding path program 3 times [2018-02-04 18:54:21,502 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:54:21,502 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:54:21,503 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:54:21,503 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:54:21,503 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:54:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:54:21,518 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:54:21,664 INFO L134 CoverageAnalysis]: Checked inductivity of 3169 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 3008 trivial. 0 not checked. [2018-02-04 18:54:21,665 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:54:21,665 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:54:21,665 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 18:54:21,701 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-02-04 18:54:21,701 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:54:21,706 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:54:21,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3169 backedges. 640 proven. 70 refuted. 0 times theorem prover too weak. 2459 trivial. 0 not checked. [2018-02-04 18:54:21,806 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:54:21,806 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 18 [2018-02-04 18:54:21,806 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 18:54:21,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 18:54:21,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-02-04 18:54:21,807 INFO L87 Difference]: Start difference. First operand 278 states and 297 transitions. Second operand 18 states. [2018-02-04 18:54:21,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:54:21,999 INFO L93 Difference]: Finished difference Result 356 states and 386 transitions. [2018-02-04 18:54:21,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 18:54:21,999 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 414 [2018-02-04 18:54:21,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:54:22,000 INFO L225 Difference]: With dead ends: 356 [2018-02-04 18:54:22,000 INFO L226 Difference]: Without dead ends: 337 [2018-02-04 18:54:22,000 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2018-02-04 18:54:22,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-02-04 18:54:22,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 326. [2018-02-04 18:54:22,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-02-04 18:54:22,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 351 transitions. [2018-02-04 18:54:22,003 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 351 transitions. Word has length 414 [2018-02-04 18:54:22,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:54:22,003 INFO L432 AbstractCegarLoop]: Abstraction has 326 states and 351 transitions. [2018-02-04 18:54:22,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 18:54:22,003 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 351 transitions. [2018-02-04 18:54:22,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2018-02-04 18:54:22,005 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:54:22,005 INFO L351 BasicCegarLoop]: trace histogram [34, 34, 26, 26, 26, 26, 26, 26, 26, 26, 26, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:54:22,005 INFO L371 AbstractCegarLoop]: === Iteration 62 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:54:22,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1164033537, now seen corresponding path program 30 times [2018-02-04 18:54:22,005 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:54:22,005 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:54:22,006 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:54:22,006 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:54:22,006 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:54:22,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:54:22,027 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:54:22,487 INFO L134 CoverageAnalysis]: Checked inductivity of 5069 backedges. 748 proven. 768 refuted. 0 times theorem prover too weak. 3553 trivial. 0 not checked. [2018-02-04 18:54:22,488 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:54:22,488 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:54:22,488 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 18:54:22,687 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-02-04 18:54:22,687 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:54:22,703 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:54:22,860 INFO L134 CoverageAnalysis]: Checked inductivity of 5069 backedges. 1099 proven. 102 refuted. 0 times theorem prover too weak. 3868 trivial. 0 not checked. [2018-02-04 18:54:22,860 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:54:22,860 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 31 [2018-02-04 18:54:22,860 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 18:54:22,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 18:54:22,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=771, Unknown=0, NotChecked=0, Total=930 [2018-02-04 18:54:22,861 INFO L87 Difference]: Start difference. First operand 326 states and 351 transitions. Second operand 31 states. [2018-02-04 18:54:23,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:54:23,418 INFO L93 Difference]: Finished difference Result 336 states and 356 transitions. [2018-02-04 18:54:23,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 18:54:23,419 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 492 [2018-02-04 18:54:23,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:54:23,420 INFO L225 Difference]: With dead ends: 336 [2018-02-04 18:54:23,420 INFO L226 Difference]: Without dead ends: 336 [2018-02-04 18:54:23,420 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 483 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=661, Invalid=2645, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 18:54:23,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-02-04 18:54:23,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 332. [2018-02-04 18:54:23,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-02-04 18:54:23,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 352 transitions. [2018-02-04 18:54:23,423 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 352 transitions. Word has length 492 [2018-02-04 18:54:23,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:54:23,423 INFO L432 AbstractCegarLoop]: Abstraction has 332 states and 352 transitions. [2018-02-04 18:54:23,423 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 18:54:23,423 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 352 transitions. [2018-02-04 18:54:23,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2018-02-04 18:54:23,425 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:54:23,425 INFO L351 BasicCegarLoop]: trace histogram [36, 35, 28, 28, 28, 28, 28, 27, 27, 27, 27, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:54:23,425 INFO L371 AbstractCegarLoop]: === Iteration 63 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:54:23,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1969617026, now seen corresponding path program 31 times [2018-02-04 18:54:23,425 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:54:23,425 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:54:23,425 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:54:23,425 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:54:23,426 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:54:23,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:54:23,457 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:54:24,040 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 2003 proven. 124 refuted. 0 times theorem prover too weak. 3438 trivial. 0 not checked. [2018-02-04 18:54:24,040 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:54:24,040 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:54:24,040 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:54:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:54:24,071 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:54:24,338 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 1988 proven. 125 refuted. 0 times theorem prover too weak. 3452 trivial. 0 not checked. [2018-02-04 18:54:24,338 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:54:24,338 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18] total 37 [2018-02-04 18:54:24,339 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 18:54:24,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 18:54:24,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1132, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 18:54:24,339 INFO L87 Difference]: Start difference. First operand 332 states and 352 transitions. Second operand 37 states. [2018-02-04 18:54:24,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:54:24,893 INFO L93 Difference]: Finished difference Result 343 states and 364 transitions. [2018-02-04 18:54:24,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 18:54:24,893 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 509 [2018-02-04 18:54:24,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:54:24,894 INFO L225 Difference]: With dead ends: 343 [2018-02-04 18:54:24,895 INFO L226 Difference]: Without dead ends: 343 [2018-02-04 18:54:24,895 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 495 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=423, Invalid=2229, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 18:54:24,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-02-04 18:54:24,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 340. [2018-02-04 18:54:24,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-02-04 18:54:24,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 361 transitions. [2018-02-04 18:54:24,897 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 361 transitions. Word has length 509 [2018-02-04 18:54:24,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:54:24,898 INFO L432 AbstractCegarLoop]: Abstraction has 340 states and 361 transitions. [2018-02-04 18:54:24,898 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 18:54:24,898 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 361 transitions. [2018-02-04 18:54:24,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2018-02-04 18:54:24,900 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:54:24,900 INFO L351 BasicCegarLoop]: trace histogram [36, 36, 28, 28, 28, 28, 28, 28, 28, 28, 28, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:54:24,900 INFO L371 AbstractCegarLoop]: === Iteration 64 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:54:24,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1156880963, now seen corresponding path program 32 times [2018-02-04 18:54:24,900 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:54:24,901 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:54:24,901 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:54:24,901 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:54:24,901 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:54:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:54:24,946 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:54:24,968 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:54:24,968 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:54:24,968 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:54:24,968 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:54:25,031 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 18:54:25,031 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:54:25,040 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:54:25,042 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-04 18:54:25,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:25,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:25,044 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:54:25,055 WARN L1033 $PredicateComparison]: unable to prove that (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) is different from true [2018-02-04 18:54:25,057 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-04 18:54:25,057 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:25,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:25,058 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:54:25,065 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_84| Int) (v_prenex_988 Int)) (= (* 4 v_prenex_988) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_84|)))) is different from true [2018-02-04 18:54:25,068 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-04 18:54:25,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:25,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:25,072 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:54:25,073 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_84| Int) (v_prenex_988 Int)) (= (* 4 v_prenex_988) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_84|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:54:25,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 17 [2018-02-04 18:54:25,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:54:25,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-02-04 18:54:25,095 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:58 [2018-02-04 18:54:25,131 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:54:25,131 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:25,138 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:25,139 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:25,139 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-04 18:54:25,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:25,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:25,145 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:54, output treesize:23 [2018-02-04 18:54:25,169 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-04 18:54:25,169 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:25,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:25,170 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:54:25,178 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_84| Int) (v_prenex_993 Int)) (= (* 4 v_prenex_993) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_84|)))) is different from true [2018-02-04 18:54:25,180 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-04 18:54:25,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:25,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:25,184 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:54:25,186 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_84| Int) (v_prenex_993 Int)) (= (* 4 v_prenex_993) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_84|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:54:25,201 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 21 treesize of output 32 [2018-02-04 18:54:25,201 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:54:25,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-02-04 18:54:25,230 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-02-04 18:54:25,287 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:54:25,288 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:25,296 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:25,296 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:25,297 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-04 18:54:25,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:25,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:25,304 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:76, output treesize:34 [2018-02-04 18:54:25,331 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-04 18:54:25,331 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:25,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:25,332 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:54:25,341 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) (exists ((v_prenex_1006 Int) (|v_foo_~#a~0.base_BEFORE_CALL_84| Int)) (= (* 4 v_prenex_1006) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_84|)))) is different from true [2018-02-04 18:54:25,351 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-04 18:54:25,351 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:25,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:25,355 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:54:25,357 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|)))) (exists ((v_prenex_1006 Int) (|v_foo_~#a~0.base_BEFORE_CALL_84| Int)) (= (* 4 v_prenex_1006) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_84|)))) is different from true [2018-02-04 18:54:25,370 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 21 treesize of output 32 [2018-02-04 18:54:25,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:54:25,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-02-04 18:54:25,393 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-02-04 18:54:25,460 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:25,460 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:25,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-02-04 18:54:25,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:25,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:25,476 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:76, output treesize:34 [2018-02-04 18:54:25,514 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-04 18:54:25,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:25,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:25,515 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:54:25,525 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_1019 Int) (|v_foo_~#a~0.base_BEFORE_CALL_84| Int)) (= (* 4 v_prenex_1019) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_84|))) (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|))) is different from true [2018-02-04 18:54:25,527 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-04 18:54:25,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:25,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:25,530 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:54:25,531 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_1019 Int) (|v_foo_~#a~0.base_BEFORE_CALL_84| Int)) (= (* 4 v_prenex_1019) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_84|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:54:25,544 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 21 treesize of output 32 [2018-02-04 18:54:25,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:54:25,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-02-04 18:54:25,565 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-02-04 18:54:25,632 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:54:25,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:25,642 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:25,642 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:25,642 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-04 18:54:25,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:25,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:25,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:76, output treesize:34 [2018-02-04 18:54:25,691 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-04 18:54:25,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:25,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:25,692 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:54:25,702 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_84| Int) (v_prenex_1032 Int)) (= (* 4 v_prenex_1032) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_84|))) (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|))) is different from true [2018-02-04 18:54:25,704 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-04 18:54:25,704 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:25,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:25,707 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:54:25,709 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_84| Int) (v_prenex_1032 Int)) (= (* 4 v_prenex_1032) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_84|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:54:25,722 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 21 treesize of output 32 [2018-02-04 18:54:25,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:54:25,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-02-04 18:54:25,745 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-02-04 18:54:25,815 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:25,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23 [2018-02-04 18:54:25,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:25,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:25,827 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:69, output treesize:23 [2018-02-04 18:54:25,867 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-04 18:54:25,867 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:25,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:25,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:54:25,881 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_84| Int) (v_prenex_1045 Int)) (= (* 4 v_prenex_1045) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_84|)))) is different from true [2018-02-04 18:54:25,883 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-04 18:54:25,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:25,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:25,895 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:54:25,897 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_84| Int) (v_prenex_1045 Int)) (= (* 4 v_prenex_1045) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_84|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:54:25,910 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 21 treesize of output 32 [2018-02-04 18:54:25,911 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:54:25,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-02-04 18:54:25,934 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-02-04 18:54:26,013 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:26,013 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:26,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-02-04 18:54:26,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:26,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:26,029 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:76, output treesize:34 [2018-02-04 18:54:26,080 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-04 18:54:26,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:26,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:26,082 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:54:26,092 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_84| Int) (v_prenex_1058 Int)) (= (* 4 v_prenex_1058) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_84|))) (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|))) is different from true [2018-02-04 18:54:26,094 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-04 18:54:26,094 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:26,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:26,097 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:54:26,099 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_84| Int) (v_prenex_1058 Int)) (= (* 4 v_prenex_1058) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_84|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:54:26,116 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 21 treesize of output 32 [2018-02-04 18:54:26,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:54:26,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-02-04 18:54:26,143 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-02-04 18:54:26,298 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) is different from true [2018-02-04 18:54:26,309 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-04 18:54:26,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:26,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 18:54:26,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:26,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:26,314 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-02-04 18:54:26,324 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_84| Int) (v_prenex_1070 Int)) (= (* 4 v_prenex_1070) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_84|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0)))) is different from true [2018-02-04 18:54:26,329 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:26,335 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 2 case distinctions, treesize of input 21 treesize of output 32 [2018-02-04 18:54:26,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:54:26,359 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:26,360 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:26,361 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:26,361 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 16 treesize of output 9 [2018-02-04 18:54:26,361 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:26,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-02-04 18:54:26,377 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:60, output treesize:86 [2018-02-04 18:54:26,868 INFO L134 CoverageAnalysis]: Checked inductivity of 5716 backedges. 14 proven. 182 refuted. 0 times theorem prover too weak. 4326 trivial. 1194 not checked. [2018-02-04 18:54:26,868 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:54:26,868 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-02-04 18:54:26,869 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 18:54:26,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 18:54:26,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=453, Unknown=17, NotChecked=1020, Total=1640 [2018-02-04 18:54:26,869 INFO L87 Difference]: Start difference. First operand 340 states and 361 transitions. Second operand 41 states. [2018-02-04 18:54:26,927 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_84| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_84|)))) is different from true [2018-02-04 18:54:26,928 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|))) is different from true [2018-02-04 18:54:26,967 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_84| Int) (v_prenex_1032 Int)) (= (* 4 v_prenex_1032) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_84|))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_84| Int) (v_prenex_1070 Int)) (= (* 4 v_prenex_1070) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_84|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_84| Int) (v_prenex_1058 Int)) (= (* 4 v_prenex_1058) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_84|))) (exists ((v_prenex_1019 Int) (|v_foo_~#a~0.base_BEFORE_CALL_84| Int)) (= (* 4 v_prenex_1019) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_84|))) (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_84| Int) (v_prenex_993 Int)) (= (* 4 v_prenex_993) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_84|))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_84| Int) (v_prenex_988 Int)) (= (* 4 v_prenex_988) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_84|))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_84| Int) (v_prenex_1045 Int)) (= (* 4 v_prenex_1045) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_84|))) (exists ((v_prenex_1006 Int) (|v_foo_~#a~0.base_BEFORE_CALL_84| Int)) (= (* 4 v_prenex_1006) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_84|)))) is different from true [2018-02-04 18:54:26,969 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_84| Int) (v_prenex_993 Int)) (= (* 4 v_prenex_993) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_84|))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_84| Int) (v_prenex_988 Int)) (= (* 4 v_prenex_988) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_84|)))) is different from true [2018-02-04 18:54:26,971 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_84| Int) (v_prenex_993 Int)) (= (* 4 v_prenex_993) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_84|))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_84| Int) (v_prenex_988 Int)) (= (* 4 v_prenex_988) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_84|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:54:27,153 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_84| Int) (v_prenex_1032 Int)) (= (* 4 v_prenex_1032) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_84|))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_84| Int) (v_prenex_1070 Int)) (= (* 4 v_prenex_1070) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_84|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_84| Int) (v_prenex_1058 Int)) (= (* 4 v_prenex_1058) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_84|))) (exists ((v_prenex_1019 Int) (|v_foo_~#a~0.base_BEFORE_CALL_84| Int)) (= (* 4 v_prenex_1019) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_84|))) (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_84| Int) (v_prenex_1045 Int)) (= (* 4 v_prenex_1045) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_84|))) (exists ((v_prenex_1006 Int) (|v_foo_~#a~0.base_BEFORE_CALL_84| Int)) (= (* 4 v_prenex_1006) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_84|)))) is different from true [2018-02-04 18:54:27,156 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_84| Int) (v_prenex_1032 Int)) (= (* 4 v_prenex_1032) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_84|))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_84| Int) (v_prenex_1070 Int)) (= (* 4 v_prenex_1070) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_84|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_84| Int) (v_prenex_1058 Int)) (= (* 4 v_prenex_1058) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_84|))) (exists ((v_prenex_1019 Int) (|v_foo_~#a~0.base_BEFORE_CALL_84| Int)) (= (* 4 v_prenex_1019) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_84|))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_84| Int) (v_prenex_1045 Int)) (= (* 4 v_prenex_1045) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_84|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|)))) (exists ((v_prenex_1006 Int) (|v_foo_~#a~0.base_BEFORE_CALL_84| Int)) (= (* 4 v_prenex_1006) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_84|)))) is different from true [2018-02-04 18:54:28,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:54:28,015 INFO L93 Difference]: Finished difference Result 379 states and 410 transitions. [2018-02-04 18:54:28,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 18:54:28,016 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 514 [2018-02-04 18:54:28,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:54:28,017 INFO L225 Difference]: With dead ends: 379 [2018-02-04 18:54:28,017 INFO L226 Difference]: Without dead ends: 379 [2018-02-04 18:54:28,017 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 462 SyntacticMatches, 17 SemanticMatches, 61 ConstructedPredicates, 24 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=399, Invalid=1155, Unknown=24, NotChecked=2328, Total=3906 [2018-02-04 18:54:28,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-02-04 18:54:28,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 360. [2018-02-04 18:54:28,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-02-04 18:54:28,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 388 transitions. [2018-02-04 18:54:28,021 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 388 transitions. Word has length 514 [2018-02-04 18:54:28,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:54:28,021 INFO L432 AbstractCegarLoop]: Abstraction has 360 states and 388 transitions. [2018-02-04 18:54:28,021 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 18:54:28,021 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 388 transitions. [2018-02-04 18:54:28,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2018-02-04 18:54:28,023 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:54:28,023 INFO L351 BasicCegarLoop]: trace histogram [36, 36, 28, 28, 28, 28, 28, 28, 28, 28, 28, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 5, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:54:28,023 INFO L371 AbstractCegarLoop]: === Iteration 65 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:54:28,023 INFO L82 PathProgramCache]: Analyzing trace with hash -386917274, now seen corresponding path program 33 times [2018-02-04 18:54:28,023 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:54:28,024 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:54:28,024 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:54:28,024 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:54:28,024 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:54:28,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:54:28,063 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:54:28,075 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:54:28,075 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:54:28,075 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:54:28,076 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 18:54:28,931 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-02-04 18:54:28,931 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:54:28,970 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:54:28,972 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-04 18:54:28,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:28,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:28,974 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:54:28,979 WARN L1033 $PredicateComparison]: unable to prove that (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) is different from true [2018-02-04 18:54:28,981 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-04 18:54:28,981 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:28,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:28,982 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:54:28,989 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_91| Int) (v_prenex_1076 Int)) (= (* 4 v_prenex_1076) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_91|)))) is different from true [2018-02-04 18:54:28,992 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-04 18:54:28,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:28,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:28,995 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:54:28,996 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_91| Int) (v_prenex_1076 Int)) (= (* 4 v_prenex_1076) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_91|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:54:29,003 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 2 case distinctions, treesize of input 14 treesize of output 17 [2018-02-04 18:54:29,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:54:29,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-02-04 18:54:29,012 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:29, output treesize:52 [2018-02-04 18:54:29,036 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:29,037 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:29,037 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 26 treesize of output 20 [2018-02-04 18:54:29,037 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:29,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:29,046 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:20 [2018-02-04 18:54:29,057 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-04 18:54:29,057 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:29,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:29,058 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:54:29,067 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int)) (= (store |c_old(#length)| |c_foo_~#a~0.base| (* 4 foo_~n)) |c_#length|)) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_91| Int) (v_prenex_1081 Int)) (= (* 4 v_prenex_1081) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_91|)))) is different from true [2018-02-04 18:54:29,069 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-04 18:54:29,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:29,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:29,073 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:54:29,074 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~0.base_BEFORE_CALL_91| Int) (v_prenex_1081 Int)) (= (* 4 v_prenex_1081) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_91|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:54:29,086 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 21 treesize of output 32 [2018-02-04 18:54:29,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:54:29,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-02-04 18:54:29,107 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:40, output treesize:106 [2018-02-04 18:54:29,154 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:29,154 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 30 treesize of output 20 [2018-02-04 18:54:29,155 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:29,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:29,165 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:63, output treesize:20 [2018-02-04 18:54:29,188 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-04 18:54:29,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:29,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:29,189 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-02-04 18:54:29,249 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-04 18:54:29,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:29,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:29,252 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:17 [2018-02-04 18:54:29,277 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 21 treesize of output 32 [2018-02-04 18:54:29,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-02-04 18:54:29,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-02-04 18:54:29,299 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:36, output treesize:94 [2018-02-04 18:54:29,429 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) is different from true [2018-02-04 18:54:29,435 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-04 18:54:29,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:29,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 18:54:29,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:29,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:29,440 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-02-04 18:54:29,449 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((v_prenex_1102 Int) (|v_foo_~#a~0.base_BEFORE_CALL_91| Int)) (= (* 4 v_prenex_1102) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_91|)))) is different from true [2018-02-04 18:54:29,454 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:29,455 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:29,456 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:29,456 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 16 treesize of output 9 [2018-02-04 18:54:29,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:29,471 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 2 case distinctions, treesize of input 21 treesize of output 32 [2018-02-04 18:54:29,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 18:54:29,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-02-04 18:54:29,491 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:49, output treesize:72 [2018-02-04 18:54:29,634 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-04 18:54:29,634 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:29,640 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:29,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-02-04 18:54:29,640 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:29,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:29,643 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:25, output treesize:18 [2018-02-04 18:54:29,695 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= |c_#valid| (store |c_old(#valid)| |foo_~#a~0.base| 0)) (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0) (= (select (store |c_old(#valid)| |foo_~#a~0.base| 1) |c_foo_#in~b.base|) 1))) is different from true [2018-02-04 18:54:29,719 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:29,719 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:29,720 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 17 treesize of output 21 [2018-02-04 18:54:29,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:29,731 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:29,737 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 2 case distinctions, treesize of input 21 treesize of output 32 [2018-02-04 18:54:29,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 18:54:29,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-04 18:54:29,756 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:55, output treesize:74 [2018-02-04 18:54:29,885 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-04 18:54:29,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:29,889 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:29,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 5 [2018-02-04 18:54:29,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:29,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:29,892 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:20, output treesize:13 [2018-02-04 18:54:29,944 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= |c_#valid| (store |c_old(#valid)| |foo_~#a~0.base| 0)) (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) is different from true [2018-02-04 18:54:29,947 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:29,954 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 2 case distinctions, treesize of input 21 treesize of output 32 [2018-02-04 18:54:29,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:54:29,977 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:29,978 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:29,980 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:29,980 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 0 case distinctions, treesize of input 22 treesize of output 30 [2018-02-04 18:54:29,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:29,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-04 18:54:29,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:52, output treesize:71 [2018-02-04 18:54:30,084 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-04 18:54:30,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:30,089 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:30,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-02-04 18:54:30,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:30,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:30,091 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:20, output treesize:13 [2018-02-04 18:54:30,148 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:30,149 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:30,150 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 0 case distinctions, treesize of input 22 treesize of output 30 [2018-02-04 18:54:30,150 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:30,161 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:30,162 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:30,168 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 2 case distinctions, treesize of input 21 treesize of output 32 [2018-02-04 18:54:30,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 18:54:30,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-04 18:54:30,185 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:52, output treesize:71 [2018-02-04 18:54:30,310 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-04 18:54:30,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:30,314 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:30,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-02-04 18:54:30,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:30,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:30,316 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:20, output treesize:13 [2018-02-04 18:54:30,367 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:30,368 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:30,369 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 16 treesize of output 9 [2018-02-04 18:54:30,369 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:30,386 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 2 case distinctions, treesize of input 21 treesize of output 32 [2018-02-04 18:54:30,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 18:54:30,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-04 18:54:30,402 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:53, output treesize:72 [2018-02-04 18:54:31,049 INFO L134 CoverageAnalysis]: Checked inductivity of 5710 backedges. 827 proven. 1330 refuted. 0 times theorem prover too weak. 2588 trivial. 965 not checked. [2018-02-04 18:54:31,050 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:54:31,050 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-02-04 18:54:31,050 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-04 18:54:31,051 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-04 18:54:31,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=954, Unknown=11, NotChecked=648, Total=1806 [2018-02-04 18:54:31,051 INFO L87 Difference]: Start difference. First operand 360 states and 388 transitions. Second operand 43 states. [2018-02-04 18:54:32,593 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((v_prenex_1102 Int) (|v_foo_~#a~0.base_BEFORE_CALL_91| Int)) (= (* 4 v_prenex_1102) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_91|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= |c_#valid| (store |c_old(#valid)| |foo_~#a~0.base| 0)) (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0) (= (select (store |c_old(#valid)| |foo_~#a~0.base| 1) |c_foo_#in~b.base|) 1))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= |c_#valid| (store |c_old(#valid)| |foo_~#a~0.base| 0)) (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_91| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_91|)))) is different from true [2018-02-04 18:54:32,596 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((v_prenex_1102 Int) (|v_foo_~#a~0.base_BEFORE_CALL_91| Int)) (= (* 4 v_prenex_1102) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_91|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= |c_#valid| (store |c_old(#valid)| |foo_~#a~0.base| 0)) (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0) (= (select (store |c_old(#valid)| |foo_~#a~0.base| 1) |c_foo_#in~b.base|) 1))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= |c_#valid| (store |c_old(#valid)| |foo_~#a~0.base| 0)) (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0)))) is different from true [2018-02-04 18:54:32,698 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= |c_#valid| (store |c_old(#valid)| |foo_~#a~0.base| 0)) (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_91| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_91|))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_91| Int) (v_prenex_1081 Int)) (= (* 4 v_prenex_1081) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_91|))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_91| Int) (v_prenex_1076 Int)) (= (* 4 v_prenex_1076) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_91|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:54:32,700 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= |c_#valid| (store |c_old(#valid)| |foo_~#a~0.base| 0)) (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_91| Int) (v_prenex_1081 Int)) (= (* 4 v_prenex_1081) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_91|))) (exists ((|v_foo_~#a~0.base_BEFORE_CALL_91| Int) (v_prenex_1076 Int)) (= (* 4 v_prenex_1076) (select |c_#length| |v_foo_~#a~0.base_BEFORE_CALL_91|))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= 0 (select |c_#valid| |foo_~#a~0.base|))))) is different from true [2018-02-04 18:54:33,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:54:33,414 INFO L93 Difference]: Finished difference Result 418 states and 455 transitions. [2018-02-04 18:54:33,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-04 18:54:33,414 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 514 [2018-02-04 18:54:33,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:54:33,415 INFO L225 Difference]: With dead ends: 418 [2018-02-04 18:54:33,415 INFO L226 Difference]: Without dead ends: 418 [2018-02-04 18:54:33,416 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 460 SyntacticMatches, 25 SemanticMatches, 80 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 1957 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=636, Invalid=4081, Unknown=27, NotChecked=1898, Total=6642 [2018-02-04 18:54:33,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-02-04 18:54:33,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 356. [2018-02-04 18:54:33,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-02-04 18:54:33,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 380 transitions. [2018-02-04 18:54:33,419 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 380 transitions. Word has length 514 [2018-02-04 18:54:33,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:54:33,419 INFO L432 AbstractCegarLoop]: Abstraction has 356 states and 380 transitions. [2018-02-04 18:54:33,419 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-04 18:54:33,419 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 380 transitions. [2018-02-04 18:54:33,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2018-02-04 18:54:33,421 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:54:33,421 INFO L351 BasicCegarLoop]: trace histogram [36, 36, 28, 28, 28, 28, 28, 28, 28, 28, 28, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 5, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:54:33,421 INFO L371 AbstractCegarLoop]: === Iteration 66 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:54:33,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1813881472, now seen corresponding path program 34 times [2018-02-04 18:54:33,422 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:54:33,422 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:54:33,422 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:54:33,422 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:54:33,422 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:54:33,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:54:33,461 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:54:33,473 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:54:33,473 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:54:33,474 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:54:33,474 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 18:54:34,125 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 18:54:34,125 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:54:34,154 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:54:34,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 18:54:34,178 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:34,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 18:54:34,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 18:54:34,189 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:34,191 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:34,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:34,193 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:24, output treesize:15 [2018-02-04 18:54:34,232 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-04 18:54:34,233 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-04 18:54:34,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:34,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:34,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:34,235 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:11, output treesize:1 [2018-02-04 18:54:34,245 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-04 18:54:34,245 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:34,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:34,248 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:21, output treesize:20 [2018-02-04 18:54:34,267 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 19 treesize of output 31 [2018-02-04 18:54:34,269 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 20 treesize of output 19 [2018-02-04 18:54:34,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:34,283 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 2 case distinctions, treesize of input 17 treesize of output 22 [2018-02-04 18:54:34,283 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 18:54:34,291 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:54:34,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 18:54:34,299 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:30, output treesize:32 [2018-02-04 18:54:34,317 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:34,317 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:34,318 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 30 [2018-02-04 18:54:34,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:34,318 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:54:34,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:34,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, 1 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-04 18:54:34,328 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:34,329 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:34,329 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 18 treesize of output 35 [2018-02-04 18:54:34,329 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:34,332 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:34,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:34,336 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:66, output treesize:22 [2018-02-04 18:54:34,424 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 18 treesize of output 15 [2018-02-04 18:54:34,425 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-02-04 18:54:34,426 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:34,427 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-04 18:54:34,427 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:34,430 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:34,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:34,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:34,434 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:22, output treesize:1 [2018-02-04 18:54:34,459 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-04 18:54:34,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:34,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:34,464 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:33, output treesize:32 [2018-02-04 18:54:34,500 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 35 treesize of output 45 [2018-02-04 18:54:34,501 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2018-02-04 18:54:34,503 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:34,504 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-04 18:54:34,504 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:34,509 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:34,527 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:34,529 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:34,537 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 4 case distinctions, treesize of input 31 treesize of output 49 [2018-02-04 18:54:34,539 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:34,539 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:34,553 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 2 case distinctions, treesize of input 37 treesize of output 64 [2018-02-04 18:54:34,553 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-02-04 18:54:34,592 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:34,592 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:34,596 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:34,606 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 6 case distinctions, treesize of input 33 treesize of output 70 [2018-02-04 18:54:34,606 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-02-04 18:54:34,652 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:34,653 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:34,653 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:34,655 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 31 treesize of output 56 [2018-02-04 18:54:34,655 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:34,726 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-02-04 18:54:34,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-02-04 18:54:34,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-02-04 18:54:34,808 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:51, output treesize:81 [2018-02-04 18:54:34,849 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:34,850 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:34,850 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 48 treesize of output 42 [2018-02-04 18:54:34,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:34,851 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:54:34,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:34,859 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 32 treesize of output 25 [2018-02-04 18:54:34,860 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:34,860 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:34,861 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:34,861 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:34,861 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:34,862 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:34,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 84 [2018-02-04 18:54:34,862 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:34,868 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:34,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:34,878 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:81, output treesize:31 [2018-02-04 18:54:35,063 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 20 [2018-02-04 18:54:35,064 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-02-04 18:54:35,065 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,066 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 31 [2018-02-04 18:54:35,067 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,068 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,068 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,070 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 25 treesize of output 52 [2018-02-04 18:54:35,070 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:35,075 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:35,078 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:35,081 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:35,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:35,085 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:27, output treesize:1 [2018-02-04 18:54:35,126 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-04 18:54:35,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:35,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:35,132 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:38, output treesize:37 [2018-02-04 18:54:35,187 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 49 treesize of output 57 [2018-02-04 18:54:35,189 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-02-04 18:54:35,190 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,191 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 31 [2018-02-04 18:54:35,193 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,194 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,194 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,196 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 25 treesize of output 52 [2018-02-04 18:54:35,196 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:35,202 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:35,209 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:35,238 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,238 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,239 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,241 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,242 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,243 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,256 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 2 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 92 [2018-02-04 18:54:35,259 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,260 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,260 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,261 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,261 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:54:35,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 107 [2018-02-04 18:54:35,266 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,266 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,267 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,267 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 96 [2018-02-04 18:54:35,276 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-02-04 18:54:35,316 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:54:35,434 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,434 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,434 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,435 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,435 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,436 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,446 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,447 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 95 [2018-02-04 18:54:35,449 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,450 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,450 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,451 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,451 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,452 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,452 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,453 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 142 [2018-02-04 18:54:35,458 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:35,476 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:35,521 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,522 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,522 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,523 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,527 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,528 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,529 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,544 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 2 new quantified variables, introduced 9 case distinctions, treesize of input 45 treesize of output 106 [2018-02-04 18:54:35,547 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,550 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,552 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,552 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,559 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,587 INFO L477 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 12 case distinctions, treesize of input 89 treesize of output 139 [2018-02-04 18:54:35,588 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 8 xjuncts. [2018-02-04 18:54:35,733 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,733 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,734 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,734 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,735 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,735 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,736 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,736 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,743 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:35,754 INFO L477 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 141 [2018-02-04 18:54:35,754 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2018-02-04 18:54:36,034 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:36,034 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:36,035 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:36,036 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:36,036 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:36,038 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:36,045 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 116 [2018-02-04 18:54:36,046 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-02-04 18:54:36,232 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:36,233 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:36,233 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:36,234 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:36,234 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:36,235 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:36,236 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:36,239 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 47 treesize of output 115 [2018-02-04 18:54:36,240 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:36,412 INFO L267 ElimStorePlain]: Start of recursive call 11: 8 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-02-04 18:54:36,529 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:36,530 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:36,530 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:36,531 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:36,531 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:36,532 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:54:36,534 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:36,535 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 86 [2018-02-04 18:54:36,537 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:36,538 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:36,539 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:36,539 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:36,539 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:36,540 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:36,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 85 [2018-02-04 18:54:36,544 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:36,559 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:36,962 INFO L267 ElimStorePlain]: Start of recursive call 6: 8 dim-1 vars, End of recursive call: and 11 xjuncts. [2018-02-04 18:54:37,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 11 xjuncts. [2018-02-04 18:54:37,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 9 xjuncts. [2018-02-04 18:54:37,170 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 7 variables, input treesize:65, output treesize:218 [2018-02-04 18:54:37,243 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:37,243 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:37,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2018-02-04 18:54:37,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:37,244 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:54:37,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:37,254 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 41 treesize of output 32 [2018-02-04 18:54:37,255 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:37,255 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:37,256 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:37,256 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:37,256 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:37,257 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:37,257 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:37,258 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:37,258 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:37,259 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:37,260 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:37,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 11 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 147 [2018-02-04 18:54:37,260 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:37,272 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:37,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:37,284 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:90, output treesize:40 [2018-02-04 18:54:38,245 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 63 DAG size of output 51 [2018-02-04 18:54:38,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 79 [2018-02-04 18:54:38,257 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,259 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,272 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 82 [2018-02-04 18:54:38,328 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,329 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,332 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,333 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,335 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,361 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 2 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 113 [2018-02-04 18:54:38,362 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-02-04 18:54:38,423 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:54:38,448 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 61 treesize of output 47 [2018-02-04 18:54:38,463 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,463 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,464 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,464 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,464 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,465 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,465 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:54:38,466 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,466 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,466 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,475 INFO L477 Elim1Store]: Elim1 did not use 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 0 case distinctions, treesize of input 37 treesize of output 114 [2018-02-04 18:54:38,477 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,477 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,478 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,478 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,479 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,479 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,479 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,480 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,480 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,480 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,481 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,481 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:54:38,488 INFO L477 Elim1Store]: Elim1 did not use 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 0 case distinctions, treesize of input 34 treesize of output 116 [2018-02-04 18:54:38,488 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:38,499 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:38,503 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:38,505 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 65 treesize of output 49 [2018-02-04 18:54:38,521 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,522 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,523 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,527 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,527 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,528 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,528 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,531 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,532 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 48 treesize of output 129 [2018-02-04 18:54:38,569 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:54:38,569 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:38,625 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,625 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,626 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,626 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,627 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,627 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,627 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,628 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,628 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:54:38,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 119 [2018-02-04 18:54:38,638 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:38,670 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,671 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,671 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,672 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,672 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,673 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,673 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,674 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,674 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,674 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:54:38,675 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,675 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,675 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 144 [2018-02-04 18:54:38,686 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:38,717 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,719 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,719 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,720 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,724 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,724 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,725 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,725 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,726 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 44 treesize of output 145 [2018-02-04 18:54:38,766 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 8 xjuncts. [2018-02-04 18:54:38,827 INFO L267 ElimStorePlain]: Start of recursive call 9: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-02-04 18:54:38,827 WARN L288 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:54:38,827 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:38,854 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-02-04 18:54:38,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-02-04 18:54:38,889 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 59 treesize of output 56 [2018-02-04 18:54:38,891 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2018-02-04 18:54:38,893 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2018-02-04 18:54:38,896 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2018-02-04 18:54:38,901 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 36 treesize of output 41 [2018-02-04 18:54:38,902 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:38,906 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:38,919 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:38,923 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:38,931 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:38,935 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 53 treesize of output 50 [2018-02-04 18:54:38,936 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2018-02-04 18:54:38,938 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2018-02-04 18:54:38,941 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2018-02-04 18:54:38,946 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 36 treesize of output 41 [2018-02-04 18:54:38,946 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:38,950 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:38,954 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:38,958 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:38,965 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:38,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 74 [2018-02-04 18:54:38,972 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,973 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 60 [2018-02-04 18:54:38,991 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:38,993 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 54 treesize of output 63 [2018-02-04 18:54:38,993 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:38,993 WARN L288 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:54:38,993 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:39,000 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:39,009 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-04 18:54:39,021 WARN L288 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:54:39,021 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:39,023 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:39,023 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:39,024 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:39,024 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:39,025 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:54:39,029 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 63 [2018-02-04 18:54:39,031 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:39,031 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:39,032 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:39,033 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:39,033 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:39,037 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 35 treesize of output 80 [2018-02-04 18:54:39,038 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:39,051 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:39,055 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:39,063 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:39,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 6 xjuncts. [2018-02-04 18:54:39,118 INFO L202 ElimStorePlain]: Needed 32 recursive calls to eliminate 6 variables, input treesize:99, output treesize:216 [2018-02-04 18:54:40,637 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-04 18:54:40,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:40,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:40,661 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:163, output treesize:162 [2018-02-04 18:54:40,978 WARN L146 SmtUtils]: Spent 163ms on a formula simplification. DAG size of input: 97 DAG size of output 71 [2018-02-04 18:54:40,980 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:54:40,982 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:40,984 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:40,986 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:40,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 198 [2018-02-04 18:54:40,991 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:40,992 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:40,994 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:40,995 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:40,996 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:40,997 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:40,998 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:40,999 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:41,000 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:41,000 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:41,002 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:41,004 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:41,009 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:54:41,012 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:41,016 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:41,019 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:41,020 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:41,021 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:41,022 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:41,023 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:41,024 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:54:41,026 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:41,047 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 195 treesize of output 339 [2018-02-04 18:54:41,809 WARN L146 SmtUtils]: Spent 752ms on a formula simplification. DAG size of input: 645 DAG size of output 186 [2018-02-04 18:54:41,812 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:41,813 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:41,814 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:41,814 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:41,815 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:41,816 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:41,817 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:41,817 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:41,818 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:41,819 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:41,820 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:41,820 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:41,821 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:41,822 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:41,822 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:54:41,823 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:41,824 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:41,826 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:41,827 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:41,827 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:41,828 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:54:41,829 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:41,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 268 [2018-02-04 18:54:41,830 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:42,042 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,043 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,043 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,044 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,044 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,045 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,046 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,046 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,047 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,048 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,048 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,049 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,049 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,050 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:54:42,050 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,052 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,053 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,054 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,054 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,055 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:54:42,055 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 262 [2018-02-04 18:54:42,056 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:42,242 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,242 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,243 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,243 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,244 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,245 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,245 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,246 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,247 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,247 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:54:42,247 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,248 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,249 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:54:42,250 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 158 [2018-02-04 18:54:42,250 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:42,405 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,405 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,406 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,407 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,408 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,408 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,409 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,410 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,411 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,412 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,412 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,413 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:54:42,415 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,418 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,419 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,420 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,420 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:54:42,428 INFO L477 Elim1Store]: Elim1 did not use 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 4 case distinctions, treesize of input 101 treesize of output 233 [2018-02-04 18:54:42,429 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 3 xjuncts. [2018-02-04 18:54:42,657 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,658 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,658 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,659 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,660 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,660 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,661 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,661 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,662 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,662 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:54:42,663 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,665 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,666 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,666 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:54:42,667 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 165 [2018-02-04 18:54:42,667 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:42,727 INFO L267 ElimStorePlain]: Start of recursive call 3: 7 dim-0 vars, 6 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:42,740 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 60 [2018-02-04 18:54:42,754 WARN L288 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:54:42,754 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:42,756 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,757 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,758 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,758 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,759 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,759 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,760 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:54:42,760 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,761 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,761 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 106 [2018-02-04 18:54:42,765 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,765 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,766 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,766 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,767 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,767 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,768 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:42,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 116 [2018-02-04 18:54:42,768 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:42,787 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:42,797 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:42,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:42,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:42,823 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:199, output treesize:88 [2018-02-04 18:54:42,907 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:54:42,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:42,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:42,908 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:105, output treesize:1 [2018-02-04 18:54:43,302 INFO L134 CoverageAnalysis]: Checked inductivity of 5710 backedges. 3059 proven. 415 refuted. 73 times theorem prover too weak. 2163 trivial. 0 not checked. [2018-02-04 18:54:43,302 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:54:43,302 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-02-04 18:54:43,303 INFO L409 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-02-04 18:54:43,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-02-04 18:54:43,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=4135, Unknown=243, NotChecked=0, Total=4556 [2018-02-04 18:54:43,303 INFO L87 Difference]: Start difference. First operand 356 states and 380 transitions. Second operand 68 states. [2018-02-04 18:54:51,616 WARN L143 SmtUtils]: Spent 143ms on a formula simplification that was a NOOP. DAG size: 69 [2018-02-04 18:54:53,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:54:53,149 INFO L93 Difference]: Finished difference Result 338 states and 357 transitions. [2018-02-04 18:54:53,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-02-04 18:54:53,149 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 514 [2018-02-04 18:54:53,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:54:53,150 INFO L225 Difference]: With dead ends: 338 [2018-02-04 18:54:53,150 INFO L226 Difference]: Without dead ends: 328 [2018-02-04 18:54:53,150 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 446 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2335 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=403, Invalid=10527, Unknown=412, NotChecked=0, Total=11342 [2018-02-04 18:54:53,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-02-04 18:54:53,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2018-02-04 18:54:53,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-02-04 18:54:53,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 347 transitions. [2018-02-04 18:54:53,153 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 347 transitions. Word has length 514 [2018-02-04 18:54:53,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:54:53,153 INFO L432 AbstractCegarLoop]: Abstraction has 328 states and 347 transitions. [2018-02-04 18:54:53,153 INFO L433 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-02-04 18:54:53,153 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 347 transitions. [2018-02-04 18:54:53,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2018-02-04 18:54:53,154 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:54:53,155 INFO L351 BasicCegarLoop]: trace histogram [36, 36, 28, 28, 28, 28, 28, 28, 28, 28, 28, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:54:53,155 INFO L371 AbstractCegarLoop]: === Iteration 67 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 18:54:53,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1024372099, now seen corresponding path program 4 times [2018-02-04 18:54:53,155 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:54:53,155 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:54:53,155 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:54:53,155 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:54:53,155 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:54:53,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:54:53,178 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:54:53,471 INFO L134 CoverageAnalysis]: Checked inductivity of 5746 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 5534 trivial. 0 not checked. [2018-02-04 18:54:53,472 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:54:53,472 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:54:53,472 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 18:54:53,727 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 18:54:53,727 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:54:53,742 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:54:53,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 18:54:53,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:53,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 18:54:53,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 18:54:53,769 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:53,770 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:53,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:53,772 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:24, output treesize:15 [2018-02-04 18:54:53,788 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~0.offset| Int) (foo_~i~1 Int) (|foo_#t~mem4| Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_foo_~#a~0.base| (store (select |c_old(#memory_int)| |c_foo_~#a~0.base|) (+ |foo_~#a~0.offset| (* 4 foo_~i~1)) |foo_#t~mem4|)))) is different from true [2018-02-04 18:54:53,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 18:54:53,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 18:54:53,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:53,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:53,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:53,793 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:15, output treesize:1 [2018-02-04 18:54:53,795 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-04 18:54:53,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:53,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:53,798 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-02-04 18:54:53,799 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~0.base| Int) (|foo_~#a~0.offset| Int) (foo_~i~1 Int) (|foo_#t~mem4| Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |foo_~#a~0.base| (store (select |c_old(#memory_int)| |foo_~#a~0.base|) (+ |foo_~#a~0.offset| (* 4 foo_~i~1)) |foo_#t~mem4|))) (= 0 (select |c_#valid| |foo_~#a~0.base|)))) is different from true [2018-02-04 18:54:53,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-02-04 18:54:53,810 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 24 treesize of output 23 [2018-02-04 18:54:53,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:53,825 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 2 case distinctions, treesize of input 21 treesize of output 30 [2018-02-04 18:54:53,826 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 18:54:53,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:54:53,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 18:54:53,843 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:31, output treesize:26 [2018-02-04 18:54:53,856 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:54:53,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:53,857 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:53,858 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:53,858 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 30 [2018-02-04 18:54:53,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:53,863 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 23 treesize of output 18 [2018-02-04 18:54:53,865 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:53,865 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-04 18:54:53,866 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:53,868 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:53,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:53,874 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:66, output treesize:11 [2018-02-04 18:54:53,892 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_#t~mem4| Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_foo_~#a~0.base| (store (select |c_old(#memory_int)| |c_foo_~#a~0.base|) |c_foo_~#a~0.offset| |foo_#t~mem4|)))) is different from true [2018-02-04 18:54:53,923 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~0.offset| Int) (foo_~i~1 Int) (v_prenex_1176 Int) (|foo_#t~mem4| Int)) (= (store |c_old(#memory_int)| |c_foo_~#a~0.base| (store (store (select |c_old(#memory_int)| |c_foo_~#a~0.base|) |foo_~#a~0.offset| v_prenex_1176) (+ |foo_~#a~0.offset| (* 4 foo_~i~1)) |foo_#t~mem4|)) |c_#memory_int|)) is different from true [2018-02-04 18:54:53,928 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 18 treesize of output 15 [2018-02-04 18:54:53,929 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-02-04 18:54:53,933 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 2 case distinctions, treesize of input 18 treesize of output 27 [2018-02-04 18:54:53,934 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 18:54:53,938 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:54:53,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:54:53,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:53,948 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:18, output treesize:1 [2018-02-04 18:54:53,951 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-04 18:54:53,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:53,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:53,954 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:25, output treesize:24 [2018-02-04 18:54:53,955 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~0.base| Int) (|foo_~#a~0.offset| Int) (foo_~i~1 Int) (v_prenex_1176 Int) (|foo_#t~mem4| Int)) (and (= (store |c_old(#memory_int)| |foo_~#a~0.base| (store (store (select |c_old(#memory_int)| |foo_~#a~0.base|) |foo_~#a~0.offset| v_prenex_1176) (+ |foo_~#a~0.offset| (* 4 foo_~i~1)) |foo_#t~mem4|)) |c_#memory_int|) (= 0 (select |c_#valid| |foo_~#a~0.base|)))) is different from true [2018-02-04 18:54:53,966 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 26 treesize of output 38 [2018-02-04 18:54:53,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2018-02-04 18:54:53,973 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 2 case distinctions, treesize of input 18 treesize of output 27 [2018-02-04 18:54:53,974 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 18:54:53,981 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:54:54,001 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 30 [2018-02-04 18:54:54,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 53 [2018-02-04 18:54:54,014 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 8 xjuncts. [2018-02-04 18:54:54,050 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 2 case distinctions, treesize of input 24 treesize of output 33 [2018-02-04 18:54:54,050 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-04 18:54:54,075 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-02-04 18:54:54,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-02-04 18:54:54,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 18:54:54,124 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:34, output treesize:26 [2018-02-04 18:54:54,140 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:54:54,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:54,141 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:54,141 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:54,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, 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 30 [2018-02-04 18:54:54,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:54,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, 1 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-04 18:54:54,152 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:54,153 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-04 18:54:54,153 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:54,156 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:54,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:54,159 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:66, output treesize:11 [2018-02-04 18:54:54,170 WARN L1033 $PredicateComparison]: unable to prove that (exists ((foo_~i~1 Int) (|foo_#t~mem4| Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_foo_~#a~0.base| (store (select |c_old(#memory_int)| |c_foo_~#a~0.base|) (+ |c_foo_~#a~0.offset| (* 4 foo_~i~1)) |foo_#t~mem4|)))) is different from true [2018-02-04 18:54:54,173 WARN L1033 $PredicateComparison]: unable to prove that (exists ((foo_~i~1 Int) (v_prenex_1179 Int) (|foo_#t~mem4| Int) (v_prenex_1180 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_foo_~#a~0.base| (store (store (select |c_old(#memory_int)| |c_foo_~#a~0.base|) (+ |c_foo_~#a~0.offset| (* 4 v_prenex_1179)) v_prenex_1180) (+ |c_foo_~#a~0.offset| (* 4 foo_~i~1)) |foo_#t~mem4|)))) is different from true [2018-02-04 18:54:54,177 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~0.offset| Int) (foo_~i~1 Int) (v_prenex_1179 Int) (|foo_#t~mem4| Int) (v_prenex_1182 Int) (v_prenex_1181 Int) (v_prenex_1180 Int)) (= (store |c_old(#memory_int)| |c_foo_~#a~0.base| (store (store (store (select |c_old(#memory_int)| |c_foo_~#a~0.base|) (+ |foo_~#a~0.offset| (* 4 v_prenex_1179)) v_prenex_1180) (+ |foo_~#a~0.offset| (* 4 v_prenex_1181)) v_prenex_1182) (+ |foo_~#a~0.offset| (* 4 foo_~i~1)) |foo_#t~mem4|)) |c_#memory_int|)) is different from true [2018-02-04 18:54:54,182 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 29 treesize of output 26 [2018-02-04 18:54:54,183 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2018-02-04 18:54:54,189 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 43 [2018-02-04 18:54:54,195 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 2 case distinctions, treesize of input 33 treesize of output 46 [2018-02-04 18:54:54,195 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-04 18:54:54,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 74 [2018-02-04 18:54:54,221 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 8 xjuncts. [2018-02-04 18:54:54,247 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-02-04 18:54:54,266 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-02-04 18:54:54,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-02-04 18:54:54,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:54,305 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 9 variables, input treesize:29, output treesize:1 [2018-02-04 18:54:54,309 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-04 18:54:54,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:54,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:54,312 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:36, output treesize:35 [2018-02-04 18:54:54,314 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~0.base| Int) (|foo_~#a~0.offset| Int) (foo_~i~1 Int) (v_prenex_1179 Int) (|foo_#t~mem4| Int) (v_prenex_1182 Int) (v_prenex_1181 Int) (v_prenex_1180 Int)) (and (= 0 (select |c_#valid| |foo_~#a~0.base|)) (= (store |c_old(#memory_int)| |foo_~#a~0.base| (store (store (store (select |c_old(#memory_int)| |foo_~#a~0.base|) (+ |foo_~#a~0.offset| (* 4 v_prenex_1179)) v_prenex_1180) (+ |foo_~#a~0.offset| (* 4 v_prenex_1181)) v_prenex_1182) (+ |foo_~#a~0.offset| (* 4 foo_~i~1)) |foo_#t~mem4|)) |c_#memory_int|))) is different from true [2018-02-04 18:54:54,346 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 37 treesize of output 49 [2018-02-04 18:54:54,357 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 45 [2018-02-04 18:54:54,369 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 53 [2018-02-04 18:54:54,378 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 2 case distinctions, treesize of input 43 treesize of output 56 [2018-02-04 18:54:54,379 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-04 18:54:54,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 84 [2018-02-04 18:54:54,424 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 8 xjuncts. [2018-02-04 18:54:54,478 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-02-04 18:54:54,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 37 treesize of output 71 [2018-02-04 18:54:54,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 44 treesize of output 87 [2018-02-04 18:54:54,577 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 8 xjuncts. [2018-02-04 18:54:54,694 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:54:54,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 42 treesize of output 107 [2018-02-04 18:54:54,716 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 16 xjuncts. [2018-02-04 18:54:55,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 9 case distinctions, treesize of input 39 treesize of output 116 [2018-02-04 18:54:55,050 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-02-04 18:54:55,055 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 64 xjuncts. [2018-02-04 18:54:55,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 44 treesize of output 79 [2018-02-04 18:54:55,389 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 8 xjuncts. [2018-02-04 18:54:55,569 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 2 case distinctions, treesize of input 46 treesize of output 59 [2018-02-04 18:54:55,569 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-02-04 18:54:55,727 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:55,738 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 49 treesize of output 88 [2018-02-04 18:54:55,738 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2018-02-04 18:54:55,865 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:55,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 80 [2018-02-04 18:54:55,876 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 4 xjuncts. [2018-02-04 18:54:55,986 INFO L267 ElimStorePlain]: Start of recursive call 7: 8 dim-1 vars, End of recursive call: and 13 xjuncts. [2018-02-04 18:54:56,148 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 15 xjuncts. [2018-02-04 18:54:56,244 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2018-02-04 18:54:56,250 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 43 [2018-02-04 18:54:56,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 74 [2018-02-04 18:54:56,265 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 8 xjuncts. [2018-02-04 18:54:56,305 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 2 case distinctions, treesize of input 33 treesize of output 46 [2018-02-04 18:54:56,305 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-02-04 18:54:56,330 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-02-04 18:54:56,354 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-02-04 18:54:56,458 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 15 xjuncts. [2018-02-04 18:54:56,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 18:54:56,573 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 9 variables, input treesize:45, output treesize:26 [2018-02-04 18:54:56,592 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:54:56,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:56,593 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:56,594 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:56,594 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 30 [2018-02-04 18:54:56,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:56,604 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 23 treesize of output 18 [2018-02-04 18:54:56,605 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:56,606 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-04 18:54:56,606 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:56,609 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:56,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:56,613 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:66, output treesize:11 [2018-02-04 18:54:56,627 WARN L1033 $PredicateComparison]: unable to prove that (exists ((foo_~i~1 Int) (v_prenex_1197 Int) (v_prenex_1196 Int) (|foo_#t~mem4| Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_foo_~#a~0.base| (store (store (select |c_old(#memory_int)| |c_foo_~#a~0.base|) (+ |c_foo_~#a~0.offset| (* 4 v_prenex_1196)) v_prenex_1197) (+ |c_foo_~#a~0.offset| (* 4 foo_~i~1)) |foo_#t~mem4|)))) is different from true [2018-02-04 18:54:56,631 WARN L1033 $PredicateComparison]: unable to prove that (exists ((foo_~i~1 Int) (v_prenex_1199 Int) (v_prenex_1198 Int) (v_prenex_1197 Int) (v_prenex_1196 Int) (|foo_#t~mem4| Int)) (= (store |c_old(#memory_int)| |c_foo_~#a~0.base| (store (store (store (select |c_old(#memory_int)| |c_foo_~#a~0.base|) (+ |c_foo_~#a~0.offset| (* 4 v_prenex_1196)) v_prenex_1197) (+ |c_foo_~#a~0.offset| (* 4 v_prenex_1198)) v_prenex_1199) (+ |c_foo_~#a~0.offset| (* 4 foo_~i~1)) |foo_#t~mem4|)) |c_#memory_int|)) is different from true [2018-02-04 18:54:56,636 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~0.offset| Int) (foo_~i~1 Int) (v_prenex_1201 Int) (v_prenex_1200 Int) (v_prenex_1199 Int) (v_prenex_1198 Int) (v_prenex_1197 Int) (v_prenex_1196 Int) (|foo_#t~mem4| Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_foo_~#a~0.base| (store (store (store (store (select |c_old(#memory_int)| |c_foo_~#a~0.base|) (+ |foo_~#a~0.offset| (* 4 v_prenex_1196)) v_prenex_1197) (+ |foo_~#a~0.offset| (* 4 v_prenex_1198)) v_prenex_1199) (+ |foo_~#a~0.offset| (* 4 v_prenex_1200)) v_prenex_1201) (+ |foo_~#a~0.offset| (* 4 foo_~i~1)) |foo_#t~mem4|)))) is different from true [2018-02-04 18:54:56,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 33 [2018-02-04 18:54:56,643 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 36 [2018-02-04 18:54:56,652 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 50 [2018-02-04 18:54:56,660 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 54 [2018-02-04 18:54:56,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 42 treesize of output 85 [2018-02-04 18:54:56,679 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 8 xjuncts. [2018-02-04 18:54:56,724 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 2 case distinctions, treesize of input 44 treesize of output 57 [2018-02-04 18:54:56,724 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-04 18:54:56,754 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-02-04 18:54:56,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 80 [2018-02-04 18:54:56,819 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:56,844 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 8 case distinctions, treesize of input 52 treesize of output 125 [2018-02-04 18:54:56,846 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 32 xjuncts. [2018-02-04 18:54:57,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 88 [2018-02-04 18:54:57,051 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 8 xjuncts. [2018-02-04 18:54:57,346 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:57,359 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 54 treesize of output 93 [2018-02-04 18:54:57,359 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-02-04 18:54:57,505 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:57,517 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 54 treesize of output 93 [2018-02-04 18:54:57,518 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 4 xjuncts. [2018-02-04 18:54:57,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 9 case distinctions, treesize of input 40 treesize of output 129 [2018-02-04 18:54:57,676 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-02-04 18:54:57,680 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 64 xjuncts. [2018-02-04 18:54:57,949 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 2 case distinctions, treesize of input 47 treesize of output 60 [2018-02-04 18:54:57,949 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-02-04 18:54:58,129 INFO L267 ElimStorePlain]: Start of recursive call 8: 8 dim-1 vars, End of recursive call: and 13 xjuncts. [2018-02-04 18:54:58,228 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 15 xjuncts. [2018-02-04 18:54:58,314 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 15 xjuncts. [2018-02-04 18:54:58,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 15 xjuncts. [2018-02-04 18:54:58,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:54:58,495 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 11 variables, input treesize:36, output treesize:1 [2018-02-04 18:54:58,499 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-04 18:54:58,500 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:54:58,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-1 vars, End of recursive call: 10 dim-0 vars, and 1 xjuncts. [2018-02-04 18:54:58,504 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 11 variables, input treesize:43, output treesize:42 [2018-02-04 18:54:58,506 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~0.base| Int) (|foo_~#a~0.offset| Int) (foo_~i~1 Int) (v_prenex_1201 Int) (v_prenex_1200 Int) (v_prenex_1199 Int) (v_prenex_1198 Int) (v_prenex_1197 Int) (v_prenex_1196 Int) (|foo_#t~mem4| Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |foo_~#a~0.base| (store (store (store (store (select |c_old(#memory_int)| |foo_~#a~0.base|) (+ |foo_~#a~0.offset| (* 4 v_prenex_1196)) v_prenex_1197) (+ |foo_~#a~0.offset| (* 4 v_prenex_1198)) v_prenex_1199) (+ |foo_~#a~0.offset| (* 4 v_prenex_1200)) v_prenex_1201) (+ |foo_~#a~0.offset| (* 4 foo_~i~1)) |foo_#t~mem4|))) (= 0 (select |c_#valid| |foo_~#a~0.base|)))) is different from true [2018-02-04 18:54:58,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 44 treesize of output 56 [2018-02-04 18:54:58,525 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2018-02-04 18:54:58,534 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 50 [2018-02-04 18:54:58,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 80 [2018-02-04 18:54:58,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 88 [2018-02-04 18:54:58,571 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 8 xjuncts. [2018-02-04 18:54:58,816 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:58,842 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 8 case distinctions, treesize of input 52 treesize of output 125 [2018-02-04 18:54:58,844 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 32 xjuncts. [2018-02-04 18:54:59,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 9 case distinctions, treesize of input 40 treesize of output 129 [2018-02-04 18:54:59,091 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-02-04 18:54:59,094 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 64 xjuncts. [2018-02-04 18:54:59,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 88 [2018-02-04 18:54:59,426 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 8 xjuncts. [2018-02-04 18:54:59,585 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:59,596 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 54 treesize of output 93 [2018-02-04 18:54:59,597 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-02-04 18:54:59,733 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:54:59,744 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 54 treesize of output 93 [2018-02-04 18:54:59,745 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-02-04 18:54:59,869 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 2 case distinctions, treesize of input 47 treesize of output 60 [2018-02-04 18:54:59,869 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-02-04 18:54:59,958 INFO L267 ElimStorePlain]: Start of recursive call 5: 8 dim-1 vars, End of recursive call: and 13 xjuncts. [2018-02-04 18:55:00,060 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 54 [2018-02-04 18:55:00,067 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 2 case distinctions, treesize of input 44 treesize of output 57 [2018-02-04 18:55:00,067 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-02-04 18:55:00,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 42 treesize of output 85 [2018-02-04 18:55:00,098 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 8 xjuncts. [2018-02-04 18:55:00,134 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-02-04 18:55:00,227 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 15 xjuncts. [2018-02-04 18:55:00,312 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 15 xjuncts. [2018-02-04 18:55:00,487 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 52 [2018-02-04 18:55:00,497 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 60 [2018-02-04 18:55:00,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 48 treesize of output 90 [2018-02-04 18:55:00,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 55 treesize of output 98 [2018-02-04 18:55:00,533 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 8 xjuncts. [2018-02-04 18:55:00,667 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:55:00,678 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 64 treesize of output 103 [2018-02-04 18:55:00,679 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 4 xjuncts. [2018-02-04 18:55:00,911 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:55:00,936 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 8 case distinctions, treesize of input 62 treesize of output 135 [2018-02-04 18:55:00,938 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 32 xjuncts. [2018-02-04 18:55:01,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 55 treesize of output 98 [2018-02-04 18:55:01,261 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 8 xjuncts. [2018-02-04 18:55:01,464 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 2 case distinctions, treesize of input 57 treesize of output 70 [2018-02-04 18:55:01,464 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. Received shutdown request... [2018-02-04 18:55:01,554 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-02-04 18:55:01,554 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 18:55:01,557 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 18:55:01,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 06:55:01 BoogieIcfgContainer [2018-02-04 18:55:01,558 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 18:55:01,558 INFO L168 Benchmark]: Toolchain (without parser) took 169256.70 ms. Allocated memory was 395.3 MB in the beginning and 1.9 GB in the end (delta: 1.5 GB). Free memory was 353.4 MB in the beginning and 873.7 MB in the end (delta: -520.2 MB). Peak memory consumption was 1.6 GB. Max. memory is 5.3 GB. [2018-02-04 18:55:01,559 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 395.3 MB. Free memory is still 358.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 18:55:01,559 INFO L168 Benchmark]: CACSL2BoogieTranslator took 144.38 ms. Allocated memory is still 395.3 MB. Free memory was 353.4 MB in the beginning and 345.5 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. [2018-02-04 18:55:01,560 INFO L168 Benchmark]: Boogie Preprocessor took 21.48 ms. Allocated memory is still 395.3 MB. Free memory was 345.5 MB in the beginning and 342.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 18:55:01,560 INFO L168 Benchmark]: RCFGBuilder took 203.52 ms. Allocated memory is still 395.3 MB. Free memory was 342.9 MB in the beginning and 321.9 MB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 5.3 GB. [2018-02-04 18:55:01,560 INFO L168 Benchmark]: TraceAbstraction took 168884.39 ms. Allocated memory was 395.3 MB in the beginning and 1.9 GB in the end (delta: 1.5 GB). Free memory was 321.9 MB in the beginning and 873.7 MB in the end (delta: -551.7 MB). Peak memory consumption was 1.5 GB. Max. memory is 5.3 GB. [2018-02-04 18:55:01,561 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.19 ms. Allocated memory is still 395.3 MB. Free memory is still 358.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 144.38 ms. Allocated memory is still 395.3 MB. Free memory was 353.4 MB in the beginning and 345.5 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 21.48 ms. Allocated memory is still 395.3 MB. Free memory was 345.5 MB in the beginning and 342.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 203.52 ms. Allocated memory is still 395.3 MB. Free memory was 342.9 MB in the beginning and 321.9 MB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 168884.39 ms. Allocated memory was 395.3 MB in the beginning and 1.9 GB in the end (delta: 1.5 GB). Free memory was 321.9 MB in the beginning and 873.7 MB in the end (delta: -551.7 MB). Peak memory consumption was 1.5 GB. 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 14). Cancelled while BasicCegarLoop was analyzing trace of length 528 with TraceHistMax 36, 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 77. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 14). Cancelled while BasicCegarLoop was analyzing trace of length 528 with TraceHistMax 36, 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 77. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 23). Cancelled while BasicCegarLoop was analyzing trace of length 528 with TraceHistMax 36, 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 77. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 23). Cancelled while BasicCegarLoop was analyzing trace of length 528 with TraceHistMax 36, 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 77. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 23). Cancelled while BasicCegarLoop was analyzing trace of length 528 with TraceHistMax 36, 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 77. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 23). Cancelled while BasicCegarLoop was analyzing trace of length 528 with TraceHistMax 36, 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 77. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 37). Cancelled while BasicCegarLoop was analyzing trace of length 528 with TraceHistMax 36, 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 77. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 34). Cancelled while BasicCegarLoop was analyzing trace of length 528 with TraceHistMax 36, 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 77. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 37). Cancelled while BasicCegarLoop was analyzing trace of length 528 with TraceHistMax 36, 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 77. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 34). Cancelled while BasicCegarLoop was analyzing trace of length 528 with TraceHistMax 36, 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 77. - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 31). Cancelled while BasicCegarLoop was analyzing trace of length 528 with TraceHistMax 36, 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 77. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 68 locations, 11 error locations. TIMEOUT Result, 168.8s OverallTime, 67 OverallIterations, 36 TraceHistogramMax, 81.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3941 SDtfs, 9987 SDslu, 28816 SDs, 0 SdLazy, 43484 SolverSat, 2663 SolverUnsat, 1741 SolverUnknown, 0 SolverNotchecked, 35.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14985 GetRequests, 12393 SyntacticMatches, 265 SemanticMatches, 2327 ConstructedPredicates, 297 IntricatePredicates, 0 DeprecatedPredicates, 33388 ImplicationChecksByTransitivity, 71.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=360occurred in iteration=64, 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.2s AutomataMinimizationTime, 66 MinimizatonAttempts, 977 StatesRemovedByMinimization, 59 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 5.7s SatisfiabilityAnalysisTime, 71.2s InterpolantComputationTime, 27334 NumberOfCodeBlocks, 26560 NumberOfCodeBlocksAsserted, 224 NumberOfCheckSat, 19887 ConstructedInterpolants, 5593 QuantifiedInterpolants, 49617300 SizeOfPredicates, 621 NumberOfNonLiveVariables, 37697 ConjunctsInSsa, 2148 ConjunctsInUnsatCore, 94 InterpolantComputations, 12 PerfectInterpolantSequences, 101335/122894 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/ArraysOfVariableLength2_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_18-55-01-567.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength2_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_18-55-01-567.csv Completed graceful shutdown