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 --cacsl2boogietranslator.bitprecise.bitfields false -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-408c70d-m [2018-04-13 08:35:14,452 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-13 08:35:14,454 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-13 08:35:14,467 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-13 08:35:14,468 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-13 08:35:14,468 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-13 08:35:14,469 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-13 08:35:14,471 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-13 08:35:14,472 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-13 08:35:14,473 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-13 08:35:14,474 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-13 08:35:14,474 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-13 08:35:14,475 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-13 08:35:14,476 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-13 08:35:14,476 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-13 08:35:14,478 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-13 08:35:14,480 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-13 08:35:14,481 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-13 08:35:14,482 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-13 08:35:14,483 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-13 08:35:14,484 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-13 08:35:14,485 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-13 08:35:14,485 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-13 08:35:14,486 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-13 08:35:14,486 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-13 08:35:14,487 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-13 08:35:14,487 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-13 08:35:14,488 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-13 08:35:14,489 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-13 08:35:14,489 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-13 08:35:14,489 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-13 08:35:14,489 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-04-13 08:35:14,499 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-13 08:35:14,499 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-13 08:35:14,500 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-13 08:35:14,501 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-13 08:35:14,501 INFO L133 SettingsManager]: * Use SBE=true [2018-04-13 08:35:14,501 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-13 08:35:14,501 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-13 08:35:14,501 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-13 08:35:14,501 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-13 08:35:14,502 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-13 08:35:14,502 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-13 08:35:14,502 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-13 08:35:14,502 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-13 08:35:14,502 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-13 08:35:14,502 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-13 08:35:14,502 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-13 08:35:14,503 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-13 08:35:14,503 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-13 08:35:14,503 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-13 08:35:14,503 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-13 08:35:14,503 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-13 08:35:14,503 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-13 08:35:14,503 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-13 08:35:14,504 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-13 08:35:14,532 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-13 08:35:14,542 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-13 08:35:14,545 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-13 08:35:14,546 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-13 08:35:14,547 INFO L276 PluginConnector]: CDTParser initialized [2018-04-13 08:35:14,547 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-04-13 08:35:14,923 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGd62d304cd [2018-04-13 08:35:15,024 INFO L287 CDTParser]: IsIndexed: true [2018-04-13 08:35:15,024 INFO L288 CDTParser]: Found 1 translation units. [2018-04-13 08:35:15,024 INFO L168 CDTParser]: Scanning ArraysOfVariableLength2_true-valid-memsafety.c [2018-04-13 08:35:15,025 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-13 08:35:15,025 INFO L215 ultiparseSymbolTable]: [2018-04-13 08:35:15,025 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-13 08:35:15,025 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo ('foo') in ArraysOfVariableLength2_true-valid-memsafety.c [2018-04-13 08:35:15,025 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in ArraysOfVariableLength2_true-valid-memsafety.c [2018-04-13 08:35:15,025 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar ('bar') in ArraysOfVariableLength2_true-valid-memsafety.c [2018-04-13 08:35:15,026 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-13 08:35:15,026 INFO L233 ultiparseSymbolTable]: [2018-04-13 08:35:15,037 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGd62d304cd [2018-04-13 08:35:15,040 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-13 08:35:15,041 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-13 08:35:15,042 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-13 08:35:15,042 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-13 08:35:15,047 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-13 08:35:15,048 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:35:15" (1/1) ... [2018-04-13 08:35:15,051 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f89cc66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:35:15, skipping insertion in model container [2018-04-13 08:35:15,051 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:35:15" (1/1) ... [2018-04-13 08:35:15,063 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 08:35:15,072 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 08:35:15,177 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 08:35:15,199 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 08:35:15,204 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 10 non ball SCCs. Number of states in SCCs 10. [2018-04-13 08:35:15,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:35:15 WrapperNode [2018-04-13 08:35:15,213 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-13 08:35:15,213 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-13 08:35:15,213 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-13 08:35:15,213 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-13 08:35:15,220 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:35:15" (1/1) ... [2018-04-13 08:35:15,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:35:15" (1/1) ... [2018-04-13 08:35:15,227 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:35:15" (1/1) ... [2018-04-13 08:35:15,228 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:35:15" (1/1) ... [2018-04-13 08:35:15,232 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:35:15" (1/1) ... [2018-04-13 08:35:15,237 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:35:15" (1/1) ... [2018-04-13 08:35:15,238 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:35:15" (1/1) ... [2018-04-13 08:35:15,239 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-13 08:35:15,240 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-13 08:35:15,240 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-13 08:35:15,240 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-13 08:35:15,241 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:35:15" (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-04-13 08:35:15,284 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-13 08:35:15,284 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-13 08:35:15,284 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar [2018-04-13 08:35:15,284 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo [2018-04-13 08:35:15,284 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-13 08:35:15,284 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar [2018-04-13 08:35:15,285 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-13 08:35:15,285 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo [2018-04-13 08:35:15,285 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-13 08:35:15,285 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-13 08:35:15,285 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-13 08:35:15,285 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-13 08:35:15,285 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-13 08:35:15,285 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-13 08:35:15,285 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-13 08:35:15,498 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-13 08:35:15,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:35:15 BoogieIcfgContainer [2018-04-13 08:35:15,499 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-13 08:35:15,499 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-13 08:35:15,499 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-13 08:35:15,501 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-13 08:35:15,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:35:15" (1/3) ... [2018-04-13 08:35:15,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59db2729 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:35:15, skipping insertion in model container [2018-04-13 08:35:15,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:35:15" (2/3) ... [2018-04-13 08:35:15,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59db2729 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:35:15, skipping insertion in model container [2018-04-13 08:35:15,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:35:15" (3/3) ... [2018-04-13 08:35:15,504 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength2_true-valid-memsafety.c [2018-04-13 08:35:15,512 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-13 08:35:15,516 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-04-13 08:35:15,544 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-13 08:35:15,545 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-13 08:35:15,545 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-13 08:35:15,545 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-13 08:35:15,545 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-13 08:35:15,545 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-13 08:35:15,545 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-13 08:35:15,545 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-13 08:35:15,546 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-13 08:35:15,546 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-13 08:35:15,556 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2018-04-13 08:35:15,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-13 08:35:15,562 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:35:15,562 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 08:35:15,563 INFO L408 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:35:15,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1613294992, now seen corresponding path program 1 times [2018-04-13 08:35:15,566 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:35:15,567 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:35:15,598 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:15,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:35:15,598 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:15,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:15,627 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:35:15,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 08:35:15,649 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 08:35:15,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-13 08:35:15,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-04-13 08:35:15,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-04-13 08:35:15,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-13 08:35:15,665 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 2 states. [2018-04-13 08:35:15,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:35:15,681 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-04-13 08:35:15,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-13 08:35:15,683 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-04-13 08:35:15,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:35:15,693 INFO L225 Difference]: With dead ends: 68 [2018-04-13 08:35:15,693 INFO L226 Difference]: Without dead ends: 65 [2018-04-13 08:35:15,695 INFO L567 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-04-13 08:35:15,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-04-13 08:35:15,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-04-13 08:35:15,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-04-13 08:35:15,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-04-13 08:35:15,723 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 13 [2018-04-13 08:35:15,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:35:15,724 INFO L459 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-04-13 08:35:15,724 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-04-13 08:35:15,724 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-04-13 08:35:15,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-13 08:35:15,724 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:35:15,724 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 08:35:15,725 INFO L408 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:35:15,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1969953325, now seen corresponding path program 1 times [2018-04-13 08:35:15,725 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:35:15,725 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:35:15,726 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:15,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:35:15,726 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:15,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:15,739 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:35:15,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 08:35:15,764 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 08:35:15,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 08:35:15,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-13 08:35:15,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-13 08:35:15,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 08:35:15,766 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 3 states. [2018-04-13 08:35:15,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:35:15,806 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2018-04-13 08:35:15,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-13 08:35:15,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-04-13 08:35:15,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:35:15,809 INFO L225 Difference]: With dead ends: 71 [2018-04-13 08:35:15,809 INFO L226 Difference]: Without dead ends: 71 [2018-04-13 08:35:15,810 INFO L567 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-04-13 08:35:15,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-04-13 08:35:15,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2018-04-13 08:35:15,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-04-13 08:35:15,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-04-13 08:35:15,817 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 14 [2018-04-13 08:35:15,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:35:15,817 INFO L459 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-04-13 08:35:15,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-13 08:35:15,817 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-04-13 08:35:15,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-13 08:35:15,818 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:35:15,818 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 08:35:15,818 INFO L408 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:35:15,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1297061679, now seen corresponding path program 1 times [2018-04-13 08:35:15,818 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:35:15,818 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:35:15,819 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:15,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:35:15,819 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:15,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:15,837 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:35:15,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 08:35:15,892 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 08:35:15,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-13 08:35:15,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 08:35:15,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 08:35:15,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-13 08:35:15,893 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 6 states. [2018-04-13 08:35:15,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:35:15,991 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2018-04-13 08:35:15,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 08:35:15,991 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-04-13 08:35:15,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:35:15,992 INFO L225 Difference]: With dead ends: 85 [2018-04-13 08:35:15,992 INFO L226 Difference]: Without dead ends: 85 [2018-04-13 08:35:15,993 INFO L567 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-04-13 08:35:15,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-04-13 08:35:15,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2018-04-13 08:35:15,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-04-13 08:35:15,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-04-13 08:35:15,999 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 17 [2018-04-13 08:35:15,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:35:15,999 INFO L459 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-04-13 08:35:15,999 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 08:35:15,999 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-04-13 08:35:16,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-13 08:35:16,000 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:35:16,000 INFO L355 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-04-13 08:35:16,000 INFO L408 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:35:16,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1600184185, now seen corresponding path program 1 times [2018-04-13 08:35:16,001 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:35:16,001 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:35:16,002 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:16,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:35:16,002 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:16,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:16,012 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:35:16,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 08:35:16,042 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 08:35:16,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 08:35:16,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 08:35:16,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 08:35:16,043 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 08:35:16,044 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 5 states. [2018-04-13 08:35:16,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:35:16,099 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2018-04-13 08:35:16,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 08:35:16,100 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-04-13 08:35:16,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:35:16,102 INFO L225 Difference]: With dead ends: 77 [2018-04-13 08:35:16,102 INFO L226 Difference]: Without dead ends: 77 [2018-04-13 08:35:16,102 INFO L567 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-04-13 08:35:16,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-04-13 08:35:16,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-04-13 08:35:16,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-04-13 08:35:16,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-04-13 08:35:16,107 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 21 [2018-04-13 08:35:16,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:35:16,108 INFO L459 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-04-13 08:35:16,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 08:35:16,108 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-04-13 08:35:16,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-13 08:35:16,108 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:35:16,108 INFO L355 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-04-13 08:35:16,108 INFO L408 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:35:16,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1600184184, now seen corresponding path program 1 times [2018-04-13 08:35:16,109 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:35:16,109 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:35:16,109 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:16,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:35:16,109 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:16,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:16,121 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:35:16,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 08:35:16,174 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 08:35:16,174 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-13 08:35:16,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-13 08:35:16,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-13 08:35:16,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-13 08:35:16,175 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 7 states. [2018-04-13 08:35:16,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:35:16,267 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-04-13 08:35:16,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-13 08:35:16,268 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-04-13 08:35:16,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:35:16,269 INFO L225 Difference]: With dead ends: 89 [2018-04-13 08:35:16,269 INFO L226 Difference]: Without dead ends: 89 [2018-04-13 08:35:16,270 INFO L567 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-04-13 08:35:16,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-04-13 08:35:16,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2018-04-13 08:35:16,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-04-13 08:35:16,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-04-13 08:35:16,275 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 21 [2018-04-13 08:35:16,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:35:16,275 INFO L459 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-04-13 08:35:16,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-13 08:35:16,275 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-04-13 08:35:16,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-13 08:35:16,276 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:35:16,276 INFO L355 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-04-13 08:35:16,276 INFO L408 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:35:16,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1759981910, now seen corresponding path program 1 times [2018-04-13 08:35:16,277 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:35:16,277 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:35:16,277 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:16,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:35:16,278 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:16,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:16,288 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:35:16,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 08:35:16,312 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 08:35:16,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 08:35:16,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 08:35:16,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 08:35:16,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 08:35:16,313 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 5 states. [2018-04-13 08:35:16,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:35:16,341 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2018-04-13 08:35:16,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 08:35:16,341 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-04-13 08:35:16,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:35:16,343 INFO L225 Difference]: With dead ends: 91 [2018-04-13 08:35:16,343 INFO L226 Difference]: Without dead ends: 91 [2018-04-13 08:35:16,343 INFO L567 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-04-13 08:35:16,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-04-13 08:35:16,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2018-04-13 08:35:16,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-04-13 08:35:16,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2018-04-13 08:35:16,351 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 31 [2018-04-13 08:35:16,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:35:16,351 INFO L459 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2018-04-13 08:35:16,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 08:35:16,351 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2018-04-13 08:35:16,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-13 08:35:16,352 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:35:16,352 INFO L355 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-04-13 08:35:16,352 INFO L408 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:35:16,353 INFO L82 PathProgramCache]: Analyzing trace with hash 216183673, now seen corresponding path program 1 times [2018-04-13 08:35:16,353 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:35:16,353 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:35:16,354 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:16,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:35:16,354 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:16,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:16,369 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:35:16,374 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 08:35:16,374 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:35:16,374 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:35:16,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:35:16,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:16,404 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:35:16,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:16,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:16,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:35:16,439 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 08:35:16,459 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:16,460 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-04-13 08:35:16,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:16,462 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-04-13 08:35:16,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-04-13 08:35:16,495 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| 0)) (<= (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0))) is different from true [2018-04-13 08:35:16,504 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:16,505 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:16,505 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:16,507 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-04-13 08:35:16,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:16,515 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-04-13 08:35:16,516 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-04-13 08:35:16,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 08:35:16,531 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 08:35:16,531 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-13 08:35:16,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 08:35:16,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 08:35:16,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2018-04-13 08:35:16,532 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand 8 states. [2018-04-13 08:35:16,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:35:16,655 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2018-04-13 08:35:16,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 08:35:16,655 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-04-13 08:35:16,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:35:16,655 INFO L225 Difference]: With dead ends: 105 [2018-04-13 08:35:16,656 INFO L226 Difference]: Without dead ends: 105 [2018-04-13 08:35:16,656 INFO L567 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-04-13 08:35:16,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-04-13 08:35:16,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 91. [2018-04-13 08:35:16,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-04-13 08:35:16,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2018-04-13 08:35:16,659 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 31 [2018-04-13 08:35:16,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:35:16,660 INFO L459 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2018-04-13 08:35:16,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 08:35:16,660 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2018-04-13 08:35:16,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-13 08:35:16,660 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:35:16,660 INFO L355 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-04-13 08:35:16,660 INFO L408 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:35:16,660 INFO L82 PathProgramCache]: Analyzing trace with hash 216183674, now seen corresponding path program 1 times [2018-04-13 08:35:16,660 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:35:16,660 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:35:16,661 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:16,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:35:16,661 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:16,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:16,670 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:35:16,673 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 08:35:16,673 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:35:16,673 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:35:16,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:35:16,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:16,702 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:35:16,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:16,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:16,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 08:35:16,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:16,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:35:16,722 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 08:35:16,741 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (<= (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0))) is different from true [2018-04-13 08:35:16,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:16,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:16,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-13 08:35:16,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:16,754 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-04-13 08:35:16,754 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-04-13 08:35:16,771 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (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)))) is different from true [2018-04-13 08:35:16,788 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:16,790 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-04-13 08:35:16,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:16,803 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:16,804 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:16,804 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-04-13 08:35:16,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:16,812 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-04-13 08:35:16,813 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:37, output treesize:30 [2018-04-13 08:35:16,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 08:35:16,835 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 08:35:16,835 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-13 08:35:16,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 08:35:16,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 08:35:16,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=29, Unknown=2, NotChecked=22, Total=72 [2018-04-13 08:35:16,836 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand 9 states. [2018-04-13 08:35:16,867 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (<= (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0)))) is different from true [2018-04-13 08:35:16,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:35:16,988 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2018-04-13 08:35:16,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-13 08:35:16,988 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-04-13 08:35:16,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:35:16,989 INFO L225 Difference]: With dead ends: 136 [2018-04-13 08:35:16,989 INFO L226 Difference]: Without dead ends: 136 [2018-04-13 08:35:16,989 INFO L567 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-04-13 08:35:16,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-04-13 08:35:16,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 102. [2018-04-13 08:35:16,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-04-13 08:35:16,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2018-04-13 08:35:16,994 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 31 [2018-04-13 08:35:16,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:35:16,994 INFO L459 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2018-04-13 08:35:16,994 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 08:35:16,994 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2018-04-13 08:35:16,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-13 08:35:16,994 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:35:16,995 INFO L355 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-04-13 08:35:16,995 INFO L408 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:35:16,995 INFO L82 PathProgramCache]: Analyzing trace with hash -231887552, now seen corresponding path program 1 times [2018-04-13 08:35:16,995 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:35:16,995 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:35:16,995 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:16,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:35:16,996 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:17,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:17,006 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:35:17,008 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 08:35:17,008 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:35:17,008 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:35:17,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:35:17,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:17,038 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:35:17,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:17,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:17,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:35:17,042 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 08:35:17,055 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:17,055 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-04-13 08:35:17,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:17,057 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-04-13 08:35:17,057 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-04-13 08:35:17,085 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| 0)))) is different from true [2018-04-13 08:35:17,090 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:17,091 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:17,092 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-04-13 08:35:17,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:17,097 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-04-13 08:35:17,097 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-04-13 08:35:17,124 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:17,125 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:17,131 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-04-13 08:35:17,131 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 08:35:17,143 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-04-13 08:35:17,144 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:32 [2018-04-13 08:35:17,174 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 08:35:17,174 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 08:35:17,174 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-13 08:35:17,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-13 08:35:17,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-13 08:35:17,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=66, Unknown=1, NotChecked=16, Total=110 [2018-04-13 08:35:17,175 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand 11 states. [2018-04-13 08:35:17,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:35:17,356 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2018-04-13 08:35:17,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-13 08:35:17,357 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2018-04-13 08:35:17,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:35:17,358 INFO L225 Difference]: With dead ends: 100 [2018-04-13 08:35:17,358 INFO L226 Difference]: Without dead ends: 100 [2018-04-13 08:35:17,358 INFO L567 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-04-13 08:35:17,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-04-13 08:35:17,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2018-04-13 08:35:17,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-04-13 08:35:17,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2018-04-13 08:35:17,362 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 42 [2018-04-13 08:35:17,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:35:17,363 INFO L459 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2018-04-13 08:35:17,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-13 08:35:17,363 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2018-04-13 08:35:17,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-13 08:35:17,364 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:35:17,364 INFO L355 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-04-13 08:35:17,364 INFO L408 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:35:17,364 INFO L82 PathProgramCache]: Analyzing trace with hash -231887551, now seen corresponding path program 1 times [2018-04-13 08:35:17,365 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:35:17,365 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:35:17,365 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:17,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:35:17,365 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:17,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:17,376 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:35:17,379 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 08:35:17,379 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:35:17,379 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:35:17,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:35:17,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:17,406 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:35:17,462 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:17,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, 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-04-13 08:35:17,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:17,474 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:17,475 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:17,479 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-04-13 08:35:17,480 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:17,487 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-04-13 08:35:17,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:34, output treesize:27 [2018-04-13 08:35:17,523 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 08:35:17,524 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 08:35:17,524 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-13 08:35:17,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 08:35:17,524 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 08:35:17,525 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-13 08:35:17,525 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand 9 states. [2018-04-13 08:35:17,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:35:17,712 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2018-04-13 08:35:17,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-13 08:35:17,713 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-04-13 08:35:17,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:35:17,714 INFO L225 Difference]: With dead ends: 114 [2018-04-13 08:35:17,714 INFO L226 Difference]: Without dead ends: 114 [2018-04-13 08:35:17,714 INFO L567 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-04-13 08:35:17,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-04-13 08:35:17,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 99. [2018-04-13 08:35:17,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-04-13 08:35:17,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2018-04-13 08:35:17,718 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 42 [2018-04-13 08:35:17,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:35:17,723 INFO L459 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2018-04-13 08:35:17,723 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 08:35:17,723 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2018-04-13 08:35:17,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-13 08:35:17,724 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:35:17,724 INFO L355 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-04-13 08:35:17,725 INFO L408 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:35:17,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1401420489, now seen corresponding path program 1 times [2018-04-13 08:35:17,725 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:35:17,725 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:35:17,726 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:17,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:35:17,726 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:17,738 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:35:17,806 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-13 08:35:17,806 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 08:35:17,807 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-13 08:35:17,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 08:35:17,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 08:35:17,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-04-13 08:35:17,808 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 8 states. [2018-04-13 08:35:17,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:35:17,926 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2018-04-13 08:35:17,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 08:35:17,926 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2018-04-13 08:35:17,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:35:17,927 INFO L225 Difference]: With dead ends: 98 [2018-04-13 08:35:17,927 INFO L226 Difference]: Without dead ends: 98 [2018-04-13 08:35:17,927 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-04-13 08:35:17,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-04-13 08:35:17,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-04-13 08:35:17,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-04-13 08:35:17,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2018-04-13 08:35:17,931 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 43 [2018-04-13 08:35:17,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:35:17,931 INFO L459 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2018-04-13 08:35:17,931 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 08:35:17,932 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2018-04-13 08:35:17,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-13 08:35:17,932 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:35:17,932 INFO L355 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-04-13 08:35:17,933 INFO L408 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:35:17,933 INFO L82 PathProgramCache]: Analyzing trace with hash 2000127404, now seen corresponding path program 1 times [2018-04-13 08:35:17,933 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:35:17,933 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:35:17,934 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:17,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:35:17,934 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:17,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:17,940 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:35:17,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 08:35:17,960 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:35:17,960 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:35:17,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:35:17,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:17,972 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:35:17,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 08:35:17,981 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 08:35:17,981 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-04-13 08:35:17,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 08:35:17,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 08:35:17,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-13 08:35:17,982 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand 5 states. [2018-04-13 08:35:18,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:35:18,008 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2018-04-13 08:35:18,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 08:35:18,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-04-13 08:35:18,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:35:18,009 INFO L225 Difference]: With dead ends: 99 [2018-04-13 08:35:18,009 INFO L226 Difference]: Without dead ends: 99 [2018-04-13 08:35:18,009 INFO L567 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-04-13 08:35:18,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-04-13 08:35:18,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 93. [2018-04-13 08:35:18,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-04-13 08:35:18,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2018-04-13 08:35:18,012 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 44 [2018-04-13 08:35:18,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:35:18,013 INFO L459 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2018-04-13 08:35:18,013 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 08:35:18,013 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2018-04-13 08:35:18,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-13 08:35:18,013 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:35:18,013 INFO L355 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-04-13 08:35:18,014 INFO L408 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:35:18,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1644784265, now seen corresponding path program 1 times [2018-04-13 08:35:18,014 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:35:18,014 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:35:18,014 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:18,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:35:18,015 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:18,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:18,023 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:35:18,058 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 08:35:18,058 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:35:18,058 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:35:18,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:35:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:18,071 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:35:18,097 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 08:35:18,097 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-13 08:35:18,097 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2018-04-13 08:35:18,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 08:35:18,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 08:35:18,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-04-13 08:35:18,098 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand 9 states. [2018-04-13 08:35:18,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:35:18,195 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2018-04-13 08:35:18,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-13 08:35:18,196 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2018-04-13 08:35:18,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:35:18,196 INFO L225 Difference]: With dead ends: 96 [2018-04-13 08:35:18,197 INFO L226 Difference]: Without dead ends: 96 [2018-04-13 08:35:18,197 INFO L567 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-04-13 08:35:18,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-04-13 08:35:18,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2018-04-13 08:35:18,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-04-13 08:35:18,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2018-04-13 08:35:18,200 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 46 [2018-04-13 08:35:18,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:35:18,200 INFO L459 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2018-04-13 08:35:18,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 08:35:18,200 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2018-04-13 08:35:18,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-13 08:35:18,201 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:35:18,201 INFO L355 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-04-13 08:35:18,201 INFO L408 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:35:18,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1169266089, now seen corresponding path program 1 times [2018-04-13 08:35:18,201 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:35:18,201 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:35:18,202 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:18,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:35:18,202 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:18,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:18,212 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:35:18,272 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 08:35:18,272 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:35:18,273 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:35:18,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:35:18,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:18,287 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:35:18,336 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 08:35:18,337 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 08:35:18,337 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-04-13 08:35:18,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-13 08:35:18,337 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-13 08:35:18,337 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-04-13 08:35:18,337 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand 15 states. [2018-04-13 08:35:18,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:35:18,510 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2018-04-13 08:35:18,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-13 08:35:18,511 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48 [2018-04-13 08:35:18,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:35:18,511 INFO L225 Difference]: With dead ends: 121 [2018-04-13 08:35:18,512 INFO L226 Difference]: Without dead ends: 121 [2018-04-13 08:35:18,512 INFO L567 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-04-13 08:35:18,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-04-13 08:35:18,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 116. [2018-04-13 08:35:18,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-04-13 08:35:18,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 124 transitions. [2018-04-13 08:35:18,516 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 124 transitions. Word has length 48 [2018-04-13 08:35:18,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:35:18,516 INFO L459 AbstractCegarLoop]: Abstraction has 116 states and 124 transitions. [2018-04-13 08:35:18,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-13 08:35:18,516 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 124 transitions. [2018-04-13 08:35:18,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-13 08:35:18,517 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:35:18,517 INFO L355 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-04-13 08:35:18,517 INFO L408 AbstractCegarLoop]: === Iteration 15 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:35:18,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1096362099, now seen corresponding path program 1 times [2018-04-13 08:35:18,518 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:35:18,518 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:35:18,518 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:18,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:35:18,519 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:18,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:18,528 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:35:18,574 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-04-13 08:35:18,574 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 08:35:18,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 08:35:18,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 08:35:18,575 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 08:35:18,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-13 08:35:18,575 INFO L87 Difference]: Start difference. First operand 116 states and 124 transitions. Second operand 6 states. [2018-04-13 08:35:18,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:35:18,639 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2018-04-13 08:35:18,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 08:35:18,639 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2018-04-13 08:35:18,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:35:18,640 INFO L225 Difference]: With dead ends: 120 [2018-04-13 08:35:18,640 INFO L226 Difference]: Without dead ends: 120 [2018-04-13 08:35:18,640 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-04-13 08:35:18,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-04-13 08:35:18,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2018-04-13 08:35:18,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-04-13 08:35:18,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 125 transitions. [2018-04-13 08:35:18,644 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 125 transitions. Word has length 52 [2018-04-13 08:35:18,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:35:18,645 INFO L459 AbstractCegarLoop]: Abstraction has 117 states and 125 transitions. [2018-04-13 08:35:18,645 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 08:35:18,645 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 125 transitions. [2018-04-13 08:35:18,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-13 08:35:18,646 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:35:18,646 INFO L355 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-04-13 08:35:18,646 INFO L408 AbstractCegarLoop]: === Iteration 16 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:35:18,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1224161946, now seen corresponding path program 1 times [2018-04-13 08:35:18,646 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:35:18,646 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:35:18,647 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:18,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:35:18,647 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:18,656 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:35:18,750 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-13 08:35:18,751 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:35:18,751 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:35:18,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:35:18,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:18,765 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:35:18,831 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-04-13 08:35:18,831 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 08:35:18,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2018-04-13 08:35:18,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 08:35:18,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 08:35:18,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-04-13 08:35:18,832 INFO L87 Difference]: Start difference. First operand 117 states and 125 transitions. Second operand 16 states. [2018-04-13 08:35:19,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:35:19,178 INFO L93 Difference]: Finished difference Result 171 states and 181 transitions. [2018-04-13 08:35:19,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-13 08:35:19,179 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 57 [2018-04-13 08:35:19,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:35:19,180 INFO L225 Difference]: With dead ends: 171 [2018-04-13 08:35:19,180 INFO L226 Difference]: Without dead ends: 171 [2018-04-13 08:35:19,180 INFO L567 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-04-13 08:35:19,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-04-13 08:35:19,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 151. [2018-04-13 08:35:19,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-04-13 08:35:19,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2018-04-13 08:35:19,184 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 57 [2018-04-13 08:35:19,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:35:19,185 INFO L459 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2018-04-13 08:35:19,185 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 08:35:19,185 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2018-04-13 08:35:19,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-13 08:35:19,185 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:35:19,186 INFO L355 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-04-13 08:35:19,186 INFO L408 AbstractCegarLoop]: === Iteration 17 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:35:19,186 INFO L82 PathProgramCache]: Analyzing trace with hash -227989441, now seen corresponding path program 1 times [2018-04-13 08:35:19,186 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:35:19,186 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:35:19,187 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:19,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:35:19,187 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:19,197 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:35:19,268 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-04-13 08:35:19,268 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:35:19,268 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:35:19,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:35:19,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:19,284 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:35:19,341 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-04-13 08:35:19,342 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 08:35:19,342 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2018-04-13 08:35:19,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-13 08:35:19,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-13 08:35:19,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-04-13 08:35:19,343 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand 12 states. [2018-04-13 08:35:19,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:35:19,485 INFO L93 Difference]: Finished difference Result 149 states and 155 transitions. [2018-04-13 08:35:19,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-13 08:35:19,485 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2018-04-13 08:35:19,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:35:19,486 INFO L225 Difference]: With dead ends: 149 [2018-04-13 08:35:19,486 INFO L226 Difference]: Without dead ends: 140 [2018-04-13 08:35:19,487 INFO L567 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-04-13 08:35:19,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-04-13 08:35:19,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2018-04-13 08:35:19,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-13 08:35:19,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 144 transitions. [2018-04-13 08:35:19,491 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 144 transitions. Word has length 62 [2018-04-13 08:35:19,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:35:19,491 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 144 transitions. [2018-04-13 08:35:19,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-13 08:35:19,491 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 144 transitions. [2018-04-13 08:35:19,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-13 08:35:19,492 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:35:19,492 INFO L355 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-04-13 08:35:19,492 INFO L408 AbstractCegarLoop]: === Iteration 18 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:35:19,492 INFO L82 PathProgramCache]: Analyzing trace with hash 897277161, now seen corresponding path program 1 times [2018-04-13 08:35:19,492 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:35:19,492 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:35:19,493 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:19,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:35:19,493 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:19,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:19,502 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:35:19,505 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 08:35:19,506 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:35:19,506 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:35:19,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:35:19,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:19,521 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:35:19,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 08:35:19,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:19,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:35:19,528 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 08:35:19,543 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-13 08:35:19,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:19,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:19,549 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-04-13 08:35:19,549 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:35:19,561 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_3| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_3|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_5 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_5)) |c_#length|))) is different from true [2018-04-13 08:35:19,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:19,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:19,572 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-04-13 08:35:19,573 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:35:19,576 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_3| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_3|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_5 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_5)) |c_#length|)))) is different from true [2018-04-13 08:35:19,592 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-04-13 08:35:19,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 08:35:19,609 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-04-13 08:35:19,609 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:58 [2018-04-13 08:35:19,717 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:35:19,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 8 treesize of output 7 [2018-04-13 08:35:19,736 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:19,741 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-04-13 08:35:19,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:19,743 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-04-13 08:35:19,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-04-13 08:35:19,758 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_3| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_3|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (v_prenex_9 Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_9)) |c_#length|)))) is different from true [2018-04-13 08:35:19,774 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:19,775 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:19,789 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:19,790 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-04-13 08:35:19,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:19,822 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-04-13 08:35:19,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 08:35:19,846 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-04-13 08:35:19,846 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:49, output treesize:72 [2018-04-13 08:35:19,897 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 10 not checked. [2018-04-13 08:35:19,898 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 08:35:19,898 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-13 08:35:19,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 08:35:19,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 08:35:19,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=82, Unknown=5, NotChecked=110, Total=240 [2018-04-13 08:35:19,898 INFO L87 Difference]: Start difference. First operand 138 states and 144 transitions. Second operand 16 states. [2018-04-13 08:35:19,935 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_3| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_3|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:35:19,937 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:35:19,944 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_3| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_3|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_5 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_5)) |c_#length|)) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (v_prenex_9 Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_9)) |c_#length|)))) is different from true [2018-04-13 08:35:20,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:35:20,033 INFO L93 Difference]: Finished difference Result 161 states and 170 transitions. [2018-04-13 08:35:20,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-13 08:35:20,033 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2018-04-13 08:35:20,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:35:20,034 INFO L225 Difference]: With dead ends: 161 [2018-04-13 08:35:20,034 INFO L226 Difference]: Without dead ends: 161 [2018-04-13 08:35:20,034 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=119, Unknown=8, NotChecked=232, Total=420 [2018-04-13 08:35:20,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-04-13 08:35:20,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 151. [2018-04-13 08:35:20,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-04-13 08:35:20,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 159 transitions. [2018-04-13 08:35:20,037 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 159 transitions. Word has length 67 [2018-04-13 08:35:20,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:35:20,038 INFO L459 AbstractCegarLoop]: Abstraction has 151 states and 159 transitions. [2018-04-13 08:35:20,038 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 08:35:20,038 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 159 transitions. [2018-04-13 08:35:20,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-13 08:35:20,038 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:35:20,038 INFO L355 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-04-13 08:35:20,038 INFO L408 AbstractCegarLoop]: === Iteration 19 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:35:20,038 INFO L82 PathProgramCache]: Analyzing trace with hash -646521076, now seen corresponding path program 1 times [2018-04-13 08:35:20,038 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:35:20,038 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:35:20,039 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:20,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:35:20,039 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:20,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:20,047 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:35:20,049 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 08:35:20,049 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:35:20,049 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:35:20,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:35:20,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:20,061 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:35:20,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:20,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:20,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:35:20,066 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 08:35:20,077 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-13 08:35:20,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-04-13 08:35:20,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:20,082 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-04-13 08:35:20,082 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:35:20,091 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) (exists ((v_prenex_15 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_4| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_4|) (* 4 v_prenex_15)))) is different from true [2018-04-13 08:35:20,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:20,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:20,099 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-04-13 08:35:20,100 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:35:20,102 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((v_prenex_15 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_4| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_4|) (* 4 v_prenex_15)))) is different from true [2018-04-13 08:35:20,118 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-04-13 08:35:20,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 08:35:20,129 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-04-13 08:35:20,129 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:58 [2018-04-13 08:35:20,203 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:35:20,214 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-04-13 08:35:20,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:20,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 08:35:20,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:20,217 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-04-13 08:35:20,218 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-04-13 08:35:20,228 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_19 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_4|) (* 4 v_prenex_19)))) is different from true [2018-04-13 08:35:20,236 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:20,236 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:20,246 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-04-13 08:35:20,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 08:35:20,280 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:20,281 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:20,282 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:20,282 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-04-13 08:35:20,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:20,307 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-04-13 08:35:20,308 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:49, output treesize:72 [2018-04-13 08:35:20,347 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 12 not checked. [2018-04-13 08:35:20,347 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 08:35:20,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-13 08:35:20,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 08:35:20,347 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 08:35:20,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=82, Unknown=5, NotChecked=110, Total=240 [2018-04-13 08:35:20,348 INFO L87 Difference]: Start difference. First operand 151 states and 159 transitions. Second operand 16 states. [2018-04-13 08:35:20,383 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_4| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_4|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-13 08:35:20,385 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:35:20,397 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) (exists ((v_prenex_15 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_4| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_4|) (* 4 v_prenex_15))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_19 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_4|) (* 4 v_prenex_19)))) is different from true [2018-04-13 08:35:20,399 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((v_prenex_15 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_4| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_4|) (* 4 v_prenex_15))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_19 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_4|) (* 4 v_prenex_19)))) is different from true [2018-04-13 08:35:20,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:35:20,533 INFO L93 Difference]: Finished difference Result 172 states and 183 transitions. [2018-04-13 08:35:20,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-13 08:35:20,533 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2018-04-13 08:35:20,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:35:20,534 INFO L225 Difference]: With dead ends: 172 [2018-04-13 08:35:20,534 INFO L226 Difference]: Without dead ends: 172 [2018-04-13 08:35:20,534 INFO L567 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-04-13 08:35:20,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-04-13 08:35:20,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 149. [2018-04-13 08:35:20,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-04-13 08:35:20,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 157 transitions. [2018-04-13 08:35:20,538 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 157 transitions. Word has length 67 [2018-04-13 08:35:20,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:35:20,538 INFO L459 AbstractCegarLoop]: Abstraction has 149 states and 157 transitions. [2018-04-13 08:35:20,538 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 08:35:20,538 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 157 transitions. [2018-04-13 08:35:20,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-04-13 08:35:20,539 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:35:20,539 INFO L355 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-04-13 08:35:20,539 INFO L408 AbstractCegarLoop]: === Iteration 20 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:35:20,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1591994525, now seen corresponding path program 1 times [2018-04-13 08:35:20,539 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:35:20,539 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:35:20,539 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:20,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:35:20,540 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:20,545 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:35:20,565 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-04-13 08:35:20,565 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:35:20,565 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:35:20,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:35:20,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:20,575 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:35:20,584 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-04-13 08:35:20,584 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 08:35:20,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-04-13 08:35:20,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 08:35:20,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 08:35:20,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-04-13 08:35:20,585 INFO L87 Difference]: Start difference. First operand 149 states and 157 transitions. Second operand 6 states. [2018-04-13 08:35:20,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:35:20,607 INFO L93 Difference]: Finished difference Result 150 states and 157 transitions. [2018-04-13 08:35:20,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 08:35:20,609 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2018-04-13 08:35:20,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:35:20,610 INFO L225 Difference]: With dead ends: 150 [2018-04-13 08:35:20,610 INFO L226 Difference]: Without dead ends: 150 [2018-04-13 08:35:20,611 INFO L567 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-04-13 08:35:20,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-04-13 08:35:20,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 144. [2018-04-13 08:35:20,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-04-13 08:35:20,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 150 transitions. [2018-04-13 08:35:20,614 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 150 transitions. Word has length 80 [2018-04-13 08:35:20,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:35:20,615 INFO L459 AbstractCegarLoop]: Abstraction has 144 states and 150 transitions. [2018-04-13 08:35:20,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 08:35:20,615 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 150 transitions. [2018-04-13 08:35:20,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-13 08:35:20,615 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:35:20,616 INFO L355 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-04-13 08:35:20,616 INFO L408 AbstractCegarLoop]: === Iteration 21 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:35:20,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1581116616, now seen corresponding path program 1 times [2018-04-13 08:35:20,616 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:35:20,616 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:35:20,617 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:20,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:35:20,617 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:20,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:20,629 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:35:20,632 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 08:35:20,632 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:35:20,632 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:35:20,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:35:20,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:20,672 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:35:20,694 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-04-13 08:35:20,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:20,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:20,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:35:20,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:35:20,700 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-04-13 08:35:20,792 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-04-13 08:35:20,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:20,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:20,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:35:20,807 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-04-13 08:35:20,807 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:19, output treesize:15 [2018-04-13 08:35:20,900 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~i~0 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (let ((.cse0 (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~i~0)))) (and (<= 0 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset) (<= 0 .cse0) (= |c_#memory_int| (store |c_old(#memory_int)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (store (select |c_old(#memory_int)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0 (select (select |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|) __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset)))) (= (select (select |c_#memory_int| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) .cse0) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~ret4|) (<= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset|) (<= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset 0) (<= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~i~0 0)))) is different from true [2018-04-13 08:35:20,940 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 45 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2018-04-13 08:35:20,941 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 08:35:20,941 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-13 08:35:20,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-13 08:35:20,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-13 08:35:20,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=283, Unknown=13, NotChecked=34, Total=380 [2018-04-13 08:35:20,942 INFO L87 Difference]: Start difference. First operand 144 states and 150 transitions. Second operand 20 states. [2018-04-13 08:35:21,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:35:21,525 INFO L93 Difference]: Finished difference Result 167 states and 174 transitions. [2018-04-13 08:35:21,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-13 08:35:21,525 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 84 [2018-04-13 08:35:21,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:35:21,526 INFO L225 Difference]: With dead ends: 167 [2018-04-13 08:35:21,526 INFO L226 Difference]: Without dead ends: 163 [2018-04-13 08:35:21,526 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=960, Unknown=32, NotChecked=64, Total=1190 [2018-04-13 08:35:21,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-04-13 08:35:21,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 142. [2018-04-13 08:35:21,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-04-13 08:35:21,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 147 transitions. [2018-04-13 08:35:21,530 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 147 transitions. Word has length 84 [2018-04-13 08:35:21,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:35:21,531 INFO L459 AbstractCegarLoop]: Abstraction has 142 states and 147 transitions. [2018-04-13 08:35:21,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-13 08:35:21,531 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 147 transitions. [2018-04-13 08:35:21,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-13 08:35:21,531 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:35:21,532 INFO L355 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-04-13 08:35:21,532 INFO L408 AbstractCegarLoop]: === Iteration 22 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:35:21,532 INFO L82 PathProgramCache]: Analyzing trace with hash -999779067, now seen corresponding path program 1 times [2018-04-13 08:35:21,532 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:35:21,532 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:35:21,533 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:21,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:35:21,533 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:21,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:21,546 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:35:21,549 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 08:35:21,549 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:35:21,550 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:35:21,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:35:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:21,584 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:35:21,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 6 treesize of output 5 [2018-04-13 08:35:21,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:21,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:35:21,601 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 08:35:21,621 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-13 08:35:21,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:21,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:21,625 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-04-13 08:35:21,626 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:35:21,637 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_6| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_6|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_26 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_26))))) is different from true [2018-04-13 08:35:21,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:21,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:21,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-04-13 08:35:21,648 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:35:21,649 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_6| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_6|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_26 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_26)))))) is different from true [2018-04-13 08:35:21,663 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-04-13 08:35:21,663 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 08:35:21,675 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-04-13 08:35:21,675 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:58 [2018-04-13 08:35:21,710 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:21,711 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:21,711 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-04-13 08:35:21,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:21,724 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-04-13 08:35:21,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:23 [2018-04-13 08:35:21,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:21,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:21,755 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-04-13 08:35:21,755 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:35:21,766 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_31 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_31)) |c_#length|)) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_6| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_6|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-13 08:35:21,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 6 treesize of output 5 [2018-04-13 08:35:21,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:21,773 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-04-13 08:35:21,774 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:35:21,799 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_31 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_31)) |c_#length|))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_6| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_6|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-13 08:35:21,822 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-04-13 08:35:21,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-13 08:35:21,860 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-04-13 08:35:21,860 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-04-13 08:35:21,920 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:35:21,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:21,928 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:21,929 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:21,930 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-04-13 08:35:21,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:21,936 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-04-13 08:35:21,937 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:69, output treesize:23 [2018-04-13 08:35:22,035 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-04-13 08:35:22,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-13 08:35:22,058 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-04-13 08:35:22,058 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:31, output treesize:79 [2018-04-13 08:35:22,218 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 25 not checked. [2018-04-13 08:35:22,218 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 08:35:22,218 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-13 08:35:22,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-13 08:35:22,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-13 08:35:22,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=217, Unknown=5, NotChecked=170, Total=462 [2018-04-13 08:35:22,219 INFO L87 Difference]: Start difference. First operand 142 states and 147 transitions. Second operand 22 states. [2018-04-13 08:35:22,267 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_6| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_6|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:35:22,289 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_31 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_31)) |c_#length|)) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_6| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_6|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_26 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_26))))) is different from true [2018-04-13 08:35:22,291 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_31 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_31)) |c_#length|))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_6| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_6|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_26 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_26)))))) is different from true [2018-04-13 08:35:22,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:35:22,925 INFO L93 Difference]: Finished difference Result 228 states and 244 transitions. [2018-04-13 08:35:22,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-13 08:35:22,925 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 84 [2018-04-13 08:35:22,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:35:22,926 INFO L225 Difference]: With dead ends: 228 [2018-04-13 08:35:22,926 INFO L226 Difference]: Without dead ends: 228 [2018-04-13 08:35:22,926 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=158, Invalid=663, Unknown=23, NotChecked=488, Total=1332 [2018-04-13 08:35:22,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-04-13 08:35:22,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 179. [2018-04-13 08:35:22,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-04-13 08:35:22,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 192 transitions. [2018-04-13 08:35:22,931 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 192 transitions. Word has length 84 [2018-04-13 08:35:22,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:35:22,931 INFO L459 AbstractCegarLoop]: Abstraction has 179 states and 192 transitions. [2018-04-13 08:35:22,931 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-13 08:35:22,932 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 192 transitions. [2018-04-13 08:35:22,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-04-13 08:35:22,932 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:35:22,932 INFO L355 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-04-13 08:35:22,933 INFO L408 AbstractCegarLoop]: === Iteration 23 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:35:22,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1195020517, now seen corresponding path program 2 times [2018-04-13 08:35:22,933 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:35:22,933 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:35:22,934 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:22,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:35:22,934 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:22,945 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:35:23,029 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 40 proven. 18 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-04-13 08:35:23,029 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:35:23,029 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:35:23,030 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 08:35:23,052 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 08:35:23,052 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 08:35:23,055 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:35:23,134 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 45 proven. 13 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-04-13 08:35:23,134 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 08:35:23,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-04-13 08:35:23,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 08:35:23,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 08:35:23,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2018-04-13 08:35:23,135 INFO L87 Difference]: Start difference. First operand 179 states and 192 transitions. Second operand 19 states. [2018-04-13 08:35:23,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:35:23,352 INFO L93 Difference]: Finished difference Result 228 states and 247 transitions. [2018-04-13 08:35:23,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-13 08:35:23,353 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 90 [2018-04-13 08:35:23,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:35:23,353 INFO L225 Difference]: With dead ends: 228 [2018-04-13 08:35:23,354 INFO L226 Difference]: Without dead ends: 228 [2018-04-13 08:35:23,354 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2018-04-13 08:35:23,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-04-13 08:35:23,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 209. [2018-04-13 08:35:23,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-04-13 08:35:23,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 226 transitions. [2018-04-13 08:35:23,360 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 226 transitions. Word has length 90 [2018-04-13 08:35:23,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:35:23,361 INFO L459 AbstractCegarLoop]: Abstraction has 209 states and 226 transitions. [2018-04-13 08:35:23,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 08:35:23,361 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 226 transitions. [2018-04-13 08:35:23,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-04-13 08:35:23,364 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:35:23,364 INFO L355 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-04-13 08:35:23,364 INFO L408 AbstractCegarLoop]: === Iteration 24 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:35:23,365 INFO L82 PathProgramCache]: Analyzing trace with hash -832613802, now seen corresponding path program 2 times [2018-04-13 08:35:23,365 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:35:23,365 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:35:23,365 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:23,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 08:35:23,365 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:23,406 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:35:23,515 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 56 proven. 1 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-04-13 08:35:23,515 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:35:23,515 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:35:23,516 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 08:35:23,536 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 08:35:23,537 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 08:35:23,540 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:35:23,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:23,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:23,560 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-04-13 08:35:23,561 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-04-13 08:35:23,737 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 54 proven. 1 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-04-13 08:35:23,737 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 08:35:23,737 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2018-04-13 08:35:23,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-13 08:35:23,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-13 08:35:23,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2018-04-13 08:35:23,737 INFO L87 Difference]: Start difference. First operand 209 states and 226 transitions. Second operand 18 states. [2018-04-13 08:35:23,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:35:23,908 INFO L93 Difference]: Finished difference Result 210 states and 227 transitions. [2018-04-13 08:35:23,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-13 08:35:23,908 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 99 [2018-04-13 08:35:23,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:35:23,909 INFO L225 Difference]: With dead ends: 210 [2018-04-13 08:35:23,909 INFO L226 Difference]: Without dead ends: 210 [2018-04-13 08:35:23,909 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2018-04-13 08:35:23,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-04-13 08:35:23,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 207. [2018-04-13 08:35:23,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-04-13 08:35:23,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 224 transitions. [2018-04-13 08:35:23,913 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 224 transitions. Word has length 99 [2018-04-13 08:35:23,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:35:23,914 INFO L459 AbstractCegarLoop]: Abstraction has 207 states and 224 transitions. [2018-04-13 08:35:23,914 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-13 08:35:23,914 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 224 transitions. [2018-04-13 08:35:23,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-04-13 08:35:23,914 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:35:23,914 INFO L355 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-04-13 08:35:23,914 INFO L408 AbstractCegarLoop]: === Iteration 25 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:35:23,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1370708101, now seen corresponding path program 2 times [2018-04-13 08:35:23,914 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:35:23,914 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:35:23,915 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:23,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 08:35:23,915 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:23,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:23,925 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:35:24,006 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 28 proven. 33 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-04-13 08:35:24,007 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:35:24,007 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:35:24,007 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 08:35:24,022 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 08:35:24,022 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 08:35:24,024 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:35:24,056 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 47 proven. 2 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-04-13 08:35:24,056 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 08:35:24,056 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 15 [2018-04-13 08:35:24,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-13 08:35:24,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-13 08:35:24,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-04-13 08:35:24,057 INFO L87 Difference]: Start difference. First operand 207 states and 224 transitions. Second operand 15 states. [2018-04-13 08:35:24,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:35:24,437 INFO L93 Difference]: Finished difference Result 243 states and 258 transitions. [2018-04-13 08:35:24,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-13 08:35:24,437 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 103 [2018-04-13 08:35:24,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:35:24,438 INFO L225 Difference]: With dead ends: 243 [2018-04-13 08:35:24,438 INFO L226 Difference]: Without dead ends: 201 [2018-04-13 08:35:24,439 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=599, Unknown=0, NotChecked=0, Total=756 [2018-04-13 08:35:24,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-04-13 08:35:24,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 193. [2018-04-13 08:35:24,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-04-13 08:35:24,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 205 transitions. [2018-04-13 08:35:24,443 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 205 transitions. Word has length 103 [2018-04-13 08:35:24,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:35:24,444 INFO L459 AbstractCegarLoop]: Abstraction has 193 states and 205 transitions. [2018-04-13 08:35:24,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-13 08:35:24,444 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 205 transitions. [2018-04-13 08:35:24,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-04-13 08:35:24,444 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:35:24,444 INFO L355 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-04-13 08:35:24,445 INFO L408 AbstractCegarLoop]: === Iteration 26 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:35:24,445 INFO L82 PathProgramCache]: Analyzing trace with hash -52037211, now seen corresponding path program 3 times [2018-04-13 08:35:24,445 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:35:24,445 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:35:24,445 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:24,446 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 08:35:24,446 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:24,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:24,460 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:35:24,635 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 68 proven. 9 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-04-13 08:35:24,636 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:35:24,636 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:35:24,636 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 08:35:24,666 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-13 08:35:24,667 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 08:35:24,670 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:35:24,760 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 78 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-04-13 08:35:24,761 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 08:35:24,761 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2018-04-13 08:35:24,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 08:35:24,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 08:35:24,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-04-13 08:35:24,762 INFO L87 Difference]: Start difference. First operand 193 states and 205 transitions. Second operand 19 states. [2018-04-13 08:35:25,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:35:25,046 INFO L93 Difference]: Finished difference Result 232 states and 245 transitions. [2018-04-13 08:35:25,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-13 08:35:25,082 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 109 [2018-04-13 08:35:25,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:35:25,083 INFO L225 Difference]: With dead ends: 232 [2018-04-13 08:35:25,083 INFO L226 Difference]: Without dead ends: 201 [2018-04-13 08:35:25,084 INFO L567 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-04-13 08:35:25,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-04-13 08:35:25,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2018-04-13 08:35:25,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-04-13 08:35:25,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 210 transitions. [2018-04-13 08:35:25,087 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 210 transitions. Word has length 109 [2018-04-13 08:35:25,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:35:25,087 INFO L459 AbstractCegarLoop]: Abstraction has 198 states and 210 transitions. [2018-04-13 08:35:25,087 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 08:35:25,087 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 210 transitions. [2018-04-13 08:35:25,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-04-13 08:35:25,088 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:35:25,088 INFO L355 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-04-13 08:35:25,088 INFO L408 AbstractCegarLoop]: === Iteration 27 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:35:25,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1577506560, now seen corresponding path program 4 times [2018-04-13 08:35:25,088 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:35:25,088 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:35:25,089 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:25,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 08:35:25,089 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:25,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:25,097 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:35:25,101 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 08:35:25,101 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:35:25,102 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:35:25,102 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 08:35:25,134 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 08:35:25,134 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 08:35:25,137 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:35:25,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:25,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:25,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:35:25,142 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 08:35:25,162 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-13 08:35:25,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:25,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:25,166 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-04-13 08:35:25,166 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:35:25,173 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_9| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_9|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_49 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_49)) |c_#length|))) is different from true [2018-04-13 08:35:25,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:25,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:25,181 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-04-13 08:35:25,181 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:35:25,183 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_9| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_9|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_49 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_49)) |c_#length|)))) is different from true [2018-04-13 08:35:25,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, 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-04-13 08:35:25,192 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 08:35:25,227 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-04-13 08:35:25,228 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:58 [2018-04-13 08:35:25,277 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:25,278 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:25,278 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-04-13 08:35:25,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:25,294 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-04-13 08:35:25,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:68, output treesize:30 [2018-04-13 08:35:25,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:25,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:25,325 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-04-13 08:35:25,325 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:35:25,335 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_54 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_54)))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_9| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_9|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-13 08:35:25,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:25,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:25,342 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-04-13 08:35:25,342 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:35:25,343 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_9| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_9|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_54 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_54)))))) is different from true [2018-04-13 08:35:25,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-04-13 08:35:25,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-13 08:35:25,387 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-04-13 08:35:25,387 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:50, output treesize:136 [2018-04-13 08:35:25,511 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:35:25,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:25,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:25,520 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-04-13 08:35:25,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:25,522 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-04-13 08:35:25,522 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-04-13 08:35:25,551 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_9| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_9|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_65 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_65)))))) is different from true [2018-04-13 08:35:25,559 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:25,561 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:25,562 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:25,562 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-04-13 08:35:25,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:25,588 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-04-13 08:35:25,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 08:35:25,618 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-04-13 08:35:25,619 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:56, output treesize:86 [2018-04-13 08:35:25,691 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 71 trivial. 44 not checked. [2018-04-13 08:35:25,691 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 08:35:25,692 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-13 08:35:25,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-13 08:35:25,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-13 08:35:25,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=144, Unknown=7, NotChecked=210, Total=420 [2018-04-13 08:35:25,692 INFO L87 Difference]: Start difference. First operand 198 states and 210 transitions. Second operand 21 states. [2018-04-13 08:35:25,750 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_9| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_9|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:35:25,751 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:35:25,776 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_54 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_54)))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_9| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_9|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_49 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_49)) |c_#length|)) (exists ((v_prenex_65 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_65)))))) is different from true [2018-04-13 08:35:25,778 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_54 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_54)))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_9| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_9|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_49 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_49)) |c_#length|))) is different from true [2018-04-13 08:35:25,780 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_9| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_9|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_49 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_49)) |c_#length|))) (exists ((v_prenex_54 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_54)))))) is different from true [2018-04-13 08:35:26,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:35:26,049 INFO L93 Difference]: Finished difference Result 220 states and 235 transitions. [2018-04-13 08:35:26,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-13 08:35:26,050 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 114 [2018-04-13 08:35:26,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:35:26,050 INFO L225 Difference]: With dead ends: 220 [2018-04-13 08:35:26,051 INFO L226 Difference]: Without dead ends: 220 [2018-04-13 08:35:26,051 INFO L567 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-04-13 08:35:26,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-04-13 08:35:26,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 200. [2018-04-13 08:35:26,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-04-13 08:35:26,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 212 transitions. [2018-04-13 08:35:26,054 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 212 transitions. Word has length 114 [2018-04-13 08:35:26,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:35:26,055 INFO L459 AbstractCegarLoop]: Abstraction has 200 states and 212 transitions. [2018-04-13 08:35:26,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-13 08:35:26,055 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 212 transitions. [2018-04-13 08:35:26,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-04-13 08:35:26,055 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:35:26,056 INFO L355 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-04-13 08:35:26,056 INFO L408 AbstractCegarLoop]: === Iteration 28 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:35:26,056 INFO L82 PathProgramCache]: Analyzing trace with hash 33708323, now seen corresponding path program 2 times [2018-04-13 08:35:26,056 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:35:26,056 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:35:26,056 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:26,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 08:35:26,056 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:26,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:26,069 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:35:26,074 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 08:35:26,074 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:35:26,074 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:35:26,075 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 08:35:26,095 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 08:35:26,095 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 08:35:26,099 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:35:26,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-04-13 08:35:26,101 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:26,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:35:26,105 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 08:35:26,119 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-13 08:35:26,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:26,123 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:26,124 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-04-13 08:35:26,124 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:35:26,135 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_11| Int) (v_prenex_70 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_11|) (* 4 v_prenex_70))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:35:26,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:26,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:26,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-04-13 08:35:26,145 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:35:26,147 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_11| Int) (v_prenex_70 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_11|) (* 4 v_prenex_70))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))))) is different from true [2018-04-13 08:35:26,156 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-04-13 08:35:26,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 08:35:26,166 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-04-13 08:35:26,166 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:58 [2018-04-13 08:35:26,193 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:35:26,194 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:26,199 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:26,200 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:26,200 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-04-13 08:35:26,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:26,204 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-04-13 08:35:26,204 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:54, output treesize:23 [2018-04-13 08:35:26,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 8 treesize of output 7 [2018-04-13 08:35:26,229 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:26,231 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-04-13 08:35:26,231 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:35:26,252 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_11| Int) (v_prenex_75 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_11|) (* 4 v_prenex_75))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:35:26,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:26,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:26,263 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-04-13 08:35:26,263 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:35:26,264 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_11| Int) (v_prenex_75 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_11|) (* 4 v_prenex_75)))) is different from true [2018-04-13 08:35:26,283 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-04-13 08:35:26,284 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-13 08:35:26,312 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-04-13 08:35:26,313 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-04-13 08:35:26,410 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:35:26,418 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-04-13 08:35:26,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:26,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:26,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:26,422 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-04-13 08:35:26,422 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-04-13 08:35:26,433 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_11| Int) (v_prenex_86 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_11|) (* 4 v_prenex_86))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))))) is different from true [2018-04-13 08:35:26,457 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:26,458 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:26,470 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-04-13 08:35:26,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 08:35:26,499 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:26,500 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:26,501 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:26,501 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-04-13 08:35:26,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:26,516 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-04-13 08:35:26,517 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:49, output treesize:72 [2018-04-13 08:35:26,594 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 71 trivial. 48 not checked. [2018-04-13 08:35:26,594 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 08:35:26,594 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-13 08:35:26,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-13 08:35:26,594 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-13 08:35:26,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=144, Unknown=7, NotChecked=210, Total=420 [2018-04-13 08:35:26,595 INFO L87 Difference]: Start difference. First operand 200 states and 212 transitions. Second operand 21 states. [2018-04-13 08:35:26,642 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_11| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_11|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-13 08:35:26,643 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:35:26,660 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_11| Int) (v_prenex_70 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_11|) (* 4 v_prenex_70))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_11| Int) (v_prenex_86 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_11|) (* 4 v_prenex_86))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_11| Int) (v_prenex_75 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_11|) (* 4 v_prenex_75))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:35:26,662 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_11| Int) (v_prenex_70 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_11|) (* 4 v_prenex_70))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_11| Int) (v_prenex_86 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_11|) (* 4 v_prenex_86))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_11| Int) (v_prenex_75 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_11|) (* 4 v_prenex_75))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))))) is different from true [2018-04-13 08:35:26,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:35:26,891 INFO L93 Difference]: Finished difference Result 221 states and 236 transitions. [2018-04-13 08:35:26,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-13 08:35:26,892 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 114 [2018-04-13 08:35:26,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:35:26,892 INFO L225 Difference]: With dead ends: 221 [2018-04-13 08:35:26,892 INFO L226 Difference]: Without dead ends: 221 [2018-04-13 08:35:26,893 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=246, Unknown=11, NotChecked=462, Total=812 [2018-04-13 08:35:26,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-04-13 08:35:26,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 211. [2018-04-13 08:35:26,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-04-13 08:35:26,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 225 transitions. [2018-04-13 08:35:26,897 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 225 transitions. Word has length 114 [2018-04-13 08:35:26,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:35:26,897 INFO L459 AbstractCegarLoop]: Abstraction has 211 states and 225 transitions. [2018-04-13 08:35:26,897 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-13 08:35:26,897 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 225 transitions. [2018-04-13 08:35:26,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-04-13 08:35:26,897 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:35:26,898 INFO L355 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-04-13 08:35:26,898 INFO L408 AbstractCegarLoop]: === Iteration 29 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:35:26,898 INFO L82 PathProgramCache]: Analyzing trace with hash -308556470, now seen corresponding path program 1 times [2018-04-13 08:35:26,898 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:35:26,898 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:35:26,898 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:26,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 08:35:26,899 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:26,906 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:35:26,930 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-04-13 08:35:26,930 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:35:26,930 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:35:26,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:35:26,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:26,943 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:35:26,959 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-04-13 08:35:26,960 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 08:35:26,960 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-04-13 08:35:26,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-13 08:35:26,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-13 08:35:26,960 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-04-13 08:35:26,960 INFO L87 Difference]: Start difference. First operand 211 states and 225 transitions. Second operand 7 states. [2018-04-13 08:35:27,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:35:27,009 INFO L93 Difference]: Finished difference Result 221 states and 237 transitions. [2018-04-13 08:35:27,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 08:35:27,009 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 122 [2018-04-13 08:35:27,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:35:27,010 INFO L225 Difference]: With dead ends: 221 [2018-04-13 08:35:27,010 INFO L226 Difference]: Without dead ends: 221 [2018-04-13 08:35:27,011 INFO L567 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-04-13 08:35:27,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-04-13 08:35:27,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 210. [2018-04-13 08:35:27,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-04-13 08:35:27,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 222 transitions. [2018-04-13 08:35:27,015 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 222 transitions. Word has length 122 [2018-04-13 08:35:27,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:35:27,015 INFO L459 AbstractCegarLoop]: Abstraction has 210 states and 222 transitions. [2018-04-13 08:35:27,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-13 08:35:27,015 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 222 transitions. [2018-04-13 08:35:27,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-04-13 08:35:27,016 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:35:27,016 INFO L355 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-04-13 08:35:27,016 INFO L408 AbstractCegarLoop]: === Iteration 30 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:35:27,016 INFO L82 PathProgramCache]: Analyzing trace with hash 737215377, now seen corresponding path program 2 times [2018-04-13 08:35:27,016 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:35:27,017 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:35:27,017 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:27,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:35:27,017 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:27,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:27,032 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:35:27,036 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 08:35:27,036 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:35:27,036 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:35:27,037 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 08:35:27,057 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 08:35:27,057 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 08:35:27,061 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:35:27,068 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-04-13 08:35:27,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:27,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:35:27,071 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-04-13 08:35:27,120 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:27,121 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-04-13 08:35:27,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:27,134 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:27,135 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:27,136 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-04-13 08:35:27,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:27,146 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-04-13 08:35:27,146 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:41, output treesize:38 [2018-04-13 08:35:27,191 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-04-13 08:35:27,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:27,200 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-04-13 08:35:27,200 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:31 [2018-04-13 08:35:27,325 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 65 proven. 16 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-04-13 08:35:27,326 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 08:35:27,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-13 08:35:27,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-13 08:35:27,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-13 08:35:27,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-04-13 08:35:27,327 INFO L87 Difference]: Start difference. First operand 210 states and 222 transitions. Second operand 13 states. [2018-04-13 08:35:27,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:35:27,681 INFO L93 Difference]: Finished difference Result 217 states and 229 transitions. [2018-04-13 08:35:27,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-13 08:35:27,681 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 131 [2018-04-13 08:35:27,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:35:27,682 INFO L225 Difference]: With dead ends: 217 [2018-04-13 08:35:27,682 INFO L226 Difference]: Without dead ends: 217 [2018-04-13 08:35:27,682 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2018-04-13 08:35:27,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-04-13 08:35:27,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 167. [2018-04-13 08:35:27,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-04-13 08:35:27,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 173 transitions. [2018-04-13 08:35:27,685 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 173 transitions. Word has length 131 [2018-04-13 08:35:27,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:35:27,685 INFO L459 AbstractCegarLoop]: Abstraction has 167 states and 173 transitions. [2018-04-13 08:35:27,685 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-13 08:35:27,685 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 173 transitions. [2018-04-13 08:35:27,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-04-13 08:35:27,686 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:35:27,686 INFO L355 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-04-13 08:35:27,686 INFO L408 AbstractCegarLoop]: === Iteration 31 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:35:27,686 INFO L82 PathProgramCache]: Analyzing trace with hash 900449447, now seen corresponding path program 3 times [2018-04-13 08:35:27,687 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:35:27,687 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:35:27,687 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:27,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 08:35:27,687 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:27,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:27,703 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:35:27,707 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 08:35:27,707 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:35:27,707 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:35:27,707 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 08:35:27,717 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-04-13 08:35:27,717 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 08:35:27,720 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:35:27,774 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:27,776 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-04-13 08:35:27,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:27,801 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:27,802 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:27,803 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-04-13 08:35:27,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:27,816 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-04-13 08:35:27,816 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:46, output treesize:43 [2018-04-13 08:35:27,844 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-04-13 08:35:27,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:27,854 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-04-13 08:35:27,854 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:33 [2018-04-13 08:35:27,962 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 85 proven. 9 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2018-04-13 08:35:27,962 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 08:35:27,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-13 08:35:27,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-13 08:35:27,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-13 08:35:27,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-04-13 08:35:27,963 INFO L87 Difference]: Start difference. First operand 167 states and 173 transitions. Second operand 12 states. [2018-04-13 08:35:28,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:35:28,336 INFO L93 Difference]: Finished difference Result 170 states and 176 transitions. [2018-04-13 08:35:28,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-13 08:35:28,337 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 137 [2018-04-13 08:35:28,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:35:28,337 INFO L225 Difference]: With dead ends: 170 [2018-04-13 08:35:28,337 INFO L226 Difference]: Without dead ends: 170 [2018-04-13 08:35:28,338 INFO L567 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-04-13 08:35:28,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-04-13 08:35:28,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 165. [2018-04-13 08:35:28,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-04-13 08:35:28,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 171 transitions. [2018-04-13 08:35:28,341 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 171 transitions. Word has length 137 [2018-04-13 08:35:28,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:35:28,341 INFO L459 AbstractCegarLoop]: Abstraction has 165 states and 171 transitions. [2018-04-13 08:35:28,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-13 08:35:28,341 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 171 transitions. [2018-04-13 08:35:28,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-04-13 08:35:28,342 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:35:28,342 INFO L355 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-04-13 08:35:28,342 INFO L408 AbstractCegarLoop]: === Iteration 32 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:35:28,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1558726796, now seen corresponding path program 5 times [2018-04-13 08:35:28,342 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:35:28,342 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:35:28,343 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:28,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 08:35:28,343 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:28,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:28,357 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:35:28,492 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 82 proven. 86 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2018-04-13 08:35:28,492 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:35:28,493 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:35:28,493 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 08:35:28,561 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-04-13 08:35:28,562 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 08:35:28,566 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:35:28,669 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 102 proven. 66 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2018-04-13 08:35:28,669 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 08:35:28,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 20 [2018-04-13 08:35:28,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-13 08:35:28,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-13 08:35:28,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2018-04-13 08:35:28,671 INFO L87 Difference]: Start difference. First operand 165 states and 171 transitions. Second operand 20 states. [2018-04-13 08:35:29,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:35:29,142 INFO L93 Difference]: Finished difference Result 184 states and 192 transitions. [2018-04-13 08:35:29,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-13 08:35:29,142 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 161 [2018-04-13 08:35:29,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:35:29,143 INFO L225 Difference]: With dead ends: 184 [2018-04-13 08:35:29,143 INFO L226 Difference]: Without dead ends: 175 [2018-04-13 08:35:29,143 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=996, Unknown=0, NotChecked=0, Total=1260 [2018-04-13 08:35:29,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-04-13 08:35:29,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2018-04-13 08:35:29,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-04-13 08:35:29,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 177 transitions. [2018-04-13 08:35:29,147 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 177 transitions. Word has length 161 [2018-04-13 08:35:29,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:35:29,147 INFO L459 AbstractCegarLoop]: Abstraction has 171 states and 177 transitions. [2018-04-13 08:35:29,148 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-13 08:35:29,148 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 177 transitions. [2018-04-13 08:35:29,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-04-13 08:35:29,149 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:35:29,149 INFO L355 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-04-13 08:35:29,149 INFO L408 AbstractCegarLoop]: === Iteration 33 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:35:29,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1880915746, now seen corresponding path program 6 times [2018-04-13 08:35:29,149 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:35:29,149 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:35:29,150 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:29,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 08:35:29,150 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:29,166 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:35:29,358 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 187 proven. 22 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-04-13 08:35:29,358 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:35:29,358 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:35:29,358 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 08:35:29,413 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-04-13 08:35:29,413 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 08:35:29,419 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:35:29,519 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 180 proven. 23 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2018-04-13 08:35:29,520 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 08:35:29,520 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 21 [2018-04-13 08:35:29,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-13 08:35:29,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-13 08:35:29,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2018-04-13 08:35:29,521 INFO L87 Difference]: Start difference. First operand 171 states and 177 transitions. Second operand 21 states. [2018-04-13 08:35:29,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:35:29,821 INFO L93 Difference]: Finished difference Result 182 states and 189 transitions. [2018-04-13 08:35:29,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-13 08:35:29,821 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 167 [2018-04-13 08:35:29,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:35:29,821 INFO L225 Difference]: With dead ends: 182 [2018-04-13 08:35:29,821 INFO L226 Difference]: Without dead ends: 182 [2018-04-13 08:35:29,822 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=627, Unknown=0, NotChecked=0, Total=756 [2018-04-13 08:35:29,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-04-13 08:35:29,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 179. [2018-04-13 08:35:29,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-04-13 08:35:29,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 186 transitions. [2018-04-13 08:35:29,825 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 186 transitions. Word has length 167 [2018-04-13 08:35:29,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:35:29,825 INFO L459 AbstractCegarLoop]: Abstraction has 179 states and 186 transitions. [2018-04-13 08:35:29,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-13 08:35:29,825 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 186 transitions. [2018-04-13 08:35:29,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-04-13 08:35:29,826 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:35:29,826 INFO L355 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-04-13 08:35:29,826 INFO L408 AbstractCegarLoop]: === Iteration 34 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:35:29,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1181300643, now seen corresponding path program 7 times [2018-04-13 08:35:29,826 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:35:29,826 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:35:29,827 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:29,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 08:35:29,827 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:29,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:29,846 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:35:29,852 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 08:35:29,852 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:35:29,852 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:35:29,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:35:29,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:29,883 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:35: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 6 treesize of output 5 [2018-04-13 08:35:29,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:29,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:35:29,888 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 08:35:29,903 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-13 08:35:29,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 08:35:29,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:29,908 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-04-13 08:35:29,908 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:35:29,919 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_13| Int) (v_prenex_91 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_13|) (* 4 v_prenex_91))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:35:29,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:29,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:29,929 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-04-13 08:35:29,929 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:35:29,932 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_13| Int) (v_prenex_91 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_13|) (* 4 v_prenex_91)))) is different from true [2018-04-13 08:35:29,953 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-04-13 08:35:29,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 08:35:29,968 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-04-13 08:35:29,968 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:58 [2018-04-13 08:35:30,010 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:30,010 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:30,011 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-04-13 08:35:30,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:30,028 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-04-13 08:35:30,028 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:23 [2018-04-13 08:35:30,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:30,090 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:30,091 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-04-13 08:35:30,091 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:35:30,100 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_13| Int) (v_prenex_96 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_13|) (* 4 v_prenex_96))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:35:30,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:30,102 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:30,106 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-04-13 08:35:30,106 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:35:30,107 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_13| Int) (v_prenex_96 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_13|) (* 4 v_prenex_96))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))))) is different from true [2018-04-13 08:35:30,121 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-04-13 08:35:30,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-13 08:35:30,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-04-13 08:35:30,144 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-04-13 08:35:30,199 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:35:30,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:30,207 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:30,207 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:30,208 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-04-13 08:35:30,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:30,213 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-04-13 08:35:30,213 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:69, output treesize:23 [2018-04-13 08:35:30,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:30,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:30,249 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-04-13 08:35:30,249 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:35:30,259 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_13| Int) (v_prenex_109 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_13|) (* 4 v_prenex_109))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:35:30,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:30,262 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:30,266 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-04-13 08:35:30,267 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:35:30,269 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_13| Int) (v_prenex_109 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_13|) (* 4 v_prenex_109)))) is different from true [2018-04-13 08:35:30,285 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-04-13 08:35:30,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-13 08:35:30,313 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-04-13 08:35:30,313 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-04-13 08:35:30,494 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:35:30,501 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-04-13 08:35:30,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:30,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:30,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:30,505 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-04-13 08:35:30,505 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-04-13 08:35:30,517 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_13| Int) (v_prenex_121 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_13|) (* 4 v_prenex_121)))) is different from true [2018-04-13 08:35:30,523 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:30,524 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:30,524 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-04-13 08:35:30,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:30,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, 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-04-13 08:35:30,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 08:35:30,569 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-04-13 08:35:30,569 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:60, output treesize:86 [2018-04-13 08:35:30,660 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 237 trivial. 118 not checked. [2018-04-13 08:35:30,661 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 08:35:30,661 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-13 08:35:30,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-13 08:35:30,661 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-13 08:35:30,661 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=193, Unknown=9, NotChecked=324, Total=600 [2018-04-13 08:35:30,661 INFO L87 Difference]: Start difference. First operand 179 states and 186 transitions. Second operand 25 states. [2018-04-13 08:35:30,719 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_13| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_13|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-13 08:35:30,720 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:35:30,738 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_13| Int) (v_prenex_96 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_13|) (* 4 v_prenex_96))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_13| Int) (v_prenex_109 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_13|) (* 4 v_prenex_109))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_13| Int) (v_prenex_91 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_13|) (* 4 v_prenex_91))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_13| Int) (v_prenex_121 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_13|) (* 4 v_prenex_121)))) is different from true [2018-04-13 08:35:30,739 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_13| Int) (v_prenex_96 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_13|) (* 4 v_prenex_96))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_13| Int) (v_prenex_91 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_13|) (* 4 v_prenex_91))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:35:30,741 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_13| Int) (v_prenex_96 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_13|) (* 4 v_prenex_96))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_13| Int) (v_prenex_91 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_13|) (* 4 v_prenex_91)))) is different from true [2018-04-13 08:35:31,037 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_13| Int) (v_prenex_109 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_13|) (* 4 v_prenex_109))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_13| Int) (v_prenex_121 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_13|) (* 4 v_prenex_121)))) is different from true [2018-04-13 08:35:31,040 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_13| Int) (v_prenex_109 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_13|) (* 4 v_prenex_109))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_13| Int) (v_prenex_121 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_13|) (* 4 v_prenex_121)))) is different from true [2018-04-13 08:35:31,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:35:31,239 INFO L93 Difference]: Finished difference Result 210 states and 222 transitions. [2018-04-13 08:35:31,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-13 08:35:31,239 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 172 [2018-04-13 08:35:31,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:35:31,240 INFO L225 Difference]: With dead ends: 210 [2018-04-13 08:35:31,240 INFO L226 Difference]: Without dead ends: 210 [2018-04-13 08:35:31,240 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 144 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=153, Invalid=401, Unknown=16, NotChecked=912, Total=1482 [2018-04-13 08:35:31,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-04-13 08:35:31,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 192. [2018-04-13 08:35:31,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-04-13 08:35:31,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 201 transitions. [2018-04-13 08:35:31,243 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 201 transitions. Word has length 172 [2018-04-13 08:35:31,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:35:31,244 INFO L459 AbstractCegarLoop]: Abstraction has 192 states and 201 transitions. [2018-04-13 08:35:31,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-13 08:35:31,244 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 201 transitions. [2018-04-13 08:35:31,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-04-13 08:35:31,245 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:35:31,245 INFO L355 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-04-13 08:35:31,245 INFO L408 AbstractCegarLoop]: === Iteration 35 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:35:31,245 INFO L82 PathProgramCache]: Analyzing trace with hash -2055653370, now seen corresponding path program 8 times [2018-04-13 08:35:31,246 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:35:31,246 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:35:31,246 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:31,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:35:31,246 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:31,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:31,265 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:35:31,270 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 08:35:31,270 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:35:31,271 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:35:31,271 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 08:35:31,301 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 08:35:31,301 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 08:35:31,307 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:35:31,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 6 treesize of output 5 [2018-04-13 08:35:31,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:31,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:35:31,314 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 08:35:31,330 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-13 08:35:31,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:31,333 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:31,335 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-04-13 08:35:31,335 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:35:31,345 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_16| Int) (v_prenex_126 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_16|) (* 4 v_prenex_126))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:35:31,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:31,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:31,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-04-13 08:35:31,355 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:35:31,357 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_16| Int) (v_prenex_126 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_16|) (* 4 v_prenex_126))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))))) is different from true [2018-04-13 08:35:31,370 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-04-13 08:35:31,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 08:35:31,386 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-04-13 08:35:31,386 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:58 [2018-04-13 08:35:31,429 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:35:31,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:31,440 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:31,441 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:31,441 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-04-13 08:35:31,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:31,448 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-04-13 08:35:31,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:54, output treesize:23 [2018-04-13 08:35:31,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:31,486 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:31,487 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-04-13 08:35:31,487 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:35:31,500 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_16| Int) (v_prenex_131 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_16|) (* 4 v_prenex_131))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:35:31,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:31,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:31,509 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-04-13 08:35:31,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:35:31,512 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_16| Int) (v_prenex_131 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_16|) (* 4 v_prenex_131))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))))) is different from true [2018-04-13 08:35:31,532 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-04-13 08:35:31,533 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-13 08:35:31,567 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-04-13 08:35:31,567 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-04-13 08:35:32,962 WARN L151 SmtUtils]: Spent 1372ms on a formula simplification. DAG size of input: 79 DAG size of output 49 [2018-04-13 08:35:32,965 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:35:32,965 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:32,982 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:32,983 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:32,983 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-04-13 08:35:32,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:32,990 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-04-13 08:35:32,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:76, output treesize:34 [2018-04-13 08:35:33,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:33,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:33,021 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-04-13 08:35:33,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:35:33,031 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_16| Int) (v_prenex_144 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_16|) (* 4 v_prenex_144))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:35:33,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:33,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:33,039 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-04-13 08:35:33,039 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:35:33,040 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_16| Int) (v_prenex_144 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_16|) (* 4 v_prenex_144))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))))) is different from true [2018-04-13 08:35:33,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-04-13 08:35:33,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-13 08:35:33,078 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-04-13 08:35:33,078 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-04-13 08:35:33,224 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:35:33,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-04-13 08:35:33,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:33,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-04-13 08:35:33,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:33,237 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-04-13 08:35:33,237 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-04-13 08:35:33,249 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_16| Int) (v_prenex_156 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_16|) (* 4 v_prenex_156))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))))) is different from true [2018-04-13 08:35:33,272 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:33,273 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:33,275 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:33,276 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-04-13 08:35:33,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:33,307 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-04-13 08:35:33,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 08:35:33,339 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-04-13 08:35:33,339 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:56, output treesize:86 [2018-04-13 08:35:33,545 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 237 trivial. 120 not checked. [2018-04-13 08:35:33,545 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 08:35:33,545 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-13 08:35:33,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-13 08:35:33,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-13 08:35:33,546 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=193, Unknown=9, NotChecked=324, Total=600 [2018-04-13 08:35:33,547 INFO L87 Difference]: Start difference. First operand 192 states and 201 transitions. Second operand 25 states. [2018-04-13 08:35:33,614 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_16| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_16|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-13 08:35:33,617 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:35:33,640 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_16| Int) (v_prenex_131 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_16|) (* 4 v_prenex_131))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_16| Int) (v_prenex_156 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_16|) (* 4 v_prenex_156))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_16| Int) (v_prenex_126 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_16|) (* 4 v_prenex_126))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_16| Int) (v_prenex_144 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_16|) (* 4 v_prenex_144))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:35:33,644 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_16| Int) (v_prenex_131 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_16|) (* 4 v_prenex_131))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_16| Int) (v_prenex_126 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_16|) (* 4 v_prenex_126))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_16| Int) (v_prenex_144 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_16|) (* 4 v_prenex_144))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:35:33,692 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_16| Int) (v_prenex_131 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_16|) (* 4 v_prenex_131))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_16| Int) (v_prenex_126 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_16|) (* 4 v_prenex_126))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_16| Int) (v_prenex_144 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_16|) (* 4 v_prenex_144))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_16| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_16|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-13 08:35:34,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:35:34,094 INFO L93 Difference]: Finished difference Result 230 states and 248 transitions. [2018-04-13 08:35:34,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-13 08:35:34,094 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 172 [2018-04-13 08:35:34,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:35:34,096 INFO L225 Difference]: With dead ends: 230 [2018-04-13 08:35:34,096 INFO L226 Difference]: Without dead ends: 230 [2018-04-13 08:35:34,096 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 144 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=143, Invalid=391, Unknown=28, NotChecked=770, Total=1332 [2018-04-13 08:35:34,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-04-13 08:35:34,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 184. [2018-04-13 08:35:34,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-04-13 08:35:34,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 193 transitions. [2018-04-13 08:35:34,101 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 193 transitions. Word has length 172 [2018-04-13 08:35:34,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:35:34,102 INFO L459 AbstractCegarLoop]: Abstraction has 184 states and 193 transitions. [2018-04-13 08:35:34,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-13 08:35:34,102 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 193 transitions. [2018-04-13 08:35:34,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-04-13 08:35:34,103 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:35:34,103 INFO L355 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-04-13 08:35:34,103 INFO L408 AbstractCegarLoop]: === Iteration 36 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:35:34,103 INFO L82 PathProgramCache]: Analyzing trace with hash -362497594, now seen corresponding path program 9 times [2018-04-13 08:35:34,103 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:35:34,104 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:35:34,104 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:34,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 08:35:34,104 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:34,125 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:35:34,131 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 08:35:34,131 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:35:34,131 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:35:34,132 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 08:35:34,179 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-13 08:35:34,179 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 08:35:34,186 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:35: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 6 treesize of output 5 [2018-04-13 08:35:34,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:34,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:35:34,192 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 08:35:34,207 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-13 08:35:34,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:34,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:34,212 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-04-13 08:35:34,213 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:35:34,226 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_19| Int) (v_prenex_161 Int)) (= (* 4 v_prenex_161) (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_19|))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:35:34,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:34,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:34,236 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-04-13 08:35:34,236 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:35:34,239 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_19| Int) (v_prenex_161 Int)) (= (* 4 v_prenex_161) (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_19|)))) is different from true [2018-04-13 08:35:34,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 2 case distinctions, treesize of input 14 treesize of output 17 [2018-04-13 08:35:34,252 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 08:35:34,269 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-04-13 08:35:34,269 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:58 [2018-04-13 08:35:34,321 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:34,321 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:34,322 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-04-13 08:35:34,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:34,339 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-04-13 08:35:34,340 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:23 [2018-04-13 08:35:34,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:34,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:34,379 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-04-13 08:35:34,379 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:35:34,393 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_19| Int) (v_prenex_166 Int)) (= (* 4 v_prenex_166) (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_19|)))) is different from true [2018-04-13 08:35:34,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:34,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:34,400 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-04-13 08:35:34,400 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:35:34,401 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_19| Int) (v_prenex_166 Int)) (= (* 4 v_prenex_166) (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_19|)))) is different from true [2018-04-13 08:35:34,415 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-04-13 08:35:34,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-13 08:35:34,440 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-04-13 08:35:34,440 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-04-13 08:35:34,549 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:34,549 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-04-13 08:35:34,549 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:34,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:34,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:34,555 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-04-13 08:35:34,555 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:20, output treesize:13 [2018-04-13 08:35:34,585 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| 0)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:35:34,589 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:34,595 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-04-13 08:35:34,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 08:35:34,614 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:34,615 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:34,616 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:34,617 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-04-13 08:35:34,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:34,638 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-04-13 08:35:34,639 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:52, output treesize:71 [2018-04-13 08:35:34,700 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:35:34,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:34,708 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:34,711 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-04-13 08:35:34,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:34,712 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-04-13 08:35:34,712 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-04-13 08:35:34,722 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_19| Int) (v_prenex_180 Int)) (= (* 4 v_prenex_180) (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_19|)))) is different from true [2018-04-13 08:35:34,727 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:34,731 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:34,731 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-04-13 08:35:34,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:34,750 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-04-13 08:35:34,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 08:35:34,769 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-04-13 08:35:34,769 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:60, output treesize:86 [2018-04-13 08:35:34,865 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 40 proven. 82 refuted. 0 times theorem prover too weak. 127 trivial. 150 not checked. [2018-04-13 08:35:34,865 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 08:35:34,865 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-13 08:35:34,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-13 08:35:34,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-13 08:35:34,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=247, Unknown=8, NotChecked=312, Total=650 [2018-04-13 08:35:34,866 INFO L87 Difference]: Start difference. First operand 184 states and 193 transitions. Second operand 26 states. [2018-04-13 08:35:35,001 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_19| Int) (v_prenex_161 Int)) (= (* 4 v_prenex_161) (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_19|))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_19| Int) (v_prenex_180 Int)) (= (* 4 v_prenex_180) (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_19|))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_19| Int) (v_prenex_166 Int)) (= (* 4 v_prenex_166) (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_19|))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_19| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n) (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_19|)))) is different from true [2018-04-13 08:35:35,003 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_19| Int) (v_prenex_161 Int)) (= (* 4 v_prenex_161) (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_19|))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_19| Int) (v_prenex_180 Int)) (= (* 4 v_prenex_180) (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_19|))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_19| Int) (v_prenex_166 Int)) (= (* 4 v_prenex_166) (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_19|)))) is different from true [2018-04-13 08:35:35,201 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| 0)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_19| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n) (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_19|)))) is different from true [2018-04-13 08:35:35,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:35:35,374 INFO L93 Difference]: Finished difference Result 213 states and 227 transitions. [2018-04-13 08:35:35,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-13 08:35:35,375 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 172 [2018-04-13 08:35:35,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:35:35,376 INFO L225 Difference]: With dead ends: 213 [2018-04-13 08:35:35,376 INFO L226 Difference]: Without dead ends: 213 [2018-04-13 08:35:35,376 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 143 SyntacticMatches, 7 SemanticMatches, 36 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=175, Invalid=560, Unknown=11, NotChecked=660, Total=1406 [2018-04-13 08:35:35,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-04-13 08:35:35,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 193. [2018-04-13 08:35:35,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-04-13 08:35:35,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 204 transitions. [2018-04-13 08:35:35,379 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 204 transitions. Word has length 172 [2018-04-13 08:35:35,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:35:35,379 INFO L459 AbstractCegarLoop]: Abstraction has 193 states and 204 transitions. [2018-04-13 08:35:35,379 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-13 08:35:35,379 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 204 transitions. [2018-04-13 08:35:35,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-04-13 08:35:35,379 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:35:35,380 INFO L355 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-04-13 08:35:35,380 INFO L408 AbstractCegarLoop]: === Iteration 37 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:35:35,380 INFO L82 PathProgramCache]: Analyzing trace with hash 695515689, now seen corresponding path program 3 times [2018-04-13 08:35:35,380 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:35:35,380 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:35:35,380 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:35,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 08:35:35,380 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:35,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:35,393 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:35:35,398 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 08:35:35,398 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:35:35,398 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:35:35,399 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 08:35:35,431 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-13 08:35:35,431 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 08:35:35,436 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:35:35,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:35,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:35,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:35:35,441 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 08:35:35,448 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-13 08:35:35,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:35,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:35,451 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-04-13 08:35:35,452 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:35:35,459 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_185 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_22| Int)) (= (* 4 v_prenex_185) (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_22|))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:35:35,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:35,463 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:35,468 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-04-13 08:35:35,468 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:35:35,470 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((v_prenex_185 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_22| Int)) (= (* 4 v_prenex_185) (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_22|)))) is different from true [2018-04-13 08:35:35,506 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-04-13 08:35:35,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 08:35:35,523 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-04-13 08:35:35,523 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:29, output treesize:52 [2018-04-13 08:35:35,565 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:35:35,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:35,574 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:35,575 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:35,575 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-04-13 08:35:35,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:35,581 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-04-13 08:35:35,582 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:48, output treesize:20 [2018-04-13 08:35:35,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:35,601 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:35,603 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-04-13 08:35:35,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:35:35,615 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_22| Int) (v_prenex_190 Int)) (= (* 4 v_prenex_190) (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_22|))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:35:35,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:35,620 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:35,626 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-04-13 08:35:35,626 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:35:35,628 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_22| Int) (v_prenex_190 Int)) (= (* 4 v_prenex_190) (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_22|)))) is different from true [2018-04-13 08:35:35,650 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-04-13 08:35:35,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-13 08:35:35,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-04-13 08:35:35,686 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:40, output treesize:106 [2018-04-13 08:35:35,831 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:35,831 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-04-13 08:35:35,831 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:35,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:35,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:35,860 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-04-13 08:35:35,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:20, output treesize:13 [2018-04-13 08:35:35,897 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| 0)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:35:35,902 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:35,905 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:35,905 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-04-13 08:35:35,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:35,923 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:35,924 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:35,934 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-04-13 08:35:35,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 08:35:35,961 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-04-13 08:35:35,962 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:49, output treesize:65 [2018-04-13 08:35:36,223 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-04-13 08:35:36,224 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:36,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:36,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:36,228 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-04-13 08:35:36,228 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-04-13 08:35:36,274 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:36,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, 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-04-13 08:35:36,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 08:35:36,319 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:36,320 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:36,321 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:36,322 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-04-13 08:35:36,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:36,343 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-04-13 08:35:36,344 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:58, output treesize:82 [2018-04-13 08:35:36,471 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 71 proven. 129 refuted. 0 times theorem prover too weak. 102 trivial. 103 not checked. [2018-04-13 08:35:36,471 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 08:35:36,471 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-13 08:35:36,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-13 08:35:36,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-13 08:35:36,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=375, Unknown=6, NotChecked=270, Total=756 [2018-04-13 08:35:36,472 INFO L87 Difference]: Start difference. First operand 193 states and 204 transitions. Second operand 28 states. [2018-04-13 08:35:37,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:35:37,860 INFO L93 Difference]: Finished difference Result 268 states and 298 transitions. [2018-04-13 08:35:37,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-13 08:35:37,861 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 172 [2018-04-13 08:35:37,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:35:37,862 INFO L225 Difference]: With dead ends: 268 [2018-04-13 08:35:37,862 INFO L226 Difference]: Without dead ends: 268 [2018-04-13 08:35:37,863 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 143 SyntacticMatches, 10 SemanticMatches, 52 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 838 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=375, Invalid=1896, Unknown=9, NotChecked=582, Total=2862 [2018-04-13 08:35:37,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-04-13 08:35:37,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 228. [2018-04-13 08:35:37,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-04-13 08:35:37,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 258 transitions. [2018-04-13 08:35:37,868 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 258 transitions. Word has length 172 [2018-04-13 08:35:37,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:35:37,869 INFO L459 AbstractCegarLoop]: Abstraction has 228 states and 258 transitions. [2018-04-13 08:35:37,869 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-13 08:35:37,869 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 258 transitions. [2018-04-13 08:35:37,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-04-13 08:35:37,870 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:35:37,870 INFO L355 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 7, 7, 7, 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-04-13 08:35:37,870 INFO L408 AbstractCegarLoop]: === Iteration 38 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:35:37,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1312648301, now seen corresponding path program 4 times [2018-04-13 08:35:37,870 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:35:37,871 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:35:37,871 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:37,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 08:35:37,871 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:37,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:37,885 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:35:38,068 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 250 proven. 40 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2018-04-13 08:35:38,068 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:35:38,068 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:35:38,069 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 08:35:38,086 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 08:35:38,086 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 08:35:38,090 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:35:38,335 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 165 proven. 50 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-04-13 08:35:38,335 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 08:35:38,335 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 26 [2018-04-13 08:35:38,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-13 08:35:38,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-13 08:35:38,336 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2018-04-13 08:35:38,337 INFO L87 Difference]: Start difference. First operand 228 states and 258 transitions. Second operand 26 states. [2018-04-13 08:35:38,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:35:38,944 INFO L93 Difference]: Finished difference Result 259 states and 287 transitions. [2018-04-13 08:35:38,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-13 08:35:38,944 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 178 [2018-04-13 08:35:38,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:35:38,945 INFO L225 Difference]: With dead ends: 259 [2018-04-13 08:35:38,945 INFO L226 Difference]: Without dead ends: 249 [2018-04-13 08:35:38,946 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=232, Invalid=1408, Unknown=0, NotChecked=0, Total=1640 [2018-04-13 08:35:38,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-04-13 08:35:38,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 236. [2018-04-13 08:35:38,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-04-13 08:35:38,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 264 transitions. [2018-04-13 08:35:38,951 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 264 transitions. Word has length 178 [2018-04-13 08:35:38,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:35:38,951 INFO L459 AbstractCegarLoop]: Abstraction has 236 states and 264 transitions. [2018-04-13 08:35:38,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-13 08:35:38,951 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 264 transitions. [2018-04-13 08:35:38,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-04-13 08:35:38,952 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:35:38,952 INFO L355 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-04-13 08:35:38,952 INFO L408 AbstractCegarLoop]: === Iteration 39 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:35:38,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1697700589, now seen corresponding path program 2 times [2018-04-13 08:35:38,953 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:35:38,953 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:35:38,953 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:38,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 08:35:38,953 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:38,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:38,965 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:35:39,010 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-04-13 08:35:39,010 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:35:39,011 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:35:39,011 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 08:35:39,031 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 08:35:39,031 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 08:35:39,035 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:35:39,066 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-04-13 08:35:39,066 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 08:35:39,066 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-04-13 08:35:39,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 08:35:39,067 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 08:35:39,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-04-13 08:35:39,067 INFO L87 Difference]: Start difference. First operand 236 states and 264 transitions. Second operand 8 states. [2018-04-13 08:35:39,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:35:39,110 INFO L93 Difference]: Finished difference Result 272 states and 314 transitions. [2018-04-13 08:35:39,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-13 08:35:39,110 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 180 [2018-04-13 08:35:39,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:35:39,112 INFO L225 Difference]: With dead ends: 272 [2018-04-13 08:35:39,112 INFO L226 Difference]: Without dead ends: 272 [2018-04-13 08:35:39,112 INFO L567 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-04-13 08:35:39,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-04-13 08:35:39,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 252. [2018-04-13 08:35:39,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-04-13 08:35:39,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 280 transitions. [2018-04-13 08:35:39,117 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 280 transitions. Word has length 180 [2018-04-13 08:35:39,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:35:39,118 INFO L459 AbstractCegarLoop]: Abstraction has 252 states and 280 transitions. [2018-04-13 08:35:39,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 08:35:39,118 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 280 transitions. [2018-04-13 08:35:39,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-04-13 08:35:39,119 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:35:39,120 INFO L355 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-04-13 08:35:39,120 INFO L408 AbstractCegarLoop]: === Iteration 40 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:35:39,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1624569478, now seen corresponding path program 10 times [2018-04-13 08:35:39,120 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:35:39,120 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:35:39,121 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:39,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 08:35:39,121 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:39,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:39,137 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:35:39,286 INFO L134 CoverageAnalysis]: Checked inductivity of 806 backedges. 191 proven. 153 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2018-04-13 08:35:39,286 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:35:39,286 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:35:39,286 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 08:35:39,302 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 08:35:39,302 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 08:35:39,307 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:35:39,414 INFO L134 CoverageAnalysis]: Checked inductivity of 806 backedges. 246 proven. 24 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2018-04-13 08:35:39,415 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 08:35:39,415 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 21 [2018-04-13 08:35:39,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-13 08:35:39,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-13 08:35:39,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2018-04-13 08:35:39,416 INFO L87 Difference]: Start difference. First operand 252 states and 280 transitions. Second operand 21 states. [2018-04-13 08:35:40,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:35:40,013 INFO L93 Difference]: Finished difference Result 252 states and 274 transitions. [2018-04-13 08:35:40,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-13 08:35:40,013 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 230 [2018-04-13 08:35:40,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:35:40,015 INFO L225 Difference]: With dead ends: 252 [2018-04-13 08:35:40,015 INFO L226 Difference]: Without dead ends: 252 [2018-04-13 08:35:40,015 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=338, Invalid=1384, Unknown=0, NotChecked=0, Total=1722 [2018-04-13 08:35:40,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-04-13 08:35:40,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 209. [2018-04-13 08:35:40,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-04-13 08:35:40,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 221 transitions. [2018-04-13 08:35:40,020 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 221 transitions. Word has length 230 [2018-04-13 08:35:40,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:35:40,020 INFO L459 AbstractCegarLoop]: Abstraction has 209 states and 221 transitions. [2018-04-13 08:35:40,020 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-13 08:35:40,020 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 221 transitions. [2018-04-13 08:35:40,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-04-13 08:35:40,021 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:35:40,022 INFO L355 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-04-13 08:35:40,022 INFO L408 AbstractCegarLoop]: === Iteration 41 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:35:40,022 INFO L82 PathProgramCache]: Analyzing trace with hash 184031125, now seen corresponding path program 11 times [2018-04-13 08:35:40,022 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:35:40,022 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:35:40,023 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:40,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 08:35:40,023 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:40,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:40,050 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:35:40,058 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 08:35:40,058 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:35:40,058 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:35:40,061 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 08:35:40,258 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-04-13 08:35:40,258 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 08:35:40,279 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:35:40,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 08:35:40,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:40,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:35:40,284 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 08:35:40,299 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-04-13 08:35:40,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:40,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:35:40,303 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:12 [2018-04-13 08:35:40,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:40,328 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:40,329 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-04-13 08:35:40,329 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:35:40,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:40,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:40,359 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-04-13 08:35:40,359 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:17 [2018-04-13 08:35:40,376 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:40,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 23 [2018-04-13 08:35:40,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 08:35:40,398 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 2 xjuncts. [2018-04-13 08:35:40,398 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:44 [2018-04-13 08:35:40,430 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:40,431 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:40,431 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-04-13 08:35:40,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:40,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 08:35:40,451 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:68, output treesize:26 [2018-04-13 08:35:40,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:40,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:40,663 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-04-13 08:35:40,664 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:14, output treesize:13 [2018-04-13 08:35:40,724 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:40,729 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-04-13 08:35:40,730 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 08:35:40,742 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-04-13 08:35:40,743 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:23, output treesize:40 [2018-04-13 08:35:40,786 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:40,788 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:40,802 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 23 treesize of output 42 [2018-04-13 08:35:40,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-13 08:35:40,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2018-04-13 08:35:40,843 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:115 [2018-04-13 08:35:40,942 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:35:40,942 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:40,951 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:40,952 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:40,953 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-04-13 08:35:40,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:40,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 08:35:40,959 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:85, output treesize:30 [2018-04-13 08:35:41,064 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1 Int)) (and (<= 0 (+ |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1))) (<= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1 0))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (<= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~n|)))) is different from true [2018-04-13 08:35:41,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:41,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:41,074 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-04-13 08:35:41,074 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:35:41,107 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1 Int)) (and (<= 0 (+ |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1))) (<= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1 0))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (<= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~n|))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~n_BEFORE_CALL_1| Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_25| Int)) (= (* 4 |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~n_BEFORE_CALL_1|) (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_25|)))) is different from true [2018-04-13 08:35:41,120 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:41,132 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 21 treesize of output 38 [2018-04-13 08:35:41,133 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-13 08:35:41,177 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-04-13 08:35:41,177 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:58, output treesize:156 [2018-04-13 08:35:41,439 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (<= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~n|))) is different from true [2018-04-13 08:35:41,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-04-13 08:35:41,444 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:41,445 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-04-13 08:35:41,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:35:41,490 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (<= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~n|))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~n_BEFORE_CALL_1| Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_25| Int)) (= (* 4 |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~n_BEFORE_CALL_1|) (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_25|)))) is different from true [2018-04-13 08:35:41,496 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:41,498 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:41,498 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:41,506 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 4 case distinctions, treesize of input 21 treesize of output 44 [2018-04-13 08:35:41,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-13 08:35:41,539 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-04-13 08:35:41,539 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:49, output treesize:132 [2018-04-13 08:35:41,752 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (<= (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0))) is different from true [2018-04-13 08:35:41,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 8 treesize of output 7 [2018-04-13 08:35:41,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:41,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-13 08:35:41,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:41,766 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-04-13 08:35:41,766 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-04-13 08:35:41,780 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (<= (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~n_BEFORE_CALL_1| Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_25| Int)) (= (* 4 |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~n_BEFORE_CALL_1|) (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_25|)))) is different from true [2018-04-13 08:35:41,787 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:41,787 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:41,789 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:41,795 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-04-13 08:35:41,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 08:35:41,825 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:41,826 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:41,826 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-04-13 08:35:41,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:41,843 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-04-13 08:35:41,843 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:56, output treesize:87 [2018-04-13 08:35:42,033 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 24 proven. 184 refuted. 0 times theorem prover too weak. 359 trivial. 358 not checked. [2018-04-13 08:35:42,033 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 08:35:42,033 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-04-13 08:35:42,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-13 08:35:42,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-13 08:35:42,034 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1201, Unknown=10, NotChecked=450, Total=1806 [2018-04-13 08:35:42,034 INFO L87 Difference]: Start difference. First operand 209 states and 221 transitions. Second operand 43 states. [2018-04-13 08:35:43,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:35:43,958 INFO L93 Difference]: Finished difference Result 232 states and 250 transitions. [2018-04-13 08:35:43,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-13 08:35:43,958 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 241 [2018-04-13 08:35:43,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:35:43,959 INFO L225 Difference]: With dead ends: 232 [2018-04-13 08:35:43,959 INFO L226 Difference]: Without dead ends: 232 [2018-04-13 08:35:43,960 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 195 SyntacticMatches, 7 SemanticMatches, 65 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1144 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=393, Invalid=3277, Unknown=14, NotChecked=738, Total=4422 [2018-04-13 08:35:43,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-04-13 08:35:43,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 214. [2018-04-13 08:35:43,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-04-13 08:35:43,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 228 transitions. [2018-04-13 08:35:43,964 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 228 transitions. Word has length 241 [2018-04-13 08:35:43,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:35:43,965 INFO L459 AbstractCegarLoop]: Abstraction has 214 states and 228 transitions. [2018-04-13 08:35:43,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-13 08:35:43,965 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 228 transitions. [2018-04-13 08:35:43,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-04-13 08:35:43,966 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:35:43,967 INFO L355 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-04-13 08:35:43,967 INFO L408 AbstractCegarLoop]: === Iteration 42 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:35:43,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1359767112, now seen corresponding path program 12 times [2018-04-13 08:35:43,967 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:35:43,967 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:35:43,968 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:43,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 08:35:43,968 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:43,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:43,998 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:35:44,005 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 08:35:44,005 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:35:44,005 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:35:44,006 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 08:35:44,120 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-04-13 08:35:44,121 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 08:35:44,132 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:35:44,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:44,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:44,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:35:44,149 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 08:35:44,163 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-13 08:35:44,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:44,167 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:44,168 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-04-13 08:35:44,168 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:35:44,180 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_28| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_28|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_242 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_242)) |c_#length|))) is different from true [2018-04-13 08:35:44,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 6 treesize of output 5 [2018-04-13 08:35:44,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:44,190 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-04-13 08:35:44,190 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:35:44,192 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_28| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_28|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_242 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_242)) |c_#length|)))) is different from true [2018-04-13 08:35:44,202 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-04-13 08:35:44,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 08:35:44,217 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-04-13 08:35:44,218 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:58 [2018-04-13 08:35:44,271 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:44,272 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:44,273 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-04-13 08:35:44,273 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:44,289 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-04-13 08:35:44,289 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:23 [2018-04-13 08:35:44,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:44,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:44,329 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-04-13 08:35:44,329 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:35:44,342 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_28| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_28|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_247 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_247)) |c_#length|))) is different from true [2018-04-13 08:35:44,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:44,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:44,352 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-04-13 08:35:44,352 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:35:44,363 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_28| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_28|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_247 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_247)) |c_#length|)))) is different from true [2018-04-13 08:35:44,383 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-04-13 08:35:44,384 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-13 08:35:44,420 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-04-13 08:35:44,420 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-04-13 08:35:44,509 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:44,510 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-04-13 08:35:44,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:44,526 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-04-13 08:35:44,526 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:69, output treesize:23 [2018-04-13 08:35:44,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:44,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:44,570 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-04-13 08:35:44,570 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:35:44,582 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_28| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_28|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_259 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_259)) |c_#length|))) is different from true [2018-04-13 08:35:44,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:44,586 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:44,591 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-04-13 08:35:44,591 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:35:44,593 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_28| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_28|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_259 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_259)) |c_#length|)))) is different from true [2018-04-13 08:35:44,613 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-04-13 08:35:44,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-13 08:35:44,654 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-04-13 08:35:44,654 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-04-13 08:35:44,726 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:35:44,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:44,735 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:44,736 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:44,736 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-04-13 08:35:44,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:44,741 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-04-13 08:35:44,741 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:69, output treesize:23 [2018-04-13 08:35:44,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 8 treesize of output 7 [2018-04-13 08:35:44,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:44,777 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-04-13 08:35:44,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:35:44,786 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_28| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_28|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_271 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_271)) |c_#length|))) is different from true [2018-04-13 08:35:44,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:44,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:44,792 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-04-13 08:35:44,792 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:35:44,793 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_28| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_28|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_271 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_271)) |c_#length|)))) is different from true [2018-04-13 08:35:44,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-04-13 08:35:44,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-13 08:35:44,836 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-04-13 08:35:44,836 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-04-13 08:35:45,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:45,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:45,037 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-04-13 08:35:45,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:45,039 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-04-13 08:35:45,039 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-04-13 08:35:45,068 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:45,068 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:45,076 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-04-13 08:35:45,076 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 08:35:45,100 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:45,100 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:45,102 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:45,102 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-04-13 08:35:45,102 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:45,118 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-04-13 08:35:45,118 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:45, output treesize:64 [2018-04-13 08:35:45,259 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 10 proven. 86 refuted. 0 times theorem prover too weak. 577 trivial. 252 not checked. [2018-04-13 08:35:45,259 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 08:35:45,259 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-04-13 08:35:45,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-13 08:35:45,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-13 08:35:45,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=428, Unknown=9, NotChecked=450, Total=992 [2018-04-13 08:35:45,260 INFO L87 Difference]: Start difference. First operand 214 states and 228 transitions. Second operand 32 states. [2018-04-13 08:35:46,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:35:46,378 INFO L93 Difference]: Finished difference Result 230 states and 248 transitions. [2018-04-13 08:35:46,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-13 08:35:46,378 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 241 [2018-04-13 08:35:46,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:35:46,379 INFO L225 Difference]: With dead ends: 230 [2018-04-13 08:35:46,379 INFO L226 Difference]: Without dead ends: 230 [2018-04-13 08:35:46,380 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 203 SyntacticMatches, 16 SemanticMatches, 49 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=275, Invalid=1459, Unknown=24, NotChecked=792, Total=2550 [2018-04-13 08:35:46,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-04-13 08:35:46,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 212. [2018-04-13 08:35:46,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-04-13 08:35:46,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 225 transitions. [2018-04-13 08:35:46,383 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 225 transitions. Word has length 241 [2018-04-13 08:35:46,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:35:46,384 INFO L459 AbstractCegarLoop]: Abstraction has 212 states and 225 transitions. [2018-04-13 08:35:46,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-13 08:35:46,384 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 225 transitions. [2018-04-13 08:35:46,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-04-13 08:35:46,385 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:35:46,385 INFO L355 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-04-13 08:35:46,385 INFO L408 AbstractCegarLoop]: === Iteration 43 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:35:46,386 INFO L82 PathProgramCache]: Analyzing trace with hash -2128500513, now seen corresponding path program 3 times [2018-04-13 08:35:46,386 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:35:46,386 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:35:46,386 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:46,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 08:35:46,386 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:46,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:46,407 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:35:46,481 INFO L134 CoverageAnalysis]: Checked inductivity of 943 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 863 trivial. 0 not checked. [2018-04-13 08:35:46,482 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:35:46,482 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:35:46,482 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 08:35:46,490 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-04-13 08:35:46,490 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 08:35:46,493 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:35:46,563 INFO L134 CoverageAnalysis]: Checked inductivity of 943 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 925 trivial. 0 not checked. [2018-04-13 08:35:46,563 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-13 08:35:46,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2018-04-13 08:35:46,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-13 08:35:46,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-13 08:35:46,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-04-13 08:35:46,564 INFO L87 Difference]: Start difference. First operand 212 states and 225 transitions. Second operand 13 states. [2018-04-13 08:35:46,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:35:46,738 INFO L93 Difference]: Finished difference Result 221 states and 235 transitions. [2018-04-13 08:35:46,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-13 08:35:46,738 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 249 [2018-04-13 08:35:46,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:35:46,739 INFO L225 Difference]: With dead ends: 221 [2018-04-13 08:35:46,739 INFO L226 Difference]: Without dead ends: 221 [2018-04-13 08:35:46,740 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=296, Invalid=634, Unknown=0, NotChecked=0, Total=930 [2018-04-13 08:35:46,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-04-13 08:35:46,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 215. [2018-04-13 08:35:46,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-04-13 08:35:46,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 228 transitions. [2018-04-13 08:35:46,742 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 228 transitions. Word has length 249 [2018-04-13 08:35:46,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:35:46,742 INFO L459 AbstractCegarLoop]: Abstraction has 215 states and 228 transitions. [2018-04-13 08:35:46,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-13 08:35:46,742 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 228 transitions. [2018-04-13 08:35:46,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-04-13 08:35:46,743 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:35:46,743 INFO L355 BasicCegarLoop]: trace histogram [20, 20, 14, 14, 14, 14, 14, 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-04-13 08:35:46,743 INFO L408 AbstractCegarLoop]: === Iteration 44 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:35:46,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1754272029, now seen corresponding path program 13 times [2018-04-13 08:35:46,743 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:35:46,743 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:35:46,744 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:46,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 08:35:46,744 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:46,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:46,758 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:35:46,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1686 backedges. 373 proven. 234 refuted. 0 times theorem prover too weak. 1079 trivial. 0 not checked. [2018-04-13 08:35:46,976 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:35:46,977 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:35:46,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:35:46,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:47,003 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:35:47,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1686 backedges. 446 proven. 44 refuted. 0 times theorem prover too weak. 1196 trivial. 0 not checked. [2018-04-13 08:35:47,120 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 08:35:47,120 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 24 [2018-04-13 08:35:47,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-13 08:35:47,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-13 08:35:47,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2018-04-13 08:35:47,121 INFO L87 Difference]: Start difference. First operand 215 states and 228 transitions. Second operand 24 states. [2018-04-13 08:35:47,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:35:47,647 INFO L93 Difference]: Finished difference Result 234 states and 250 transitions. [2018-04-13 08:35:47,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-13 08:35:47,647 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 310 [2018-04-13 08:35:47,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:35:47,648 INFO L225 Difference]: With dead ends: 234 [2018-04-13 08:35:47,649 INFO L226 Difference]: Without dead ends: 234 [2018-04-13 08:35:47,649 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=454, Invalid=1898, Unknown=0, NotChecked=0, Total=2352 [2018-04-13 08:35:47,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-04-13 08:35:47,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 230. [2018-04-13 08:35:47,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-04-13 08:35:47,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 246 transitions. [2018-04-13 08:35:47,651 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 246 transitions. Word has length 310 [2018-04-13 08:35:47,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:35:47,652 INFO L459 AbstractCegarLoop]: Abstraction has 230 states and 246 transitions. [2018-04-13 08:35:47,652 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-13 08:35:47,652 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 246 transitions. [2018-04-13 08:35:47,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-04-13 08:35:47,653 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:35:47,653 INFO L355 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-04-13 08:35:47,653 INFO L408 AbstractCegarLoop]: === Iteration 45 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:35:47,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1272749241, now seen corresponding path program 14 times [2018-04-13 08:35:47,653 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:35:47,653 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:35:47,654 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:47,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:35:47,654 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:47,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:47,669 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:35:48,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1782 backedges. 761 proven. 63 refuted. 0 times theorem prover too weak. 958 trivial. 0 not checked. [2018-04-13 08:35:48,178 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:35:48,178 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:35:48,179 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 08:35:48,201 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 08:35:48,201 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 08:35:48,206 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:35:48,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1782 backedges. 801 proven. 38 refuted. 0 times theorem prover too weak. 943 trivial. 0 not checked. [2018-04-13 08:35:48,407 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 08:35:48,407 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 31 [2018-04-13 08:35:48,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-13 08:35:48,408 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-13 08:35:48,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=799, Unknown=0, NotChecked=0, Total=930 [2018-04-13 08:35:48,408 INFO L87 Difference]: Start difference. First operand 230 states and 246 transitions. Second operand 31 states. [2018-04-13 08:35:49,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:35:49,131 INFO L93 Difference]: Finished difference Result 273 states and 296 transitions. [2018-04-13 08:35:49,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-13 08:35:49,131 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 316 [2018-04-13 08:35:49,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:35:49,133 INFO L225 Difference]: With dead ends: 273 [2018-04-13 08:35:49,133 INFO L226 Difference]: Without dead ends: 265 [2018-04-13 08:35:49,134 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=406, Invalid=2564, Unknown=0, NotChecked=0, Total=2970 [2018-04-13 08:35:49,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-04-13 08:35:49,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 238. [2018-04-13 08:35:49,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-04-13 08:35:49,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 257 transitions. [2018-04-13 08:35:49,139 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 257 transitions. Word has length 316 [2018-04-13 08:35:49,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:35:49,139 INFO L459 AbstractCegarLoop]: Abstraction has 238 states and 257 transitions. [2018-04-13 08:35:49,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-13 08:35:49,139 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 257 transitions. [2018-04-13 08:35:49,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-04-13 08:35:49,141 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:35:49,141 INFO L355 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, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 08:35:49,141 INFO L408 AbstractCegarLoop]: === Iteration 46 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:35:49,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1088356460, now seen corresponding path program 15 times [2018-04-13 08:35:49,142 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:35:49,142 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:35:49,143 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:49,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 08:35:49,143 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:49,181 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:35:49,191 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 08:35:49,191 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:35:49,191 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:35:49,192 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 08:35:49,394 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-04-13 08:35:49,394 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 08:35:49,418 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:35:49,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:49,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:49,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:35:49,431 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 08:35:49,445 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-13 08:35:49,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 8 treesize of output 7 [2018-04-13 08:35:49,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:49,449 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-04-13 08:35:49,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:35:49,457 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_32| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n) (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_32|))) (exists ((v_prenex_286 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_286)) |c_#length|))) is different from true [2018-04-13 08:35:49,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:49,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:49,464 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-04-13 08:35:49,464 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:35:49,465 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_32| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n) (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_32|))) (exists ((v_prenex_286 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_286)) |c_#length|)))) is different from true [2018-04-13 08:35:49,474 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-04-13 08:35:49,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 08:35:49,486 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-04-13 08:35:49,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:58 [2018-04-13 08:35:49,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:49,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:49,646 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:49,646 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-04-13 08:35:49,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:49,650 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-04-13 08:35:49,650 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:20, output treesize:13 [2018-04-13 08:35:49,703 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:49,703 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:49,705 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:49,705 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-04-13 08:35:49,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:49,717 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:49,718 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:49,724 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-04-13 08:35:49,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 08:35:49,742 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-04-13 08:35:49,742 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:48, output treesize:71 [2018-04-13 08:35:49,781 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:49,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-04-13 08:35:49,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:49,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:49,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:49,786 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-04-13 08:35:49,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:20, output treesize:13 [2018-04-13 08:35:49,811 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| 0)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:35:49,814 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:49,815 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:49,816 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:49,817 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-04-13 08:35:49,817 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:49,829 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:49,829 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:49,836 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-04-13 08:35:49,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 08:35:49,855 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-04-13 08:35:49,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:48, output treesize:71 [2018-04-13 08:35:49,899 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:49,899 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-04-13 08:35:49,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:49,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:49,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:49,905 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-04-13 08:35:49,905 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:20, output treesize:13 [2018-04-13 08:35:49,934 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:49,934 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:49,936 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:49,937 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-04-13 08:35:49,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:49,950 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:49,950 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:49,957 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-04-13 08:35:49,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 08:35:49,976 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-04-13 08:35:49,976 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:48, output treesize:71 [2018-04-13 08:35:50,046 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:50,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-04-13 08:35:50,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:50,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 08:35:50,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:50,057 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-04-13 08:35:50,057 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:20, output treesize:13 [2018-04-13 08:35:50,104 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:50,106 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:50,107 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:50,108 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-04-13 08:35:50,109 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:50,136 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:50,138 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:50,147 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-04-13 08:35:50,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 08:35:50,177 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-04-13 08:35:50,177 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:48, output treesize:71 [2018-04-13 08:35:50,303 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:35:50,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:50,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:50,332 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-04-13 08:35:50,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:50,334 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-04-13 08:35:50,335 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-04-13 08:35:50,354 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_32| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n) (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_32|))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (v_prenex_306 Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_306)))))) is different from true [2018-04-13 08:35:50,364 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:50,365 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:50,375 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-04-13 08:35:50,376 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 08:35:50,410 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:50,411 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:50,413 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:50,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-04-13 08:35:50,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:50,439 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-04-13 08:35:50,439 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:56, output treesize:86 [2018-04-13 08:35:50,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1864 backedges. 54 proven. 524 refuted. 0 times theorem prover too weak. 810 trivial. 476 not checked. [2018-04-13 08:35:50,805 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 08:35:50,805 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-13 08:35:50,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-13 08:35:50,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-13 08:35:50,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=371, Unknown=7, NotChecked=270, Total=756 [2018-04-13 08:35:50,805 INFO L87 Difference]: Start difference. First operand 238 states and 257 transitions. Second operand 28 states. [2018-04-13 08:35:51,243 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_32| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n) (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_32|))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| 0)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (v_prenex_306 Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_306)))))) is different from true [2018-04-13 08:35:51,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:35:51,469 INFO L93 Difference]: Finished difference Result 286 states and 317 transitions. [2018-04-13 08:35:51,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-13 08:35:51,469 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 321 [2018-04-13 08:35:51,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:35:51,470 INFO L225 Difference]: With dead ends: 286 [2018-04-13 08:35:51,470 INFO L226 Difference]: Without dead ends: 286 [2018-04-13 08:35:51,470 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 283 SyntacticMatches, 27 SemanticMatches, 38 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 642 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=230, Invalid=845, Unknown=9, NotChecked=476, Total=1560 [2018-04-13 08:35:51,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-04-13 08:35:51,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 269. [2018-04-13 08:35:51,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-04-13 08:35:51,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 297 transitions. [2018-04-13 08:35:51,473 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 297 transitions. Word has length 321 [2018-04-13 08:35:51,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:35:51,473 INFO L459 AbstractCegarLoop]: Abstraction has 269 states and 297 transitions. [2018-04-13 08:35:51,473 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-13 08:35:51,473 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 297 transitions. [2018-04-13 08:35:51,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-04-13 08:35:51,475 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:35:51,475 INFO L355 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-04-13 08:35:51,475 INFO L408 AbstractCegarLoop]: === Iteration 47 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:35:51,475 INFO L82 PathProgramCache]: Analyzing trace with hash -401515543, now seen corresponding path program 16 times [2018-04-13 08:35:51,475 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:35:51,475 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:35:51,475 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:51,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 08:35:51,476 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:51,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:51,500 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:35:51,506 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 08:35:51,506 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:35:51,506 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:35:51,506 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 08:35:51,626 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 08:35:51,626 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 08:35:51,637 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:35:51,658 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-04-13 08:35:51,658 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:51,662 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-04-13 08:35:51,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:51,663 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:51,664 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:35:51,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:35:51,666 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:24, output treesize:15 [2018-04-13 08:35:51,737 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-04-13 08:35:51,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:51,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:51,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:35:51,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:35:51,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:11, output treesize:1 [2018-04-13 08:35:51,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:51,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:51,764 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-04-13 08:35:51,765 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:21, output treesize:20 [2018-04-13 08:35:51,804 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-04-13 08:35:51,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:51,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:51,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 17 treesize of output 22 [2018-04-13 08:35:51,825 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 08:35:51,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 08:35:51,843 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-04-13 08:35:51,843 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:30, output treesize:32 [2018-04-13 08:35:51,862 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:35:51,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:51,864 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:51,864 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:51,865 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-04-13 08:35:51,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:51,872 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-04-13 08:35:51,873 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:51,874 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:51,874 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-04-13 08:35:51,875 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:51,879 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:35:51,885 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-04-13 08:35:51,886 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:66, output treesize:22 [2018-04-13 08:35:52,067 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 31 treesize of output 24 [2018-04-13 08:35:52,068 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:52,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 22 [2018-04-13 08:35:52,070 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:52,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 18 treesize of output 31 [2018-04-13 08:35:52,070 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:52,074 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:35:52,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:35:52,081 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 29 treesize of output 26 [2018-04-13 08:35:52,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 21 treesize of output 24 [2018-04-13 08:35:52,084 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 24 treesize of output 25 [2018-04-13 08:35:52,085 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:52,087 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:35:52,091 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:35:52,101 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 31 treesize of output 41 [2018-04-13 08:35:52,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-04-13 08:35:52,104 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 24 treesize of output 25 [2018-04-13 08:35:52,104 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:52,108 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:35:52,120 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:52,120 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:52,122 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 27 treesize of output 38 [2018-04-13 08:35:52,124 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:52,125 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:52,132 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 2 case distinctions, treesize of input 20 treesize of output 47 [2018-04-13 08:35:52,132 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-04-13 08:35:52,143 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 08:35:52,153 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 08:35:52,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-04-13 08:35:52,166 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:36, output treesize:60 [2018-04-13 08:35:52,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 6 treesize of output 5 [2018-04-13 08:35:52,500 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:52,510 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-04-13 08:35:52,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:78, output treesize:77 [2018-04-13 08:35:52,512 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~i~0 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (let ((.cse2 (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~i~0))) (let ((.cse0 (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset .cse2))) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (<= 4 .cse0) (<= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~i~0 1) (= 0 (let ((.cse1 (select |c_#memory_int| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|))) (+ (select .cse1 (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset .cse2 (- 4))) (select .cse1 .cse0)))) (<= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset 0) (= |c_#memory_int| (store |c_old(#memory_int)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (let ((.cse3 (store (select |c_old(#memory_int)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0 (select (select |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset|)))) (store .cse3 4 (select (select (store |c_old(#memory_int)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| .cse3) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|) (+ |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset| 4)))))))))) is different from true [2018-04-13 08:35:52,553 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:52,553 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 40 treesize of output 45 [2018-04-13 08:35:52,556 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:52,556 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:52,558 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:52,559 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:35:52,561 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:52,562 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:52,569 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 83 [2018-04-13 08:35:52,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:52,673 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 42 treesize of output 65 [2018-04-13 08:35:52,673 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:52,702 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:52,703 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:52,704 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:52,705 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 20 treesize of output 41 [2018-04-13 08:35:52,705 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:52,716 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:35:52,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:35:52,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 08:35:52,732 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:96, output treesize:73 [2018-04-13 08:35:52,780 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:35:52,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:52,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:35:52,781 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:93, output treesize:1 [2018-04-13 08:35:52,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1862 backedges. 827 proven. 71 refuted. 0 times theorem prover too weak. 958 trivial. 6 not checked. [2018-04-13 08:35:52,915 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 08:35:52,915 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-04-13 08:35:52,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-13 08:35:52,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-13 08:35:52,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1094, Unknown=6, NotChecked=66, Total=1260 [2018-04-13 08:35:52,916 INFO L87 Difference]: Start difference. First operand 269 states and 297 transitions. Second operand 36 states. [2018-04-13 08:35:54,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:35:54,729 INFO L93 Difference]: Finished difference Result 277 states and 305 transitions. [2018-04-13 08:35:54,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-13 08:35:54,729 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 321 [2018-04-13 08:35:54,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:35:54,729 INFO L225 Difference]: With dead ends: 277 [2018-04-13 08:35:54,729 INFO L226 Difference]: Without dead ends: 271 [2018-04-13 08:35:54,730 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 285 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=195, Invalid=2663, Unknown=8, NotChecked=104, Total=2970 [2018-04-13 08:35:54,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-04-13 08:35:54,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2018-04-13 08:35:54,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-04-13 08:35:54,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 299 transitions. [2018-04-13 08:35:54,733 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 299 transitions. Word has length 321 [2018-04-13 08:35:54,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:35:54,733 INFO L459 AbstractCegarLoop]: Abstraction has 271 states and 299 transitions. [2018-04-13 08:35:54,733 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-13 08:35:54,733 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 299 transitions. [2018-04-13 08:35:54,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-04-13 08:35:54,734 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:35:54,734 INFO L355 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-04-13 08:35:54,734 INFO L408 AbstractCegarLoop]: === Iteration 48 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:35:54,734 INFO L82 PathProgramCache]: Analyzing trace with hash 193721796, now seen corresponding path program 17 times [2018-04-13 08:35:54,734 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:35:54,734 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:35:54,735 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:54,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 08:35:54,735 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:54,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:54,751 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:35:54,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1949 backedges. 140 proven. 468 refuted. 0 times theorem prover too weak. 1341 trivial. 0 not checked. [2018-04-13 08:35:54,961 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:35:54,961 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:35:54,961 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 08:35:54,993 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-04-13 08:35:54,994 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 08:35:55,000 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:35:55,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1949 backedges. 917 proven. 22 refuted. 0 times theorem prover too weak. 1010 trivial. 0 not checked. [2018-04-13 08:35:55,145 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 08:35:55,145 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2018-04-13 08:35:55,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-13 08:35:55,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-13 08:35:55,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2018-04-13 08:35:55,146 INFO L87 Difference]: Start difference. First operand 271 states and 299 transitions. Second operand 21 states. [2018-04-13 08:35:55,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:35:55,470 INFO L93 Difference]: Finished difference Result 258 states and 280 transitions. [2018-04-13 08:35:55,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-13 08:35:55,470 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 326 [2018-04-13 08:35:55,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:35:55,471 INFO L225 Difference]: With dead ends: 258 [2018-04-13 08:35:55,471 INFO L226 Difference]: Without dead ends: 258 [2018-04-13 08:35:55,472 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=773, Unknown=0, NotChecked=0, Total=930 [2018-04-13 08:35:55,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-04-13 08:35:55,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2018-04-13 08:35:55,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-04-13 08:35:55,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 280 transitions. [2018-04-13 08:35:55,475 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 280 transitions. Word has length 326 [2018-04-13 08:35:55,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:35:55,476 INFO L459 AbstractCegarLoop]: Abstraction has 258 states and 280 transitions. [2018-04-13 08:35:55,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-13 08:35:55,476 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 280 transitions. [2018-04-13 08:35:55,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-04-13 08:35:55,478 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:35:55,478 INFO L355 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-04-13 08:35:55,478 INFO L408 AbstractCegarLoop]: === Iteration 49 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:35:55,478 INFO L82 PathProgramCache]: Analyzing trace with hash -455441777, now seen corresponding path program 18 times [2018-04-13 08:35:55,478 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:35:55,478 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:35:55,479 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:55,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 08:35:55,479 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:35:55,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:35:55,515 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:35:55,526 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 08:35:55,526 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:35:55,526 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:35:55,526 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 08:35:55,692 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-04-13 08:35:55,693 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 08:35:55,713 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:35:55,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-04-13 08:35:55,715 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:55,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:35:55,718 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 08:35:55,728 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-13 08:35:55,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:55,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:55,732 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-04-13 08:35:55,732 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:35:55,743 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_39| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_39|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_319 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_319))))) is different from true [2018-04-13 08:35:55,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:55,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:55,752 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-04-13 08:35:55,752 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:35:55,755 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_39| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_39|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (v_prenex_319 Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_319)))))) is different from true [2018-04-13 08:35:55,766 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-04-13 08:35:55,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 08:35:55,780 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-04-13 08:35:55,780 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:29, output treesize:52 [2018-04-13 08:35:55,808 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:35:55,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:55,844 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:55,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:55,845 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-04-13 08:35:55,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:55,860 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-04-13 08:35:55,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:48, output treesize:20 [2018-04-13 08:35:55,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:55,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:55,917 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-04-13 08:35:55,918 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:14, output treesize:13 [2018-04-13 08:35:56,046 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-04-13 08:35:56,048 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-04-13 08:35:56,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:56,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:35:56,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-13 08:35:56,057 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:37, output treesize:26 [2018-04-13 08:35:56,076 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:56,081 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-04-13 08:35:56,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 08:35:56,092 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-04-13 08:35:56,092 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:34 [2018-04-13 08:35:56,138 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 33 treesize of output 31 [2018-04-13 08:35:56,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:56,165 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:56,177 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 38 treesize of output 45 [2018-04-13 08:35:56,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 08:35:56,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-04-13 08:35:56,224 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:72, output treesize:91 [2018-04-13 08:35:56,300 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:56,300 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:56,301 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-04-13 08:35:56,301 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:56,311 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-04-13 08:35:56,312 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:59, output treesize:20 [2018-04-13 08:35:56,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:56,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:56,324 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-04-13 08:35:56,324 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:35:56,334 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_39| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_39|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_333 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_333))))) is different from true [2018-04-13 08:35:56,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:56,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:56,342 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-04-13 08:35:56,342 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:35:56,345 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_39| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_39|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_333 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_333)))))) is different from true [2018-04-13 08:35:56,366 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-04-13 08:35:56,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-13 08:35:56,389 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-04-13 08:35:56,389 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:40, output treesize:106 [2018-04-13 08:35:56,475 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:35:56,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:56,483 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:56,484 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:56,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-04-13 08:35:56,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:56,491 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-04-13 08:35:56,492 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:70, output treesize:31 [2018-04-13 08:35:56,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:56,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:56,510 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-04-13 08:35:56,511 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:14, output treesize:13 [2018-04-13 08:35:56,542 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:56,546 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-04-13 08:35:56,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 08:35:56,554 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-04-13 08:35:56,554 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:34 [2018-04-13 08:35:56,575 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:56,581 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 38 treesize of output 49 [2018-04-13 08:35:56,582 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 08:35:56,613 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 33 treesize of output 27 [2018-04-13 08:35:56,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:56,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-04-13 08:35:56,636 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:72, output treesize:91 [2018-04-13 08:35:56,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 08:35:56,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:56,900 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:56,900 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-04-13 08:35:56,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:56,904 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-04-13 08:35:56,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:20, output treesize:13 [2018-04-13 08:35:56,982 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-04-13 08:35:56,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:57,015 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 54 [2018-04-13 08:35:57,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-04-13 08:35:57,145 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:57,147 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:57,147 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:57,148 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 48 treesize of output 56 [2018-04-13 08:35:57,148 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:57,190 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:57,192 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:57,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 53 [2018-04-13 08:35:57,198 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-13 08:35:57,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 4 dim-1 vars, End of recursive call: 17 dim-0 vars, and 5 xjuncts. [2018-04-13 08:35:57,248 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 13 variables, input treesize:98, output treesize:178 [2018-04-13 08:35:57,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:35:57,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:57,459 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-04-13 08:35:57,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:57,460 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-04-13 08:35:57,460 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-04-13 08:35:57,568 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:57,569 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:57,569 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:35:57,570 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-04-13 08:35:57,570 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:35:57,583 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-04-13 08:35:57,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 08:35:57,600 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-04-13 08:35:57,600 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:45, output treesize:64 [2018-04-13 08:35:57,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1862 backedges. 368 proven. 929 refuted. 0 times theorem prover too weak. 265 trivial. 300 not checked. [2018-04-13 08:35:57,887 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 08:35:57,887 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-04-13 08:35:57,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-13 08:35:57,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-13 08:35:57,888 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1311, Unknown=7, NotChecked=390, Total=1892 [2018-04-13 08:35:57,888 INFO L87 Difference]: Start difference. First operand 258 states and 280 transitions. Second operand 44 states. [2018-04-13 08:36:01,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:36:01,027 INFO L93 Difference]: Finished difference Result 285 states and 311 transitions. [2018-04-13 08:36:01,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-04-13 08:36:01,063 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 321 [2018-04-13 08:36:01,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:36:01,064 INFO L225 Difference]: With dead ends: 285 [2018-04-13 08:36:01,064 INFO L226 Difference]: Without dead ends: 285 [2018-04-13 08:36:01,066 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 268 SyntacticMatches, 26 SemanticMatches, 85 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2811 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=748, Invalid=5884, Unknown=30, NotChecked=820, Total=7482 [2018-04-13 08:36:01,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-04-13 08:36:01,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 263. [2018-04-13 08:36:01,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-04-13 08:36:01,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 286 transitions. [2018-04-13 08:36:01,073 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 286 transitions. Word has length 321 [2018-04-13 08:36:01,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:36:01,073 INFO L459 AbstractCegarLoop]: Abstraction has 263 states and 286 transitions. [2018-04-13 08:36:01,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-13 08:36:01,073 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 286 transitions. [2018-04-13 08:36:01,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-04-13 08:36:01,079 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:36:01,080 INFO L355 BasicCegarLoop]: trace histogram [22, 22, 16, 16, 16, 16, 16, 16, 16, 16, 16, 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-04-13 08:36:01,080 INFO L408 AbstractCegarLoop]: === Iteration 50 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:36:01,080 INFO L82 PathProgramCache]: Analyzing trace with hash 558312820, now seen corresponding path program 19 times [2018-04-13 08:36:01,080 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:36:01,080 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:36:01,081 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:36:01,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 08:36:01,085 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:36:01,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:36:01,137 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:36:01,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2051 backedges. 344 proven. 270 refuted. 0 times theorem prover too weak. 1437 trivial. 0 not checked. [2018-04-13 08:36:01,766 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:36:01,767 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:36:01,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:36:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:36:01,800 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:36:02,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2051 backedges. 1188 proven. 80 refuted. 0 times theorem prover too weak. 783 trivial. 0 not checked. [2018-04-13 08:36:02,052 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 08:36:02,053 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2018-04-13 08:36:02,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-13 08:36:02,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-13 08:36:02,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=636, Unknown=0, NotChecked=0, Total=756 [2018-04-13 08:36:02,054 INFO L87 Difference]: Start difference. First operand 263 states and 286 transitions. Second operand 28 states. [2018-04-13 08:36:02,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:36:02,374 INFO L93 Difference]: Finished difference Result 250 states and 267 transitions. [2018-04-13 08:36:02,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-13 08:36:02,374 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 332 [2018-04-13 08:36:02,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:36:02,375 INFO L225 Difference]: With dead ends: 250 [2018-04-13 08:36:02,375 INFO L226 Difference]: Without dead ends: 250 [2018-04-13 08:36:02,375 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=212, Invalid=978, Unknown=0, NotChecked=0, Total=1190 [2018-04-13 08:36:02,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-04-13 08:36:02,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 239. [2018-04-13 08:36:02,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-04-13 08:36:02,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 254 transitions. [2018-04-13 08:36:02,377 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 254 transitions. Word has length 332 [2018-04-13 08:36:02,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:36:02,378 INFO L459 AbstractCegarLoop]: Abstraction has 239 states and 254 transitions. [2018-04-13 08:36:02,378 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-13 08:36:02,378 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 254 transitions. [2018-04-13 08:36:02,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-04-13 08:36:02,379 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:36:02,379 INFO L355 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-04-13 08:36:02,379 INFO L408 AbstractCegarLoop]: === Iteration 51 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:36:02,379 INFO L82 PathProgramCache]: Analyzing trace with hash -130067974, now seen corresponding path program 2 times [2018-04-13 08:36:02,379 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:36:02,379 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:36:02,380 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:36:02,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:36:02,380 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:36:02,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:36:02,396 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:36:02,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1886 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 1769 trivial. 0 not checked. [2018-04-13 08:36:02,487 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:36:02,487 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:36:02,488 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 08:36:02,520 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 08:36:02,520 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 08:36:02,526 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:36:02,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1886 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 1769 trivial. 0 not checked. [2018-04-13 08:36:02,603 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 08:36:02,603 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-04-13 08:36:02,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-13 08:36:02,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-13 08:36:02,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-04-13 08:36:02,604 INFO L87 Difference]: Start difference. First operand 239 states and 254 transitions. Second operand 10 states. [2018-04-13 08:36:02,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:36:02,646 INFO L93 Difference]: Finished difference Result 249 states and 265 transitions. [2018-04-13 08:36:02,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-13 08:36:02,646 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 334 [2018-04-13 08:36:02,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:36:02,647 INFO L225 Difference]: With dead ends: 249 [2018-04-13 08:36:02,647 INFO L226 Difference]: Without dead ends: 249 [2018-04-13 08:36:02,647 INFO L567 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-04-13 08:36:02,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-04-13 08:36:02,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 243. [2018-04-13 08:36:02,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-04-13 08:36:02,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 258 transitions. [2018-04-13 08:36:02,649 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 258 transitions. Word has length 334 [2018-04-13 08:36:02,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:36:02,649 INFO L459 AbstractCegarLoop]: Abstraction has 243 states and 258 transitions. [2018-04-13 08:36:02,649 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-13 08:36:02,650 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 258 transitions. [2018-04-13 08:36:02,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2018-04-13 08:36:02,651 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:36:02,651 INFO L355 BasicCegarLoop]: trace histogram [27, 27, 20, 20, 20, 20, 20, 20, 20, 20, 20, 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-04-13 08:36:02,651 INFO L408 AbstractCegarLoop]: === Iteration 52 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:36:02,652 INFO L82 PathProgramCache]: Analyzing trace with hash 916267843, now seen corresponding path program 20 times [2018-04-13 08:36:02,652 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:36:02,652 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:36:02,652 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:36:02,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 08:36:02,653 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:36:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:36:02,682 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:36:02,971 INFO L134 CoverageAnalysis]: Checked inductivity of 3143 backedges. 646 proven. 329 refuted. 0 times theorem prover too weak. 2168 trivial. 0 not checked. [2018-04-13 08:36:02,971 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:36:02,971 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:36:02,971 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 08:36:02,997 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 08:36:02,997 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 08:36:03,004 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:36:03,202 INFO L134 CoverageAnalysis]: Checked inductivity of 3143 backedges. 737 proven. 70 refuted. 0 times theorem prover too weak. 2336 trivial. 0 not checked. [2018-04-13 08:36:03,202 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 08:36:03,202 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 27 [2018-04-13 08:36:03,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-13 08:36:03,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-13 08:36:03,203 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=567, Unknown=0, NotChecked=0, Total=702 [2018-04-13 08:36:03,204 INFO L87 Difference]: Start difference. First operand 243 states and 258 transitions. Second operand 27 states. [2018-04-13 08:36:03,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:36:03,966 INFO L93 Difference]: Finished difference Result 262 states and 280 transitions. [2018-04-13 08:36:03,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-13 08:36:03,966 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 401 [2018-04-13 08:36:03,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:36:03,967 INFO L225 Difference]: With dead ends: 262 [2018-04-13 08:36:03,967 INFO L226 Difference]: Without dead ends: 262 [2018-04-13 08:36:03,968 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 395 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 746 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=587, Invalid=2493, Unknown=0, NotChecked=0, Total=3080 [2018-04-13 08:36:03,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-04-13 08:36:03,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 258. [2018-04-13 08:36:03,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-04-13 08:36:03,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 276 transitions. [2018-04-13 08:36:03,971 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 276 transitions. Word has length 401 [2018-04-13 08:36:03,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:36:03,971 INFO L459 AbstractCegarLoop]: Abstraction has 258 states and 276 transitions. [2018-04-13 08:36:03,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-13 08:36:03,972 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 276 transitions. [2018-04-13 08:36:03,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2018-04-13 08:36:03,974 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:36:03,974 INFO L355 BasicCegarLoop]: trace histogram [28, 27, 21, 21, 21, 21, 21, 20, 20, 20, 20, 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-04-13 08:36:03,974 INFO L408 AbstractCegarLoop]: === Iteration 53 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:36:03,975 INFO L82 PathProgramCache]: Analyzing trace with hash 2091701869, now seen corresponding path program 21 times [2018-04-13 08:36:03,975 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:36:03,975 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:36:03,975 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:36:03,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 08:36:03,976 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:36:03,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:36:03,998 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:36:04,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3277 backedges. 1282 proven. 91 refuted. 0 times theorem prover too weak. 1904 trivial. 0 not checked. [2018-04-13 08:36:04,352 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:36:04,352 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:36:04,353 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 08:36:04,467 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-04-13 08:36:04,467 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 08:36:04,495 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:36:04,712 INFO L134 CoverageAnalysis]: Checked inductivity of 3277 backedges. 1334 proven. 60 refuted. 0 times theorem prover too weak. 1883 trivial. 0 not checked. [2018-04-13 08:36:04,712 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 08:36:04,712 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 35 [2018-04-13 08:36:04,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-13 08:36:04,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-13 08:36:04,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1022, Unknown=0, NotChecked=0, Total=1190 [2018-04-13 08:36:04,713 INFO L87 Difference]: Start difference. First operand 258 states and 276 transitions. Second operand 35 states. [2018-04-13 08:36:05,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:36:05,516 INFO L93 Difference]: Finished difference Result 301 states and 326 transitions. [2018-04-13 08:36:05,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-13 08:36:05,516 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 407 [2018-04-13 08:36:05,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:36:05,517 INFO L225 Difference]: With dead ends: 301 [2018-04-13 08:36:05,517 INFO L226 Difference]: Without dead ends: 293 [2018-04-13 08:36:05,517 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=523, Invalid=3383, Unknown=0, NotChecked=0, Total=3906 [2018-04-13 08:36:05,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-04-13 08:36:05,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 266. [2018-04-13 08:36:05,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-04-13 08:36:05,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 287 transitions. [2018-04-13 08:36:05,520 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 287 transitions. Word has length 407 [2018-04-13 08:36:05,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:36:05,521 INFO L459 AbstractCegarLoop]: Abstraction has 266 states and 287 transitions. [2018-04-13 08:36:05,521 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-13 08:36:05,521 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 287 transitions. [2018-04-13 08:36:05,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-04-13 08:36:05,522 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:36:05,522 INFO L355 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-04-13 08:36:05,522 INFO L408 AbstractCegarLoop]: === Iteration 54 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:36:05,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1988970696, now seen corresponding path program 22 times [2018-04-13 08:36:05,523 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:36:05,523 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:36:05,523 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:36:05,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 08:36:05,523 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:36:05,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:36:05,551 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:36:05,560 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 08:36:05,560 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:36:05,560 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:36:05,560 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 08:36:06,059 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 08:36:06,059 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 08:36:06,107 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:36:06,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:36:06,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:06,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:06,147 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 08:36:06,253 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-13 08:36:06,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:36:06,255 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:06,256 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-04-13 08:36:06,257 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:36:06,264 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44| Int) (v_prenex_370 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44|) (* 4 v_prenex_370))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:36:06,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:36:06,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:06,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-04-13 08:36:06,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:36:06,271 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44| Int) (v_prenex_370 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44|) (* 4 v_prenex_370))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))))) is different from true [2018-04-13 08:36:06,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, 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-04-13 08:36:06,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 08:36:06,289 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-04-13 08:36:06,289 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:58 [2018-04-13 08:36:06,318 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:36:06,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:06,325 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:06,326 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:06,326 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-04-13 08:36:06,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:06,331 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-04-13 08:36:06,332 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:68, output treesize:30 [2018-04-13 08:36:06,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 08:36:06,356 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:06,357 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-04-13 08:36:06,357 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:36:06,364 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) (exists ((v_prenex_375 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44|) (* 4 v_prenex_375)))) is different from true [2018-04-13 08:36:06,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:36:06,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:06,370 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-04-13 08:36:06,370 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:36:06,372 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((v_prenex_375 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44|) (* 4 v_prenex_375)))) is different from true [2018-04-13 08:36:06,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, 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-04-13 08:36:06,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-13 08:36:06,410 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-04-13 08:36:06,410 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:50, output treesize:136 [2018-04-13 08:36:06,462 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:06,462 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 40 treesize of output 30 [2018-04-13 08:36:06,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:06,475 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-04-13 08:36:06,475 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:83, output treesize:30 [2018-04-13 08:36:06,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-04-13 08:36:06,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:06,509 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-04-13 08:36:06,509 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:36:06,518 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) (exists ((v_prenex_388 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44|) (* 4 v_prenex_388)))) is different from true [2018-04-13 08:36:06,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:36:06,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:06,525 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-04-13 08:36:06,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:36:06,526 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((v_prenex_388 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44|) (* 4 v_prenex_388)))) is different from true [2018-04-13 08:36:06,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 32 [2018-04-13 08:36:06,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-13 08:36:06,566 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-04-13 08:36:06,566 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:50, output treesize:136 [2018-04-13 08:36:06,630 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:06,631 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:06,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2018-04-13 08:36:06,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:06,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-04-13 08:36:06,649 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:90, output treesize:41 [2018-04-13 08:36:06,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 08:36:06,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:06,682 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-04-13 08:36:06,682 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:36:06,695 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_401 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44|) (* 4 v_prenex_401))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:36:06,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:36:06,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:06,701 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-04-13 08:36:06,701 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:36:06,703 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((v_prenex_401 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44|) (* 4 v_prenex_401)))) is different from true [2018-04-13 08:36:06,717 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-04-13 08:36:06,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-13 08:36:06,740 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-04-13 08:36:06,740 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:50, output treesize:136 [2018-04-13 08:36:06,795 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:06,795 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 40 treesize of output 34 [2018-04-13 08:36:06,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:06,809 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-04-13 08:36:06,810 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:83, output treesize:30 [2018-04-13 08:36:06,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:36:06,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:06,848 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-04-13 08:36:06,848 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:36:06,857 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_414 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44|) (* 4 v_prenex_414))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:36:06,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:36:06,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:06,862 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-04-13 08:36:06,863 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:36:06,864 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_414 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44|) (* 4 v_prenex_414))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))))) is different from true [2018-04-13 08:36:06,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, 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-04-13 08:36:06,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-13 08:36:06,900 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-04-13 08:36:06,900 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:50, output treesize:136 [2018-04-13 08:36:06,976 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:06,976 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:06,976 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 47 treesize of output 41 [2018-04-13 08:36:06,977 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:07,001 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-04-13 08:36:07,001 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:90, output treesize:41 [2018-04-13 08:36:07,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:36:07,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:07,044 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-04-13 08:36:07,044 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:36:07,054 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44| Int) (v_prenex_427 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44|) (* 4 v_prenex_427))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:36:07,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 08:36:07,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:07,059 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-04-13 08:36:07,059 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:36:07,061 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44| Int) (v_prenex_427 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44|) (* 4 v_prenex_427))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))))) is different from true [2018-04-13 08:36:07,073 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-04-13 08:36:07,074 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-13 08:36:07,102 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-04-13 08:36:07,102 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:50, output treesize:136 [2018-04-13 08:36:07,262 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (<= (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0))) is different from true [2018-04-13 08:36:07,272 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-04-13 08:36:07,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:07,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:36:07,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:07,274 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-04-13 08:36:07,274 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-04-13 08:36:07,285 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (<= (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44| Int) (v_prenex_439 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44|) (* 4 v_prenex_439)))) is different from true [2018-04-13 08:36:07,291 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:07,292 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:07,298 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-04-13 08:36:07,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 08:36:07,319 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:07,320 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:07,321 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:07,321 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:07,324 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-04-13 08:36:07,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 08:36:07,341 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-04-13 08:36:07,342 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:56, output treesize:86 [2018-04-13 08:36:07,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3391 backedges. 12 proven. 135 refuted. 0 times theorem prover too weak. 2472 trivial. 772 not checked. [2018-04-13 08:36:07,711 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 08:36:07,711 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-04-13 08:36:07,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-13 08:36:07,711 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-13 08:36:07,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=404, Unknown=15, NotChecked=810, Total=1332 [2018-04-13 08:36:07,712 INFO L87 Difference]: Start difference. First operand 266 states and 287 transitions. Second operand 37 states. [2018-04-13 08:36:07,799 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (<= (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-13 08:36:07,800 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (<= (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:36:07,969 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44| Int) (v_prenex_370 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44|) (* 4 v_prenex_370))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) (exists ((v_prenex_375 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44|) (* 4 v_prenex_375))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-13 08:36:07,971 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44| Int) (v_prenex_370 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44|) (* 4 v_prenex_370))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((v_prenex_375 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44|) (* 4 v_prenex_375)))) is different from true [2018-04-13 08:36:08,226 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44| Int) (v_prenex_427 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44|) (* 4 v_prenex_427))) (exists ((v_prenex_414 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44|) (* 4 v_prenex_414))) (exists ((v_prenex_401 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44|) (* 4 v_prenex_401))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (<= (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44| Int) (v_prenex_439 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44|) (* 4 v_prenex_439))) (exists ((v_prenex_388 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44|) (* 4 v_prenex_388))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-13 08:36:08,229 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44| Int) (v_prenex_427 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44|) (* 4 v_prenex_427))) (exists ((v_prenex_414 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44|) (* 4 v_prenex_414))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((v_prenex_401 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44|) (* 4 v_prenex_401))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (<= (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44| Int) (v_prenex_439 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44|) (* 4 v_prenex_439))) (exists ((v_prenex_388 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_44|) (* 4 v_prenex_388)))) is different from true [2018-04-13 08:36:09,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:36:09,132 INFO L93 Difference]: Finished difference Result 308 states and 341 transitions. [2018-04-13 08:36:09,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-13 08:36:09,132 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 412 [2018-04-13 08:36:09,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:36:09,133 INFO L225 Difference]: With dead ends: 308 [2018-04-13 08:36:09,133 INFO L226 Difference]: Without dead ends: 308 [2018-04-13 08:36:09,133 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 366 SyntacticMatches, 11 SemanticMatches, 49 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=161, Invalid=752, Unknown=41, NotChecked=1596, Total=2550 [2018-04-13 08:36:09,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-04-13 08:36:09,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 297. [2018-04-13 08:36:09,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-04-13 08:36:09,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 327 transitions. [2018-04-13 08:36:09,136 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 327 transitions. Word has length 412 [2018-04-13 08:36:09,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:36:09,137 INFO L459 AbstractCegarLoop]: Abstraction has 297 states and 327 transitions. [2018-04-13 08:36:09,137 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-13 08:36:09,137 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 327 transitions. [2018-04-13 08:36:09,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-04-13 08:36:09,139 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:36:09,139 INFO L355 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-04-13 08:36:09,140 INFO L408 AbstractCegarLoop]: === Iteration 55 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:36:09,140 INFO L82 PathProgramCache]: Analyzing trace with hash 762198363, now seen corresponding path program 23 times [2018-04-13 08:36:09,140 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:36:09,140 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:36:09,141 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:36:09,141 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 08:36:09,141 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:36:09,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:36:09,192 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:36:09,204 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 08:36:09,204 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:36:09,204 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:36:09,204 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 08:36:09,530 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-04-13 08:36:09,530 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 08:36:09,712 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:36:09,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:36:09,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:09,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:09,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 08:36:09,722 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-13 08:36:09,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-04-13 08:36:09,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:09,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-04-13 08:36:09,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:36:09,732 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_444 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_444)) |c_#length|)) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_50| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_50|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-13 08:36:09,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-04-13 08:36:09,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:09,739 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-04-13 08:36:09,739 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:36:09,741 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_444 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_444)) |c_#length|))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_50| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_50|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-13 08:36:09,748 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-04-13 08:36:09,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 08:36:09,758 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-04-13 08:36:09,758 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:29, output treesize:52 [2018-04-13 08:36:09,783 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:36:09,783 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:09,789 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:09,789 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:09,790 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-04-13 08:36:09,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:09,794 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-04-13 08:36:09,794 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:48, output treesize:20 [2018-04-13 08:36:09,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:36:09,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:09,911 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-04-13 08:36:09,911 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:14, output treesize:13 [2018-04-13 08:36:09,951 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:09,955 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-04-13 08:36:09,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 08:36:09,964 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-04-13 08:36:09,964 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:46 [2018-04-13 08:36:09,997 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 39 treesize of output 37 [2018-04-13 08:36:09,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:10,019 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:10,026 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 44 treesize of output 51 [2018-04-13 08:36:10,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 08:36:10,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-04-13 08:36:10,058 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:84, output treesize:109 [2018-04-13 08:36:10,120 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:36:10,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:10,128 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:10,128 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:10,129 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-04-13 08:36:10,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:10,134 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-04-13 08:36:10,134 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:71, output treesize:26 [2018-04-13 08:36:10,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 08:36:10,216 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:10,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-04-13 08:36:10,248 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:14, output treesize:13 [2018-04-13 08:36:10,325 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:10,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, 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-04-13 08:36:10,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 08:36:10,336 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-04-13 08:36:10,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:40 [2018-04-13 08:36:10,370 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:10,377 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 44 treesize of output 51 [2018-04-13 08:36:10,378 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 08:36:10,416 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 39 treesize of output 33 [2018-04-13 08:36:10,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:10,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-04-13 08:36:10,444 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:84, output treesize:109 [2018-04-13 08:36:10,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:36:10,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:10,642 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-04-13 08:36:10,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:10,643 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-04-13 08:36:10,643 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-04-13 08:36:10,652 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_465 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_50| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_50|) (* 4 v_prenex_465))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))))) is different from true [2018-04-13 08:36:10,657 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:10,659 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:10,664 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-04-13 08:36:10,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 08:36:10,684 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:10,685 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:10,686 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:10,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-04-13 08:36:10,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:10,701 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-04-13 08:36:10,701 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:52, output treesize:78 [2018-04-13 08:36:10,824 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:36:10,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 08:36:10,832 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:10,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-04-13 08:36:10,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:10,836 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-04-13 08:36:10,836 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-04-13 08:36:10,850 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((v_prenex_471 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_50| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_50|) (* 4 v_prenex_471)))) is different from true [2018-04-13 08:36:10,860 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:10,867 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-04-13 08:36:10,867 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 08:36:10,889 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:10,890 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:10,890 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-04-13 08:36:10,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:10,906 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-04-13 08:36:10,906 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:51, output treesize:78 [2018-04-13 08:36:11,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:36:11,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:11,135 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-04-13 08:36:11,135 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:14, output treesize:13 [2018-04-13 08:36:11,203 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:11,207 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-04-13 08:36:11,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 08:36:11,216 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-04-13 08:36:11,217 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:30, output treesize:54 [2018-04-13 08:36:11,267 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:11,274 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 54 treesize of output 65 [2018-04-13 08:36:11,275 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 08:36:11,321 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 47 [2018-04-13 08:36:11,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:11,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 12 dim-0 vars, and 3 xjuncts. [2018-04-13 08:36:11,359 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:104, output treesize:139 [2018-04-13 08:36:11,599 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (<= (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0))) is different from true [2018-04-13 08:36:11,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:36:11,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:11,613 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-04-13 08:36:11,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:11,614 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-04-13 08:36:11,614 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-04-13 08:36:11,626 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_486 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_50| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_50|) (* 4 v_prenex_486))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (<= (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0)))) is different from true [2018-04-13 08:36:11,631 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:11,632 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:11,638 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-04-13 08:36:11,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 08:36:11,663 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:11,664 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:11,665 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:11,665 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:11,668 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-04-13 08:36:11,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 08:36:11,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 12 dim-0 vars, and 2 xjuncts. [2018-04-13 08:36:11,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:62, output treesize:98 [2018-04-13 08:36:12,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3387 backedges. 320 proven. 972 refuted. 0 times theorem prover too weak. 957 trivial. 1138 not checked. [2018-04-13 08:36:12,162 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 08:36:12,162 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-04-13 08:36:12,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-04-13 08:36:12,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-04-13 08:36:12,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1706, Unknown=12, NotChecked=728, Total=2652 [2018-04-13 08:36:12,163 INFO L87 Difference]: Start difference. First operand 297 states and 327 transitions. Second operand 52 states. [2018-04-13 08:36:12,604 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_444 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_444)) |c_#length|))) (exists ((v_prenex_486 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_50| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_50|) (* 4 v_prenex_486))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (<= (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_50| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_50|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-13 08:36:14,020 WARN L151 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 82 DAG size of output 55 [2018-04-13 08:36:15,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:36:15,010 INFO L93 Difference]: Finished difference Result 302 states and 334 transitions. [2018-04-13 08:36:15,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-13 08:36:15,010 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 412 [2018-04-13 08:36:15,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:36:15,011 INFO L225 Difference]: With dead ends: 302 [2018-04-13 08:36:15,011 INFO L226 Difference]: Without dead ends: 302 [2018-04-13 08:36:15,011 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 354 SyntacticMatches, 13 SemanticMatches, 79 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1752 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=525, Invalid=4607, Unknown=16, NotChecked=1332, Total=6480 [2018-04-13 08:36:15,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-04-13 08:36:15,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 269. [2018-04-13 08:36:15,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-04-13 08:36:15,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 291 transitions. [2018-04-13 08:36:15,014 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 291 transitions. Word has length 412 [2018-04-13 08:36:15,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:36:15,014 INFO L459 AbstractCegarLoop]: Abstraction has 269 states and 291 transitions. [2018-04-13 08:36:15,014 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-04-13 08:36:15,014 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 291 transitions. [2018-04-13 08:36:15,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2018-04-13 08:36:15,015 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:36:15,015 INFO L355 BasicCegarLoop]: trace histogram [28, 28, 21, 21, 21, 21, 21, 21, 21, 21, 21, 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-04-13 08:36:15,016 INFO L408 AbstractCegarLoop]: === Iteration 56 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:36:15,016 INFO L82 PathProgramCache]: Analyzing trace with hash 547358382, now seen corresponding path program 3 times [2018-04-13 08:36:15,016 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:36:15,016 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:36:15,016 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:36:15,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 08:36:15,016 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:36:15,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:36:15,033 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:36:15,129 INFO L134 CoverageAnalysis]: Checked inductivity of 3417 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 3256 trivial. 0 not checked. [2018-04-13 08:36:15,130 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:36:15,130 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:36:15,130 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 08:36:15,196 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-04-13 08:36:15,196 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 08:36:15,213 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:36:15,396 INFO L134 CoverageAnalysis]: Checked inductivity of 3417 backedges. 1718 proven. 249 refuted. 0 times theorem prover too weak. 1450 trivial. 0 not checked. [2018-04-13 08:36:15,396 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 08:36:15,397 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 19] total 24 [2018-04-13 08:36:15,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-13 08:36:15,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-13 08:36:15,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2018-04-13 08:36:15,397 INFO L87 Difference]: Start difference. First operand 269 states and 291 transitions. Second operand 24 states. [2018-04-13 08:36:15,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:36:15,803 INFO L93 Difference]: Finished difference Result 395 states and 436 transitions. [2018-04-13 08:36:15,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-13 08:36:15,803 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 425 [2018-04-13 08:36:15,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:36:15,805 INFO L225 Difference]: With dead ends: 395 [2018-04-13 08:36:15,805 INFO L226 Difference]: Without dead ends: 368 [2018-04-13 08:36:15,805 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 412 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=401, Invalid=1669, Unknown=0, NotChecked=0, Total=2070 [2018-04-13 08:36:15,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-04-13 08:36:15,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 351. [2018-04-13 08:36:15,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-04-13 08:36:15,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 378 transitions. [2018-04-13 08:36:15,811 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 378 transitions. Word has length 425 [2018-04-13 08:36:15,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:36:15,811 INFO L459 AbstractCegarLoop]: Abstraction has 351 states and 378 transitions. [2018-04-13 08:36:15,811 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-13 08:36:15,811 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 378 transitions. [2018-04-13 08:36:15,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2018-04-13 08:36:15,814 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:36:15,814 INFO L355 BasicCegarLoop]: trace histogram [35, 35, 27, 27, 27, 27, 27, 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-04-13 08:36:15,814 INFO L408 AbstractCegarLoop]: === Iteration 57 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:36:15,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1369932012, now seen corresponding path program 24 times [2018-04-13 08:36:15,815 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:36:15,815 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:36:15,815 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:36:15,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 08:36:15,816 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:36:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:36:15,841 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:36:16,095 INFO L134 CoverageAnalysis]: Checked inductivity of 5387 backedges. 1028 proven. 438 refuted. 0 times theorem prover too weak. 3921 trivial. 0 not checked. [2018-04-13 08:36:16,095 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:36:16,095 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:36:16,095 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 08:36:16,551 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-04-13 08:36:16,551 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 08:36:16,572 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:36:16,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:36:16,587 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:16,590 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-04-13 08:36:16,590 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-04-13 08:36:16,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2018-04-13 08:36:16,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:16,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:16,701 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:23, output treesize:3 [2018-04-13 08:36:16,904 INFO L134 CoverageAnalysis]: Checked inductivity of 5387 backedges. 1312 proven. 546 refuted. 0 times theorem prover too weak. 3529 trivial. 0 not checked. [2018-04-13 08:36:16,904 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 08:36:16,904 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 37 [2018-04-13 08:36:16,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-13 08:36:16,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-13 08:36:16,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1141, Unknown=0, NotChecked=0, Total=1332 [2018-04-13 08:36:16,905 INFO L87 Difference]: Start difference. First operand 351 states and 378 transitions. Second operand 37 states. [2018-04-13 08:36:18,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:36:18,892 INFO L93 Difference]: Finished difference Result 446 states and 489 transitions. [2018-04-13 08:36:18,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-04-13 08:36:18,892 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 503 [2018-04-13 08:36:18,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:36:18,894 INFO L225 Difference]: With dead ends: 446 [2018-04-13 08:36:18,894 INFO L226 Difference]: Without dead ends: 426 [2018-04-13 08:36:18,895 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 584 GetRequests, 490 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2524 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1503, Invalid=7617, Unknown=0, NotChecked=0, Total=9120 [2018-04-13 08:36:18,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-04-13 08:36:18,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 395. [2018-04-13 08:36:18,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-04-13 08:36:18,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 424 transitions. [2018-04-13 08:36:18,901 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 424 transitions. Word has length 503 [2018-04-13 08:36:18,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:36:18,901 INFO L459 AbstractCegarLoop]: Abstraction has 395 states and 424 transitions. [2018-04-13 08:36:18,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-13 08:36:18,901 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 424 transitions. [2018-04-13 08:36:18,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2018-04-13 08:36:18,904 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:36:18,904 INFO L355 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-04-13 08:36:18,904 INFO L408 AbstractCegarLoop]: === Iteration 58 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:36:18,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1969617026, now seen corresponding path program 25 times [2018-04-13 08:36:18,905 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:36:18,905 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:36:18,905 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:36:18,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 08:36:18,905 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:36:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:36:18,951 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:36:18,964 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 08:36:18,964 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:36:18,964 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:36:18,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:36:18,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:36:19,000 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:36:19,145 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 1988 proven. 125 refuted. 0 times theorem prover too weak. 3452 trivial. 0 not checked. [2018-04-13 08:36:19,146 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 08:36:19,146 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-13 08:36:19,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-13 08:36:19,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-13 08:36:19,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2018-04-13 08:36:19,146 INFO L87 Difference]: Start difference. First operand 395 states and 424 transitions. Second operand 18 states. [2018-04-13 08:36:19,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:36:19,358 INFO L93 Difference]: Finished difference Result 440 states and 478 transitions. [2018-04-13 08:36:19,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-13 08:36:19,358 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 509 [2018-04-13 08:36:19,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:36:19,359 INFO L225 Difference]: With dead ends: 440 [2018-04-13 08:36:19,360 INFO L226 Difference]: Without dead ends: 440 [2018-04-13 08:36:19,360 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 492 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=495, Unknown=0, NotChecked=0, Total=650 [2018-04-13 08:36:19,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-04-13 08:36:19,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 418. [2018-04-13 08:36:19,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2018-04-13 08:36:19,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 454 transitions. [2018-04-13 08:36:19,363 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 454 transitions. Word has length 509 [2018-04-13 08:36:19,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:36:19,363 INFO L459 AbstractCegarLoop]: Abstraction has 418 states and 454 transitions. [2018-04-13 08:36:19,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-13 08:36:19,363 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 454 transitions. [2018-04-13 08:36:19,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2018-04-13 08:36:19,365 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:36:19,365 INFO L355 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-04-13 08:36:19,365 INFO L408 AbstractCegarLoop]: === Iteration 59 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:36:19,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1156880963, now seen corresponding path program 26 times [2018-04-13 08:36:19,365 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:36:19,365 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:36:19,366 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:36:19,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:36:19,366 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:36:19,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:36:19,399 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:36:19,414 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 08:36:19,414 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:36:19,414 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:36:19,415 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 08:36:19,486 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 08:36:19,486 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 08:36:19,494 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:36:19,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:36:19,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:19,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:19,498 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 08:36:19,508 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-13 08:36:19,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:36:19,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:19,511 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-04-13 08:36:19,511 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:36:19,518 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54| Int) (v_prenex_492 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54|) (* 4 v_prenex_492))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:36:19,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:36:19,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:19,524 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-04-13 08:36:19,524 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:36:19,526 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54| Int) (v_prenex_492 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54|) (* 4 v_prenex_492))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))))) is different from true [2018-04-13 08:36:19,551 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-04-13 08:36:19,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 08:36:19,568 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-04-13 08:36:19,568 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:58 [2018-04-13 08:36:19,618 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:19,619 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:19,619 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-04-13 08:36:19,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:19,631 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-04-13 08:36:19,631 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:23 [2018-04-13 08:36:19,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:36:19,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:19,665 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-04-13 08:36:19,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:36:19,680 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_497 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54|) (* 4 v_prenex_497))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:36:19,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-04-13 08:36:19,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:19,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-04-13 08:36:19,691 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:36:19,696 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((v_prenex_497 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54|) (* 4 v_prenex_497)))) is different from true [2018-04-13 08:36:19,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, 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-04-13 08:36:19,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-13 08:36:19,745 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-04-13 08:36:19,745 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-04-13 08:36:19,813 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:19,814 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:19,814 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-04-13 08:36:19,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:19,832 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-04-13 08:36:19,832 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:76, output treesize:34 [2018-04-13 08:36:19,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:36:19,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:19,865 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-04-13 08:36:19,865 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:36:19,878 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) (exists ((v_prenex_509 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54|) (* 4 v_prenex_509)))) is different from true [2018-04-13 08:36:19,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:36:19,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:19,887 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-04-13 08:36:19,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:36:19,889 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((v_prenex_509 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54|) (* 4 v_prenex_509)))) is different from true [2018-04-13 08:36:19,920 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-04-13 08:36:19,921 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-13 08:36:19,962 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-04-13 08:36:19,962 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-04-13 08:36:20,046 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:36:20,046 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:20,061 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:20,061 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:20,062 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-04-13 08:36:20,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:20,070 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-04-13 08:36:20,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:69, output treesize:23 [2018-04-13 08:36:20,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:36:20,123 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:20,125 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-04-13 08:36:20,125 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:36:20,143 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) (exists ((v_prenex_521 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54|) (* 4 v_prenex_521)))) is different from true [2018-04-13 08:36:20,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:36:20,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:20,158 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-04-13 08:36:20,158 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:36:20,161 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((v_prenex_521 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54|) (* 4 v_prenex_521)))) is different from true [2018-04-13 08:36:20,184 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-04-13 08:36:20,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-13 08:36:20,321 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-04-13 08:36:20,321 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-04-13 08:36:20,382 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:36:20,383 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:20,392 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:20,392 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:20,393 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-04-13 08:36:20,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:20,400 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-04-13 08:36:20,419 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:76, output treesize:34 [2018-04-13 08:36:20,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:36:20,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:20,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-04-13 08:36:20,466 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:36:20,475 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_533 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54|) (* 4 v_prenex_533))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:36:20,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 08:36:20,478 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:20,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-04-13 08:36:20,482 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:36:20,483 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((v_prenex_533 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54|) (* 4 v_prenex_533)))) is different from true [2018-04-13 08:36:20,497 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-04-13 08:36:20,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-13 08:36:20,522 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-04-13 08:36:20,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-04-13 08:36:20,590 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:36:20,590 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:20,599 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:20,600 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:20,600 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-04-13 08:36:20,600 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:20,606 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-04-13 08:36:20,607 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:76, output treesize:34 [2018-04-13 08:36:20,661 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (<= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~n|))) is different from true [2018-04-13 08:36:20,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-04-13 08:36:20,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:20,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-04-13 08:36:20,671 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:36:20,687 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_545 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (<= v_prenex_545 |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~n|) (= (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_545)) |c_#length|))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-13 08:36:20,697 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:20,705 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 21 treesize of output 38 [2018-04-13 08:36:20,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-13 08:36:20,729 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-04-13 08:36:20,730 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:41, output treesize:105 [2018-04-13 08:36:20,808 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:36:20,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:20,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2018-04-13 08:36:20,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:20,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 08:36:20,814 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:81, output treesize:22 [2018-04-13 08:36:20,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:36:20,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:20,866 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-04-13 08:36:20,866 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:36:20,876 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_556 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54|) (* 4 v_prenex_556))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:36:20,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:36:20,878 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:20,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-04-13 08:36:20,882 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:36:20,883 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_556 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54|) (* 4 v_prenex_556))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))))) is different from true [2018-04-13 08:36:20,886 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:20,888 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:20,897 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 21 treesize of output 38 [2018-04-13 08:36:20,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-13 08:36:20,921 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-04-13 08:36:20,921 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:42, output treesize:117 [2018-04-13 08:36:21,058 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:36:21,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 8 treesize of output 7 [2018-04-13 08:36:21,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:21,071 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-04-13 08:36:21,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:21,072 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-04-13 08:36:21,073 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-04-13 08:36:21,085 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((v_prenex_567 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54|) (* 4 v_prenex_567)))) is different from true [2018-04-13 08:36:21,090 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:21,097 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-04-13 08:36:21,098 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 08:36:21,119 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:21,120 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:21,121 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:21,121 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-04-13 08:36:21,121 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:21,136 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-04-13 08:36:21,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:60, output treesize:86 [2018-04-13 08:36:21,612 INFO L134 CoverageAnalysis]: Checked inductivity of 5716 backedges. 18 proven. 184 refuted. 0 times theorem prover too weak. 3724 trivial. 1790 not checked. [2018-04-13 08:36:21,613 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 08:36:21,613 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-04-13 08:36:21,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-13 08:36:21,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-13 08:36:21,614 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=557, Unknown=17, NotChecked=1088, Total=1806 [2018-04-13 08:36:21,614 INFO L87 Difference]: Start difference. First operand 418 states and 454 transitions. Second operand 43 states. [2018-04-13 08:36:21,724 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (<= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~n|)))) is different from true [2018-04-13 08:36:21,726 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (<= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~n|)))) is different from true [2018-04-13 08:36:21,749 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_556 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54|) (* 4 v_prenex_556))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54| Int) (v_prenex_492 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54|) (* 4 v_prenex_492))) (exists ((v_prenex_533 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54|) (* 4 v_prenex_533))) (exists ((v_prenex_497 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54|) (* 4 v_prenex_497))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((v_prenex_567 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54|) (* 4 v_prenex_567))) (exists ((v_prenex_545 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (<= v_prenex_545 |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~n|) (= (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_545)) |c_#length|))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) (exists ((v_prenex_521 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54|) (* 4 v_prenex_521))) (exists ((v_prenex_509 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54|) (* 4 v_prenex_509)))) is different from true [2018-04-13 08:36:21,751 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54| Int) (v_prenex_492 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54|) (* 4 v_prenex_492))) (exists ((v_prenex_497 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54|) (* 4 v_prenex_497))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:36:21,753 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54| Int) (v_prenex_492 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54|) (* 4 v_prenex_492))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((v_prenex_497 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54|) (* 4 v_prenex_497)))) is different from true [2018-04-13 08:36:21,971 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_556 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54|) (* 4 v_prenex_556))) (exists ((v_prenex_533 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54|) (* 4 v_prenex_533))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((v_prenex_567 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54|) (* 4 v_prenex_567))) (exists ((v_prenex_545 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (<= v_prenex_545 |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~n|) (= (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_545)) |c_#length|))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) (exists ((v_prenex_521 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54|) (* 4 v_prenex_521))) (exists ((v_prenex_509 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54|) (* 4 v_prenex_509)))) is different from true [2018-04-13 08:36:21,974 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_556 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54|) (* 4 v_prenex_556))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((v_prenex_533 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54|) (* 4 v_prenex_533))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((v_prenex_567 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54|) (* 4 v_prenex_567))) (exists ((v_prenex_545 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (<= v_prenex_545 |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~n|) (= (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_545)) |c_#length|))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_521 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54|) (* 4 v_prenex_521))) (exists ((v_prenex_509 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54|) (* 4 v_prenex_509)))) is different from true [2018-04-13 08:36:22,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:36:22,993 INFO L93 Difference]: Finished difference Result 479 states and 529 transitions. [2018-04-13 08:36:22,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-13 08:36:22,993 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 514 [2018-04-13 08:36:22,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:36:22,995 INFO L225 Difference]: With dead ends: 479 [2018-04-13 08:36:22,995 INFO L226 Difference]: Without dead ends: 479 [2018-04-13 08:36:22,996 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 462 SyntacticMatches, 15 SemanticMatches, 67 ConstructedPredicates, 24 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=432, Invalid=1620, Unknown=24, NotChecked=2616, Total=4692 [2018-04-13 08:36:22,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-04-13 08:36:23,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 458. [2018-04-13 08:36:23,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-04-13 08:36:23,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 505 transitions. [2018-04-13 08:36:23,001 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 505 transitions. Word has length 514 [2018-04-13 08:36:23,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:36:23,001 INFO L459 AbstractCegarLoop]: Abstraction has 458 states and 505 transitions. [2018-04-13 08:36:23,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-13 08:36:23,002 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 505 transitions. [2018-04-13 08:36:23,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2018-04-13 08:36:23,005 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:36:23,005 INFO L355 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-04-13 08:36:23,005 INFO L408 AbstractCegarLoop]: === Iteration 60 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:36:23,005 INFO L82 PathProgramCache]: Analyzing trace with hash -386917274, now seen corresponding path program 27 times [2018-04-13 08:36:23,005 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:36:23,006 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:36:23,006 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:36:23,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 08:36:23,006 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:36:23,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:36:23,052 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:36:23,066 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 08:36:23,066 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:36:23,066 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:36:23,066 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 08:36:24,212 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-04-13 08:36:24,212 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 08:36:24,238 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:36:24,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 6 treesize of output 5 [2018-04-13 08:36:24,240 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:24,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:24,253 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 08:36:24,259 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-13 08:36:24,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:36:24,261 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:24,262 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-04-13 08:36:24,262 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:36:24,280 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) (exists ((v_prenex_574 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_60| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_60|) (* 4 v_prenex_574)))) is different from true [2018-04-13 08:36:24,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:36:24,284 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:24,290 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-04-13 08:36:24,290 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:36:24,293 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((v_prenex_574 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_60| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_60|) (* 4 v_prenex_574)))) is different from true [2018-04-13 08:36:24,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 14 treesize of output 17 [2018-04-13 08:36:24,305 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 08:36:24,321 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-04-13 08:36:24,321 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:29, output treesize:52 [2018-04-13 08:36:24,362 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:24,363 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:24,364 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-04-13 08:36:24,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:24,378 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-04-13 08:36:24,378 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:20 [2018-04-13 08:36:24,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:36:24,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:24,398 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-04-13 08:36:24,398 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:36:24,410 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_579 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_60| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_60|) (* 4 v_prenex_579))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:36:24,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:36:24,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:24,420 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-04-13 08:36:24,420 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:36:24,422 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_579 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_60| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_60|) (* 4 v_prenex_579))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))))) is different from true [2018-04-13 08:36:24,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, 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-04-13 08:36:24,443 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-13 08:36:24,480 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-04-13 08:36:24,480 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:40, output treesize:106 [2018-04-13 08:36:24,552 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:24,552 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 24 [2018-04-13 08:36:24,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:24,563 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-04-13 08:36:24,564 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:63, output treesize:20 [2018-04-13 08:36:24,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:36:24,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:24,596 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-04-13 08:36:24,596 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:36:24,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 6 treesize of output 5 [2018-04-13 08:36:24,695 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:24,698 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-04-13 08:36:24,698 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:17 [2018-04-13 08:36:24,726 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-04-13 08:36:24,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-13 08:36:24,751 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-04-13 08:36:24,751 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:36, output treesize:94 [2018-04-13 08:36:24,882 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:36:24,888 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-04-13 08:36:24,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:24,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:36:24,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:24,891 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-04-13 08:36:24,891 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-04-13 08:36:24,900 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_600 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_60| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_60|) (* 4 v_prenex_600))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))))) is different from true [2018-04-13 08:36:24,905 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:24,906 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:24,907 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-04-13 08:36:24,907 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:24,923 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-04-13 08:36:24,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 08:36:24,941 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-04-13 08:36:24,941 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:53, output treesize:72 [2018-04-13 08:36:25,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:36:25,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:25,009 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-04-13 08:36:25,009 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:36:25,019 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_606 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_60| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_60|) (* 4 v_prenex_606))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:36:25,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-04-13 08:36:25,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:25,025 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-04-13 08:36:25,025 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:36:25,026 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((v_prenex_606 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_60| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_60|) (* 4 v_prenex_606)))) is different from true [2018-04-13 08:36:25,039 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-04-13 08:36:25,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-13 08:36:25,062 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-04-13 08:36:25,062 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-04-13 08:36:25,154 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:25,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 33 treesize of output 27 [2018-04-13 08:36:25,155 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:25,168 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-04-13 08:36:25,168 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:69, output treesize:23 [2018-04-13 08:36:25,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 08:36:25,216 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:25,217 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-04-13 08:36:25,217 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:36:25,229 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) (exists ((v_prenex_619 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_60| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_60|) (* 4 v_prenex_619)))) is different from true [2018-04-13 08:36:25,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:36:25,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:25,235 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-04-13 08:36:25,235 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:36:25,236 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((v_prenex_619 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_60| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_60|) (* 4 v_prenex_619)))) is different from true [2018-04-13 08:36:25,249 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-04-13 08:36:25,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-13 08:36:25,272 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-04-13 08:36:25,272 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-04-13 08:36:25,455 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:25,456 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-04-13 08:36:25,485 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:25,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:36:25,489 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:25,491 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-04-13 08:36:25,491 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:20, output treesize:13 [2018-04-13 08:36:25,540 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| 0)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:36:25,543 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:25,545 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:25,545 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-04-13 08:36:25,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:25,558 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:25,558 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:25,565 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-04-13 08:36:25,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 08:36:25,584 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-04-13 08:36:25,584 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:52, output treesize:71 [2018-04-13 08:36:25,690 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:25,690 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-04-13 08:36:25,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:25,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:36:25,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:25,696 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-04-13 08:36:25,696 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:20, output treesize:13 [2018-04-13 08:36:25,745 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:25,746 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:25,746 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-04-13 08:36:25,746 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:25,761 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-04-13 08:36:25,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 08:36:25,776 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-04-13 08:36:25,776 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:53, output treesize:72 [2018-04-13 08:36:26,339 INFO L134 CoverageAnalysis]: Checked inductivity of 5710 backedges. 1233 proven. 654 refuted. 0 times theorem prover too weak. 1996 trivial. 1827 not checked. [2018-04-13 08:36:26,340 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 08:36:26,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-04-13 08:36:26,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-13 08:36:26,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-13 08:36:26,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=836, Unknown=14, NotChecked=852, Total=1892 [2018-04-13 08:36:26,341 INFO L87 Difference]: Start difference. First operand 458 states and 505 transitions. Second operand 44 states. [2018-04-13 08:36:27,702 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_600 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_60| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_60|) (* 4 v_prenex_600))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((v_prenex_606 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_60| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_60|) (* 4 v_prenex_606))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| 0)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_60| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_60|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_619 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_60| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_60|) (* 4 v_prenex_619)))) is different from true [2018-04-13 08:36:27,706 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_579 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_60| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_60|) (* 4 v_prenex_579))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| 0)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_60| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_60|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_574 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_60| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_60|) (* 4 v_prenex_574)))) is different from true [2018-04-13 08:36:27,709 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_600 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_60| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_60|) (* 4 v_prenex_600))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((v_prenex_606 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_60| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_60|) (* 4 v_prenex_606))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| 0)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((v_prenex_619 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_60| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_60|) (* 4 v_prenex_619)))) is different from true [2018-04-13 08:36:27,711 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_579 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_60| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_60|) (* 4 v_prenex_579))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| 0)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((v_prenex_574 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_60| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_60|) (* 4 v_prenex_574)))) is different from true [2018-04-13 08:36:28,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:36:28,476 INFO L93 Difference]: Finished difference Result 562 states and 634 transitions. [2018-04-13 08:36:28,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-13 08:36:28,477 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 514 [2018-04-13 08:36:28,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:36:28,479 INFO L225 Difference]: With dead ends: 562 [2018-04-13 08:36:28,479 INFO L226 Difference]: Without dead ends: 562 [2018-04-13 08:36:28,479 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 461 SyntacticMatches, 24 SemanticMatches, 76 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 1596 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=603, Invalid=3222, Unknown=21, NotChecked=2160, Total=6006 [2018-04-13 08:36:28,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2018-04-13 08:36:28,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 454. [2018-04-13 08:36:28,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2018-04-13 08:36:28,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 497 transitions. [2018-04-13 08:36:28,485 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 497 transitions. Word has length 514 [2018-04-13 08:36:28,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:36:28,486 INFO L459 AbstractCegarLoop]: Abstraction has 454 states and 497 transitions. [2018-04-13 08:36:28,486 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-13 08:36:28,486 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 497 transitions. [2018-04-13 08:36:28,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2018-04-13 08:36:28,488 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:36:28,488 INFO L355 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-04-13 08:36:28,488 INFO L408 AbstractCegarLoop]: === Iteration 61 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:36:28,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1155015808, now seen corresponding path program 28 times [2018-04-13 08:36:28,488 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:36:28,488 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:36:28,489 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:36:28,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 08:36:28,489 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:36:28,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:36:28,530 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:36:28,545 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 08:36:28,546 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:36:28,546 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:36:28,546 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 08:36:29,271 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 08:36:29,272 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 08:36:29,305 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:36:29,314 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-04-13 08:36:29,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:29,318 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-04-13 08:36:29,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-13 08:36:29,318 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:29,319 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:29,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:29,321 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:24, output treesize:15 [2018-04-13 08:36:29,358 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-04-13 08:36:29,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-04-13 08:36:29,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:29,360 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:29,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:29,361 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:11, output treesize:1 [2018-04-13 08:36:29,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 08:36:29,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:29,376 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-04-13 08:36:29,376 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:21, output treesize:20 [2018-04-13 08:36:29,398 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-04-13 08:36:29,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-04-13 08:36:29,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:29,413 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-04-13 08:36:29,413 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 08:36:29,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 08:36:29,429 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-04-13 08:36:29,429 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:30, output treesize:32 [2018-04-13 08:36:29,448 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:36:29,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:29,449 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:29,450 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:29,450 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-04-13 08:36:29,450 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:29,455 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-04-13 08:36:29,457 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:29,457 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:29,457 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-04-13 08:36:29,457 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:29,460 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:29,467 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-04-13 08:36:29,467 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:66, output treesize:22 [2018-04-13 08:36:29,584 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-04-13 08:36:29,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-04-13 08:36:29,586 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:29,587 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-04-13 08:36:29,587 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:29,589 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:29,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:29,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:29,594 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:16, output treesize:1 [2018-04-13 08:36:29,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:36:29,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:29,623 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-04-13 08:36:29,623 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:25 [2018-04-13 08:36:29,657 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-04-13 08:36:29,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-04-13 08:36:29,660 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:29,661 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-04-13 08:36:29,661 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:29,667 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:29,683 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:29,685 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:29,707 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-04-13 08:36:29,709 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:29,709 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:29,710 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:29,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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 56 [2018-04-13 08:36:29,712 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:29,738 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:29,740 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:29,741 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:29,752 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 31 treesize of output 62 [2018-04-13 08:36:29,753 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-04-13 08:36:29,817 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:29,818 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:36:29,819 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-04-13 08:36:29,820 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:29,844 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-13 08:36:29,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-13 08:36:29,888 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-04-13 08:36:29,888 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:44, output treesize:81 [2018-04-13 08:36:29,930 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:36:29,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:29,931 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:29,932 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:29,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, 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-04-13 08:36:29,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:29,940 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-04-13 08:36:29,942 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:29,942 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:29,943 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:29,943 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:29,943 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:29,944 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:29,944 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-04-13 08:36:29,945 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:29,951 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:29,962 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-04-13 08:36:29,962 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:81, output treesize:31 [2018-04-13 08:36:30,160 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 24 treesize of output 21 [2018-04-13 08:36:30,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-04-13 08:36:30,162 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2018-04-13 08:36:30,164 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,165 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,166 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,167 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 26 treesize of output 55 [2018-04-13 08:36:30,167 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:30,172 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:30,176 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:30,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:30,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:30,182 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:28, output treesize:1 [2018-04-13 08:36:30,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 08:36:30,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:30,238 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-04-13 08:36:30,238 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:37, output treesize:36 [2018-04-13 08:36:30,300 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 50 treesize of output 58 [2018-04-13 08:36:30,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 51 treesize of output 53 [2018-04-13 08:36:30,304 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2018-04-13 08:36:30,307 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,307 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,308 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,310 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 26 treesize of output 55 [2018-04-13 08:36:30,311 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:30,317 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:30,324 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:30,347 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,348 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,349 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,351 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,351 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,352 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,365 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 44 treesize of output 93 [2018-04-13 08:36:30,369 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,369 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,370 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,370 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:36:30,373 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 95 [2018-04-13 08:36:30,375 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,376 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,377 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,377 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,378 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,379 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,383 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 33 treesize of output 89 [2018-04-13 08:36:30,383 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:30,404 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:30,528 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,529 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,531 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,532 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,534 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,535 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,536 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,553 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 46 treesize of output 107 [2018-04-13 08:36:30,557 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,561 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,562 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,564 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,565 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,590 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 90 treesize of output 145 [2018-04-13 08:36:30,592 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 8 xjuncts. [2018-04-13 08:36:30,823 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,824 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,825 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,826 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,827 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,827 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,829 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,833 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 48 treesize of output 146 [2018-04-13 08:36:30,833 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:30,923 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,924 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,924 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,926 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,926 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,927 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,928 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,929 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,931 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:30,946 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 48 treesize of output 148 [2018-04-13 08:36:30,947 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 4 xjuncts. [2018-04-13 08:36:31,387 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:31,387 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:31,388 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:31,389 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:31,390 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:31,391 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:31,400 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 48 treesize of output 120 [2018-04-13 08:36:31,401 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-04-13 08:36:31,508 INFO L267 ElimStorePlain]: Start of recursive call 9: 8 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-04-13 08:36:31,638 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:31,638 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:31,639 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:31,639 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:31,640 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:31,640 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:31,641 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:31,644 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 44 treesize of output 98 [2018-04-13 08:36:31,647 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:31,647 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:31,648 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:31,649 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:31,649 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:31,650 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:31,650 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:31,651 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:31,651 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:31,657 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 54 treesize of output 157 [2018-04-13 08:36:31,657 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:31,686 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:31,843 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:31,844 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:31,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:31,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:31,846 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:36:31,846 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:31,850 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 44 treesize of output 88 [2018-04-13 08:36:31,853 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:31,854 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:31,854 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:31,855 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:31,856 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:31,865 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 41 treesize of output 96 [2018-04-13 08:36:31,865 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-04-13 08:36:31,897 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 08:36:32,210 INFO L267 ElimStorePlain]: Start of recursive call 6: 8 dim-1 vars, End of recursive call: and 11 xjuncts. [2018-04-13 08:36:32,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 11 xjuncts. [2018-04-13 08:36:32,420 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 8 xjuncts. [2018-04-13 08:36:32,420 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 7 variables, input treesize:64, output treesize:197 [2018-04-13 08:36:32,489 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:32,489 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:32,490 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-04-13 08:36:32,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:32,490 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:36:32,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:32,508 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-04-13 08:36:32,510 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:32,510 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:32,511 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:32,511 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:32,511 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:32,512 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:32,512 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:32,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:32,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:32,514 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:32,515 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:32,515 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-04-13 08:36:32,515 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:32,527 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:32,533 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-04-13 08:36:32,534 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:90, output treesize:40 [2018-04-13 08:36:33,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 29 [2018-04-13 08:36:33,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2018-04-13 08:36:33,105 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,106 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 42 [2018-04-13 08:36:33,108 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,109 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,110 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,113 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 64 [2018-04-13 08:36:33,115 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,115 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,116 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,116 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,117 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,117 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,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, 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 101 [2018-04-13 08:36:33,121 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:33,130 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:33,136 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:33,140 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:33,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:33,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:33,151 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 10 variables, input treesize:46, output treesize:1 [2018-04-13 08:36:33,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:36:33,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:33,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2018-04-13 08:36:33,242 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 10 variables, input treesize:58, output treesize:57 [2018-04-13 08:36:33,342 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 67 treesize of output 73 [2018-04-13 08:36:33,345 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,345 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,346 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,347 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,348 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,349 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,351 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,352 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,353 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,354 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,355 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,391 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 59 treesize of output 147 [2018-04-13 08:36:33,397 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:36:33,397 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:33,824 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,825 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,826 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,827 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,828 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,829 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,830 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,831 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,832 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,833 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,834 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,836 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,840 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,846 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 59 treesize of output 173 [2018-04-13 08:36:33,849 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,850 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,850 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,851 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,852 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,852 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,853 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,853 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,854 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,855 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,855 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,856 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 18 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 235 [2018-04-13 08:36:33,869 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,870 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,871 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,871 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,872 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,873 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,874 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,874 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,875 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,876 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,877 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,878 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,878 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,879 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,880 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,882 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,883 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:33,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 24 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 322 [2018-04-13 08:36:33,901 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:33,936 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:33,957 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:34,150 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,151 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,152 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,153 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,154 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,155 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,156 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,157 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,157 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:36:34,158 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,164 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,172 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 59 treesize of output 146 [2018-04-13 08:36:34,175 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,176 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,177 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,177 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,178 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:36:34,178 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,185 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 143 [2018-04-13 08:36:34,188 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,189 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,190 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,191 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,191 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,192 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,193 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,193 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,194 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,195 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,201 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 48 treesize of output 171 [2018-04-13 08:36:34,201 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:34,224 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:34,241 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:34,442 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,443 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,443 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,445 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,445 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,446 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,447 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,448 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,449 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,450 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:36:34,454 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,458 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,465 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 59 treesize of output 149 [2018-04-13 08:36:34,468 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,469 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,469 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,471 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,472 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,472 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,473 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,474 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,474 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,475 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:36:34,482 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 150 [2018-04-13 08:36:34,486 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,486 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,487 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,487 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,488 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,489 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,489 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,490 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,490 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,491 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:36:34,498 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 0 case distinctions, treesize of input 56 treesize of output 168 [2018-04-13 08:36:34,498 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:34,518 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:34,534 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:34,618 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,619 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,620 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,625 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,626 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,630 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,638 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,639 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,643 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,648 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,649 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,653 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,683 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 61 treesize of output 173 [2018-04-13 08:36:34,689 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:36:34,689 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:34,859 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,859 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,860 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,861 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,861 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,862 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,863 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,863 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,864 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:36:34,864 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,865 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,865 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:36:34,870 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,870 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,872 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,875 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 65 treesize of output 224 [2018-04-13 08:36:34,878 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,879 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,879 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,880 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,882 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,883 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,884 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:34,890 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 79 treesize of output 220 [2018-04-13 08:36:34,891 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:34,927 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:35,072 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,073 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,074 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,074 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,075 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,075 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,076 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,077 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,077 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,078 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,078 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:36:35,079 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,079 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:36:35,084 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,086 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,089 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 65 treesize of output 203 [2018-04-13 08:36:35,092 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,093 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,094 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,094 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,095 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,095 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,096 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,096 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,097 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:36:35,103 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 0 case distinctions, treesize of input 73 treesize of output 189 [2018-04-13 08:36:35,104 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:35,135 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:35,293 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,294 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,295 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,295 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,296 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,298 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,299 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,301 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,303 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,308 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,310 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,311 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,312 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,313 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,344 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 63 treesize of output 195 [2018-04-13 08:36:35,355 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,356 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,357 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,358 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,358 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,359 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,360 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,360 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:36:35,361 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,361 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,362 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,363 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,363 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,364 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,364 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:36:35,377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 289 [2018-04-13 08:36:35,377 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:35,668 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,668 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,719 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,719 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,720 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,721 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,722 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,722 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,723 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,724 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,724 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,725 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,725 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,726 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,727 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,727 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,728 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,729 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,729 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,730 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:36:35,738 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,740 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,744 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 67 treesize of output 276 [2018-04-13 08:36:35,745 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:35,852 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,856 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,856 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,860 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,860 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,861 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,862 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,862 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,864 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,864 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,866 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,870 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,878 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,879 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,883 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:35,921 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 65 treesize of output 240 [2018-04-13 08:36:35,923 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 16 xjuncts. [2018-04-13 08:36:36,245 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:36,246 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:36,247 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:36,247 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:36,248 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:36,249 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:36,249 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:36,250 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:36:36,250 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:36,251 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:36,252 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:36,252 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:36,253 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:36,254 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:36,254 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:36:36,255 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:36,260 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:36,260 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:36,262 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:36,265 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 67 treesize of output 305 [2018-04-13 08:36:36,265 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:36,598 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:36,599 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:36,599 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:36,600 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:36,601 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:36,602 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:36,602 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:36,603 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:36,604 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:36,604 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:36:36,605 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:36,606 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:36,606 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:36,607 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:36:36,607 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:36:36,615 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:36,615 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:36,617 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:36,620 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 67 treesize of output 261 [2018-04-13 08:36:36,621 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:37,275 INFO L267 ElimStorePlain]: Start of recursive call 20: 16 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-04-13 08:36:37,890 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:37,891 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:37,892 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:37,892 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:37,893 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:37,894 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:37,894 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:37,895 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:37,896 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:37,896 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:37,897 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:37,898 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:37,898 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:37,899 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:37,899 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:36:37,905 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:37,907 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:37,910 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 65 treesize of output 209 [2018-04-13 08:36:37,914 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:37,915 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:37,916 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:37,916 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:37,917 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:37,917 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:37,918 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:37,919 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:37,919 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:37,920 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:37,927 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:37,928 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:37,929 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:37,929 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:36:37,940 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 70 treesize of output 218 [2018-04-13 08:36:37,940 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:37,976 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:38,083 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:38,083 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:38,084 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:38,085 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:38,085 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:38,086 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:38,086 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:38,087 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:38,088 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:38,088 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:36:38,089 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:38,089 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:38,090 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:38,094 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:38,094 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:38,096 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:38,098 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 65 treesize of output 233 [2018-04-13 08:36:38,102 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:38,103 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:38,104 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:38,104 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:38,105 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:38,106 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:38,106 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:38,107 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:38,107 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:38,108 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:38,109 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:38,109 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:38,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 18 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 319 [2018-04-13 08:36:38,118 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:38,166 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:38,666 INFO L267 ElimStorePlain]: Start of recursive call 14: 16 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-04-13 08:36:39,181 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:39,182 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:39,183 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:39,183 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:36:39,184 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:39,185 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:39,186 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:39,187 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:39,188 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:39,192 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:39,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 160 [2018-04-13 08:36:39,202 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:39,202 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:39,203 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:39,203 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:39,204 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:39,205 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:39,205 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:39,206 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:39,206 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:39,212 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 62 treesize of output 160 [2018-04-13 08:36:39,216 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:39,216 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:39,217 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:39,218 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:39,218 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:39,219 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:39,220 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:39,221 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:39,221 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:39,222 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:39,223 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:39,223 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:39,224 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:39,225 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:39,237 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 64 treesize of output 227 [2018-04-13 08:36:39,237 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:39,261 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:39,279 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:39,744 INFO L267 ElimStorePlain]: Start of recursive call 3: 16 dim-1 vars, End of recursive call: and 8 xjuncts. [2018-04-13 08:36:39,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 66 [2018-04-13 08:36:39,890 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:39,892 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 42 [2018-04-13 08:36:39,894 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:39,895 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:39,895 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:39,897 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 64 [2018-04-13 08:36:39,900 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:39,900 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:39,901 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:39,901 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:39,902 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:39,903 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:39,906 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 101 [2018-04-13 08:36:39,907 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:39,917 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:39,922 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:39,931 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:40,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 8 xjuncts. [2018-04-13 08:36:40,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-04-13 08:36:40,145 INFO L202 ElimStorePlain]: Needed 36 recursive calls to eliminate 10 variables, input treesize:94, output treesize:267 [2018-04-13 08:36:40,257 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:40,258 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:40,258 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 69 treesize of output 63 [2018-04-13 08:36:40,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:40,259 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:36:40,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:40,272 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 50 treesize of output 39 [2018-04-13 08:36:40,273 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:40,274 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:40,274 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:40,275 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:40,275 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:40,276 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:40,276 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:40,277 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:40,277 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:40,277 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:40,278 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:40,279 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:40,280 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:40,281 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:40,281 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:40,282 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:40,283 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:40,283 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-04-13 08:36:40,283 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:40,302 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:40,318 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-04-13 08:36:40,318 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:105, output treesize:60 [2018-04-13 08:36:43,377 WARN L151 SmtUtils]: Spent 1482ms on a formula simplification. DAG size of input: 152 DAG size of output 67 [2018-04-13 08:36:43,382 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-04-13 08:36:43,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 44 treesize of output 47 [2018-04-13 08:36:43,385 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 47 treesize of output 49 [2018-04-13 08:36:43,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 51 [2018-04-13 08:36:43,392 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 51 treesize of output 53 [2018-04-13 08:36:43,399 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 53 treesize of output 60 [2018-04-13 08:36:43,399 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:43,405 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:43,410 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:43,420 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:43,426 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:43,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:43,467 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 260 treesize of output 165 [2018-04-13 08:36:43,470 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,471 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,493 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 2 case distinctions, treesize of input 156 treesize of output 172 [2018-04-13 08:36:43,493 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-13 08:36:43,525 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 159 treesize of output 131 [2018-04-13 08:36:43,558 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,558 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,559 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,563 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,565 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,601 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 4 case distinctions, treesize of input 118 treesize of output 147 [2018-04-13 08:36:43,602 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-04-13 08:36:43,654 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 08:36:43,692 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 111 treesize of output 87 [2018-04-13 08:36:43,720 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,721 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,723 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,724 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,726 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,727 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,728 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,735 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,740 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,780 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 3 new quantified variables, introduced 9 case distinctions, treesize of input 74 treesize of output 154 [2018-04-13 08:36:43,781 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2018-04-13 08:36:43,862 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 08:36:43,864 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 101 treesize of output 79 [2018-04-13 08:36:43,888 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,888 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,889 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,889 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,890 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:36:43,890 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,890 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,891 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,891 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,892 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,900 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 69 treesize of output 141 [2018-04-13 08:36:43,900 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:43,914 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:43,953 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 71 treesize of output 53 [2018-04-13 08:36:43,970 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,970 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,971 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,971 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,972 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,972 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,973 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,973 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,974 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,974 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:36:43,974 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,975 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,975 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,976 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,976 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,977 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,977 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,978 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,978 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 23 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 186 [2018-04-13 08:36:43,995 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,996 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,996 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,997 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,997 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,998 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,998 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,999 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:43,999 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,000 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,000 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,000 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,001 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:36:44,001 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,002 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,002 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,012 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 38 treesize of output 152 [2018-04-13 08:36:44,013 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:44,033 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:44,037 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:44,038 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 60 treesize of output 46 [2018-04-13 08:36:44,052 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,052 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,053 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,053 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,054 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,054 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,055 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,057 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,057 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:36:44,058 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,058 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,059 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,066 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 36 treesize of output 131 [2018-04-13 08:36:44,068 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,069 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,070 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,071 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,071 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,072 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,072 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,073 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,073 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:36:44,078 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 29 treesize of output 91 [2018-04-13 08:36:44,078 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:44,092 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:44,095 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:44,097 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 81 treesize of output 61 [2018-04-13 08:36:44,125 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,126 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,127 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,128 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,129 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,130 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,131 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,132 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,133 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,134 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,139 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,141 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,142 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,143 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,208 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 16 case distinctions, treesize of input 48 treesize of output 174 [2018-04-13 08:36:44,212 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:36:44,212 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:44,356 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,360 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,361 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,362 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,363 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,363 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,368 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,368 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,369 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,369 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,370 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,373 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,373 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,377 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,440 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 21 case distinctions, treesize of input 50 treesize of output 200 [2018-04-13 08:36:44,442 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 16 xjuncts. [2018-04-13 08:36:44,752 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,753 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,753 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,754 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,754 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,755 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,755 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,755 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,756 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,756 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,757 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,757 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,758 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,758 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,759 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:36:44,772 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 153 [2018-04-13 08:36:44,772 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:44,850 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,851 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,851 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,852 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,852 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,853 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,856 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,856 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,857 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,857 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,857 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:36:44,858 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,858 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,859 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,859 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,860 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,861 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,861 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,862 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,862 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,863 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,863 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,864 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 31 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 208 [2018-04-13 08:36:44,882 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:44,957 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,965 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,966 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,967 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,967 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,968 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,968 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,969 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,969 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,969 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:36:44,970 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,970 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,971 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:44,984 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 46 treesize of output 141 [2018-04-13 08:36:44,985 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:45,033 INFO L267 ElimStorePlain]: Start of recursive call 23: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-13 08:36:45,073 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-13 08:36:45,115 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-13 08:36:45,129 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 253 treesize of output 160 [2018-04-13 08:36:45,131 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:45,133 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 152 treesize of output 151 [2018-04-13 08:36:45,133 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:45,147 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 133 treesize of output 125 [2018-04-13 08:36:45,148 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:45,159 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 144 treesize of output 140 [2018-04-13 08:36:45,159 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:45,168 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 151 treesize of output 117 [2018-04-13 08:36:45,189 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:45,189 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:36:45,189 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:45,192 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 102 [2018-04-13 08:36:45,212 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 50 treesize of output 52 [2018-04-13 08:36:45,223 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 50 treesize of output 32 [2018-04-13 08:36:45,223 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:45,223 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:36:45,223 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:45,226 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:45,233 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:45,234 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:45,234 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:45,235 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:45,235 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:45,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 72 [2018-04-13 08:36:45,258 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:45,259 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:45,259 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:45,260 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:45,261 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:45,270 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 46 treesize of output 84 [2018-04-13 08:36:45,273 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:45,274 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:45,274 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:45,275 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:45,276 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:45,276 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:45,280 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 48 treesize of output 109 [2018-04-13 08:36:45,280 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:45,296 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:45,307 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:45,313 INFO L267 ElimStorePlain]: Start of recursive call 34: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:45,314 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:36:45,314 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:45,320 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:45,328 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:45,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 5 xjuncts. [2018-04-13 08:36:45,371 INFO L202 ElimStorePlain]: Needed 41 recursive calls to eliminate 5 variables, input treesize:274, output treesize:178 [2018-04-13 08:36:47,440 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~i~0 Int)) (let ((.cse1 (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~i~0))) (let ((.cse2 (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset .cse1))) (and (<= (let ((.cse0 (select |c_#memory_int| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|))) (+ (select .cse0 (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset .cse1 (- 8))) (select .cse0 (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset .cse1 (- 16))) (select .cse0 (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset .cse1 (- 4))) (select .cse0 .cse2) (select .cse0 (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset .cse1 (- 12))))) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~ret4|) (<= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset 0) (<= 16 .cse2) (<= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~i~0 4))))) (exists ((v_prenex_711 Int)) (and (<= (select (select |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset|) v_prenex_711) (= (store |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (store (select |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0 v_prenex_711))) (store .cse6 4 (select (select (store |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| .cse6) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|) (+ |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset| 4)))))) (store .cse5 8 (select (select (store |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| .cse5) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|) (+ |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset| 8)))))) (store .cse4 12 (select (select (store |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| .cse4) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|) (+ |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset| 12)))))) (store .cse3 16 (select (select (store |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| .cse3) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|) (+ |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset| 16))))) |c_#memory_int|)))) is different from true [2018-04-13 08:36:47,446 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~i~0 Int)) (let ((.cse1 (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~i~0))) (let ((.cse2 (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset .cse1))) (and (<= (let ((.cse0 (select |c_#memory_int| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|))) (+ (select .cse0 (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset .cse1 (- 8))) (select .cse0 (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset .cse1 (- 16))) (select .cse0 (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset .cse1 (- 4))) (select .cse0 .cse2) (select .cse0 (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset .cse1 (- 12))))) 0) (<= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset 0) (<= 16 .cse2) (<= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~i~0 4))))) (exists ((v_prenex_711 Int)) (and (<= (select (select |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset|) v_prenex_711) (= (store |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (store (select |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0 v_prenex_711))) (store .cse6 4 (select (select (store |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| .cse6) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|) (+ |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset| 4)))))) (store .cse5 8 (select (select (store |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| .cse5) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|) (+ |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset| 8)))))) (store .cse4 12 (select (select (store |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| .cse4) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|) (+ |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset| 12)))))) (store .cse3 16 (select (select (store |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| .cse3) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|) (+ |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset| 16))))) |c_#memory_int|)))) is different from true [2018-04-13 08:36:47,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-04-13 08:36:47,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:47,502 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-04-13 08:36:47,502 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:345, output treesize:344 [2018-04-13 08:36:47,506 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_prenex_711 Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~i~0 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (let ((.cse1 (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~i~0))) (let ((.cse2 (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset .cse1))) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (<= (select (select |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset|) v_prenex_711) (<= (let ((.cse0 (select |c_#memory_int| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|))) (+ (select .cse0 (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset .cse1 (- 8))) (select .cse0 (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset .cse1 (- 16))) (select .cse0 (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset .cse1 (- 4))) (select .cse0 .cse2) (select .cse0 (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset .cse1 (- 12))))) 0) (= (store |c_old(#memory_int)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (store (select |c_old(#memory_int)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0 v_prenex_711))) (store .cse6 4 (select (select (store |c_old(#memory_int)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| .cse6) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|) (+ |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset| 4)))))) (store .cse5 8 (select (select (store |c_old(#memory_int)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| .cse5) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|) (+ |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset| 8)))))) (store .cse4 12 (select (select (store |c_old(#memory_int)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| .cse4) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|) (+ |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset| 12)))))) (store .cse3 16 (select (select (store |c_old(#memory_int)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| .cse3) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|) (+ |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset| 16))))) |c_#memory_int|) (<= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset 0) (<= 16 .cse2) (<= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~i~0 4))))) is different from true [2018-04-13 08:36:48,092 WARN L151 SmtUtils]: Spent 582ms on a formula simplification. DAG size of input: 190 DAG size of output 86 [2018-04-13 08:36:48,097 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:36:48,100 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,104 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,108 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,110 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,114 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,116 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,119 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,122 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,125 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,128 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 302 treesize of output 726 [2018-04-13 08:36:48,255 WARN L151 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 81 DAG size of output 69 [2018-04-13 08:36:48,261 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,263 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,264 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,265 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,267 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,268 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,269 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,270 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,272 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,273 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,274 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,276 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,277 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,278 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,280 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,280 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:36:48,281 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,281 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:36:48,285 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,290 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,292 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,293 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,299 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,300 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,301 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,303 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,303 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:36:48,305 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 19 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 349 treesize of output 564 [2018-04-13 08:36:48,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:48,428 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 117 treesize of output 113 [2018-04-13 08:36:48,428 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:48,467 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 183 treesize of output 147 [2018-04-13 08:36:48,498 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:36:48,498 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:48,501 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,502 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,503 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,503 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,504 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:36:48,504 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,505 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,506 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,506 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,507 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,508 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,508 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,509 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,510 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,510 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,511 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:36:48,511 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,512 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 273 [2018-04-13 08:36:48,520 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 82 [2018-04-13 08:36:48,523 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,524 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,524 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:36:48,524 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:36:48,525 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 76 treesize of output 119 [2018-04-13 08:36:48,528 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,528 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,529 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,529 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:36:48,529 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 107 treesize of output 176 [2018-04-13 08:36:48,529 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:48,540 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:48,547 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:48,587 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:48,603 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:48,622 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 157 treesize of output 123 [2018-04-13 08:36:48,675 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,675 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,676 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,676 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,677 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,677 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,677 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,678 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,678 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,683 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,684 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,684 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:36:48,684 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,685 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,686 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,686 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:36:48,688 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 0 case distinctions, treesize of input 107 treesize of output 236 [2018-04-13 08:36:48,726 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,727 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,727 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,728 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,728 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,729 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,729 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,730 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,730 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,731 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,731 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:36:48,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 170 [2018-04-13 08:36:48,733 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-04-13 08:36:48,759 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:48,760 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:36:48,760 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:48,764 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:48,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:48,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 08:36:48,786 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:399, output treesize:129 [2018-04-13 08:36:48,933 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:36:48,933 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:36:48,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:36:48,934 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:149, output treesize:1 [2018-04-13 08:36:49,432 INFO L134 CoverageAnalysis]: Checked inductivity of 5710 backedges. 3299 proven. 894 refuted. 84 times theorem prover too weak. 1409 trivial. 24 not checked. [2018-04-13 08:36:49,432 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 08:36:49,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-04-13 08:36:49,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-04-13 08:36:49,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-04-13 08:36:49,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=6830, Unknown=260, NotChecked=510, Total=7832 [2018-04-13 08:36:49,433 INFO L87 Difference]: Start difference. First operand 454 states and 497 transitions. Second operand 89 states. [2018-04-13 08:36:57,982 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 70 DAG size of output 69 [2018-04-13 08:37:24,972 WARN L148 SmtUtils]: Spent 136ms on a formula simplification that was a NOOP. DAG size: 85 [2018-04-13 08:37:44,518 WARN L148 SmtUtils]: Spent 133ms on a formula simplification that was a NOOP. DAG size: 84 [2018-04-13 08:37:57,970 WARN L148 SmtUtils]: Spent 302ms on a formula simplification that was a NOOP. DAG size: 89 [2018-04-13 08:38:16,058 WARN L148 SmtUtils]: Spent 238ms on a formula simplification that was a NOOP. DAG size: 81 [2018-04-13 08:38:21,630 WARN L148 SmtUtils]: Spent 501ms on a formula simplification that was a NOOP. DAG size: 86 [2018-04-13 08:38:29,793 WARN L151 SmtUtils]: Spent 149ms on a formula simplification. DAG size of input: 101 DAG size of output 80 [2018-04-13 08:38:52,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:38:52,432 INFO L93 Difference]: Finished difference Result 468 states and 513 transitions. [2018-04-13 08:38:52,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-04-13 08:38:52,433 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 514 [2018-04-13 08:38:52,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:38:52,434 INFO L225 Difference]: With dead ends: 468 [2018-04-13 08:38:52,434 INFO L226 Difference]: Without dead ends: 466 [2018-04-13 08:38:52,435 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 569 GetRequests, 426 SyntacticMatches, 1 SemanticMatches, 142 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 4267 ImplicationChecksByTransitivity, 55.4s TimeCoverageRelationStatistics Valid=581, Invalid=18571, Unknown=600, NotChecked=840, Total=20592 [2018-04-13 08:38:52,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2018-04-13 08:38:52,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 460. [2018-04-13 08:38:52,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-04-13 08:38:52,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 504 transitions. [2018-04-13 08:38:52,441 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 504 transitions. Word has length 514 [2018-04-13 08:38:52,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:38:52,441 INFO L459 AbstractCegarLoop]: Abstraction has 460 states and 504 transitions. [2018-04-13 08:38:52,441 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-04-13 08:38:52,441 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 504 transitions. [2018-04-13 08:38:52,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2018-04-13 08:38:52,444 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:38:52,444 INFO L355 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-04-13 08:38:52,444 INFO L408 AbstractCegarLoop]: === Iteration 62 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:38:52,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1813881472, now seen corresponding path program 29 times [2018-04-13 08:38:52,444 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:38:52,444 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:38:52,445 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:38:52,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 08:38:52,445 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:38:52,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:38:52,496 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:38:52,517 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 08:38:52,518 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:38:52,518 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:38:52,518 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 08:38:52,804 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-04-13 08:38:52,805 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 08:38:52,819 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:38:52,831 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-04-13 08:38:52,831 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:38:52,833 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-04-13 08:38:52,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:38:52,834 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 08:38:52,835 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:38:52,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:38:52,836 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2018-04-13 08:38:52,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:38:52,857 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:38:52,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:38:52,861 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-04-13 08:38:52,899 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 18 treesize of output 10 [2018-04-13 08:38:52,900 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:38:52,906 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-04-13 08:38:52,907 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:38 [2018-04-13 08:38:52,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-13 08:38:52,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-04-13 08:38:52,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:38:52,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:38:53,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:38:53,006 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:22, output treesize:1 [2018-04-13 08:38:53,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 08:38:53,030 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:38:53,038 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-04-13 08:38:53,038 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:36 [2018-04-13 08:38:53,077 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 24 treesize of output 36 [2018-04-13 08:38:53,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-04-13 08:38:53,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:38:53,100 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 22 treesize of output 32 [2018-04-13 08:38:53,100 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 08:38:53,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 08:38:53,129 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-04-13 08:38:53,129 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:48, output treesize:52 [2018-04-13 08:38:53,164 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:53,164 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:53,165 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 49 treesize of output 43 [2018-04-13 08:38:53,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:38:53,166 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:38:53,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:38:53,176 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 28 treesize of output 23 [2018-04-13 08:38:53,178 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:53,178 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:53,179 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 23 treesize of output 50 [2018-04-13 08:38:53,179 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 08:38:53,183 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:38:53,196 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-04-13 08:38:53,196 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:92, output treesize:32 [2018-04-13 08:38:53,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 08:38:53,245 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:38:53,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:38:53,249 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-04-13 08:38:53,442 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-04-13 08:38:53,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-04-13 08:38:53,446 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:53,447 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-04-13 08:38:53,448 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 08:38:53,453 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:38:53,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:38:53,465 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 1 xjuncts. [2018-04-13 08:38:53,466 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:34, output treesize:5 [2018-04-13 08:38:53,597 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:53,597 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-04-13 08:38:53,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:38:53,606 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-04-13 08:38:53,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:46, output treesize:40 [2018-04-13 08:38:53,674 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 43 treesize of output 53 [2018-04-13 08:38:53,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 46 [2018-04-13 08:38:53,678 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:53,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, 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-04-13 08:38:53,680 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 08:38:53,688 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:38:53,711 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:53,714 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:53,726 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 84 [2018-04-13 08:38:53,729 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:53,730 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:53,731 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:38:53,734 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 66 treesize of output 85 [2018-04-13 08:38:53,734 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 08:38:53,794 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:53,795 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:53,800 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:53,815 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 6 case distinctions, treesize of input 41 treesize of output 97 [2018-04-13 08:38:53,816 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-04-13 08:38:53,867 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:53,868 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:53,868 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:53,871 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 41 treesize of output 74 [2018-04-13 08:38:53,871 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 08:38:53,908 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-13 08:38:53,947 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-13 08:38:53,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-04-13 08:38:53,989 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:72, output treesize:156 [2018-04-13 08:38:54,096 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 59 treesize of output 52 [2018-04-13 08:38:54,098 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:54,099 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:54,100 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:54,100 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:54,101 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:54,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 111 [2018-04-13 08:38:54,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:38:54,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:38:54,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 08:38:54,180 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 12 variables, input treesize:239, output treesize:52 [2018-04-13 08:38:54,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:38:54,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:38:54,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:38:54,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:22 [2018-04-13 08:38:54,458 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-04-13 08:38:54,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:38:54,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:38:54,464 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:22 [2018-04-13 08:38:54,824 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-04-13 08:38:54,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:38:54,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 18 [2018-04-13 08:38:54,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 18 treesize of output 21 [2018-04-13 08:38:54,837 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:54,839 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 21 treesize of output 29 [2018-04-13 08:38:54,841 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:54,842 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:54,842 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:54,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-13 08:38:54,845 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 08:38:54,851 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:38:54,856 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:38:54,860 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:38:54,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 08:38:54,867 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:37, output treesize:7 [2018-04-13 08:38:55,180 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 25 treesize of output 23 [2018-04-13 08:38:55,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 08:38:55,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-04-13 08:38:55,202 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:60, output treesize:46 [2018-04-13 08:38:55,385 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:55,386 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:55,388 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:55,388 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-04-13 08:38:55,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:38:55,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 61 [2018-04-13 08:38:55,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 18 treesize of output 21 [2018-04-13 08:38:55,425 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:55,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 29 [2018-04-13 08:38:55,429 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:55,430 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:55,431 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:55,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-13 08:38:55,435 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 08:38:55,442 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:38:55,447 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:38:55,455 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:38:55,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:38:55,471 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 9 variables, input treesize:100, output treesize:48 [2018-04-13 08:38:55,534 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-04-13 08:38:55,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:38:55,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 45 [2018-04-13 08:38:55,546 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:55,547 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:55,547 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:55,548 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:55,548 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:55,549 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:55,550 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:55,550 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:55,551 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:55,553 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 45 treesize of output 188 [2018-04-13 08:38:55,553 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 08:38:55,566 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:38:55,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 08:38:55,575 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:68, output treesize:56 [2018-04-13 08:38:56,974 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 109 treesize of output 92 [2018-04-13 08:38:56,977 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:56,978 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 84 treesize of output 88 [2018-04-13 08:38:56,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:38:56,999 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 84 treesize of output 70 [2018-04-13 08:38:57,015 WARN L288 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:38:57,016 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 08:38:57,017 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,018 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,018 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,021 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 91 [2018-04-13 08:38:57,046 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 33 [2018-04-13 08:38:57,049 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,050 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,050 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,053 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-04-13 08:38:57,053 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 08:38:57,067 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:38:57,079 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,079 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,080 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2018-04-13 08:38:57,082 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 08:38:57,090 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:38:57,096 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:38:57,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:38:57,110 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 68 treesize of output 65 [2018-04-13 08:38:57,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, 1 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-04-13 08:38:57,113 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,114 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 40 [2018-04-13 08:38:57,117 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,117 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,118 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 56 [2018-04-13 08:38:57,124 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,124 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,125 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,125 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,126 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,126 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 83 [2018-04-13 08:38:57,131 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-13 08:38:57,140 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:38:57,146 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:38:57,151 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:38:57,161 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:38:57,173 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 116 treesize of output 97 [2018-04-13 08:38:57,176 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,191 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 2 case distinctions, treesize of input 88 treesize of output 107 [2018-04-13 08:38:57,191 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-04-13 08:38:57,230 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 94 treesize of output 78 [2018-04-13 08:38:57,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,257 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,257 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,258 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,273 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 4 case distinctions, treesize of input 63 treesize of output 108 [2018-04-13 08:38:57,334 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,335 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,336 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,336 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,337 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,338 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,338 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,339 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,340 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,341 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,341 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,342 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,343 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,343 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:38:57,357 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 152 [2018-04-13 08:38:57,360 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,360 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,361 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,361 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,362 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,362 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,363 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,363 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:38:57,369 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 37 treesize of output 103 [2018-04-13 08:38:57,370 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-13 08:38:57,389 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:38:57,410 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,412 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,413 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,413 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,414 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,415 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,415 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,418 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,418 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,419 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,452 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 11 case distinctions, treesize of input 51 treesize of output 168 [2018-04-13 08:38:57,457 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,457 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,458 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,458 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,459 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,459 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,460 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,460 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,461 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,461 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,462 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,462 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,463 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,463 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:38:57,474 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 133 treesize of output 203 [2018-04-13 08:38:57,474 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-13 08:38:57,611 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,612 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,613 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,613 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,614 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,615 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,615 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,616 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,617 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,617 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,618 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,619 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,619 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,620 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,620 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,621 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,622 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,622 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,623 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,623 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:38:57,639 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 207 [2018-04-13 08:38:57,639 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-13 08:38:57,727 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,728 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,729 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,729 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,730 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:38:57,735 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 37 treesize of output 77 [2018-04-13 08:38:57,735 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-13 08:38:57,870 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,872 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,874 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,876 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,877 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,879 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,880 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,882 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,886 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,887 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,887 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,889 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:57,947 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 16 case distinctions, treesize of input 53 treesize of output 214 [2018-04-13 08:38:57,950 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 16 xjuncts. [2018-04-13 08:38:58,201 INFO L267 ElimStorePlain]: Start of recursive call 21: 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-13 08:38:58,257 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-13 08:38:58,309 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-13 08:38:58,369 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-13 08:38:58,377 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 62 treesize of output 59 [2018-04-13 08:38:58,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2018-04-13 08:38:58,382 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:58,383 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 40 [2018-04-13 08:38:58,386 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:58,387 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:58,388 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:58,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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 56 [2018-04-13 08:38:58,394 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:58,395 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:58,396 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:58,396 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:58,397 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:58,398 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:58,403 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 83 [2018-04-13 08:38:58,403 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-13 08:38:58,414 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:38:58,422 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:38:58,428 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:38:58,440 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:38:58,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 15 dim-0 vars, and 6 xjuncts. [2018-04-13 08:38:58,531 INFO L202 ElimStorePlain]: Needed 30 recursive calls to eliminate 8 variables, input treesize:131, output treesize:275 [2018-04-13 08:38:59,852 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_prenex_740 Int) (v_prenex_739 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3| Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset| Int)) (let ((.cse2 (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset| 4))) (let ((.cse5 (let ((.cse6 (store (select |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset| v_prenex_739))) (store .cse6 .cse2 (select (select (store |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| .cse6) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|) (+ |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset| 4))))) (.cse3 (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset| 8))) (let ((.cse1 (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset| 12)) (.cse4 (store .cse5 .cse3 v_prenex_740))) (and (<= (let ((.cse0 (select |c_#memory_int| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|))) (+ (select .cse0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) (select .cse0 .cse1) (select .cse0 .cse2) (select .cse0 .cse3))) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~ret4|) (<= 0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) (<= (select (select |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset|) v_prenex_739) (= |c_#memory_int| (store |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (store .cse4 .cse1 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3|))) (<= (select (select (store |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| .cse4) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|) (+ |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset| 12)) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3|) (<= (select (select (store |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| .cse5) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|) (+ |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset| 8)) v_prenex_740) (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset| 0)))))) is different from true [2018-04-13 08:38:59,860 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_prenex_740 Int) (v_prenex_739 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3| Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset| Int)) (let ((.cse2 (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset| 4))) (let ((.cse5 (let ((.cse6 (store (select |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset| v_prenex_739))) (store .cse6 .cse2 (select (select (store |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| .cse6) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|) (+ |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset| 4))))) (.cse3 (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset| 8))) (let ((.cse1 (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset| 12)) (.cse4 (store .cse5 .cse3 v_prenex_740))) (and (<= (let ((.cse0 (select |c_#memory_int| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|))) (+ (select .cse0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) (select .cse0 .cse1) (select .cse0 .cse2) (select .cse0 .cse3))) 0) (<= 0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) (<= (select (select |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset|) v_prenex_739) (= |c_#memory_int| (store |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (store .cse4 .cse1 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3|))) (<= (select (select (store |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| .cse4) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|) (+ |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset| 12)) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3|) (<= (select (select (store |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| .cse5) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|) (+ |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset| 8)) v_prenex_740) (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset| 0)))))) is different from true [2018-04-13 08:38:59,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:38:59,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:38:59,899 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-04-13 08:38:59,899 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:166, output treesize:165 [2018-04-13 08:38:59,905 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_prenex_740 Int) (v_prenex_739 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3| Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset| Int)) (let ((.cse2 (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset| 4))) (let ((.cse5 (let ((.cse6 (store (select |c_old(#memory_int)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset| v_prenex_739))) (store .cse6 .cse2 (select (select (store |c_old(#memory_int)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| .cse6) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|) (+ |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset| 4))))) (.cse3 (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset| 8))) (let ((.cse1 (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset| 12)) (.cse4 (store .cse5 .cse3 v_prenex_740))) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (<= (let ((.cse0 (select |c_#memory_int| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|))) (+ (select .cse0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) (select .cse0 .cse1) (select .cse0 .cse2) (select .cse0 .cse3))) 0) (<= 0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) (<= (select (select |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset|) v_prenex_739) (= |c_#memory_int| (store |c_old(#memory_int)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (store .cse4 .cse1 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3|))) (<= (select (select (store |c_old(#memory_int)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| .cse4) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|) (+ |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset| 12)) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3|) (<= (select (select (store |c_old(#memory_int)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| .cse5) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|) (+ |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset| 8)) v_prenex_740) (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset| 0)))))) is different from true [2018-04-13 08:38:59,996 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:38:59,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 182 [2018-04-13 08:39:00,000 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:39:00,001 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:00,002 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:00,003 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:00,004 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:00,005 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:00,006 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:39:00,007 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:00,008 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:00,009 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:00,010 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:00,011 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:00,012 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:39:00,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 356 [2018-04-13 08:39:00,020 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:00,058 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 175 treesize of output 151 [2018-04-13 08:39:00,090 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:39:00,091 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:00,092 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:00,093 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:00,094 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:00,094 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:00,095 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:00,095 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:00,095 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:39:00,096 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:00,096 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:00,097 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:00,097 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:00,097 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:39:00,098 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:00,099 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:00,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 318 [2018-04-13 08:39:00,152 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:00,152 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:00,153 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:00,153 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:00,154 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:00,154 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:00,155 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:00,155 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:00,156 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:39:00,156 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:00,157 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:39:00,157 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 124 treesize of output 245 [2018-04-13 08:39:00,201 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:00,202 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:00,202 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:00,203 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:00,204 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:00,204 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:00,205 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:00,205 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:00,206 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:00,206 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:00,207 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:39:00,207 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:00,207 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:39:00,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 207 [2018-04-13 08:39:00,208 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:00,225 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:39:00,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 14 [2018-04-13 08:39:00,233 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:00,237 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:39:00,242 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:39:00,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:39:00,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:39:00,259 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:270, output treesize:5 [2018-04-13 08:39:00,800 INFO L134 CoverageAnalysis]: Checked inductivity of 5710 backedges. 2975 proven. 716 refuted. 0 times theorem prover too weak. 1999 trivial. 20 not checked. [2018-04-13 08:39:00,800 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 08:39:00,800 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-04-13 08:39:00,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-04-13 08:39:00,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-04-13 08:39:00,801 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=5744, Unknown=46, NotChecked=462, Total=6480 [2018-04-13 08:39:00,801 INFO L87 Difference]: Start difference. First operand 460 states and 504 transitions. Second operand 81 states. [2018-04-13 08:39:02,004 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 34 DAG size of output 33 [2018-04-13 08:39:17,394 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_73| Int)) (= 1 (select |c_#valid| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_73|))) (exists ((v_prenex_740 Int) (v_prenex_739 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3| Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset| Int)) (let ((.cse2 (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset| 4))) (let ((.cse5 (let ((.cse6 (store (select |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset| v_prenex_739))) (store .cse6 .cse2 (select (select (store |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| .cse6) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|) (+ |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset| 4))))) (.cse3 (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset| 8))) (let ((.cse1 (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset| 12)) (.cse4 (store .cse5 .cse3 v_prenex_740))) (and (<= (let ((.cse0 (select |c_#memory_int| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|))) (+ (select .cse0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) (select .cse0 .cse1) (select .cse0 .cse2) (select .cse0 .cse3))) 0) (<= 0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) (<= (select (select |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset|) v_prenex_739) (= |c_#memory_int| (store |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (store .cse4 .cse1 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3|))) (<= (select (select (store |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| .cse4) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|) (+ |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset| 12)) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3|) (<= (select (select (store |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| .cse5) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|) (+ |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset| 8)) v_prenex_740) (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset| 0))))))) is different from true [2018-04-13 08:39:19,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:39:19,525 INFO L93 Difference]: Finished difference Result 532 states and 577 transitions. [2018-04-13 08:39:19,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-04-13 08:39:19,526 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 514 [2018-04-13 08:39:19,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:39:19,527 INFO L225 Difference]: With dead ends: 532 [2018-04-13 08:39:19,527 INFO L226 Difference]: Without dead ends: 524 [2018-04-13 08:39:19,528 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 606 GetRequests, 442 SyntacticMatches, 2 SemanticMatches, 162 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 6486 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=1062, Invalid=24136, Unknown=258, NotChecked=1276, Total=26732 [2018-04-13 08:39:19,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2018-04-13 08:39:19,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 484. [2018-04-13 08:39:19,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2018-04-13 08:39:19,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 523 transitions. [2018-04-13 08:39:19,532 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 523 transitions. Word has length 514 [2018-04-13 08:39:19,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:39:19,532 INFO L459 AbstractCegarLoop]: Abstraction has 484 states and 523 transitions. [2018-04-13 08:39:19,532 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-04-13 08:39:19,532 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 523 transitions. [2018-04-13 08:39:19,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2018-04-13 08:39:19,534 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:39:19,534 INFO L355 BasicCegarLoop]: trace histogram [37, 36, 29, 29, 29, 29, 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-04-13 08:39:19,534 INFO L408 AbstractCegarLoop]: === Iteration 63 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:39:19,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1578782619, now seen corresponding path program 30 times [2018-04-13 08:39:19,535 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:39:19,535 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:39:19,535 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:39:19,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 08:39:19,535 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:39:19,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:39:19,561 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:39:19,840 INFO L134 CoverageAnalysis]: Checked inductivity of 5866 backedges. 574 proven. 1124 refuted. 0 times theorem prover too weak. 4168 trivial. 0 not checked. [2018-04-13 08:39:19,841 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:39:19,841 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:39:19,841 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 08:39:20,237 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-04-13 08:39:20,237 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 08:39:20,254 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:39:20,437 INFO L134 CoverageAnalysis]: Checked inductivity of 5866 backedges. 3377 proven. 66 refuted. 0 times theorem prover too weak. 2423 trivial. 0 not checked. [2018-04-13 08:39:20,437 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 08:39:20,437 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 29 [2018-04-13 08:39:20,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-13 08:39:20,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-13 08:39:20,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2018-04-13 08:39:20,438 INFO L87 Difference]: Start difference. First operand 484 states and 523 transitions. Second operand 29 states. [2018-04-13 08:39:20,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:39:20,768 INFO L93 Difference]: Finished difference Result 494 states and 529 transitions. [2018-04-13 08:39:20,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-13 08:39:20,768 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 519 [2018-04-13 08:39:20,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:39:20,769 INFO L225 Difference]: With dead ends: 494 [2018-04-13 08:39:20,769 INFO L226 Difference]: Without dead ends: 486 [2018-04-13 08:39:20,770 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 508 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=315, Invalid=1665, Unknown=0, NotChecked=0, Total=1980 [2018-04-13 08:39:20,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-04-13 08:39:20,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 483. [2018-04-13 08:39:20,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2018-04-13 08:39:20,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 517 transitions. [2018-04-13 08:39:20,776 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 517 transitions. Word has length 519 [2018-04-13 08:39:20,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:39:20,776 INFO L459 AbstractCegarLoop]: Abstraction has 483 states and 517 transitions. [2018-04-13 08:39:20,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-13 08:39:20,776 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 517 transitions. [2018-04-13 08:39:20,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2018-04-13 08:39:20,779 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:39:20,779 INFO L355 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-04-13 08:39:20,780 INFO L408 AbstractCegarLoop]: === Iteration 64 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:39:20,780 INFO L82 PathProgramCache]: Analyzing trace with hash -2014865370, now seen corresponding path program 31 times [2018-04-13 08:39:20,780 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:39:20,780 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:39:20,780 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:39:20,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 08:39:20,781 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:39:20,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:39:20,841 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:39:20,856 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 08:39:20,856 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:39:20,857 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:39:20,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:39:20,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:39:20,909 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:39:20,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:39:20,911 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:20,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:39:20,913 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 08:39:20,922 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-13 08:39:20,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:39:20,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:20,925 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-04-13 08:39:20,925 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:39:20,934 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_76| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_76|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_760 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_760)) |c_#length|))) is different from true [2018-04-13 08:39:20,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 6 treesize of output 5 [2018-04-13 08:39:20,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:20,941 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-04-13 08:39:20,941 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:39:20,943 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_76| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_76|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_760 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_760)) |c_#length|)))) is different from true [2018-04-13 08:39:20,951 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-04-13 08:39:20,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 08:39:20,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-04-13 08:39:20,965 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:58 [2018-04-13 08:39:21,000 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:21,001 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:21,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-04-13 08:39:21,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:21,014 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-04-13 08:39:21,014 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:23 [2018-04-13 08:39:21,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:39:21,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:21,040 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-04-13 08:39:21,041 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:39:21,049 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_76| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_76|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_765 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_765))))) is different from true [2018-04-13 08:39:21,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:39:21,051 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:21,055 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-04-13 08:39:21,056 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:39:21,058 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_765 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_765))))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_76| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_76|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-13 08:39:21,075 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-04-13 08:39:21,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-13 08:39:21,110 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-04-13 08:39:21,110 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-04-13 08:39:21,181 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:21,182 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:21,182 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-04-13 08:39:21,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:21,205 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-04-13 08:39:21,205 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:76, output treesize:34 [2018-04-13 08:39:21,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:39:21,238 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:21,239 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-04-13 08:39:21,239 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:39:21,248 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_777 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_777)) |c_#length|)) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_76| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_76|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-13 08:39:21,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:39:21,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:21,255 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-04-13 08:39:21,255 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:39:21,256 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_76| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_76|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_777 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_777)) |c_#length|)))) is different from true [2018-04-13 08:39:21,271 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-04-13 08:39:21,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-13 08:39:21,306 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-04-13 08:39:21,306 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-04-13 08:39:21,380 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:21,381 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:21,381 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-04-13 08:39:21,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:21,402 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-04-13 08:39:21,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:76, output treesize:34 [2018-04-13 08:39:21,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 8 treesize of output 7 [2018-04-13 08:39:21,443 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:21,444 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-04-13 08:39:21,444 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:39:21,453 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_76| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_76|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_789 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_789))))) is different from true [2018-04-13 08:39:21,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:39:21,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:21,460 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-04-13 08:39:21,460 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:39:21,461 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_76| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_76|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (v_prenex_789 Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_789)))))) is different from true [2018-04-13 08:39:21,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, 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-04-13 08:39:21,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-13 08:39:21,511 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-04-13 08:39:21,511 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-04-13 08:39:21,613 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:39:21,613 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:21,625 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:21,625 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:21,626 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-04-13 08:39:21,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:21,635 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-04-13 08:39:21,635 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:76, output treesize:34 [2018-04-13 08:39:21,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:39:21,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:21,683 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-04-13 08:39:21,683 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:39:21,695 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_76| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_76|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_801 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_801)) |c_#length|))) is different from true [2018-04-13 08:39:21,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:39:21,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:21,704 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-04-13 08:39:21,704 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:39:21,706 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_76| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_76|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (v_prenex_801 Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_801)) |c_#length|)))) is different from true [2018-04-13 08:39:21,726 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-04-13 08:39:21,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-13 08:39:21,763 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-04-13 08:39:21,763 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-04-13 08:39:21,868 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:39:21,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:21,880 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:21,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:21,881 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-04-13 08:39:21,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:21,890 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-04-13 08:39:21,890 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:76, output treesize:34 [2018-04-13 08:39:21,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:39:21,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:21,954 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-04-13 08:39:21,954 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:39:21,969 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_813 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_813)) |c_#length|)) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_76| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_76|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-13 08:39:21,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-04-13 08:39:21,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:21,977 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-04-13 08:39:21,978 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:39:21,979 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_76| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_76|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_813 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_813)) |c_#length|)))) is different from true [2018-04-13 08:39:21,999 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-04-13 08:39:21,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-13 08:39:22,036 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-04-13 08:39:22,036 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-04-13 08:39:22,174 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:22,175 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:22,175 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-04-13 08:39:22,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:22,200 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-04-13 08:39:22,200 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:76, output treesize:34 [2018-04-13 08:39:22,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 08:39:22,264 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:22,265 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-04-13 08:39:22,265 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:39:22,278 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_76| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_76|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_825 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_825)) |c_#length|))) is different from true [2018-04-13 08:39:22,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 08:39:22,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:22,286 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-04-13 08:39:22,286 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:39:22,289 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (v_prenex_825 Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_825)) |c_#length|))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_76| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_76|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-13 08:39:22,311 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-04-13 08:39:22,312 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-13 08:39:22,349 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-04-13 08:39:22,349 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-04-13 08:39:22,568 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:39:22,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:39:22,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:22,585 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-04-13 08:39:22,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:22,587 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-04-13 08:39:22,587 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-04-13 08:39:22,603 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (v_prenex_836 Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_836))))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_76| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_76|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-13 08:39:22,609 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:22,618 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-04-13 08:39:22,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 08:39:22,646 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:22,647 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:22,649 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:22,649 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-04-13 08:39:22,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:22,672 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-04-13 08:39:22,672 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:60, output treesize:86 [2018-04-13 08:39:23,210 INFO L134 CoverageAnalysis]: Checked inductivity of 5710 backedges. 14 proven. 182 refuted. 0 times theorem prover too weak. 4326 trivial. 1188 not checked. [2018-04-13 08:39:23,211 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 08:39:23,211 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-04-13 08:39:23,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-13 08:39:23,211 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-13 08:39:23,211 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=453, Unknown=17, NotChecked=1020, Total=1640 [2018-04-13 08:39:23,211 INFO L87 Difference]: Start difference. First operand 483 states and 517 transitions. Second operand 41 states. [2018-04-13 08:39:23,292 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_76| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_76|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:39:23,293 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:39:23,315 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_777 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_777)) |c_#length|)) (exists ((v_prenex_813 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_813)) |c_#length|)) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (v_prenex_836 Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_836))))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_76| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_76|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_760 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_760)) |c_#length|)) (exists ((v_prenex_765 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_765)))) (exists ((v_prenex_801 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_801)) |c_#length|)) (exists ((v_prenex_789 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_789)))) (exists ((v_prenex_825 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_825)) |c_#length|))) is different from true [2018-04-13 08:39:23,317 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_76| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_76|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_760 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_760)) |c_#length|)) (exists ((v_prenex_765 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_765)))) (exists ((v_prenex_789 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_789))))) is different from true [2018-04-13 08:39:23,320 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_765 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_765))))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_76| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_76|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_760 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_760)) |c_#length|))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (v_prenex_789 Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_789)))))) is different from true [2018-04-13 08:39:23,630 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_777 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_777)) |c_#length|)) (exists ((v_prenex_813 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_813)) |c_#length|)) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (v_prenex_836 Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_836))))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_76| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_76|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_801 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_801)) |c_#length|)) (exists ((v_prenex_825 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_825)) |c_#length|))) is different from true [2018-04-13 08:39:23,633 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (v_prenex_836 Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_836))))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (v_prenex_825 Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_825)) |c_#length|))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_76| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_76|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_813 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_813)) |c_#length|))) (exists ((v_prenex_777 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_777)) |c_#length|))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (v_prenex_801 Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_801)) |c_#length|)))) is different from true [2018-04-13 08:39:24,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:39:24,867 INFO L93 Difference]: Finished difference Result 536 states and 588 transitions. [2018-04-13 08:39:24,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-13 08:39:24,868 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 514 [2018-04-13 08:39:24,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:39:24,869 INFO L225 Difference]: With dead ends: 536 [2018-04-13 08:39:24,869 INFO L226 Difference]: Without dead ends: 536 [2018-04-13 08:39:24,869 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 462 SyntacticMatches, 16 SemanticMatches, 61 ConstructedPredicates, 24 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=397, Invalid=1157, Unknown=24, NotChecked=2328, Total=3906 [2018-04-13 08:39:24,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-04-13 08:39:24,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 508. [2018-04-13 08:39:24,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-04-13 08:39:24,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 555 transitions. [2018-04-13 08:39:24,873 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 555 transitions. Word has length 514 [2018-04-13 08:39:24,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:39:24,874 INFO L459 AbstractCegarLoop]: Abstraction has 508 states and 555 transitions. [2018-04-13 08:39:24,874 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-13 08:39:24,874 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 555 transitions. [2018-04-13 08:39:24,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2018-04-13 08:39:24,876 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:39:24,876 INFO L355 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, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 08:39:24,876 INFO L408 AbstractCegarLoop]: === Iteration 65 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:39:24,876 INFO L82 PathProgramCache]: Analyzing trace with hash 736303689, now seen corresponding path program 32 times [2018-04-13 08:39:24,876 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:39:24,876 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:39:24,876 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:39:24,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 08:39:24,877 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:39:24,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:39:24,911 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:39:24,924 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 08:39:24,924 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:39:24,924 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:39:24,924 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 08:39:24,984 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 08:39:24,984 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 08:39:24,992 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:39:24,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:39:24,994 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:24,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:39:24,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 08:39:25,014 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-13 08:39:25,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:39:25,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:25,017 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-04-13 08:39:25,017 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:39:25,025 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_842 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_842)) |c_#length|)) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_83| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_83|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-13 08:39:25,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 6 treesize of output 5 [2018-04-13 08:39:25,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:25,032 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-04-13 08:39:25,033 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:39:25,034 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_83| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_83|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_842 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_842)) |c_#length|)))) is different from true [2018-04-13 08:39:25,043 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-04-13 08:39:25,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 08:39:25,057 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-04-13 08:39:25,057 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:58 [2018-04-13 08:39:25,109 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:25,110 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:25,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-04-13 08:39:25,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:25,123 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-04-13 08:39:25,123 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:23 [2018-04-13 08:39:25,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:39:25,150 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:25,167 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-04-13 08:39:25,167 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:39:25,178 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_83| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_83|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_847 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_847))))) is different from true [2018-04-13 08:39:25,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:39:25,181 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:25,186 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-04-13 08:39:25,186 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:39:25,188 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_83| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_83|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (v_prenex_847 Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_847)))))) is different from true [2018-04-13 08:39:25,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, 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-04-13 08:39:25,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-13 08:39:25,241 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-04-13 08:39:25,241 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-04-13 08:39:25,316 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:25,316 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:25,317 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-04-13 08:39:25,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:25,337 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-04-13 08:39:25,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:76, output treesize:34 [2018-04-13 08:39:25,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:39:25,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:25,367 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-04-13 08:39:25,367 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:39:25,378 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_859 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_859)))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_83| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_83|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-13 08:39:25,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:39:25,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:25,387 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-04-13 08:39:25,387 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:39:25,389 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_859 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_859))))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_83| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_83|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-13 08:39:25,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, 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-04-13 08:39:25,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-13 08:39:25,442 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-04-13 08:39:25,442 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-04-13 08:39:25,529 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:25,530 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 27 [2018-04-13 08:39:25,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:25,544 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-04-13 08:39:25,545 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:69, output treesize:23 [2018-04-13 08:39:25,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:39:25,582 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:25,583 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-04-13 08:39:25,583 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:39:25,595 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_871 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_871)))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_83| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_83|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-13 08:39:25,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:39:25,598 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:25,602 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-04-13 08:39:25,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:39:25,604 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_83| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_83|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_871 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_871)))))) is different from true [2018-04-13 08:39:25,620 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-04-13 08:39:25,621 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-13 08:39:25,651 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-04-13 08:39:25,651 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-04-13 08:39:25,720 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:39:25,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:25,731 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:25,732 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:25,732 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-04-13 08:39:25,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:25,739 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-04-13 08:39:25,740 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:76, output treesize:34 [2018-04-13 08:39:25,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:39:25,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:25,787 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-04-13 08:39:25,787 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:39:25,805 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_83| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_83|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_883 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_883))))) is different from true [2018-04-13 08:39:25,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:39:25,807 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:25,812 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-04-13 08:39:25,812 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:39:25,813 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_83| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_83|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_883 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_883)))))) is different from true [2018-04-13 08:39:25,829 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-04-13 08:39:25,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-13 08:39:25,864 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-04-13 08:39:25,864 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-04-13 08:39:25,929 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:25,930 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 27 [2018-04-13 08:39:25,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:25,944 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-04-13 08:39:25,944 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:69, output treesize:23 [2018-04-13 08:39:25,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:39:25,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:25,990 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-04-13 08:39:25,990 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:39:26,001 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_895 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_895)))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_83| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_83|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-13 08:39:26,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-04-13 08:39:26,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:26,012 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-04-13 08:39:26,012 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:39:26,013 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_83| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_83|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_895 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_895)))))) is different from true [2018-04-13 08:39:26,031 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-04-13 08:39:26,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-13 08:39:26,062 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-04-13 08:39:26,062 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-04-13 08:39:26,160 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:26,161 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:26,161 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-04-13 08:39:26,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:26,181 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-04-13 08:39:26,181 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:76, output treesize:34 [2018-04-13 08:39:26,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-04-13 08:39:26,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:26,240 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-04-13 08:39:26,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-13 08:39:26,251 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_83| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_83|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_907 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_907)) |c_#length|))) is different from true [2018-04-13 08:39:26,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 6 treesize of output 5 [2018-04-13 08:39:26,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:26,258 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-04-13 08:39:26,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:39:26,260 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_83| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_83|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_907 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_907)) |c_#length|) (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0)))) is different from true [2018-04-13 08:39:26,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-04-13 08:39:26,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-13 08:39:26,306 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-04-13 08:39:26,306 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-04-13 08:39:26,490 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:39:26,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-04-13 08:39:26,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:26,504 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-04-13 08:39:26,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:26,505 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-04-13 08:39:26,505 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-04-13 08:39:26,518 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_83| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_83|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_918 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_918)))))) is different from true [2018-04-13 08:39:26,524 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:26,524 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:26,526 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:26,526 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-04-13 08:39:26,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:26,549 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-04-13 08:39:26,549 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 08:39:26,571 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-04-13 08:39:26,571 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:56, output treesize:86 [2018-04-13 08:39:27,074 INFO L134 CoverageAnalysis]: Checked inductivity of 5708 backedges. 14 proven. 182 refuted. 0 times theorem prover too weak. 4326 trivial. 1186 not checked. [2018-04-13 08:39:27,075 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 08:39:27,075 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-04-13 08:39:27,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-13 08:39:27,075 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-13 08:39:27,075 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=453, Unknown=17, NotChecked=1020, Total=1640 [2018-04-13 08:39:27,075 INFO L87 Difference]: Start difference. First operand 508 states and 555 transitions. Second operand 41 states. [2018-04-13 08:39:27,147 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_83| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_83|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:39:27,148 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-13 08:39:27,167 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_842 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_842)) |c_#length|)) (exists ((v_prenex_895 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_895)))) (exists ((v_prenex_859 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_859)))) (exists ((v_prenex_871 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_871)))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_83| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_83|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_918 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_918))))) (exists ((v_prenex_907 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_907)) |c_#length|)) (exists ((v_prenex_847 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_847)))) (exists ((v_prenex_883 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_883))))) is different from true [2018-04-13 08:39:27,170 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_842 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_842)) |c_#length|)) (exists ((v_prenex_871 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_871)))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_83| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_83|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_918 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_918))))) (exists ((v_prenex_847 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_847))))) is different from true [2018-04-13 08:39:27,172 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_83| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_83|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (v_prenex_847 Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_847))))) (exists ((v_prenex_918 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_918))))) (exists ((v_prenex_842 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_842)) |c_#length|))) (exists ((v_prenex_871 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_871)))))) is different from true [2018-04-13 08:39:27,414 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_895 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_895)))) (exists ((v_prenex_859 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_859)))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_83| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_83|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_907 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_907)) |c_#length|)) (exists ((v_prenex_883 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_883))))) is different from true [2018-04-13 08:39:27,417 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_859 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_859))))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_83| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_83|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_883 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_883))))) (exists ((v_prenex_907 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_907)) |c_#length|) (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0))) (exists ((v_prenex_895 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_895)))))) is different from true [2018-04-13 08:39:30,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:39:30,370 INFO L93 Difference]: Finished difference Result 547 states and 603 transitions. [2018-04-13 08:39:30,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-13 08:39:30,371 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 514 [2018-04-13 08:39:30,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:39:30,372 INFO L225 Difference]: With dead ends: 547 [2018-04-13 08:39:30,372 INFO L226 Difference]: Without dead ends: 547 [2018-04-13 08:39:30,372 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 462 SyntacticMatches, 14 SemanticMatches, 60 ConstructedPredicates, 24 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=382, Invalid=1096, Unknown=24, NotChecked=2280, Total=3782 [2018-04-13 08:39:30,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2018-04-13 08:39:30,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 501. [2018-04-13 08:39:30,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2018-04-13 08:39:30,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 546 transitions. [2018-04-13 08:39:30,376 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 546 transitions. Word has length 514 [2018-04-13 08:39:30,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:39:30,376 INFO L459 AbstractCegarLoop]: Abstraction has 501 states and 546 transitions. [2018-04-13 08:39:30,376 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-13 08:39:30,376 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 546 transitions. [2018-04-13 08:39:30,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2018-04-13 08:39:30,378 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:39:30,378 INFO L355 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, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 08:39:30,378 INFO L408 AbstractCegarLoop]: === Iteration 66 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:39:30,378 INFO L82 PathProgramCache]: Analyzing trace with hash -2016730525, now seen corresponding path program 33 times [2018-04-13 08:39:30,378 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:39:30,379 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:39:30,379 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:39:30,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 08:39:30,379 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:39:30,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:39:30,413 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:39:30,427 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 08:39:30,427 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:39:30,427 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:39:30,428 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 08:39:31,213 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-04-13 08:39:31,213 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 08:39:31,249 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:39:31,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, 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-04-13 08:39:31,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:39:31,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:31,255 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:39:31,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:39:31,258 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-04-13 08:39:31,310 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-04-13 08:39:31,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-04-13 08:39:31,312 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:31,313 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-04-13 08:39:31,313 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:31,316 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:39:31,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:39:31,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:39:31,320 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:16, output treesize:1 [2018-04-13 08:39:31,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:39:31,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:31,400 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-04-13 08:39:31,401 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:31 [2018-04-13 08:39:31,426 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-04-13 08:39:31,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-04-13 08:39:31,428 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:31,429 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-04-13 08:39:31,429 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:31,432 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:39:31,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:39:31,441 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 1 xjuncts. [2018-04-13 08:39:31,442 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:34, output treesize:15 [2018-04-13 08:39:31,460 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:31,460 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:31,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, 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-04-13 08:39:31,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:31,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-04-13 08:39:31,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-13 08:39:31,468 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:31,469 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:39:31,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:39:31,474 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:10 [2018-04-13 08:39:31,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 43 treesize of output 51 [2018-04-13 08:39:31,996 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:31,997 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:31,998 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:31,999 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:32,000 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:32,013 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 78 [2018-04-13 08:39:32,015 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:32,016 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:32,016 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:32,017 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:32,017 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:39:32,021 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 69 treesize of output 80 [2018-04-13 08:39:32,023 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:32,024 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:32,024 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:39:32,024 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:32,028 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 28 treesize of output 54 [2018-04-13 08:39:32,028 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:32,038 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:39:32,061 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:32,062 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:32,063 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:32,064 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:32,064 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:32,067 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:32,090 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 39 treesize of output 95 [2018-04-13 08:39:32,093 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:32,093 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:32,094 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:32,095 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:32,097 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:32,100 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:32,133 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 3 new quantified variables, introduced 9 case distinctions, treesize of input 79 treesize of output 113 [2018-04-13 08:39:32,134 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 8 xjuncts. [2018-04-13 08:39:32,301 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:32,302 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:32,302 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:32,303 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:32,303 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:32,304 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:32,304 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:39:32,311 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 39 treesize of output 85 [2018-04-13 08:39:32,311 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:32,345 INFO L267 ElimStorePlain]: Start of recursive call 6: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 08:39:32,374 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 08:39:32,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 40 treesize of output 42 [2018-04-13 08:39:32,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2018-04-13 08:39:32,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, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-04-13 08:39:32,424 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:32,428 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:39:32,434 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:39:32,466 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 08:39:32,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-04-13 08:39:32,496 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:65, output treesize:76 [2018-04-13 08:39:33,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-04-13 08:39:33,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:33,490 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-04-13 08:39:33,490 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:123, output treesize:122 [2018-04-13 08:39:33,685 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 43 treesize of output 51 [2018-04-13 08:39:33,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 44 treesize of output 46 [2018-04-13 08:39:33,690 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 17 treesize of output 19 [2018-04-13 08:39:33,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-04-13 08:39:33,695 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:33,700 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:39:33,709 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:39:33,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:39:33,769 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-04-13 08:39:33,769 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:131, output treesize:99 [2018-04-13 08:39:33,868 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:33,868 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:33,869 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-04-13 08:39:33,869 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:33,896 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 81 treesize of output 76 [2018-04-13 08:39:33,898 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:33,899 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:33,899 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:33,900 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:33,900 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:33,901 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:33,906 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 44 treesize of output 97 [2018-04-13 08:39:33,906 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:33,921 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:39:33,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-13 08:39:33,939 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:123, output treesize:106 [2018-04-13 08:39:35,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 48 [2018-04-13 08:39:35,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2018-04-13 08:39:35,486 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 41 treesize of output 51 [2018-04-13 08:39:35,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 45 [2018-04-13 08:39:35,493 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:35,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 2 case distinctions, treesize of input 27 treesize of output 48 [2018-04-13 08:39:35,499 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-13 08:39:35,512 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 08:39:35,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, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 67 [2018-04-13 08:39:35,566 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:35,567 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:39:35,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, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 79 [2018-04-13 08:39:35,578 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-04-13 08:39:35,699 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:35,701 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:35,707 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 55 treesize of output 86 [2018-04-13 08:39:35,708 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-13 08:39:35,785 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:35,802 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 6 case distinctions, treesize of input 45 treesize of output 88 [2018-04-13 08:39:35,803 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 8 xjuncts. [2018-04-13 08:39:35,902 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-04-13 08:39:35,955 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-04-13 08:39:35,958 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:35,969 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 70 [2018-04-13 08:39:35,975 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:36,010 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 2 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 114 [2018-04-13 08:39:36,015 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:36,016 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:36,017 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:36,035 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 5 case distinctions, treesize of input 80 treesize of output 130 [2018-04-13 08:39:36,035 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2018-04-13 08:39:36,601 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:36,604 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:36,620 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 5 case distinctions, treesize of input 65 treesize of output 103 [2018-04-13 08:39:36,621 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 4 xjuncts. [2018-04-13 08:39:37,135 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:37,136 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:37,154 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:37,170 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 4 case distinctions, treesize of input 73 treesize of output 123 [2018-04-13 08:39:37,170 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 4 xjuncts. [2018-04-13 08:39:37,452 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:37,454 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:37,455 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:37,471 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 5 case distinctions, treesize of input 69 treesize of output 130 [2018-04-13 08:39:37,471 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 4 xjuncts. [2018-04-13 08:39:37,775 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:37,776 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:37,784 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 2 case distinctions, treesize of input 59 treesize of output 99 [2018-04-13 08:39:37,784 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-04-13 08:39:38,352 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:38,353 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:38,357 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:38,358 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:38,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 72 treesize of output 130 [2018-04-13 08:39:38,388 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 8 xjuncts. [2018-04-13 08:39:38,735 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:38,736 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:38,740 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:38,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 61 treesize of output 134 [2018-04-13 08:39:38,776 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 16 xjuncts. [2018-04-13 08:39:39,373 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:39,377 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:39,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 10 case distinctions, treesize of input 53 treesize of output 138 [2018-04-13 08:39:39,418 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 32 xjuncts. [2018-04-13 08:39:39,961 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:39,961 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:39,963 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:39,964 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:39,979 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 4 case distinctions, treesize of input 74 treesize of output 145 [2018-04-13 08:39:39,980 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 4 xjuncts. [2018-04-13 08:39:40,206 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:40,207 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:40,208 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:40,228 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 5 case distinctions, treesize of input 63 treesize of output 138 [2018-04-13 08:39:40,229 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 8 xjuncts. [2018-04-13 08:39:40,573 INFO L267 ElimStorePlain]: Start of recursive call 12: 16 dim-1 vars, End of recursive call: and 15 xjuncts. [2018-04-13 08:39:40,741 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:40,754 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 77 [2018-04-13 08:39:40,756 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:40,757 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:40,765 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 2 case distinctions, treesize of input 66 treesize of output 106 [2018-04-13 08:39:40,765 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 2 xjuncts. [2018-04-13 08:39:40,799 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:40,802 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:40,818 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 1 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 101 [2018-04-13 08:39:40,819 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 4 xjuncts. [2018-04-13 08:39:40,864 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-13 08:39:41,023 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 17 xjuncts. [2018-04-13 08:39:41,221 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 22 xjuncts. [2018-04-13 08:39:41,391 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 20 xjuncts. [2018-04-13 08:39:41,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2018-04-13 08:39:41,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 39 [2018-04-13 08:39:41,436 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 49 [2018-04-13 08:39:41,445 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 41 treesize of output 53 [2018-04-13 08:39:41,449 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:41,457 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 3 case distinctions, treesize of input 43 treesize of output 64 [2018-04-13 08:39:41,458 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 2 xjuncts. [2018-04-13 08:39:41,480 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:41,481 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 45 treesize of output 56 [2018-04-13 08:39:41,481 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:41,499 INFO L267 ElimStorePlain]: Start of recursive call 29: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 08:39:41,541 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 41 treesize of output 75 [2018-04-13 08:39:41,544 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:41,544 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 50 treesize of output 61 [2018-04-13 08:39:41,545 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:41,673 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:41,674 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:41,682 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 53 treesize of output 84 [2018-04-13 08:39:41,683 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 2 xjuncts. [2018-04-13 08:39:41,756 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:41,758 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:41,765 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 53 treesize of output 84 [2018-04-13 08:39:41,766 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 2 xjuncts. [2018-04-13 08:39:41,838 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:41,840 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:39:41,856 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 6 case distinctions, treesize of input 46 treesize of output 77 [2018-04-13 08:39:41,856 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 4 xjuncts. [2018-04-13 08:39:42,020 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:42,040 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 7 case distinctions, treesize of input 43 treesize of output 86 [2018-04-13 08:39:42,040 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 8 xjuncts. [2018-04-13 08:39:42,201 INFO L267 ElimStorePlain]: Start of recursive call 32: 8 dim-1 vars, End of recursive call: and 9 xjuncts. [2018-04-13 08:39:42,277 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-04-13 08:39:42,348 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-04-13 08:39:42,421 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-04-13 08:39:42,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:39:42,749 INFO L202 ElimStorePlain]: Needed 37 recursive calls to eliminate 10 variables, input treesize:65, output treesize:1 [2018-04-13 08:39:43,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-04-13 08:39:43,241 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:43,260 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-04-13 08:39:43,260 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:82, output treesize:81 [2018-04-13 08:39:43,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 121 treesize of output 127 [2018-04-13 08:39:43,555 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:43,556 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:43,557 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:43,557 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:39:43,558 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:43,559 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:39:43,560 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:43,561 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:43,561 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:39:43,561 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:39:43,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 200 [2018-04-13 08:39:43,600 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:43,601 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:43,605 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:43,675 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 147 [2018-04-13 08:39:43,682 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:39:43,682 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:43,786 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:43,787 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:43,788 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:43,789 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:43,790 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:43,790 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:39:43,796 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 136 [2018-04-13 08:39:43,800 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:43,800 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:43,801 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:43,801 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:43,802 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:43,802 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:43,807 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 43 treesize of output 102 [2018-04-13 08:39:43,807 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:43,824 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:39:43,882 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:43,883 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:43,884 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:43,884 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:43,885 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:39:43,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 93 treesize of output 172 [2018-04-13 08:39:43,920 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:43,921 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:43,922 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:43,923 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:43,924 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:43,925 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:43,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 148 treesize of output 193 [2018-04-13 08:39:43,944 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-13 08:39:44,036 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:44,037 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:44,038 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:44,039 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:44,040 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:44,041 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:44,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 80 treesize of output 157 [2018-04-13 08:39:44,059 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-13 08:39:44,119 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:44,119 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:44,120 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:44,121 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:44,122 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:44,122 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:44,128 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 85 treesize of output 152 [2018-04-13 08:39:44,128 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:44,166 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 08:39:44,448 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:44,449 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:44,450 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:44,469 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 4 case distinctions, treesize of input 78 treesize of output 122 [2018-04-13 08:39:44,477 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:44,478 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:44,478 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:44,479 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:44,480 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:44,481 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:44,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 112 treesize of output 157 [2018-04-13 08:39:44,499 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-04-13 08:39:44,558 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:44,559 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:44,560 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:44,560 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:44,561 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:44,562 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:44,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 149 [2018-04-13 08:39:44,568 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:44,604 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 08:39:44,664 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:44,665 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:44,666 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:44,667 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:44,667 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:44,668 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:39:44,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 148 [2018-04-13 08:39:44,678 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:44,679 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:44,680 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:44,681 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:44,681 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:44,682 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:44,688 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 73 treesize of output 140 [2018-04-13 08:39:44,688 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:44,705 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:39:44,748 INFO L267 ElimStorePlain]: Start of recursive call 4: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-13 08:39:44,815 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-13 08:39:44,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 118 treesize of output 120 [2018-04-13 08:39:44,960 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 49 [2018-04-13 08:39:44,963 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:44,964 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 41 treesize of output 53 [2018-04-13 08:39:44,968 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:44,968 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:44,969 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:44,972 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 36 treesize of output 67 [2018-04-13 08:39:44,973 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:44,982 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:39:45,001 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,012 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 63 [2018-04-13 08:39:45,018 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,019 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,020 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,032 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 4 case distinctions, treesize of input 53 treesize of output 84 [2018-04-13 08:39:45,032 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-04-13 08:39:45,066 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,066 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,067 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,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 45 treesize of output 76 [2018-04-13 08:39:45,070 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:45,093 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 08:39:45,119 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-13 08:39:45,156 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-13 08:39:45,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 9 xjuncts. [2018-04-13 08:39:45,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 121 [2018-04-13 08:39:45,321 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,321 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,322 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,322 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:39:45,323 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,323 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,324 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,332 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 86 treesize of output 135 [2018-04-13 08:39:45,358 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,359 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:39:45,359 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,360 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,360 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,361 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,362 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,363 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,390 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 6 case distinctions, treesize of input 79 treesize of output 193 [2018-04-13 08:39:45,395 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,396 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,397 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,397 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,398 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,398 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,399 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:39:45,399 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,406 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 165 treesize of output 197 [2018-04-13 08:39:45,410 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,411 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,412 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,412 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:39:45,412 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,413 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,414 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 132 [2018-04-13 08:39:45,422 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:45,449 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:39:45,546 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,548 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,549 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,550 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,551 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,551 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:39:45,551 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,552 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,553 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,567 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 3 case distinctions, treesize of input 83 treesize of output 154 [2018-04-13 08:39:45,571 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,576 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,577 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,578 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,578 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,579 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,580 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,580 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,581 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,582 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,582 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:39:45,610 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 0 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 190 [2018-04-13 08:39:45,610 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 3 xjuncts. [2018-04-13 08:39:45,679 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 08:39:45,768 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,769 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,769 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,770 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,770 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,771 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,772 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,772 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,772 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:39:45,779 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 68 treesize of output 147 [2018-04-13 08:39:45,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,785 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,785 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,786 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,787 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,787 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,788 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,789 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,789 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:39:45,796 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 140 [2018-04-13 08:39:45,797 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:45,815 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:39:45,898 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,898 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,899 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,899 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,900 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,901 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,901 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:39:45,902 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,908 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 72 treesize of output 149 [2018-04-13 08:39:45,912 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,912 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,913 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,914 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,914 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,915 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,915 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,916 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,916 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:45,917 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:39:45,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 154 [2018-04-13 08:39:45,924 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:45,943 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:39:46,065 INFO L267 ElimStorePlain]: Start of recursive call 26: 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-13 08:39:46,068 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:46,069 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:46,070 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:46,070 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:46,071 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:46,072 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:46,072 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:39:46,072 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:46,081 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 71 treesize of output 159 [2018-04-13 08:39:46,085 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:46,086 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:46,087 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:46,087 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:39:46,088 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:46,088 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:46,089 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:46,099 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 58 treesize of output 132 [2018-04-13 08:39:46,103 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:46,103 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:46,104 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:46,104 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:46,105 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:46,106 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:46,106 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:46,107 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:46,107 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:46,107 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:39:46,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 160 [2018-04-13 08:39:46,115 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:46,130 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:39:46,145 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:39:46,201 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-13 08:39:46,249 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-13 08:39:46,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-2 vars, End of recursive call: 61 dim-0 vars, and 12 xjuncts. [2018-04-13 08:39:46,546 INFO L202 ElimStorePlain]: Needed 37 recursive calls to eliminate 11 variables, input treesize:187, output treesize:1476 [2018-04-13 08:39:47,452 WARN L151 SmtUtils]: Spent 183ms on a formula simplification. DAG size of input: 537 DAG size of output 108 [2018-04-13 08:39:47,459 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:47,469 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 101 treesize of output 91 [2018-04-13 08:39:47,469 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:47,470 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:39:47,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:47,471 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:39:47,471 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:47,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 61 [2018-04-13 08:39:47,500 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:47,501 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:47,502 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:47,502 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:47,503 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:47,503 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:39:47,504 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:47,505 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:47,505 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:47,506 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:47,507 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:47,507 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:47,519 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:47,520 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 231 [2018-04-13 08:39:47,520 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:47,542 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:39:47,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 08:39:47,576 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 13 variables, input treesize:305, output treesize:90 [2018-04-13 08:39:52,092 WARN L151 SmtUtils]: Spent 584ms on a formula simplification. DAG size of input: 111 DAG size of output 73 [2018-04-13 08:39:52,103 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 90 treesize of output 87 [2018-04-13 08:39:52,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 63 treesize of output 66 [2018-04-13 08:39:52,115 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 66 treesize of output 76 [2018-04-13 08:39:52,118 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:52,131 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 90 [2018-04-13 08:39:52,134 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:52,136 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:52,138 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:52,139 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:52,148 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 2 case distinctions, treesize of input 82 treesize of output 116 [2018-04-13 08:39:52,152 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:52,153 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:52,154 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:52,155 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:52,156 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:52,157 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:52,158 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:52,158 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:52,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 167 [2018-04-13 08:39:52,169 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:52,183 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:39:52,200 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:52,201 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:52,201 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:52,204 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 72 treesize of output 110 [2018-04-13 08:39:52,206 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:52,206 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:52,207 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:52,208 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:52,208 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:52,209 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:52,214 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 67 treesize of output 144 [2018-04-13 08:39:52,215 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:52,226 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:39:52,244 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 08:39:52,272 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:52,273 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 70 treesize of output 84 [2018-04-13 08:39:52,276 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:52,276 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:52,277 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:52,280 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 65 treesize of output 103 [2018-04-13 08:39:52,282 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:52,283 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:52,284 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:52,284 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:52,285 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:52,286 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:52,300 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 67 treesize of output 144 [2018-04-13 08:39:52,300 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:52,310 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:39:52,317 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:39:52,342 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 08:39:52,375 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 08:39:52,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 08:39:52,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 251 treesize of output 208 [2018-04-13 08:39:52,478 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:52,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 2 new quantified variables, introduced 3 case distinctions, treesize of input 197 treesize of output 200 [2018-04-13 08:39:52,751 WARN L151 SmtUtils]: Spent 212ms on a formula simplification. DAG size of input: 89 DAG size of output 82 [2018-04-13 08:39:52,752 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:39:52,752 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:52,758 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:52,761 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:52,777 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:52,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 10 case distinctions, treesize of input 191 treesize of output 249 [2018-04-13 08:39:52,889 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 8 xjuncts. [2018-04-13 08:39:53,202 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 08:39:53,323 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 164 treesize of output 140 [2018-04-13 08:39:53,352 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:39:53,352 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:53,355 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:53,356 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:53,359 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:53,359 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:53,360 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:53,361 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:53,363 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:53,366 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:53,367 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:53,367 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:53,445 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 3 new quantified variables, introduced 13 case distinctions, treesize of input 132 treesize of output 316 [2018-04-13 08:39:53,446 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-13 08:39:53,455 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 64 xjuncts. [2018-04-13 08:39:54,007 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-04-13 08:39:54,012 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 164 treesize of output 142 [2018-04-13 08:39:54,038 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:39:54,038 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:54,041 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,042 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,043 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,043 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,044 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,045 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,045 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,046 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,048 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,049 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,049 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,050 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,051 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,051 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,075 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 2 case distinctions, treesize of input 127 treesize of output 290 [2018-04-13 08:39:54,076 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-04-13 08:39:54,195 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 08:39:54,197 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 164 treesize of output 142 [2018-04-13 08:39:54,239 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,240 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,241 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,242 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,244 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,246 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,248 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,248 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:39:54,251 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,252 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,253 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,294 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 4 case distinctions, treesize of input 127 treesize of output 259 [2018-04-13 08:39:54,295 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 2 xjuncts. [2018-04-13 08:39:54,296 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:39:54,297 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:54,377 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 08:39:54,601 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 113 treesize of output 97 [2018-04-13 08:39:54,622 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,623 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,623 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,624 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,624 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,625 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,625 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,626 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,626 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,628 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,628 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,629 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,629 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,630 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,630 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,630 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:39:54,631 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,642 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 64 treesize of output 284 [2018-04-13 08:39:54,645 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,645 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,646 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,646 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,647 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,647 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,648 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,648 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,649 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,649 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,649 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,650 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,650 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,651 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:39: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, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 218 [2018-04-13 08:39:54,659 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:54,680 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:39:54,686 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:39:54,688 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 119 treesize of output 101 [2018-04-13 08:39:54,733 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:39:54,733 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:54,736 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,736 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,737 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,737 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,738 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,739 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,740 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,741 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,741 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,742 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,742 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,743 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,743 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,745 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,745 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,746 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,746 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,748 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,779 INFO L477 Elim1Store]: Elim1 did not use 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 85 treesize of output 349 [2018-04-13 08:39:54,782 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:39:54,782 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:54,888 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,889 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,890 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,891 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,892 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,893 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,894 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,895 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,896 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,897 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,898 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,898 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,899 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,900 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,901 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,904 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,904 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,907 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,908 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,909 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,910 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,912 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:54,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 81 treesize of output 421 [2018-04-13 08:39:54,965 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 8 xjuncts. [2018-04-13 08:39:55,178 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,178 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,179 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,180 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,181 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,181 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,182 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,182 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,183 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,184 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,184 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,185 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,185 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,186 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:39:55,198 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 77 treesize of output 262 [2018-04-13 08:39:55,199 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:55,262 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,263 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,263 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,264 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,265 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,265 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,266 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,266 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,267 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,268 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,268 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,269 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,269 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,270 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,271 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,271 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,272 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,272 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:39:55,273 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,291 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 320 [2018-04-13 08:39:55,292 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:55,342 INFO L267 ElimStorePlain]: Start of recursive call 31: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-13 08:39:55,377 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-13 08:39:55,381 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 113 treesize of output 93 [2018-04-13 08:39:55,416 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:39:55,417 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:55,422 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,426 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,429 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,431 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,437 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,441 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,444 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,450 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,452 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,454 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,455 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,460 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,464 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,465 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,466 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,467 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,469 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,470 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,479 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,481 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,488 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,585 INFO L303 Elim1Store]: Index analysis took 167 ms [2018-04-13 08:39:55,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 23 disjoint index pairs (out of 28 index pairs), introduced 5 new quantified variables, introduced 16 case distinctions, treesize of input 85 treesize of output 397 [2018-04-13 08:39:55,647 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,648 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,649 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,650 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,650 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,651 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:39:55,651 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,652 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,653 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,653 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,654 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,655 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,655 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,656 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,657 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,657 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:39:55,658 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,659 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,659 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:55,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 342 treesize of output 433 [2018-04-13 08:39:55,684 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:56,282 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,284 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,285 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,286 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,287 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,288 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,290 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,292 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,292 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,293 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,294 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,295 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,296 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,297 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,298 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,299 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,299 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,302 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,304 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,305 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,306 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,307 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,308 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,309 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,310 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,311 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,314 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,315 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,316 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,317 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,318 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,319 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 32 disjoint index pairs (out of 28 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 515 [2018-04-13 08:39:56,391 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 4 xjuncts. [2018-04-13 08:39:56,908 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,910 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,911 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,911 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,912 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,915 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,916 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,917 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,918 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,919 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,921 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,922 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,925 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,927 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,928 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,932 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,932 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,933 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,934 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,935 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,936 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,938 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,944 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,945 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,949 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,950 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:56,955 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:57,013 INFO L303 Elim1Store]: Index analysis took 107 ms [2018-04-13 08:39:57,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 28 disjoint index pairs (out of 36 index pairs), introduced 5 new quantified variables, introduced 19 case distinctions, treesize of input 90 treesize of output 485 [2018-04-13 08:39:57,060 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 32 xjuncts. [2018-04-13 08:39:58,199 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:58,201 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:58,203 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:58,204 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:58,206 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:58,210 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:58,212 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:58,213 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:58,215 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:58,217 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:58,222 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:58,223 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:58,224 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:58,229 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:58,230 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:58,231 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:58,237 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:58,239 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:58,240 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:58,241 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:58,245 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:58,246 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:58,248 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:58,251 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:58,253 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:58,319 INFO L303 Elim1Store]: Index analysis took 123 ms [2018-04-13 08:39:58,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 26 disjoint index pairs (out of 36 index pairs), introduced 5 new quantified variables, introduced 20 case distinctions, treesize of input 88 treesize of output 471 [2018-04-13 08:39:58,370 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 32 xjuncts. [2018-04-13 08:39:58,895 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:58,896 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:58,897 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:58,897 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:58,900 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:58,901 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:58,902 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:58,902 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:58,904 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:58,905 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:58,905 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:58,906 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:58,907 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:58,908 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:58,909 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:58,910 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:58,910 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:58,911 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:58,912 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:39:58,912 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:58,913 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:58,914 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:58,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 19 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 340 [2018-04-13 08:39:58,944 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-04-13 08:39:59,400 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:59,401 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:59,401 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:59,402 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:59,403 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:59,406 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:59,406 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:59,407 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:59,408 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:59,408 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:59,411 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:59,412 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:59,412 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:59,413 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:59,414 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:59,415 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:59,415 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:59,416 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:59,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:59,418 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:59,419 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:39:59,420 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:59,420 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:59,421 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:59,423 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:59,423 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:39:59,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 23 disjoint index pairs (out of 28 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 83 treesize of output 416 [2018-04-13 08:39:59,477 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 3 xjuncts. [2018-04-13 08:40:00,081 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,081 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,082 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,083 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,085 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,085 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,086 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,087 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,087 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,089 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,089 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,090 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,091 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,091 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,092 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,092 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,093 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,094 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,094 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:40:00,095 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,095 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,096 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 19 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 329 [2018-04-13 08:40:00,122 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-04-13 08:40:00,597 INFO L267 ElimStorePlain]: Start of recursive call 38: 16 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-04-13 08:40:00,709 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-04-13 08:40:00,711 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 113 treesize of output 95 [2018-04-13 08:40:00,737 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,738 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,739 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,741 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,742 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,743 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,744 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,746 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,748 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,749 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,750 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,754 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,756 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,758 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,759 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,761 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,762 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,763 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,765 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,766 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,768 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,770 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,773 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,775 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,777 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,850 INFO L303 Elim1Store]: Index analysis took 115 ms [2018-04-13 08:40:00,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 25 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 80 treesize of output 411 [2018-04-13 08:40:00,873 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,874 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,874 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,875 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,876 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,876 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,877 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,877 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,878 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,879 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,879 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,880 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,880 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,882 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,882 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,883 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,883 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:40:00,883 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:00,903 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 375 treesize of output 441 [2018-04-13 08:40:00,904 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-04-13 08:40:01,072 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,073 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,073 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,074 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,074 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,075 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,075 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,076 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,076 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,077 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,077 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,077 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,078 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,078 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,079 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,079 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,080 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,080 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,081 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,081 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,081 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,082 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:40:01,082 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,083 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,083 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,099 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 78 treesize of output 378 [2018-04-13 08:40:01,099 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-04-13 08:40:01,160 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,161 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,162 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,164 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,165 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,166 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,167 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,168 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,170 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,171 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,172 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,175 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,177 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,178 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,179 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,180 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,181 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,182 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,182 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,183 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,185 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,188 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,189 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,190 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,191 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,192 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,193 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,195 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,196 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,197 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 30 disjoint index pairs (out of 28 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 76 treesize of output 493 [2018-04-13 08:40:01,278 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 8 xjuncts. [2018-04-13 08:40:01,490 INFO L267 ElimStorePlain]: Start of recursive call 47: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-13 08:40:01,491 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:40:01,491 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-04-13 08:40:01,531 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-13 08:40:01,533 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 113 treesize of output 95 [2018-04-13 08:40:01,589 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,590 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,591 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,592 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,595 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,595 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,596 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,597 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,599 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,600 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,600 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,601 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,602 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,603 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,604 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,605 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,605 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,606 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,607 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:40:01,608 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,608 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,609 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 19 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 312 [2018-04-13 08:40:01,663 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,671 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,699 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,710 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,713 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,714 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,723 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,724 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,726 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,727 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,728 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,729 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,731 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,733 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,733 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:40:01,831 INFO L303 Elim1Store]: Index analysis took 176 ms [2018-04-13 08:40:01,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 248 [2018-04-13 08:40:01,834 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-04-13 08:40:01,886 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:40:01,894 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:40:01,896 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 113 treesize of output 95 [2018-04-13 08:40:01,917 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:40:01,917 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-04-13 08:40:01,926 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,929 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,930 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,931 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,933 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,936 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,937 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,939 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,940 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,941 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,942 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,943 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,944 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,945 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,946 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,947 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,947 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,951 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:01,953 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 19 disjoint index pairs (out of 21 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 80 treesize of output 350 [2018-04-13 08:40:02,018 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,022 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,023 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,025 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,027 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,030 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,035 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,037 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,039 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,042 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,044 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,045 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,046 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,050 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,055 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,056 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,062 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,063 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,064 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,068 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,071 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,073 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,075 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,142 INFO L303 Elim1Store]: Index analysis took 128 ms [2018-04-13 08:40:02,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 23 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 13 case distinctions, treesize of input 315 treesize of output 425 [2018-04-13 08:40:02,172 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 8 xjuncts. [2018-04-13 08:40:02,475 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,476 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,477 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,477 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,478 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,479 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,480 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,480 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,481 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,482 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,482 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,483 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,484 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,484 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,485 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,486 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,486 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,487 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:40:02,487 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,488 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,489 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,489 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,490 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,491 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,516 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 78 treesize of output 365 [2018-04-13 08:40:02,517 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-04-13 08:40:02,603 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,604 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,605 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,605 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,606 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:40:02,606 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,607 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,608 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,608 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,609 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,609 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,610 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,611 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,611 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,612 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:40:02,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 268 [2018-04-13 08:40:02,630 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-04-13 08:40:02,720 INFO L267 ElimStorePlain]: Start of recursive call 57: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-13 08:40:02,760 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-13 08:40:02,762 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 127 treesize of output 109 [2018-04-13 08:40:02,787 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,788 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,790 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,792 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,793 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,794 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,795 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,796 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,797 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,798 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,801 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,803 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,804 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,805 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,806 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,808 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,809 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,810 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,811 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,812 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 366 [2018-04-13 08:40:02,858 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,859 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,860 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,861 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,862 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,863 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,863 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,864 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,865 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,866 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,867 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,870 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,870 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,871 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,872 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,873 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,873 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,874 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,875 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,877 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,878 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,879 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,879 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,880 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:02,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 25 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 350 treesize of output 450 [2018-04-13 08:40:02,926 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 4 xjuncts. [2018-04-13 08:40:03,138 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:03,139 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:03,140 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:03,140 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:03,141 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:03,142 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:03,142 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:03,143 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:03,144 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:03,144 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:03,145 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:03,145 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:03,146 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:03,147 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:03,148 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:03,148 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:03,149 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:03,149 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:40:03,150 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:03,166 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 323 [2018-04-13 08:40:03,166 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-04-13 08:40:03,215 INFO L267 ElimStorePlain]: Start of recursive call 62: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 08:40:03,216 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:40:03,216 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-04-13 08:40:03,248 INFO L267 ElimStorePlain]: Start of recursive call 61: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 08:40:03,249 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 107 treesize of output 93 [2018-04-13 08:40:03,270 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:03,271 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:03,272 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:03,272 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:03,273 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:03,274 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:03,275 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:03,275 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:03,276 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:03,276 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:03,277 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:03,278 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:03,278 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:03,278 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:40:03,294 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 236 [2018-04-13 08:40:03,297 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:03,298 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:03,298 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:03,299 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:03,299 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:03,300 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:03,301 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:03,301 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:03,302 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:03,302 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:40:03,310 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 46 treesize of output 176 [2018-04-13 08:40:03,310 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-04-13 08:40:03,325 INFO L267 ElimStorePlain]: Start of recursive call 67: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:40:03,329 INFO L267 ElimStorePlain]: Start of recursive call 66: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:40:03,635 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 21 xjuncts. [2018-04-13 08:40:03,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 200 [2018-04-13 08:40:03,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 187 treesize of output 189 [2018-04-13 08:40:03,801 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:03,802 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:03,802 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:40:03,805 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 173 treesize of output 178 [2018-04-13 08:40:03,805 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-04-13 08:40:03,806 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:40:03,806 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-04-13 08:40:03,859 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:03,860 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:03,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, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 171 treesize of output 213 [2018-04-13 08:40:03,902 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 8 xjuncts. [2018-04-13 08:40:03,963 INFO L267 ElimStorePlain]: Start of recursive call 70: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 08:40:04,003 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 145 treesize of output 127 [2018-04-13 08:40:04,024 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,024 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,025 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,026 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,026 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:40:04,031 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 112 treesize of output 162 [2018-04-13 08:40:04,031 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-04-13 08:40:04,032 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:40:04,032 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-04-13 08:40:04,042 INFO L267 ElimStorePlain]: Start of recursive call 74: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:40:04,045 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 156 treesize of output 134 [2018-04-13 08:40:04,094 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,095 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,100 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,101 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,104 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,108 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,109 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,110 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,113 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,157 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 6 case distinctions, treesize of input 126 treesize of output 230 [2018-04-13 08:40:04,158 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 2 xjuncts. [2018-04-13 08:40:04,159 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:40:04,159 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-04-13 08:40:04,232 INFO L267 ElimStorePlain]: Start of recursive call 77: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 08:40:04,257 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 79 treesize of output 69 [2018-04-13 08:40:04,269 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,270 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,270 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,271 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,271 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,272 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:40:04,275 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 116 [2018-04-13 08:40:04,277 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,277 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,277 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:40:04,279 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 61 [2018-04-13 08:40:04,279 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-04-13 08:40:04,285 INFO L267 ElimStorePlain]: Start of recursive call 81: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:40:04,287 INFO L267 ElimStorePlain]: Start of recursive call 80: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:40:04,289 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 98 treesize of output 82 [2018-04-13 08:40:04,317 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,318 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,319 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,320 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,322 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,323 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,325 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,326 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,327 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,328 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,329 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,330 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,332 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,333 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,337 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,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 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 321 [2018-04-13 08:40:04,389 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,390 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,390 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,391 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,392 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,392 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,393 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,393 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,394 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,395 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,395 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,396 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,396 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,397 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:40:04,407 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 277 treesize of output 340 [2018-04-13 08:40:04,407 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2018-04-13 08:40:04,528 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,529 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,530 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,531 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,532 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,533 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,534 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,534 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,535 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,537 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,538 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,547 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 1 case distinctions, treesize of input 70 treesize of output 225 [2018-04-13 08:40:04,548 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2018-04-13 08:40:04,661 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,661 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,662 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,663 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,664 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,665 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,665 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,666 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,668 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,668 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,670 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,681 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 2 case distinctions, treesize of input 54 treesize of output 205 [2018-04-13 08:40:04,681 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2018-04-13 08:40:04,738 INFO L267 ElimStorePlain]: Start of recursive call 84: 8 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 08:40:04,740 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:40:04,740 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-04-13 08:40:04,754 INFO L267 ElimStorePlain]: Start of recursive call 83: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 08:40:04,769 INFO L267 ElimStorePlain]: Start of recursive call 69: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 08:40:04,777 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 98 treesize of output 95 [2018-04-13 08:40:04,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 63 treesize of output 66 [2018-04-13 08:40:04,789 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 66 treesize of output 76 [2018-04-13 08:40:04,791 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 84 [2018-04-13 08:40:04,795 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,795 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,796 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,799 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 65 treesize of output 103 [2018-04-13 08:40:04,802 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,803 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,803 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,804 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,804 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,805 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,810 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 67 treesize of output 144 [2018-04-13 08:40:04,811 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2018-04-13 08:40:04,819 INFO L267 ElimStorePlain]: Start of recursive call 93: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:40:04,826 INFO L267 ElimStorePlain]: Start of recursive call 92: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:40:04,843 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,854 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 90 [2018-04-13 08:40:04,857 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,859 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,861 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,862 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,872 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 2 case distinctions, treesize of input 82 treesize of output 116 [2018-04-13 08:40:04,875 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,876 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,877 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,878 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,880 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,882 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 167 [2018-04-13 08:40:04,894 INFO L267 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2018-04-13 08:40:04,910 INFO L267 ElimStorePlain]: Start of recursive call 96: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:40:04,927 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,928 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,929 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,931 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 72 treesize of output 110 [2018-04-13 08:40:04,933 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,934 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,935 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,935 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,936 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,937 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:40:04,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 67 treesize of output 144 [2018-04-13 08:40:04,943 INFO L267 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2018-04-13 08:40:04,954 INFO L267 ElimStorePlain]: Start of recursive call 98: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:40:04,972 INFO L267 ElimStorePlain]: Start of recursive call 95: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 08:40:04,999 INFO L267 ElimStorePlain]: Start of recursive call 91: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 08:40:05,025 INFO L267 ElimStorePlain]: Start of recursive call 90: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 08:40:05,059 INFO L267 ElimStorePlain]: Start of recursive call 89: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 08:40:05,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:40:05,482 INFO L202 ElimStorePlain]: Needed 99 recursive calls to eliminate 7 variables, input treesize:271, output treesize:1 [2018-04-13 08:40:09,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:40:09,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:40:09,554 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-04-13 08:40:09,555 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:333, output treesize:332 [2018-04-13 08:40:10,058 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-04-13 08:40:10,058 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 8 variables, input treesize:426, output treesize:1 [2018-04-13 08:40:10,806 INFO L134 CoverageAnalysis]: Checked inductivity of 5708 backedges. 3457 proven. 990 refuted. 175 times theorem prover too weak. 1086 trivial. 0 not checked. [2018-04-13 08:40:10,806 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 08:40:10,806 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-04-13 08:40:10,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-04-13 08:40:10,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-04-13 08:40:10,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=10398, Unknown=414, NotChecked=0, Total=11130 [2018-04-13 08:40:10,807 INFO L87 Difference]: Start difference. First operand 501 states and 546 transitions. Second operand 106 states. [2018-04-13 08:40:14,836 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 81 DAG size of output 72 [2018-04-13 08:40:15,888 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 101 DAG size of output 76 [2018-04-13 08:40:18,454 WARN L151 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 111 DAG size of output 71 [2018-04-13 08:40:20,087 WARN L151 SmtUtils]: Spent 202ms on a formula simplification. DAG size of input: 116 DAG size of output 81 [2018-04-13 08:40:22,090 WARN L151 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 102 DAG size of output 69 [2018-04-13 08:40:22,900 WARN L151 SmtUtils]: Spent 167ms on a formula simplification. DAG size of input: 128 DAG size of output 84 [2018-04-13 08:40:24,364 WARN L151 SmtUtils]: Spent 386ms on a formula simplification. DAG size of input: 122 DAG size of output 100 [2018-04-13 08:40:26,317 WARN L151 SmtUtils]: Spent 398ms on a formula simplification. DAG size of input: 134 DAG size of output 111 [2018-04-13 08:40:30,207 WARN L151 SmtUtils]: Spent 820ms on a formula simplification. DAG size of input: 137 DAG size of output 114 [2018-04-13 08:40:31,835 WARN L151 SmtUtils]: Spent 315ms on a formula simplification. DAG size of input: 135 DAG size of output 112 [2018-04-13 08:40:36,718 WARN L151 SmtUtils]: Spent 476ms on a formula simplification. DAG size of input: 160 DAG size of output 116 [2018-04-13 08:40:39,304 WARN L151 SmtUtils]: Spent 288ms on a formula simplification. DAG size of input: 109 DAG size of output 106 [2018-04-13 08:40:41,991 WARN L151 SmtUtils]: Spent 501ms on a formula simplification. DAG size of input: 122 DAG size of output 116 [2018-04-13 08:40:54,823 WARN L151 SmtUtils]: Spent 1612ms on a formula simplification. DAG size of input: 128 DAG size of output 124 [2018-04-13 08:41:09,195 WARN L151 SmtUtils]: Spent 989ms on a formula simplification. DAG size of input: 122 DAG size of output 118 [2018-04-13 08:41:15,142 WARN L151 SmtUtils]: Spent 1713ms on a formula simplification. DAG size of input: 137 DAG size of output 133 [2018-04-13 08:41:21,649 WARN L151 SmtUtils]: Spent 2404ms on a formula simplification. DAG size of input: 143 DAG size of output 139 [2018-04-13 08:41:40,237 WARN L151 SmtUtils]: Spent 6391ms on a formula simplification. DAG size of input: 148 DAG size of output 144 [2018-04-13 08:41:47,186 WARN L151 SmtUtils]: Spent 1251ms on a formula simplification. DAG size of input: 173 DAG size of output 133 [2018-04-13 08:41:51,995 WARN L151 SmtUtils]: Spent 1041ms on a formula simplification. DAG size of input: 182 DAG size of output 142 [2018-04-13 08:41:54,689 WARN L151 SmtUtils]: Spent 419ms on a formula simplification. DAG size of input: 139 DAG size of output 116 [2018-04-13 08:41:55,996 WARN L151 SmtUtils]: Spent 239ms on a formula simplification. DAG size of input: 156 DAG size of output 116 [2018-04-13 08:42:04,988 WARN L151 SmtUtils]: Spent 6501ms on a formula simplification. DAG size of input: 157 DAG size of output 134 [2018-04-13 08:42:06,359 WARN L151 SmtUtils]: Spent 393ms on a formula simplification. DAG size of input: 161 DAG size of output 121 [2018-04-13 08:42:11,778 WARN L151 SmtUtils]: Spent 458ms on a formula simplification. DAG size of input: 137 DAG size of output 114 [2018-04-13 08:42:17,852 WARN L151 SmtUtils]: Spent 2576ms on a formula simplification. DAG size of input: 146 DAG size of output 123 [2018-04-13 08:42:22,331 WARN L151 SmtUtils]: Spent 3073ms on a formula simplification. DAG size of input: 152 DAG size of output 129 [2018-04-13 08:42:24,049 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 118 DAG size of output 114 [2018-04-13 08:42:26,809 WARN L151 SmtUtils]: Spent 546ms on a formula simplification. DAG size of input: 123 DAG size of output 117 [2018-04-13 08:42:29,353 WARN L151 SmtUtils]: Spent 451ms on a formula simplification. DAG size of input: 140 DAG size of output 114 [2018-04-13 08:42:33,992 WARN L151 SmtUtils]: Spent 333ms on a formula simplification. DAG size of input: 113 DAG size of output 110 [2018-04-13 08:42:36,707 WARN L151 SmtUtils]: Spent 462ms on a formula simplification. DAG size of input: 112 DAG size of output 109 [2018-04-13 08:42:40,490 WARN L151 SmtUtils]: Spent 975ms on a formula simplification. DAG size of input: 117 DAG size of output 115 [2018-04-13 08:42:40,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:42:40,962 INFO L93 Difference]: Finished difference Result 535 states and 586 transitions. [2018-04-13 08:42:40,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-04-13 08:42:40,962 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 514 [2018-04-13 08:42:40,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:42:40,963 INFO L225 Difference]: With dead ends: 535 [2018-04-13 08:42:40,963 INFO L226 Difference]: Without dead ends: 535 [2018-04-13 08:42:40,964 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 585 GetRequests, 410 SyntacticMatches, 2 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7507 ImplicationChecksByTransitivity, 118.1s TimeCoverageRelationStatistics Valid=905, Invalid=28502, Unknown=1043, NotChecked=0, Total=30450 [2018-04-13 08:42:40,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-04-13 08:42:40,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 524. [2018-04-13 08:42:40,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-04-13 08:42:40,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 574 transitions. [2018-04-13 08:42:40,968 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 574 transitions. Word has length 514 [2018-04-13 08:42:40,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:42:40,968 INFO L459 AbstractCegarLoop]: Abstraction has 524 states and 574 transitions. [2018-04-13 08:42:40,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-04-13 08:42:40,968 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 574 transitions. [2018-04-13 08:42:40,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2018-04-13 08:42:40,970 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:42:40,970 INFO L355 BasicCegarLoop]: trace histogram [37, 36, 29, 29, 29, 29, 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, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 08:42:40,970 INFO L408 AbstractCegarLoop]: === Iteration 67 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:42:40,971 INFO L82 PathProgramCache]: Analyzing trace with hash 666334952, now seen corresponding path program 34 times [2018-04-13 08:42:40,971 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:42:40,971 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:42:40,971 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:42:40,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 08:42:40,971 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:42:40,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:42:40,995 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:42:41,218 INFO L134 CoverageAnalysis]: Checked inductivity of 5864 backedges. 326 proven. 1083 refuted. 0 times theorem prover too weak. 4455 trivial. 0 not checked. [2018-04-13 08:42:41,218 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:42:41,218 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:42:41,218 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 08:42:41,246 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 08:42:41,246 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 08:42:41,251 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:42:41,427 INFO L134 CoverageAnalysis]: Checked inductivity of 5864 backedges. 2623 proven. 47 refuted. 0 times theorem prover too weak. 3194 trivial. 0 not checked. [2018-04-13 08:42:41,427 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 08:42:41,428 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 26 [2018-04-13 08:42:41,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-13 08:42:41,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-13 08:42:41,428 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2018-04-13 08:42:41,428 INFO L87 Difference]: Start difference. First operand 524 states and 574 transitions. Second operand 26 states. [2018-04-13 08:42:41,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:42:41,756 INFO L93 Difference]: Finished difference Result 504 states and 547 transitions. [2018-04-13 08:42:41,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-13 08:42:41,756 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 519 [2018-04-13 08:42:41,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:42:41,758 INFO L225 Difference]: With dead ends: 504 [2018-04-13 08:42:41,758 INFO L226 Difference]: Without dead ends: 496 [2018-04-13 08:42:41,758 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 509 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=237, Invalid=1485, Unknown=0, NotChecked=0, Total=1722 [2018-04-13 08:42:41,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2018-04-13 08:42:41,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2018-04-13 08:42:41,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2018-04-13 08:42:41,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 539 transitions. [2018-04-13 08:42:41,761 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 539 transitions. Word has length 519 [2018-04-13 08:42:41,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:42:41,761 INFO L459 AbstractCegarLoop]: Abstraction has 496 states and 539 transitions. [2018-04-13 08:42:41,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-13 08:42:41,761 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 539 transitions. [2018-04-13 08:42:41,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2018-04-13 08:42:41,763 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:42:41,763 INFO L355 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, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 08:42:41,764 INFO L408 AbstractCegarLoop]: === Iteration 68 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:42:41,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1357864861, now seen corresponding path program 35 times [2018-04-13 08:42:41,764 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:42:41,764 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:42:41,764 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:42:41,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 08:42:41,764 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:42:41,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:42:41,797 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:42:41,810 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 08:42:41,810 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:42:41,810 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:42:41,810 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 08:42:41,957 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-04-13 08:42:41,957 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 08:42:41,966 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:42:41,972 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-04-13 08:42:41,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:42:41,974 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-04-13 08:42:41,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 12 treesize of output 11 [2018-04-13 08:42:41,975 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 08:42:41,976 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:42:41,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:42:41,976 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2018-04-13 08:42:42,052 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-04-13 08:42:42,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:42:42,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:42:42,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:42:42,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:42:42,055 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:11, output treesize:1 [2018-04-13 08:42:42,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 08:42:42,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:42:42,075 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-04-13 08:42:42,075 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:27, output treesize:26 [2018-04-13 08:42:42,100 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 24 treesize of output 36 [2018-04-13 08:42:42,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2018-04-13 08:42:42,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 08:42:42,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2018-04-13 08:42:42,120 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 08:42:42,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 08:42:42,139 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-04-13 08:42:42,140 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:38, output treesize:43 [2018-04-13 08:42:42,165 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:42,166 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:42,166 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 47 treesize of output 41 [2018-04-13 08:42:42,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:42:42,167 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:42:42,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:42:42,180 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 28 treesize of output 23 [2018-04-13 08:42:42,181 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:42,182 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:42,182 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 23 treesize of output 50 [2018-04-13 08:42:42,182 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 08:42:42,186 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:42:42,191 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-04-13 08:42:42,191 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:83, output treesize:30 [2018-04-13 08:42:42,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-04-13 08:42:42,240 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:42:42,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:42:42,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-04-13 08:42:42,389 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-04-13 08:42:42,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-04-13 08:42:42,391 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:42,392 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-04-13 08:42:42,392 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 08:42:42,395 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:42:42,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:42:42,403 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 1 xjuncts. [2018-04-13 08:42:42,403 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:34, output treesize:5 [2018-04-13 08:42:42,496 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:42,496 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-04-13 08:42:42,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:42:42,503 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-04-13 08:42:42,503 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:46, output treesize:40 [2018-04-13 08:42:42,549 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 43 treesize of output 53 [2018-04-13 08:42:42,551 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:42,553 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:42,566 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 84 [2018-04-13 08:42:42,567 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:42:42,568 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 08:42:42,599 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:42,601 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:42,604 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:42,618 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 6 case distinctions, treesize of input 41 treesize of output 97 [2018-04-13 08:42:42,619 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-04-13 08:42:42,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:42,673 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:42,673 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:42:42,675 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 67 [2018-04-13 08:42:42,676 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 08:42:42,711 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:42,712 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:42,712 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:42,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 74 [2018-04-13 08:42:42,715 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 08:42:42,747 INFO L267 ElimStorePlain]: Start of recursive call 3: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-13 08:42:42,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 40 treesize of output 42 [2018-04-13 08:42:42,790 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:42,791 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-04-13 08:42:42,791 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 08:42:42,796 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:42:42,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-13 08:42:42,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-04-13 08:42:42,868 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:70, output treesize:152 [2018-04-13 08:42:42,956 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:42:42,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:42:42,958 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:42,958 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:42,959 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 59 treesize of output 53 [2018-04-13 08:42:42,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:42:42,959 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:42:42,960 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 08:42:42,960 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:42:42,960 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 08:42:42,978 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 40 treesize of output 33 [2018-04-13 08:42:42,980 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:42,980 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:42,980 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:42,981 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:42,982 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:42,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 111 [2018-04-13 08:42:42,983 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 08:42:42,989 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:42:43,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 08:42:43,009 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 11 variables, input treesize:235, output treesize:42 [2018-04-13 08:42:43,595 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 62 treesize of output 51 [2018-04-13 08:42:43,597 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:43,597 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 43 treesize of output 50 [2018-04-13 08:42:43,615 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:43,616 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:43,616 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:43,618 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 42 treesize of output 68 [2018-04-13 08:42:43,620 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:43,621 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:43,621 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:43,622 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:43,622 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:43,623 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:43,627 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 91 [2018-04-13 08:42:43,627 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 08:42:43,638 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:42:43,639 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:42:43,639 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 08:42:43,645 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:42:43,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:42:43,658 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 65 treesize of output 54 [2018-04-13 08:42:43,661 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:43,665 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 45 treesize of output 57 [2018-04-13 08:42:43,688 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:43,689 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:43,692 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:43,693 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:43,695 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:43,718 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 37 treesize of output 99 [2018-04-13 08:42:43,721 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:43,722 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:43,724 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:43,725 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:43,727 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:43,728 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:43,730 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:43,758 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 9 case distinctions, treesize of input 79 treesize of output 133 [2018-04-13 08:42:43,759 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 8 xjuncts. [2018-04-13 08:42:43,898 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:43,899 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:43,900 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:42:43,900 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:43,904 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 37 treesize of output 67 [2018-04-13 08:42:43,904 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-13 08:42:43,928 INFO L267 ElimStorePlain]: Start of recursive call 9: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 08:42:43,948 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 08:42:43,969 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 08:42:43,974 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 54 treesize of output 51 [2018-04-13 08:42:43,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-04-13 08:42:43,977 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:43,977 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 33 [2018-04-13 08:42:43,980 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:43,980 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:43,981 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:43,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2018-04-13 08:42:43,988 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-13 08:42:43,994 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:42:43,997 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:42:44,005 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:42:44,010 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 48 treesize of output 45 [2018-04-13 08:42:44,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-04-13 08:42:44,012 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:44,013 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 25 treesize of output 33 [2018-04-13 08:42:44,015 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:44,015 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:44,016 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:44,018 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 27 treesize of output 50 [2018-04-13 08:42:44,018 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-13 08:42:44,023 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:42:44,026 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:42:44,033 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:42:44,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 11 dim-0 vars, and 4 xjuncts. [2018-04-13 08:42:44,080 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 7 variables, input treesize:84, output treesize:174 [2018-04-13 08:42:53,126 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:53,129 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-04-13 08:42:53,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 08:42:53,152 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-04-13 08:42:53,152 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:112, output treesize:208 [2018-04-13 08:42:53,330 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 123 treesize of output 101 [2018-04-13 08:42:53,346 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:42:53,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:42:53,348 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:53,348 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:42:53,349 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:53,349 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:53,350 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:53,350 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:42:53,351 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:53,351 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:53,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 192 [2018-04-13 08:42:53,376 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:53,377 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:53,377 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:53,378 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:53,378 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:53,378 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:42:53,379 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:53,379 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:42:53,380 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 79 treesize of output 164 [2018-04-13 08:42:53,396 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:53,397 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:53,397 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:53,398 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:53,398 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:53,399 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:42:53,399 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:42:53,399 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:42:53,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 99 [2018-04-13 08:42:53,400 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 08:42:53,407 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:42:53,411 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:42:53,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:42:53,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:42:53,422 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 13 variables, input treesize:296, output treesize:5 [2018-04-13 08:42:53,769 INFO L134 CoverageAnalysis]: Checked inductivity of 5708 backedges. 2414 proven. 234 refuted. 0 times theorem prover too weak. 3060 trivial. 0 not checked. [2018-04-13 08:42:53,769 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 08:42:53,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-04-13 08:42:53,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-13 08:42:53,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-13 08:42:53,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2783, Unknown=23, NotChecked=0, Total=2970 [2018-04-13 08:42:53,770 INFO L87 Difference]: Start difference. First operand 496 states and 539 transitions. Second operand 55 states. [2018-04-13 08:42:58,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:42:58,926 INFO L93 Difference]: Finished difference Result 470 states and 501 transitions. [2018-04-13 08:42:58,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-04-13 08:42:58,926 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 514 [2018-04-13 08:42:58,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:42:58,927 INFO L225 Difference]: With dead ends: 470 [2018-04-13 08:42:58,927 INFO L226 Difference]: Without dead ends: 456 [2018-04-13 08:42:58,928 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 560 GetRequests, 462 SyntacticMatches, 2 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2040 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=498, Invalid=8930, Unknown=78, NotChecked=0, Total=9506 [2018-04-13 08:42:58,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-04-13 08:42:58,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 452. [2018-04-13 08:42:58,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-04-13 08:42:58,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 479 transitions. [2018-04-13 08:42:58,930 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 479 transitions. Word has length 514 [2018-04-13 08:42:58,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:42:58,931 INFO L459 AbstractCegarLoop]: Abstraction has 452 states and 479 transitions. [2018-04-13 08:42:58,931 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-04-13 08:42:58,931 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 479 transitions. [2018-04-13 08:42:58,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2018-04-13 08:42:58,932 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:42:58,933 INFO L355 BasicCegarLoop]: trace histogram [37, 36, 29, 29, 29, 29, 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-04-13 08:42:58,933 INFO L408 AbstractCegarLoop]: === Iteration 69 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:42:58,933 INFO L82 PathProgramCache]: Analyzing trace with hash 208694771, now seen corresponding path program 36 times [2018-04-13 08:42:58,933 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:42:58,933 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:42:58,934 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:42:58,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 08:42:58,934 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:42:58,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:42:58,958 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:42:59,259 INFO L134 CoverageAnalysis]: Checked inductivity of 5866 backedges. 951 proven. 1013 refuted. 0 times theorem prover too weak. 3902 trivial. 0 not checked. [2018-04-13 08:42:59,259 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:42:59,259 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:42:59,260 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 08:42:59,534 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-04-13 08:42:59,534 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 08:42:59,553 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:42:59,780 INFO L134 CoverageAnalysis]: Checked inductivity of 5866 backedges. 3820 proven. 112 refuted. 0 times theorem prover too weak. 1934 trivial. 0 not checked. [2018-04-13 08:42:59,780 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 08:42:59,781 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 34 [2018-04-13 08:42:59,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-13 08:42:59,781 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-13 08:42:59,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=988, Unknown=0, NotChecked=0, Total=1122 [2018-04-13 08:42:59,781 INFO L87 Difference]: Start difference. First operand 452 states and 479 transitions. Second operand 34 states. [2018-04-13 08:43:00,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 08:43:00,301 INFO L93 Difference]: Finished difference Result 443 states and 464 transitions. [2018-04-13 08:43:00,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-13 08:43:00,302 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 519 [2018-04-13 08:43:00,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 08:43:00,303 INFO L225 Difference]: With dead ends: 443 [2018-04-13 08:43:00,303 INFO L226 Difference]: Without dead ends: 403 [2018-04-13 08:43:00,303 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 559 GetRequests, 505 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 902 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=407, Invalid=2673, Unknown=0, NotChecked=0, Total=3080 [2018-04-13 08:43:00,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-04-13 08:43:00,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2018-04-13 08:43:00,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-04-13 08:43:00,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 418 transitions. [2018-04-13 08:43:00,305 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 418 transitions. Word has length 519 [2018-04-13 08:43:00,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 08:43:00,306 INFO L459 AbstractCegarLoop]: Abstraction has 403 states and 418 transitions. [2018-04-13 08:43:00,306 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-13 08:43:00,306 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 418 transitions. [2018-04-13 08:43:00,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2018-04-13 08:43:00,307 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 08:43:00,307 INFO L355 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-04-13 08:43:00,307 INFO L408 AbstractCegarLoop]: === Iteration 70 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 08:43:00,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1024372099, now seen corresponding path program 4 times [2018-04-13 08:43:00,308 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 08:43:00,308 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 08:43:00,308 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:43:00,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 08:43:00,308 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 08:43:00,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 08:43:00,331 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 08:43:00,447 INFO L134 CoverageAnalysis]: Checked inductivity of 5746 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 5534 trivial. 0 not checked. [2018-04-13 08:43:00,447 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 08:43:00,447 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 08:43:00,447 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 08:43:00,799 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 08:43:00,799 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 08:43:00,815 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 08:43:00,828 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-04-13 08:43:00,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:43:00,832 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-04-13 08:43:00,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-13 08:43:00,833 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 08:43:00,833 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:43:00,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:43:00,836 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:24, output treesize:15 [2018-04-13 08:43:00,855 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3| Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset| Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (store (select |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) (+ (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3|)))) is different from true [2018-04-13 08:43:00,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, 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-04-13 08:43:00,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:43:00,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:43:00,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:43:00,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:43:00,862 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:15, output treesize:1 [2018-04-13 08:43:00,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:43:00,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:43:00,867 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-04-13 08:43:00,867 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-13 08:43:00,868 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3| Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset| Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#memory_int| (store |c_old(#memory_int)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (store (select |c_old(#memory_int)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) (+ (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3|))))) is different from true [2018-04-13 08:43:00,881 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-04-13 08:43:00,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:43:00,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:43:00,898 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-04-13 08:43:00,898 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 08:43:00,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 08:43:00,916 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-04-13 08:43:00,916 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:31, output treesize:26 [2018-04-13 08:43:00,931 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:43:00,931 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:43:00,931 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-04-13 08:43:00,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:43:00,932 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:43:00,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:43:00,938 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-04-13 08:43:00,939 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:43:00,939 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-04-13 08:43:00,939 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 08:43:00,942 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:43:00,948 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-04-13 08:43:00,948 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:66, output treesize:11 [2018-04-13 08:43:00,958 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3| Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (store (select |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) (+ (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3|)))) is different from true [2018-04-13 08:43:00,962 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_prenex_1118 Int) (v_prenex_1117 Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3| Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset| Int)) (= (store |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (store (store (select |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) (+ (* 4 v_prenex_1117) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) v_prenex_1118) (+ (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3|)) |c_#memory_int|)) is different from true [2018-04-13 08:43:00,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 19 [2018-04-13 08:43:00,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-04-13 08:43:00,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 22 treesize of output 35 [2018-04-13 08:43:00,973 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 08:43:00,979 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 08:43:00,984 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 08:43:00,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:43:00,991 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:22, output treesize:1 [2018-04-13 08:43:00,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 6 treesize of output 5 [2018-04-13 08:43:00,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:43:00,997 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-04-13 08:43:00,997 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:29, output treesize:28 [2018-04-13 08:43:00,999 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_prenex_1118 Int) (v_prenex_1117 Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3| Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset| Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= (store |c_old(#memory_int)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (store (store (select |c_old(#memory_int)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) (+ (* 4 v_prenex_1117) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) v_prenex_1118) (+ (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3|)) |c_#memory_int|))) is different from true [2018-04-13 08:43:01,012 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 30 treesize of output 42 [2018-04-13 08:43:01,019 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 28 treesize of output 38 [2018-04-13 08:43:01,026 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 32 treesize of output 45 [2018-04-13 08:43:01,027 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 08:43:01,061 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 30 treesize of output 65 [2018-04-13 08:43:01,062 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 8 xjuncts. [2018-04-13 08:43:01,104 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-13 08:43:01,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-04-13 08:43:01,148 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 22 treesize of output 35 [2018-04-13 08:43:01,148 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-13 08:43:01,156 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 08:43:01,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-13 08:43:01,215 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 2 xjuncts. [2018-04-13 08:43:01,215 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:38, output treesize:26 [2018-04-13 08:43:01,232 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:43:01,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:43:01,233 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:43:01,234 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:43:01,234 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-04-13 08:43:01,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:43:01,244 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-04-13 08:43:01,245 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:43:01,246 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-04-13 08:43:01,246 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 08:43:01,249 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:43:01,252 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-04-13 08:43:01,252 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:66, output treesize:11 [2018-04-13 08:43:01,268 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_prenex_1123 Int) (v_prenex_1122 Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3| Int)) (= (store |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (store (store (select |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) (+ (* 4 v_prenex_1122) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) v_prenex_1123) (+ (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3|)) |c_#memory_int|)) is different from true [2018-04-13 08:43:01,275 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_prenex_1125 Int) (v_prenex_1124 Int) (v_prenex_1123 Int) (v_prenex_1122 Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3| Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset| Int)) (= (store |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (store (store (store (select |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) (+ (* 4 v_prenex_1122) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) v_prenex_1123) (+ (* 4 v_prenex_1124) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) v_prenex_1125) (+ (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3|)) |c_#memory_int|)) is different from true [2018-04-13 08:43:01,282 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-04-13 08:43:01,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-04-13 08:43:01,292 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-04-13 08:43:01,309 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-04-13 08:43:01,309 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 8 xjuncts. [2018-04-13 08:43:01,350 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-04-13 08:43:01,350 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-13 08:43:01,376 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-13 08:43:01,398 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-13 08:43:01,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-13 08:43:01,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:43:01,443 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 9 variables, input treesize:29, output treesize:1 [2018-04-13 08:43:01,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 08:43:01,446 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:43:01,450 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-04-13 08:43:01,450 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:36, output treesize:35 [2018-04-13 08:43:01,452 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_prenex_1125 Int) (v_prenex_1124 Int) (v_prenex_1123 Int) (v_prenex_1122 Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3| Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset| Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= (store |c_old(#memory_int)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (store (store (store (select |c_old(#memory_int)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) (+ (* 4 v_prenex_1122) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) v_prenex_1123) (+ (* 4 v_prenex_1124) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) v_prenex_1125) (+ (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3|)) |c_#memory_int|))) is different from true [2018-04-13 08:43:01,470 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-04-13 08:43:01,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 38 treesize of output 40 [2018-04-13 08:43:01,479 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-04-13 08:43:01,496 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-04-13 08:43:01,496 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 8 xjuncts. [2018-04-13 08:43:01,541 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-04-13 08:43:01,542 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-13 08:43:01,569 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-13 08:43:01,596 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-13 08:43:01,656 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-04-13 08:43:01,665 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-04-13 08:43:01,686 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-04-13 08:43:01,687 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 8 xjuncts. [2018-04-13 08:43:01,746 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-04-13 08:43:01,746 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-13 08:43:01,787 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-13 08:43:01,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, 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-04-13 08:43:01,896 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 47 treesize of output 112 [2018-04-13 08:43:01,898 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 32 xjuncts. [2018-04-13 08:43:02,354 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-04-13 08:43:02,354 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 8 xjuncts. [2018-04-13 08:43:02,632 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:43:02,646 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-04-13 08:43:02,647 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 4 xjuncts. [2018-04-13 08:43:02,843 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-04-13 08:43:02,844 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-04-13 08:43:03,022 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-04-13 08:43:03,022 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-13 08:43:03,026 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 64 xjuncts. [2018-04-13 08:43:03,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:43:03,641 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-04-13 08:43:03,642 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 4 xjuncts. [2018-04-13 08:43:03,766 INFO L267 ElimStorePlain]: Start of recursive call 11: 8 dim-1 vars, End of recursive call: and 13 xjuncts. [2018-04-13 08:43:03,889 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 15 xjuncts. [2018-04-13 08:43:04,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 15 xjuncts. [2018-04-13 08:43:04,162 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-04-13 08:43:04,162 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 9 variables, input treesize:45, output treesize:26 [2018-04-13 08:43:04,180 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:43:04,180 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:43:04,181 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-04-13 08:43:04,181 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:43:04,181 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:43:04,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:43:04,187 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-04-13 08:43:04,188 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:43:04,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, 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-04-13 08:43:04,189 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 08:43:04,191 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:43:04,201 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-04-13 08:43:04,202 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:66, output treesize:11 [2018-04-13 08:43:04,220 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_prenex_1139 Int) (v_prenex_1138 Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3| Int)) (= (store |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (store (store (select |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) (+ (* 4 v_prenex_1138) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) v_prenex_1139) (+ (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3|)) |c_#memory_int|)) is different from true [2018-04-13 08:43:04,224 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_prenex_1139 Int) (v_prenex_1138 Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1 Int) (v_prenex_1141 Int) (v_prenex_1140 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3| Int)) (= (store |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (store (store (store (select |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) (+ (* 4 v_prenex_1138) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) v_prenex_1139) (+ (* 4 v_prenex_1140) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) v_prenex_1141) (+ (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3|)) |c_#memory_int|)) is different from true [2018-04-13 08:43:04,231 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_prenex_1139 Int) (v_prenex_1138 Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1 Int) (v_prenex_1143 Int) (v_prenex_1142 Int) (v_prenex_1141 Int) (v_prenex_1140 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3| Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset| Int)) (= (store |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (store (store (store (store (select |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) (+ (* 4 v_prenex_1138) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) v_prenex_1139) (+ (* 4 v_prenex_1140) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) v_prenex_1141) (+ (* 4 v_prenex_1142) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) v_prenex_1143) (+ (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3|)) |c_#memory_int|)) is different from true [2018-04-13 08:43:04,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 33 [2018-04-13 08:43:04,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-04-13 08:43:04,248 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-04-13 08:43:04,257 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-04-13 08:43:04,275 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-04-13 08:43:04,276 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 8 xjuncts. [2018-04-13 08:43:04,324 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-04-13 08:43:04,325 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-13 08:43:04,356 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-13 08:43:04,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, 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-04-13 08:43:04,417 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-04-13 08:43:04,418 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-13 08:43:04,496 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:43:04,518 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 43 treesize of output 116 [2018-04-13 08:43:04,519 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 16 xjuncts. [2018-04-13 08:43:04,697 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:43:04,710 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-04-13 08:43:04,710 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-04-13 08:43:04,875 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-04-13 08:43:04,875 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-13 08:43:04,879 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 64 xjuncts. [2018-04-13 08:43:05,394 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:43:05,406 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-04-13 08:43:05,407 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2018-04-13 08:43:05,611 INFO L267 ElimStorePlain]: Start of recursive call 8: 8 dim-1 vars, End of recursive call: and 13 xjuncts. [2018-04-13 08:43:05,724 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 15 xjuncts. [2018-04-13 08:43:05,817 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 15 xjuncts. [2018-04-13 08:43:05,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 15 xjuncts. [2018-04-13 08:43:05,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:43:05,990 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 11 variables, input treesize:36, output treesize:1 [2018-04-13 08:43:05,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:43:05,994 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:43:05,999 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-04-13 08:43:05,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 11 variables, input treesize:43, output treesize:42 [2018-04-13 08:43:06,001 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_prenex_1139 Int) (v_prenex_1138 Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1 Int) (v_prenex_1143 Int) (v_prenex_1142 Int) (v_prenex_1141 Int) (v_prenex_1140 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3| Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset| Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= (store |c_old(#memory_int)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (store (store (store (store (select |c_old(#memory_int)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) (+ (* 4 v_prenex_1138) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) v_prenex_1139) (+ (* 4 v_prenex_1140) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) v_prenex_1141) (+ (* 4 v_prenex_1142) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) v_prenex_1143) (+ (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3|)) |c_#memory_int|))) is different from true [2018-04-13 08:43:06,019 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-04-13 08:43:06,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2018-04-13 08:43:06,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, 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-04-13 08:43:06,036 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-04-13 08:43:06,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, 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-04-13 08:43:06,052 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 8 xjuncts. [2018-04-13 08:43:06,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, 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-04-13 08:43:06,103 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-13 08:43:06,135 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-13 08:43:06,191 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-04-13 08:43:06,194 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:43:06,205 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-04-13 08:43:06,206 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-04-13 08:43:06,313 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-04-13 08:43:06,313 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 8 xjuncts. [2018-04-13 08:43:06,424 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:43:06,436 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-04-13 08:43:06,436 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-04-13 08:43:06,731 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:43:06,758 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-04-13 08:43:06,759 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 32 xjuncts. [2018-04-13 08:43:06,982 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-04-13 08:43:06,983 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-13 08:43:06,986 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 64 xjuncts. [2018-04-13 08:43:07,275 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-04-13 08:43:07,275 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-04-13 08:43:07,395 INFO L267 ElimStorePlain]: Start of recursive call 8: 8 dim-1 vars, End of recursive call: and 13 xjuncts. [2018-04-13 08:43:07,526 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 15 xjuncts. [2018-04-13 08:43:07,635 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 15 xjuncts. [2018-04-13 08:43:07,841 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-04-13 08:43:07,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, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 44 treesize of output 78 [2018-04-13 08:43:07,884 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:43:07,916 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 1 new quantified variables, introduced 8 case distinctions, treesize of input 49 treesize of output 111 [2018-04-13 08:43:07,948 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 56 treesize of output 121 [2018-04-13 08:43:07,949 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 16 xjuncts. [2018-04-13 08:43:08,676 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:43:08,690 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 63 treesize of output 102 [2018-04-13 08:43:08,690 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 4 xjuncts. [2018-04-13 08:43:09,057 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:43:09,081 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 7 case distinctions, treesize of input 73 treesize of output 134 [2018-04-13 08:43:09,082 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 16 xjuncts. [2018-04-13 08:43:09,951 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 58 treesize of output 93 [2018-04-13 08:43:09,952 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 8 xjuncts. [2018-04-13 08:43:10,855 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:43:10,879 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 56 treesize of output 121 [2018-04-13 08:43:10,880 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 16 xjuncts. [2018-04-13 08:43:11,393 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:43:11,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 11 case distinctions, treesize of input 54 treesize of output 149 [2018-04-13 08:43:11,430 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-13 08:43:11,432 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 32 xjuncts. [2018-04-13 08:43:12,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 13 case distinctions, treesize of input 51 treesize of output 174 [2018-04-13 08:43:12,146 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-04-13 08:43:12,163 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 128 xjuncts. [2018-04-13 08:43:14,066 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:43:14,069 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:43:14,095 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 7 case distinctions, treesize of input 73 treesize of output 142 [2018-04-13 08:43:14,096 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 16 xjuncts. [2018-04-13 08:43:14,761 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 60 treesize of output 73 [2018-04-13 08:43:14,762 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2018-04-13 08:43:15,435 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:43:15,437 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:43:15,459 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 73 treesize of output 130 [2018-04-13 08:43:15,460 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 8 xjuncts. [2018-04-13 08:43:16,029 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 58 treesize of output 101 [2018-04-13 08:43:16,030 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 8 xjuncts. [2018-04-13 08:43:16,554 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:43:16,576 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 56 treesize of output 129 [2018-04-13 08:43:16,578 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 16 xjuncts. [2018-04-13 08:43:17,125 INFO L267 ElimStorePlain]: Start of recursive call 17: 16 dim-1 vars, End of recursive call: and 37 xjuncts. [2018-04-13 08:43:17,787 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:43:17,803 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 94 [2018-04-13 08:43:17,806 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:43:17,822 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 72 treesize of output 111 [2018-04-13 08:43:17,822 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 4 xjuncts. [2018-04-13 08:43:17,977 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:43:18,009 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-04-13 08:43:18,011 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 32 xjuncts. [2018-04-13 08:43:18,207 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:43:18,225 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-04-13 08:43:18,226 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 4 xjuncts. [2018-04-13 08:43:18,331 INFO L267 ElimStorePlain]: Start of recursive call 30: 4 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-04-13 08:43:19,651 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 53 treesize of output 67 [2018-04-13 08:43:19,670 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-04-13 08:43:19,670 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 8 xjuncts. [2018-04-13 08:43:19,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, 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-04-13 08:43:19,735 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 2 xjuncts. [2018-04-13 08:43:19,782 INFO L267 ElimStorePlain]: Start of recursive call 34: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-13 08:43:20,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, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 51 treesize of output 85 [2018-04-13 08:43:20,450 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:43:20,474 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 56 treesize of output 121 [2018-04-13 08:43:20,476 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 16 xjuncts. [2018-04-13 08:43:20,997 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 58 treesize of output 101 [2018-04-13 08:43:20,998 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 8 xjuncts. [2018-04-13 08:43:21,236 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 58 treesize of output 93 [2018-04-13 08:43:21,237 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 8 xjuncts. [2018-04-13 08:43:21,495 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 53 treesize of output 130 [2018-04-13 08:43:21,495 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-13 08:43:21,498 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 64 xjuncts. [2018-04-13 08:43:21,974 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:43:21,987 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 63 treesize of output 94 [2018-04-13 08:43:21,988 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 4 xjuncts. [2018-04-13 08:43:22,199 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:43:22,213 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 63 treesize of output 102 [2018-04-13 08:43:22,213 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 4 xjuncts. [2018-04-13 08:43:22,391 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 60 treesize of output 73 [2018-04-13 08:43:22,392 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 2 xjuncts. [2018-04-13 08:43:22,538 INFO L267 ElimStorePlain]: Start of recursive call 37: 8 dim-1 vars, End of recursive call: and 13 xjuncts. [2018-04-13 08:43:23,283 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 1 new quantified variables, introduced 9 case distinctions, treesize of input 46 treesize of output 120 [2018-04-13 08:43:23,283 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-13 08:43:23,289 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:43:23,302 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 70 treesize of output 109 [2018-04-13 08:43:23,302 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 4 xjuncts. [2018-04-13 08:43:25,188 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 58 treesize of output 93 [2018-04-13 08:43:25,189 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 8 xjuncts. [2018-04-13 08:43:26,767 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:43:26,768 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:43:26,770 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:43:26,793 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 78 treesize of output 143 [2018-04-13 08:43:26,794 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 8 xjuncts. [2018-04-13 08:43:30,001 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:43:30,003 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:43:30,036 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 7 case distinctions, treesize of input 73 treesize of output 142 [2018-04-13 08:43:30,037 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 16 xjuncts. [2018-04-13 08:43:31,708 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:43:31,710 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:43:31,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 135 [2018-04-13 08:43:31,733 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 8 xjuncts. [2018-04-13 08:43:34,931 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 58 treesize of output 101 [2018-04-13 08:43:34,931 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 8 xjuncts. [2018-04-13 08:43:37,855 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:43:37,857 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:43:37,860 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:43:37,878 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 73 treesize of output 130 [2018-04-13 08:43:37,879 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 8 xjuncts. [2018-04-13 08:43:44,625 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:43:44,649 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 56 treesize of output 121 [2018-04-13 08:43:44,650 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 16 xjuncts. [2018-04-13 08:43:45,966 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:43:45,970 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:43:46,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 11 case distinctions, treesize of input 71 treesize of output 166 [2018-04-13 08:43:46,018 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-13 08:43:46,022 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 64 xjuncts. [2018-04-13 08:43:49,201 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:43:49,203 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:43:49,227 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 7 case distinctions, treesize of input 70 treesize of output 139 [2018-04-13 08:43:49,228 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 16 xjuncts. [2018-04-13 08:43:50,642 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:43:50,656 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 67 treesize of output 106 [2018-04-13 08:43:50,656 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 4 xjuncts. [2018-04-13 08:43:53,000 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:43:53,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, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 12 case distinctions, treesize of input 59 treesize of output 166 [2018-04-13 08:43:53,038 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-04-13 08:43:53,046 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 128 xjuncts. [2018-04-13 08:43:55,222 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:43:55,245 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 56 treesize of output 129 [2018-04-13 08:43:55,246 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 16 xjuncts. [2018-04-13 08:43:57,499 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:43:57,502 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:43:57,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 12 case distinctions, treesize of input 63 treesize of output 170 [2018-04-13 08:43:57,547 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-04-13 08:43:57,555 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 128 xjuncts. [2018-04-13 08:44:03,396 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:44:03,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 13 case distinctions, treesize of input 51 treesize of output 170 [2018-04-13 08:44:03,441 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-04-13 08:44:03,451 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 128 xjuncts. [2018-04-13 08:44:07,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 14 case distinctions, treesize of input 48 treesize of output 183 [2018-04-13 08:44:07,726 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2018-04-13 08:44:07,871 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1024 xjuncts. [2018-04-13 08:44:26,220 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:44:26,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 94 [2018-04-13 08:44:26,233 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 4 xjuncts. [2018-04-13 08:44:27,796 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:44:27,798 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:44:27,822 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 7 case distinctions, treesize of input 70 treesize of output 139 [2018-04-13 08:44:27,824 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 16 xjuncts. [2018-04-13 08:44:33,632 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 60 treesize of output 73 [2018-04-13 08:44:33,632 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 2 xjuncts. [2018-04-13 08:44:34,832 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:44:34,833 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:44:34,857 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 7 case distinctions, treesize of input 66 treesize of output 147 [2018-04-13 08:44:34,858 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 16 xjuncts. [2018-04-13 08:44:37,055 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:44:37,068 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 63 treesize of output 102 [2018-04-13 08:44:37,068 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 4 xjuncts. [2018-04-13 08:44:44,022 INFO L267 ElimStorePlain]: Start of recursive call 45: 64 dim-1 vars, End of recursive call: and 35 xjuncts. [2018-04-13 08:44:45,605 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:44:45,618 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 56 treesize of output 86 [2018-04-13 08:44:45,621 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:44:45,635 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 68 treesize of output 107 [2018-04-13 08:44:45,635 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 4 xjuncts. [2018-04-13 08:44:45,792 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 58 treesize of output 123 [2018-04-13 08:44:45,794 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 32 xjuncts. [2018-04-13 08:44:45,976 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:44:45,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 91 [2018-04-13 08:44:45,989 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 4 xjuncts. [2018-04-13 08:44:46,108 INFO L267 ElimStorePlain]: Start of recursive call 67: 4 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-04-13 08:44:46,777 INFO L267 ElimStorePlain]: Start of recursive call 16: 8 dim-1 vars, End of recursive call: and 47 xjuncts. [2018-04-13 08:44:47,400 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-04-13 08:44:47,418 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-04-13 08:44:47,423 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:44:47,452 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-04-13 08:44:47,454 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 32 xjuncts. [2018-04-13 08:44:47,771 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 50 treesize of output 139 [2018-04-13 08:44:47,771 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-13 08:44:47,774 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 64 xjuncts. [2018-04-13 08:44:48,118 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:44:48,131 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-04-13 08:44:48,135 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 4 xjuncts. [2018-04-13 08:44:48,612 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-04-13 08:44:48,612 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 2 xjuncts. [2018-04-13 08:44:48,759 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:44:48,772 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-04-13 08:44:48,772 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 4 xjuncts. [2018-04-13 08:44:49,048 INFO L267 ElimStorePlain]: Start of recursive call 72: 8 dim-1 vars, End of recursive call: and 13 xjuncts. [2018-04-13 08:44:49,215 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 50 treesize of output 64 [2018-04-13 08:44:49,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 52 treesize of output 95 [2018-04-13 08:44:49,232 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 8 xjuncts. [2018-04-13 08:44:49,299 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 54 treesize of output 67 [2018-04-13 08:44:49,299 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 2 xjuncts. [2018-04-13 08:44:49,346 INFO L267 ElimStorePlain]: Start of recursive call 78: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-13 08:44:49,491 INFO L267 ElimStorePlain]: Start of recursive call 71: 2 dim-1 vars, End of recursive call: and 15 xjuncts. [2018-04-13 08:44:50,158 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 52 xjuncts. [2018-04-13 08:44:50,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 52 xjuncts. [2018-04-13 08:44:51,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-13 08:44:51,355 INFO L202 ElimStorePlain]: Needed 80 recursive calls to eliminate 11 variables, input treesize:52, output treesize:42 [2018-04-13 08:44:51,381 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:44:51,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:44:51,383 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:44:51,383 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:44:51,384 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-04-13 08:44:51,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 08:44:51,393 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-04-13 08:44:51,395 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:44:51,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-13 08:44:51,395 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 08:44:51,398 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:44:51,402 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-04-13 08:44:51,402 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:66, output treesize:11 [2018-04-13 08:44:51,417 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1 Int) (v_prenex_1274 Int) (v_prenex_1273 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3| Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (store (store (select |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) (+ (* 4 v_prenex_1273) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) v_prenex_1274) (+ (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3|)))) is different from true [2018-04-13 08:44:51,422 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_prenex_1276 Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1 Int) (v_prenex_1275 Int) (v_prenex_1274 Int) (v_prenex_1273 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3| Int)) (= (store |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (store (store (store (select |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) (+ (* 4 v_prenex_1273) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) v_prenex_1274) (+ (* 4 v_prenex_1275) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) v_prenex_1276) (+ (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3|)) |c_#memory_int|)) is different from true [2018-04-13 08:44:51,427 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_prenex_1278 Int) (v_prenex_1277 Int) (v_prenex_1276 Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1 Int) (v_prenex_1275 Int) (v_prenex_1274 Int) (v_prenex_1273 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3| Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (store (store (store (store (select |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) (+ (* 4 v_prenex_1273) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) v_prenex_1274) (+ (* 4 v_prenex_1275) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) v_prenex_1276) (+ (* 4 v_prenex_1277) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) v_prenex_1278) (+ (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3|)))) is different from true [2018-04-13 08:44:51,434 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_prenex_1279 Int) (v_prenex_1278 Int) (v_prenex_1277 Int) (v_prenex_1276 Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1 Int) (v_prenex_1275 Int) (v_prenex_1274 Int) (v_prenex_1273 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3| Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset| Int) (v_prenex_1280 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (store (store (store (store (store (select |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) (+ (* 4 v_prenex_1273) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) v_prenex_1274) (+ (* 4 v_prenex_1275) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) v_prenex_1276) (+ (* 4 v_prenex_1277) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) v_prenex_1278) (+ (* 4 v_prenex_1279) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) v_prenex_1280) (+ (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3|)))) is different from true [2018-04-13 08:44:51,442 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 43 treesize of output 40 [2018-04-13 08:44:51,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 43 [2018-04-13 08:44:51,451 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 43 treesize of output 57 [2018-04-13 08:44:51,468 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 45 treesize of output 87 [2018-04-13 08:44:51,476 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 54 treesize of output 68 [2018-04-13 08:44:51,483 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 58 treesize of output 71 [2018-04-13 08:44:51,483 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-13 08:44:51,523 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 56 treesize of output 99 [2018-04-13 08:44:51,524 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 8 xjuncts. [2018-04-13 08:44:51,585 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-13 08:44:51,707 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:44:51,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 61 treesize of output 99 [2018-04-13 08:44:51,721 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:44:51,732 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 77 treesize of output 116 [2018-04-13 08:44:51,733 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-04-13 08:44:51,795 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:44:51,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 65 treesize of output 104 [2018-04-13 08:44:51,808 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-04-13 08:44:51,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:44:51,911 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 63 treesize of output 148 [2018-04-13 08:44:51,912 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 32 xjuncts. [2018-04-13 08:44:52,181 INFO L267 ElimStorePlain]: Start of recursive call 9: 4 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-04-13 08:44:52,404 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:44:52,432 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 1 new quantified variables, introduced 8 case distinctions, treesize of input 50 treesize of output 120 [2018-04-13 08:44:52,435 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:44:52,435 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-13 08:44:52,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 59 treesize of output 102 [2018-04-13 08:44:52,679 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 8 xjuncts. [2018-04-13 08:44:52,944 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:44:52,956 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 68 treesize of output 107 [2018-04-13 08:44:52,956 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 4 xjuncts. [2018-04-13 08:44:53,227 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:44:53,228 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:44:53,288 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 7 case distinctions, treesize of input 78 treesize of output 147 [2018-04-13 08:44:53,289 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 16 xjuncts. [2018-04-13 08:44:53,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 74 [2018-04-13 08:44:53,635 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-04-13 08:44:54,207 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:44:54,208 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:44:54,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 11 case distinctions, treesize of input 76 treesize of output 179 [2018-04-13 08:44:54,258 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-13 08:44:54,262 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 64 xjuncts. [2018-04-13 08:44:54,991 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:44:55,015 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 57 treesize of output 130 [2018-04-13 08:44:55,016 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 16 xjuncts. [2018-04-13 08:44:55,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 13 case distinctions, treesize of input 52 treesize of output 187 [2018-04-13 08:44:55,600 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-04-13 08:44:55,609 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 128 xjuncts. [2018-04-13 08:44:57,222 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:44:57,223 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:44:57,245 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 6 case distinctions, treesize of input 78 treesize of output 143 [2018-04-13 08:44:57,246 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 8 xjuncts. [2018-04-13 08:44:58,558 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:44:58,584 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 57 treesize of output 130 [2018-04-13 08:44:58,585 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 16 xjuncts. [2018-04-13 08:44:59,124 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:44:59,157 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 66 treesize of output 151 [2018-04-13 08:44:59,161 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 32 xjuncts. [2018-04-13 08:44:59,793 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 59 treesize of output 102 [2018-04-13 08:44:59,795 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 8 xjuncts. [2018-04-13 08:45:00,236 INFO L267 ElimStorePlain]: Start of recursive call 13: 16 dim-1 vars, End of recursive call: and 35 xjuncts. [2018-04-13 08:45:01,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, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 52 treesize of output 94 [2018-04-13 08:45:01,445 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:45:01,445 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-13 08:45:01,620 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 59 treesize of output 102 [2018-04-13 08:45:01,621 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 8 xjuncts. [2018-04-13 08:45:01,940 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:45:01,975 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 57 treesize of output 130 [2018-04-13 08:45:01,977 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 16 xjuncts. [2018-04-13 08:45:02,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 74 [2018-04-13 08:45:02,240 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 2 xjuncts. [2018-04-13 08:45:02,505 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 54 treesize of output 143 [2018-04-13 08:45:02,506 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-13 08:45:02,509 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 64 xjuncts. [2018-04-13 08:45:02,931 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 59 treesize of output 102 [2018-04-13 08:45:02,931 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 8 xjuncts. [2018-04-13 08:45:03,135 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:45:03,146 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 68 treesize of output 107 [2018-04-13 08:45:03,147 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 4 xjuncts. [2018-04-13 08:45:03,318 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:45:03,331 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 68 treesize of output 107 [2018-04-13 08:45:03,331 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 4 xjuncts. [2018-04-13 08:45:03,475 INFO L267 ElimStorePlain]: Start of recursive call 26: 8 dim-1 vars, End of recursive call: and 13 xjuncts. [2018-04-13 08:45:04,151 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 1 new quantified variables, introduced 9 case distinctions, treesize of input 47 treesize of output 133 [2018-04-13 08:45:04,151 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-13 08:45:04,157 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:45:04,164 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:45:04,190 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 69 treesize of output 145 [2018-04-13 08:45:04,192 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 16 xjuncts. [2018-04-13 08:45:06,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 59 treesize of output 102 [2018-04-13 08:45:06,237 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 8 xjuncts. [2018-04-13 08:45:07,951 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:45:07,952 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:45:07,954 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:45:07,988 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 87 treesize of output 152 [2018-04-13 08:45:07,988 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 8 xjuncts. [2018-04-13 08:45:16,314 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:45:16,341 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 57 treesize of output 130 [2018-04-13 08:45:16,342 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 16 xjuncts. [2018-04-13 08:45:22,837 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 59 treesize of output 102 [2018-04-13 08:45:22,837 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 8 xjuncts. [2018-04-13 08:45:24,396 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:45:24,396 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:45:24,403 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:45:24,419 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 6 case distinctions, treesize of input 78 treesize of output 143 [2018-04-13 08:45:24,420 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 8 xjuncts. [2018-04-13 08:45:25,815 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:45:25,845 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 66 treesize of output 151 [2018-04-13 08:45:25,847 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 32 xjuncts. [2018-04-13 08:45:29,961 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:45:29,985 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 57 treesize of output 130 [2018-04-13 08:45:29,986 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 16 xjuncts. [2018-04-13 08:45:31,271 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:45:31,281 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:45:31,281 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:45:31,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 11 case distinctions, treesize of input 67 treesize of output 173 [2018-04-13 08:45:31,319 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-13 08:45:31,322 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 32 xjuncts. [2018-04-13 08:45:35,313 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:45:35,362 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 66 treesize of output 151 [2018-04-13 08:45:35,364 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 32 xjuncts. [2018-04-13 08:45:38,136 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:45:38,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 68 treesize of output 107 [2018-04-13 08:45:38,149 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 4 xjuncts. [2018-04-13 08:45:39,361 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:45:39,362 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:45:39,366 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:45:39,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 11 case distinctions, treesize of input 85 treesize of output 188 [2018-04-13 08:45:39,407 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-13 08:45:39,415 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 128 xjuncts. [2018-04-13 08:45:41,764 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:45:41,775 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:45:41,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 12 case distinctions, treesize of input 64 treesize of output 183 [2018-04-13 08:45:41,820 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-04-13 08:45:41,828 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 128 xjuncts. [2018-04-13 08:45:45,546 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:45:45,558 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 68 treesize of output 107 [2018-04-13 08:45:45,559 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 4 xjuncts. [2018-04-13 08:45:46,742 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:45:46,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 13 case distinctions, treesize of input 52 treesize of output 187 [2018-04-13 08:45:46,792 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-04-13 08:45:46,801 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 128 xjuncts. [2018-04-13 08:45:48,946 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:45:48,974 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 66 treesize of output 151 [2018-04-13 08:45:48,977 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 32 xjuncts. [2018-04-13 08:45:50,355 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:45:50,356 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:45:50,358 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:45:50,378 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 87 treesize of output 152 [2018-04-13 08:45:50,378 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 8 xjuncts. [2018-04-13 08:45:51,453 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:45:51,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 13 case distinctions, treesize of input 61 treesize of output 196 [2018-04-13 08:45:51,504 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-04-13 08:45:51,551 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 512 xjuncts. [2018-04-13 08:46:00,362 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:46:00,365 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:46:00,389 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 7 case distinctions, treesize of input 75 treesize of output 156 [2018-04-13 08:46:00,390 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 16 xjuncts. [2018-04-13 08:46:05,130 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:46:05,160 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 66 treesize of output 151 [2018-04-13 08:46:05,162 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 32 xjuncts. [2018-04-13 08:46:09,061 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:46:09,061 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:46:09,089 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 7 case distinctions, treesize of input 75 treesize of output 156 [2018-04-13 08:46:09,090 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 16 xjuncts. [2018-04-13 08:46:10,721 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:46:10,724 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:46:10,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 75 treesize of output 156 [2018-04-13 08:46:10,751 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 16 xjuncts. [2018-04-13 08:46:14,479 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:46:14,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 68 treesize of output 107 [2018-04-13 08:46:14,492 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 4 xjuncts. [2018-04-13 08:46:15,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 14 case distinctions, treesize of input 49 treesize of output 200 [2018-04-13 08:46:15,643 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2018-04-13 08:46:15,772 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1024 xjuncts. [2018-04-13 08:46:32,448 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 61 treesize of output 74 [2018-04-13 08:46:32,448 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 2 xjuncts. [2018-04-13 08:46:35,820 INFO L267 ElimStorePlain]: Start of recursive call 35: 64 dim-1 vars, End of recursive call: and 35 xjuncts. [2018-04-13 08:46:37,318 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:46:37,334 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 61 treesize of output 99 [2018-04-13 08:46:37,336 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:46:37,336 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-04-13 08:46:37,375 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:46:37,419 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 63 treesize of output 136 [2018-04-13 08:46:37,423 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 32 xjuncts. [2018-04-13 08:46:37,588 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:46:37,602 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 65 treesize of output 104 [2018-04-13 08:46:37,603 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 4 xjuncts. [2018-04-13 08:46:37,720 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:46:37,733 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 65 treesize of output 104 [2018-04-13 08:46:37,734 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 4 xjuncts. [2018-04-13 08:46:37,829 INFO L267 ElimStorePlain]: Start of recursive call 61: 4 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-04-13 08:46:38,414 INFO L267 ElimStorePlain]: Start of recursive call 5: 8 dim-1 vars, End of recursive call: and 47 xjuncts. [2018-04-13 08:46:38,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 61 [2018-04-13 08:46:38,980 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 49 treesize of output 91 [2018-04-13 08:46:38,998 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 56 treesize of output 99 [2018-04-13 08:46:38,999 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 8 xjuncts. [2018-04-13 08:46:39,133 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:46:39,162 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 63 treesize of output 136 [2018-04-13 08:46:39,164 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 32 xjuncts. [2018-04-13 08:46:39,425 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:46:39,438 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 65 treesize of output 104 [2018-04-13 08:46:39,438 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 4 xjuncts. [2018-04-13 08:46:39,647 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 51 treesize of output 140 [2018-04-13 08:46:39,648 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-13 08:46:39,651 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 64 xjuncts. [2018-04-13 08:46:40,017 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:46:40,030 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 65 treesize of output 104 [2018-04-13 08:46:40,030 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 4 xjuncts. [2018-04-13 08:46:40,174 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 58 treesize of output 71 [2018-04-13 08:46:40,174 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 2 xjuncts. [2018-04-13 08:46:40,527 INFO L267 ElimStorePlain]: Start of recursive call 67: 8 dim-1 vars, End of recursive call: and 13 xjuncts. [2018-04-13 08:46:40,675 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 51 treesize of output 65 [2018-04-13 08:46:40,695 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 53 treesize of output 96 [2018-04-13 08:46:40,695 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 8 xjuncts. [2018-04-13 08:46:40,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 55 treesize of output 68 [2018-04-13 08:46:40,762 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 2 xjuncts. [2018-04-13 08:46:40,813 INFO L267 ElimStorePlain]: Start of recursive call 74: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-13 08:46:40,976 INFO L267 ElimStorePlain]: Start of recursive call 66: 2 dim-1 vars, End of recursive call: and 15 xjuncts. [2018-04-13 08:46:41,575 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 52 xjuncts. [2018-04-13 08:46:42,091 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 52 xjuncts. [2018-04-13 08:46:42,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 52 xjuncts. [2018-04-13 08:46:43,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 08:46:43,108 INFO L202 ElimStorePlain]: Needed 76 recursive calls to eliminate 13 variables, input treesize:43, output treesize:1 [2018-04-13 08:46:43,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-13 08:46:43,113 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 08:46:43,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 1 dim-1 vars, End of recursive call: 12 dim-0 vars, and 1 xjuncts. [2018-04-13 08:46:43,119 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 13 variables, input treesize:50, output treesize:49 [2018-04-13 08:46:43,122 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_prenex_1279 Int) (v_prenex_1278 Int) (v_prenex_1277 Int) (v_prenex_1276 Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1 Int) (v_prenex_1275 Int) (v_prenex_1274 Int) (v_prenex_1273 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3| Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset| Int) (v_prenex_1280 Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#memory_int| (store |c_old(#memory_int)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (store (store (store (store (store (select |c_old(#memory_int)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) (+ (* 4 v_prenex_1273) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) v_prenex_1274) (+ (* 4 v_prenex_1275) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) v_prenex_1276) (+ (* 4 v_prenex_1277) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) v_prenex_1278) (+ (* 4 v_prenex_1279) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) v_prenex_1280) (+ (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3|))))) is different from true [2018-04-13 08:46:43,143 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 51 treesize of output 63 [2018-04-13 08:46:43,159 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 49 treesize of output 59 [2018-04-13 08:46:43,171 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 53 treesize of output 67 [2018-04-13 08:46:43,181 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 57 treesize of output 71 [2018-04-13 08:46:43,190 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 61 treesize of output 75 [2018-04-13 08:46:43,198 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 65 treesize of output 78 [2018-04-13 08:46:43,199 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-13 08:46:43,249 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 63 treesize of output 106 [2018-04-13 08:46:43,249 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 8 xjuncts. [2018-04-13 08:46:43,312 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-13 08:46:43,398 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 59 treesize of output 101 [2018-04-13 08:46:43,407 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 68 treesize of output 81 [2018-04-13 08:46:43,407 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-13 08:46:43,522 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:46:43,534 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 75 treesize of output 114 [2018-04-13 08:46:43,534 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-04-13 08:46:43,687 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 66 treesize of output 109 [2018-04-13 08:46:43,687 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 8 xjuncts. [2018-04-13 08:46:44,144 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:46:44,173 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 64 treesize of output 137 [2018-04-13 08:46:44,174 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 16 xjuncts. [2018-04-13 08:46:44,399 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:46:44,413 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 75 treesize of output 114 [2018-04-13 08:46:44,413 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 4 xjuncts. [2018-04-13 08:46:44,639 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 61 treesize of output 150 [2018-04-13 08:46:44,639 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-13 08:46:44,642 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 64 xjuncts. [2018-04-13 08:46:45,016 INFO L267 ElimStorePlain]: Start of recursive call 9: 8 dim-1 vars, End of recursive call: and 14 xjuncts. [2018-04-13 08:46:45,183 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 15 xjuncts. [2018-04-13 08:46:45,389 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 55 treesize of output 97 [2018-04-13 08:46:45,394 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:46:45,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 69 treesize of output 139 [2018-04-13 08:46:45,442 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 08:46:45,442 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-13 08:46:46,616 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:46:46,617 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:46:46,619 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:46:46,644 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 97 treesize of output 162 [2018-04-13 08:46:46,645 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 8 xjuncts. [2018-04-13 08:46:47,284 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:46:47,291 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:46:47,296 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:46:47,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 11 case distinctions, treesize of input 86 treesize of output 189 [2018-04-13 08:46:47,338 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-13 08:46:47,342 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 64 xjuncts. [2018-04-13 08:46:48,489 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:46:48,494 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:46:48,524 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 79 treesize of output 155 [2018-04-13 08:46:48,526 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 16 xjuncts. [2018-04-13 08:46:50,283 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:46:50,289 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:46:50,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 12 case distinctions, treesize of input 83 treesize of output 202 [2018-04-13 08:46:50,342 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-04-13 08:46:50,362 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 256 xjuncts. [2018-04-13 08:46:54,058 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:46:54,064 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:46:54,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 12 case distinctions, treesize of input 74 treesize of output 193 [2018-04-13 08:46:54,112 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-04-13 08:46:54,121 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 128 xjuncts. [2018-04-13 08:46:55,814 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:46:55,815 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:46:55,841 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 7 case distinctions, treesize of input 88 treesize of output 157 [2018-04-13 08:46:55,842 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 16 xjuncts. [2018-04-13 08:46:56,739 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:46:56,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 13 case distinctions, treesize of input 71 treesize of output 206 [2018-04-13 08:46:56,794 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-04-13 08:46:56,847 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 512 xjuncts. [2018-04-13 08:47:02,722 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:47:02,725 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:47:02,728 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:47:02,748 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 6 case distinctions, treesize of input 88 treesize of output 153 [2018-04-13 08:47:02,749 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 8 xjuncts. [2018-04-13 08:47:03,407 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:47:03,420 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 78 treesize of output 117 [2018-04-13 08:47:03,420 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 4 xjuncts. [2018-04-13 08:47:04,026 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:47:04,028 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:47:04,031 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:47:04,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, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 88 treesize of output 153 [2018-04-13 08:47:04,051 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 8 xjuncts. [2018-04-13 08:47:08,478 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:47:08,482 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:47:08,507 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 7 case distinctions, treesize of input 85 treesize of output 166 [2018-04-13 08:47:08,508 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 16 xjuncts. [2018-04-13 08:47:09,108 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:47:09,122 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 78 treesize of output 117 [2018-04-13 08:47:09,123 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 4 xjuncts. [2018-04-13 08:47:12,140 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:47:12,143 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:47:12,170 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 7 case distinctions, treesize of input 85 treesize of output 166 [2018-04-13 08:47:12,171 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 16 xjuncts. [2018-04-13 08:47:14,286 INFO L267 ElimStorePlain]: Start of recursive call 17: 32 dim-1 vars, End of recursive call: and 27 xjuncts. [2018-04-13 08:47:14,934 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 62 treesize of output 104 [2018-04-13 08:47:14,941 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:47:14,968 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 67 treesize of output 140 [2018-04-13 08:47:14,969 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 16 xjuncts. [2018-04-13 08:47:15,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 69 treesize of output 112 [2018-04-13 08:47:15,271 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 8 xjuncts. [2018-04-13 08:47:15,601 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 64 treesize of output 153 [2018-04-13 08:47:15,601 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-13 08:47:15,604 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 64 xjuncts. [2018-04-13 08:47:16,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 84 [2018-04-13 08:47:16,357 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 2 xjuncts. [2018-04-13 08:47:16,583 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:47:16,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 78 treesize of output 117 [2018-04-13 08:47:16,597 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 4 xjuncts. [2018-04-13 08:47:17,021 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:47:17,034 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 78 treesize of output 117 [2018-04-13 08:47:17,035 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 4 xjuncts. [2018-04-13 08:47:17,218 INFO L267 ElimStorePlain]: Start of recursive call 32: 8 dim-1 vars, End of recursive call: and 13 xjuncts. [2018-04-13 08:47:18,034 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:47:18,050 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 71 treesize of output 109 [2018-04-13 08:47:18,054 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:47:18,085 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 85 treesize of output 158 [2018-04-13 08:47:18,087 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 32 xjuncts. [2018-04-13 08:47:18,398 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:47:18,411 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 75 treesize of output 114 [2018-04-13 08:47:18,411 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 4 xjuncts. [2018-04-13 08:47:18,537 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:47:18,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 75 treesize of output 114 [2018-04-13 08:47:18,551 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 4 xjuncts. [2018-04-13 08:47:18,685 INFO L267 ElimStorePlain]: Start of recursive call 39: 4 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-04-13 08:47:19,464 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:47:19,477 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 71 treesize of output 109 [2018-04-13 08:47:19,495 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:47:19,523 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 85 treesize of output 158 [2018-04-13 08:47:19,525 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 32 xjuncts. [2018-04-13 08:47:19,826 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:47:19,838 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 75 treesize of output 114 [2018-04-13 08:47:19,838 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 4 xjuncts. [2018-04-13 08:47:19,961 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:47:19,973 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 75 treesize of output 114 [2018-04-13 08:47:19,974 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 4 xjuncts. [2018-04-13 08:47:20,093 INFO L267 ElimStorePlain]: Start of recursive call 43: 4 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-04-13 08:47:20,821 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 64 treesize of output 78 [2018-04-13 08:47:20,828 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 68 treesize of output 81 [2018-04-13 08:47:20,829 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 2 xjuncts. [2018-04-13 08:47:20,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 66 treesize of output 109 [2018-04-13 08:47:20,883 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 8 xjuncts. [2018-04-13 08:47:20,948 INFO L267 ElimStorePlain]: Start of recursive call 47: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-13 08:47:22,897 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 1 new quantified variables, introduced 9 case distinctions, treesize of input 57 treesize of output 143 [2018-04-13 08:47:22,897 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-13 08:47:22,905 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:47:22,905 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:47:22,909 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:47:22,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 11 case distinctions, treesize of input 95 treesize of output 198 [2018-04-13 08:47:22,951 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-13 08:47:22,962 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 128 xjuncts. [2018-04-13 08:47:28,599 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:47:28,604 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:47:28,626 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 7 case distinctions, treesize of input 79 treesize of output 148 [2018-04-13 08:47:28,629 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 16 xjuncts. [2018-04-13 08:47:31,050 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:47:31,051 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:47:31,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 12 case distinctions, treesize of input 83 treesize of output 202 [2018-04-13 08:47:31,100 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-04-13 08:47:31,120 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 256 xjuncts. [2018-04-13 08:47:38,311 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:47:38,333 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 67 treesize of output 140 [2018-04-13 08:47:38,335 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 16 xjuncts. [2018-04-13 08:47:40,590 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 69 treesize of output 112 [2018-04-13 08:47:40,591 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 8 xjuncts. [2018-04-13 08:47:44,372 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:47:44,402 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 76 treesize of output 161 [2018-04-13 08:47:44,404 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 32 xjuncts. [2018-04-13 08:47:46,438 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 69 treesize of output 112 [2018-04-13 08:47:46,438 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 8 xjuncts. [2018-04-13 08:47:49,936 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:47:49,966 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 76 treesize of output 161 [2018-04-13 08:47:49,968 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 32 xjuncts. [2018-04-13 08:47:51,824 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:47:51,828 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:47:51,855 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 79 treesize of output 155 [2018-04-13 08:47:51,858 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 16 xjuncts. [2018-04-13 08:47:53,717 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:47:53,719 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:47:53,722 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:47:53,741 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 6 case distinctions, treesize of input 88 treesize of output 153 [2018-04-13 08:47:53,742 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 8 xjuncts. [2018-04-13 08:48:01,023 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:48:01,049 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 67 treesize of output 140 [2018-04-13 08:48:01,050 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 16 xjuncts. [2018-04-13 08:48:04,906 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:48:04,918 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 78 treesize of output 117 [2018-04-13 08:48:04,919 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 4 xjuncts. [2018-04-13 08:48:08,218 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 69 treesize of output 112 [2018-04-13 08:48:08,219 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 8 xjuncts. [2018-04-13 08:48:12,943 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 71 treesize of output 84 [2018-04-13 08:48:12,944 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 2 xjuncts. [2018-04-13 08:48:14,399 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:48:14,402 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:48:14,403 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 08:48:14,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 11 case distinctions, treesize of input 77 treesize of output 180 [2018-04-13 08:48:14,446 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-13 08:48:14,448 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 32 xjuncts. [2018-04-13 08:48:16,253 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:48:16,281 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 76 treesize of output 161 [2018-04-13 08:48:16,283 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 32 xjuncts. [2018-04-13 08:48:19,564 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:48:19,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 13 case distinctions, treesize of input 71 treesize of output 206 [2018-04-13 08:48:19,617 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-04-13 08:48:19,669 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 512 xjuncts. [2018-04-13 08:48:27,985 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:48:27,985 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:48:27,987 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 08:48:28,008 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 97 treesize of output 162 [2018-04-13 08:48:28,008 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 8 xjuncts. Received shutdown request... [2018-04-13 08:48:28,766 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-13 08:48:28,766 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-13 08:48:28,769 WARN L197 ceAbstractionStarter]: Timeout [2018-04-13 08:48:28,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 08:48:28 BoogieIcfgContainer [2018-04-13 08:48:28,769 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-13 08:48:28,770 INFO L168 Benchmark]: Toolchain (without parser) took 793729.48 ms. Allocated memory was 400.6 MB in the beginning and 521.1 MB in the end (delta: 120.6 MB). Free memory was 338.8 MB in the beginning and 349.6 MB in the end (delta: -10.8 MB). Peak memory consumption was 192.6 MB. Max. memory is 5.3 GB. [2018-04-13 08:48:28,772 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 400.6 MB. Free memory is still 359.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-13 08:48:28,772 INFO L168 Benchmark]: CACSL2BoogieTranslator took 170.88 ms. Allocated memory is still 400.6 MB. Free memory was 338.8 MB in the beginning and 328.2 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-04-13 08:48:28,772 INFO L168 Benchmark]: Boogie Preprocessor took 26.47 ms. Allocated memory is still 400.6 MB. Free memory is still 328.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-13 08:48:28,773 INFO L168 Benchmark]: RCFGBuilder took 259.17 ms. Allocated memory was 400.6 MB in the beginning and 605.0 MB in the end (delta: 204.5 MB). Free memory was 328.2 MB in the beginning and 563.5 MB in the end (delta: -235.3 MB). Peak memory consumption was 28.1 MB. Max. memory is 5.3 GB. [2018-04-13 08:48:28,773 INFO L168 Benchmark]: TraceAbstraction took 793269.91 ms. Allocated memory was 605.0 MB in the beginning and 521.1 MB in the end (delta: -83.9 MB). Free memory was 563.5 MB in the beginning and 349.6 MB in the end (delta: 214.0 MB). Peak memory consumption was 212.8 MB. Max. memory is 5.3 GB. [2018-04-13 08:48:28,774 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 400.6 MB. Free memory is still 359.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 170.88 ms. Allocated memory is still 400.6 MB. Free memory was 338.8 MB in the beginning and 328.2 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.47 ms. Allocated memory is still 400.6 MB. Free memory is still 328.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * RCFGBuilder took 259.17 ms. Allocated memory was 400.6 MB in the beginning and 605.0 MB in the end (delta: 204.5 MB). Free memory was 328.2 MB in the beginning and 563.5 MB in the end (delta: -235.3 MB). Peak memory consumption was 28.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 793269.91 ms. Allocated memory was 605.0 MB in the beginning and 521.1 MB in the end (delta: -83.9 MB). Free memory was 563.5 MB in the beginning and 349.6 MB in the end (delta: 214.0 MB). Peak memory consumption was 212.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 14]: 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 233. - TimeoutResultAtElement [Line: 14]: 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 233. - TimeoutResultAtElement [Line: 23]: 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 233. - TimeoutResultAtElement [Line: 23]: 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 233. - TimeoutResultAtElement [Line: 23]: 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 233. - TimeoutResultAtElement [Line: 23]: 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 233. - TimeoutResultAtElement [Line: 37]: 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 233. - TimeoutResultAtElement [Line: 34]: 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 233. - TimeoutResultAtElement [Line: 37]: 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 233. - 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 233. - TimeoutResultAtElement [Line: 34]: 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 233. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 68 locations, 11 error locations. TIMEOUT Result, 793.2s OverallTime, 70 OverallIterations, 37 TraceHistogramMax, 337.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4292 SDtfs, 10679 SDslu, 35663 SDs, 0 SdLazy, 56259 SolverSat, 2859 SolverUnsat, 2195 SolverUnknown, 0 SolverNotchecked, 138.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 17024 GetRequests, 14178 SyntacticMatches, 220 SemanticMatches, 2626 ConstructedPredicates, 254 IntricatePredicates, 0 DeprecatedPredicates, 44375 ImplicationChecksByTransitivity, 241.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=524occurred in iteration=66, 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, 69 MinimizatonAttempts, 1114 StatesRemovedByMinimization, 62 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 8.1s SatisfiabilityAnalysisTime, 117.1s InterpolantComputationTime, 31128 NumberOfCodeBlocks, 30281 NumberOfCodeBlocksAsserted, 248 NumberOfCheckSat, 22508 ConstructedInterpolants, 5453 QuantifiedInterpolants, 60033833 SizeOfPredicates, 717 NumberOfNonLiveVariables, 42746 ConjunctsInSsa, 2627 ConjunctsInUnsatCore, 98 InterpolantComputations, 12 PerfectInterpolantSequences, 134940/160276 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-04-13_08-48-28-780.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-04-13_08-48-28-780.csv Completed graceful shutdown