java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength2_true-valid-memsafety.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-10 16:13:59,109 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-10 16:13:59,111 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-10 16:13:59,124 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-10 16:13:59,124 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-10 16:13:59,124 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-10 16:13:59,125 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-10 16:13:59,127 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-10 16:13:59,128 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-10 16:13:59,129 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-10 16:13:59,129 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-10 16:13:59,130 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-10 16:13:59,130 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-10 16:13:59,131 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-10 16:13:59,132 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-10 16:13:59,133 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-10 16:13:59,135 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-10 16:13:59,136 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-10 16:13:59,137 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-10 16:13:59,138 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-10 16:13:59,139 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-10 16:13:59,139 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-10 16:13:59,140 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-10 16:13:59,141 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-10 16:13:59,141 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-10 16:13:59,142 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-10 16:13:59,142 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-10 16:13:59,143 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-10 16:13:59,143 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-10 16:13:59,144 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-10 16:13:59,144 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-10 16:13:59,144 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-10 16:13:59,161 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-10 16:13:59,161 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-10 16:13:59,162 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-10 16:13:59,162 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-10 16:13:59,162 INFO L133 SettingsManager]: * Use SBE=true [2018-04-10 16:13:59,163 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-10 16:13:59,163 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-10 16:13:59,163 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-10 16:13:59,163 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-10 16:13:59,163 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-10 16:13:59,163 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-10 16:13:59,163 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-10 16:13:59,163 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-10 16:13:59,163 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-10 16:13:59,164 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-10 16:13:59,164 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-10 16:13:59,164 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-10 16:13:59,164 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-10 16:13:59,164 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-10 16:13:59,164 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 16:13:59,164 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-10 16:13:59,164 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-10 16:13:59,164 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-10 16:13:59,165 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-04-10 16:13:59,194 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-10 16:13:59,204 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-10 16:13:59,208 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-10 16:13:59,209 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-10 16:13:59,210 INFO L276 PluginConnector]: CDTParser initialized [2018-04-10 16:13:59,210 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-10 16:13:59,488 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGf0a6da70e [2018-04-10 16:13:59,571 INFO L287 CDTParser]: IsIndexed: true [2018-04-10 16:13:59,571 INFO L288 CDTParser]: Found 1 translation units. [2018-04-10 16:13:59,571 INFO L168 CDTParser]: Scanning ArraysOfVariableLength2_true-valid-memsafety.c [2018-04-10 16:13:59,572 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-10 16:13:59,572 INFO L215 ultiparseSymbolTable]: [2018-04-10 16:13:59,572 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-10 16:13:59,572 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo ('foo') in ArraysOfVariableLength2_true-valid-memsafety.c [2018-04-10 16:13:59,572 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in ArraysOfVariableLength2_true-valid-memsafety.c [2018-04-10 16:13:59,572 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar ('bar') in ArraysOfVariableLength2_true-valid-memsafety.c [2018-04-10 16:13:59,572 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-10 16:13:59,572 INFO L233 ultiparseSymbolTable]: [2018-04-10 16:13:59,583 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGf0a6da70e [2018-04-10 16:13:59,587 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-10 16:13:59,588 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-10 16:13:59,589 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-10 16:13:59,589 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-10 16:13:59,593 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-10 16:13:59,593 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 04:13:59" (1/1) ... [2018-04-10 16:13:59,595 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@669672ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:13:59, skipping insertion in model container [2018-04-10 16:13:59,595 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 04:13:59" (1/1) ... [2018-04-10 16:13:59,609 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 16:13:59,620 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 16:13:59,736 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 16:13:59,758 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 16:13:59,763 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 10 non ball SCCs. Number of states in SCCs 10. [2018-04-10 16:13:59,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:13:59 WrapperNode [2018-04-10 16:13:59,771 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-10 16:13:59,772 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-10 16:13:59,772 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-10 16:13:59,772 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-10 16:13:59,782 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:13:59" (1/1) ... [2018-04-10 16:13:59,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:13:59" (1/1) ... [2018-04-10 16:13:59,790 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:13:59" (1/1) ... [2018-04-10 16:13:59,790 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:13:59" (1/1) ... [2018-04-10 16:13:59,794 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:13:59" (1/1) ... [2018-04-10 16:13:59,798 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:13:59" (1/1) ... [2018-04-10 16:13:59,799 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:13:59" (1/1) ... [2018-04-10 16:13:59,801 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-10 16:13:59,801 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-10 16:13:59,801 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-10 16:13:59,801 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-10 16:13:59,802 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:13:59" (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-10 16:13:59,840 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-10 16:13:59,840 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-10 16:13:59,840 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar [2018-04-10 16:13:59,840 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo [2018-04-10 16:13:59,840 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-10 16:13:59,840 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar [2018-04-10 16:13:59,840 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-10 16:13:59,840 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo [2018-04-10 16:13:59,840 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-10 16:13:59,841 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-10 16:13:59,841 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-10 16:13:59,841 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-10 16:13:59,841 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-10 16:13:59,841 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-10 16:13:59,841 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-10 16:14:00,086 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-10 16:14:00,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 04:14:00 BoogieIcfgContainer [2018-04-10 16:14:00,086 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-10 16:14:00,087 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-10 16:14:00,087 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-10 16:14:00,089 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-10 16:14:00,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.04 04:13:59" (1/3) ... [2018-04-10 16:14:00,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fd76ffc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 04:14:00, skipping insertion in model container [2018-04-10 16:14:00,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:13:59" (2/3) ... [2018-04-10 16:14:00,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fd76ffc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 04:14:00, skipping insertion in model container [2018-04-10 16:14:00,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 04:14:00" (3/3) ... [2018-04-10 16:14:00,091 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength2_true-valid-memsafety.c [2018-04-10 16:14:00,097 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-10 16:14:00,101 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-04-10 16:14:00,126 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-10 16:14:00,127 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-10 16:14:00,127 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-10 16:14:00,127 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-10 16:14:00,127 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-10 16:14:00,127 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-10 16:14:00,128 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-10 16:14:00,128 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-10 16:14:00,128 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-10 16:14:00,129 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-10 16:14:00,141 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2018-04-10 16:14:00,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-10 16:14:00,150 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:00,151 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:14:00,151 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-10 16:14:00,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1613294992, now seen corresponding path program 1 times [2018-04-10 16:14:00,155 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:00,156 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:00,189 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:00,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:00,190 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:00,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:00,218 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:00,244 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-10 16:14:00,246 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:14:00,247 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-10 16:14:00,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-04-10 16:14:00,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-04-10 16:14:00,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-10 16:14:00,260 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 2 states. [2018-04-10 16:14:00,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:00,275 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-04-10 16:14:00,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-10 16:14:00,276 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-04-10 16:14:00,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:00,284 INFO L225 Difference]: With dead ends: 68 [2018-04-10 16:14:00,284 INFO L226 Difference]: Without dead ends: 65 [2018-04-10 16:14:00,286 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-10 16:14:00,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-04-10 16:14:00,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-04-10 16:14:00,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-04-10 16:14:00,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-04-10 16:14:00,311 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 13 [2018-04-10 16:14:00,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:00,311 INFO L459 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-04-10 16:14:00,312 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-04-10 16:14:00,312 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-04-10 16:14:00,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-10 16:14:00,312 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:00,312 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:14:00,312 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-10 16:14:00,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1969953325, now seen corresponding path program 1 times [2018-04-10 16:14:00,313 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:00,313 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:00,313 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:00,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:00,314 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:00,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:00,325 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:00,357 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-10 16:14:00,357 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:14:00,357 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 16:14:00,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-10 16:14:00,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-10 16:14:00,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 16:14:00,359 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 3 states. [2018-04-10 16:14:00,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:00,400 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2018-04-10 16:14:00,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-10 16:14:00,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-04-10 16:14:00,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:00,402 INFO L225 Difference]: With dead ends: 71 [2018-04-10 16:14:00,403 INFO L226 Difference]: Without dead ends: 71 [2018-04-10 16:14:00,403 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-10 16:14:00,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-04-10 16:14:00,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2018-04-10 16:14:00,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-04-10 16:14:00,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-04-10 16:14:00,411 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 14 [2018-04-10 16:14:00,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:00,411 INFO L459 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-04-10 16:14:00,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-10 16:14:00,411 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-04-10 16:14:00,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-10 16:14:00,412 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:00,412 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:14:00,412 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-10 16:14:00,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1297061679, now seen corresponding path program 1 times [2018-04-10 16:14:00,413 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:00,413 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:00,414 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:00,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:00,414 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:00,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:00,431 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:00,487 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-10 16:14:00,487 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:14:00,487 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-10 16:14:00,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 16:14:00,488 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 16:14:00,488 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-10 16:14:00,489 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 6 states. [2018-04-10 16:14:00,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:00,567 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2018-04-10 16:14:00,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 16:14:00,568 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-04-10 16:14:00,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:00,568 INFO L225 Difference]: With dead ends: 85 [2018-04-10 16:14:00,568 INFO L226 Difference]: Without dead ends: 85 [2018-04-10 16:14:00,569 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-10 16:14:00,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-04-10 16:14:00,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2018-04-10 16:14:00,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-04-10 16:14:00,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-04-10 16:14:00,575 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 17 [2018-04-10 16:14:00,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:00,576 INFO L459 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-04-10 16:14:00,576 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 16:14:00,576 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-04-10 16:14:00,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-10 16:14:00,577 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:00,577 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-10 16:14:00,577 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-10 16:14:00,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1600184185, now seen corresponding path program 1 times [2018-04-10 16:14:00,577 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:00,577 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:00,578 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:00,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:00,579 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:00,590 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:00,620 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-10 16:14:00,620 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:14:00,621 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:14:00,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:14:00,621 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:14:00,621 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:14:00,621 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 5 states. [2018-04-10 16:14:00,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:00,685 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2018-04-10 16:14:00,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:14:00,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-04-10 16:14:00,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:00,688 INFO L225 Difference]: With dead ends: 77 [2018-04-10 16:14:00,688 INFO L226 Difference]: Without dead ends: 77 [2018-04-10 16:14:00,688 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-10 16:14:00,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-04-10 16:14:00,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-04-10 16:14:00,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-04-10 16:14:00,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-04-10 16:14:00,694 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 21 [2018-04-10 16:14:00,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:00,694 INFO L459 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-04-10 16:14:00,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:14:00,694 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-04-10 16:14:00,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-10 16:14:00,695 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:00,695 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-10 16:14:00,695 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-10 16:14:00,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1600184184, now seen corresponding path program 1 times [2018-04-10 16:14:00,695 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:00,695 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:00,696 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:00,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:00,696 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:00,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:00,710 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:00,753 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-10 16:14:00,753 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:14:00,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 16:14:00,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 16:14:00,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 16:14:00,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-10 16:14:00,754 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 7 states. [2018-04-10 16:14:00,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:00,834 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-04-10 16:14:00,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 16:14:00,839 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-04-10 16:14:00,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:00,840 INFO L225 Difference]: With dead ends: 89 [2018-04-10 16:14:00,840 INFO L226 Difference]: Without dead ends: 89 [2018-04-10 16:14:00,841 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-10 16:14:00,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-04-10 16:14:00,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2018-04-10 16:14:00,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-04-10 16:14:00,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-04-10 16:14:00,851 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 21 [2018-04-10 16:14:00,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:00,852 INFO L459 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-04-10 16:14:00,852 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 16:14:00,852 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-04-10 16:14:00,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-10 16:14:00,853 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:00,853 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-10 16:14:00,853 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-10 16:14:00,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1759981910, now seen corresponding path program 1 times [2018-04-10 16:14:00,853 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:00,853 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:00,854 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:00,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:00,858 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:00,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:00,871 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:00,897 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-10 16:14:00,897 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:14:00,897 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 16:14:00,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:14:00,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:14:00,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:14:00,898 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 5 states. [2018-04-10 16:14:00,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:00,918 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2018-04-10 16:14:00,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:14:00,919 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-04-10 16:14:00,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:00,921 INFO L225 Difference]: With dead ends: 91 [2018-04-10 16:14:00,921 INFO L226 Difference]: Without dead ends: 91 [2018-04-10 16:14:00,921 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-10 16:14:00,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-04-10 16:14:00,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2018-04-10 16:14:00,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-04-10 16:14:00,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2018-04-10 16:14:00,928 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 31 [2018-04-10 16:14:00,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:00,929 INFO L459 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2018-04-10 16:14:00,929 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:14:00,929 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2018-04-10 16:14:00,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-10 16:14:00,930 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:00,930 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-10 16:14:00,930 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-10 16:14:00,930 INFO L82 PathProgramCache]: Analyzing trace with hash 216183673, now seen corresponding path program 1 times [2018-04-10 16:14:00,930 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:00,930 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:00,936 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:00,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:00,936 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:00,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:00,954 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:00,962 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:14:00,962 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:00,962 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:00,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:00,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:00,997 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:14:01,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-10 16:14:01,029 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:01,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:01,033 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-10 16:14:01,065 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:01,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 13 [2018-04-10 16:14:01,067 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:01,069 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-10 16:14:01,069 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-04-10 16:14:01,102 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-10 16:14:01,108 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:01,109 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:01,110 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:01,111 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-10 16:14:01,112 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:01,116 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-10 16:14:01,117 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-04-10 16:14:01,128 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-10 16:14:01,128 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:14:01,128 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 16:14:01,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 16:14:01,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 16:14:01,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2018-04-10 16:14:01,129 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand 8 states. [2018-04-10 16:14:01,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:01,251 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2018-04-10 16:14:01,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 16:14:01,252 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-04-10 16:14:01,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:01,252 INFO L225 Difference]: With dead ends: 105 [2018-04-10 16:14:01,252 INFO L226 Difference]: Without dead ends: 105 [2018-04-10 16:14:01,253 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-10 16:14:01,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-04-10 16:14:01,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 91. [2018-04-10 16:14:01,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-04-10 16:14:01,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2018-04-10 16:14:01,268 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 31 [2018-04-10 16:14:01,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:01,268 INFO L459 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2018-04-10 16:14:01,268 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 16:14:01,268 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2018-04-10 16:14:01,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-10 16:14:01,269 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:01,269 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-10 16:14:01,269 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-10 16:14:01,270 INFO L82 PathProgramCache]: Analyzing trace with hash 216183674, now seen corresponding path program 1 times [2018-04-10 16:14:01,270 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:01,270 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:01,271 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:01,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:01,271 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:01,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:01,282 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:01,286 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:14:01,286 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:01,286 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:01,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:01,308 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:14:01,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:01,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:01,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 6 treesize of output 5 [2018-04-10 16:14:01,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:01,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:01,334 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 16:14:01,367 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-10 16:14:01,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:01,375 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:01,395 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-10 16:14:01,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:01,398 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-10 16:14:01,398 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-04-10 16:14:01,414 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-10 16:14:01,430 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:01,432 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-10 16:14:01,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:01,442 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:01,443 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:01,444 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-10 16:14:01,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:01,452 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-10 16:14:01,452 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:37, output treesize:30 [2018-04-10 16:14:01,492 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-10 16:14:01,492 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:14:01,492 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-10 16:14:01,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 16:14:01,493 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 16:14:01,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=29, Unknown=2, NotChecked=22, Total=72 [2018-04-10 16:14:01,493 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand 9 states. [2018-04-10 16:14:01,524 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-10 16:14:01,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:01,658 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2018-04-10 16:14:01,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 16:14:01,659 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-04-10 16:14:01,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:01,660 INFO L225 Difference]: With dead ends: 136 [2018-04-10 16:14:01,661 INFO L226 Difference]: Without dead ends: 136 [2018-04-10 16:14:01,661 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-10 16:14:01,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-04-10 16:14:01,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 102. [2018-04-10 16:14:01,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-04-10 16:14:01,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2018-04-10 16:14:01,667 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 31 [2018-04-10 16:14:01,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:01,667 INFO L459 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2018-04-10 16:14:01,667 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 16:14:01,668 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2018-04-10 16:14:01,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-10 16:14:01,668 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:01,669 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-10 16:14:01,669 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-10 16:14:01,669 INFO L82 PathProgramCache]: Analyzing trace with hash -231887552, now seen corresponding path program 1 times [2018-04-10 16:14:01,669 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:01,669 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:01,670 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:01,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:01,670 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:01,682 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:01,686 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:14:01,686 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:01,686 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:01,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:01,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:01,718 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:14:01,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:14:01,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:01,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:01,722 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-10 16:14:01,735 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:01,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-04-10 16:14:01,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:01,736 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-10 16:14:01,737 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-04-10 16:14:01,764 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-10 16:14:01,768 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:01,769 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:01,770 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-10 16:14:01,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:01,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:14:01,774 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-04-10 16:14:01,803 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:01,804 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:01,811 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-10 16:14:01,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 16:14:01,825 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-10 16:14:01,825 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:32 [2018-04-10 16:14:01,858 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-10 16:14:01,858 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:14:01,858 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-10 16:14:01,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 16:14:01,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 16:14:01,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=66, Unknown=1, NotChecked=16, Total=110 [2018-04-10 16:14:01,859 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand 11 states. [2018-04-10 16:14:02,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:02,174 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2018-04-10 16:14:02,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 16:14:02,175 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2018-04-10 16:14:02,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:02,176 INFO L225 Difference]: With dead ends: 100 [2018-04-10 16:14:02,176 INFO L226 Difference]: Without dead ends: 100 [2018-04-10 16:14:02,176 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-10 16:14:02,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-04-10 16:14:02,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2018-04-10 16:14:02,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-04-10 16:14:02,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2018-04-10 16:14:02,186 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 42 [2018-04-10 16:14:02,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:02,186 INFO L459 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2018-04-10 16:14:02,186 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 16:14:02,186 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2018-04-10 16:14:02,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-10 16:14:02,187 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:02,187 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-10 16:14:02,188 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-10 16:14:02,188 INFO L82 PathProgramCache]: Analyzing trace with hash -231887551, now seen corresponding path program 1 times [2018-04-10 16:14:02,188 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:02,188 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:02,189 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:02,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:02,189 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:02,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:02,208 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:02,221 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:14:02,221 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:02,221 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:02,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:02,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:02,262 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:14:02,351 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:02,353 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-10 16:14:02,354 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:02,369 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:02,370 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:02,371 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-10 16:14:02,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:02,379 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-10 16:14:02,379 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:34, output treesize:27 [2018-04-10 16:14:02,420 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-10 16:14:02,421 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:14:02,421 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-10 16:14:02,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 16:14:02,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 16:14:02,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-10 16:14:02,421 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand 9 states. [2018-04-10 16:14:02,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:02,723 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2018-04-10 16:14:02,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 16:14:02,724 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-04-10 16:14:02,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:02,724 INFO L225 Difference]: With dead ends: 114 [2018-04-10 16:14:02,724 INFO L226 Difference]: Without dead ends: 114 [2018-04-10 16:14:02,724 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-04-10 16:14:02,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-04-10 16:14:02,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 99. [2018-04-10 16:14:02,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-04-10 16:14:02,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2018-04-10 16:14:02,728 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 42 [2018-04-10 16:14:02,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:02,728 INFO L459 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2018-04-10 16:14:02,728 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 16:14:02,728 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2018-04-10 16:14:02,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-10 16:14:02,729 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:02,729 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-10 16:14:02,729 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-10 16:14:02,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1401420489, now seen corresponding path program 1 times [2018-04-10 16:14:02,729 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:02,729 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:02,730 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:02,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:02,730 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:02,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:02,737 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:02,822 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-10 16:14:02,822 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:14:02,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 16:14:02,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 16:14:02,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 16:14:02,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:14:02,823 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 8 states. [2018-04-10 16:14:02,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:02,929 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2018-04-10 16:14:02,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 16:14:02,929 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2018-04-10 16:14:02,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:02,929 INFO L225 Difference]: With dead ends: 98 [2018-04-10 16:14:02,930 INFO L226 Difference]: Without dead ends: 98 [2018-04-10 16:14:02,930 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-04-10 16:14:02,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-04-10 16:14:02,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-04-10 16:14:02,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-04-10 16:14:02,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2018-04-10 16:14:02,933 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 43 [2018-04-10 16:14:02,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:02,933 INFO L459 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2018-04-10 16:14:02,933 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 16:14:02,933 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2018-04-10 16:14:02,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-10 16:14:02,934 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:02,934 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-10 16:14:02,934 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-10 16:14:02,934 INFO L82 PathProgramCache]: Analyzing trace with hash 2000127404, now seen corresponding path program 1 times [2018-04-10 16:14:02,934 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:02,934 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:02,935 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:02,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:02,935 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:02,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:02,942 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:02,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-10 16:14:02,960 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:02,960 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:02,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:02,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:02,973 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:14:02,984 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-10 16:14:02,984 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:14:02,984 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-04-10 16:14:02,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:14:02,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:14:02,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:14:02,985 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand 5 states. [2018-04-10 16:14:03,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:03,003 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2018-04-10 16:14:03,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 16:14:03,003 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-04-10 16:14:03,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:03,003 INFO L225 Difference]: With dead ends: 99 [2018-04-10 16:14:03,003 INFO L226 Difference]: Without dead ends: 99 [2018-04-10 16:14:03,004 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-10 16:14:03,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-04-10 16:14:03,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 93. [2018-04-10 16:14:03,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-04-10 16:14:03,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2018-04-10 16:14:03,006 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 44 [2018-04-10 16:14:03,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:03,006 INFO L459 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2018-04-10 16:14:03,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:14:03,006 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2018-04-10 16:14:03,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-10 16:14:03,006 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:03,006 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-10 16:14:03,007 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-10 16:14:03,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1644784265, now seen corresponding path program 1 times [2018-04-10 16:14:03,007 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:03,007 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:03,007 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:03,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:03,007 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:03,016 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:03,059 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-10 16:14:03,060 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:03,060 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:03,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:03,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:03,076 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:14:03,105 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-10 16:14:03,106 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:14:03,106 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2018-04-10 16:14:03,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 16:14:03,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 16:14:03,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-04-10 16:14:03,107 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand 9 states. [2018-04-10 16:14:03,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:03,180 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2018-04-10 16:14:03,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 16:14:03,180 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2018-04-10 16:14:03,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:03,181 INFO L225 Difference]: With dead ends: 96 [2018-04-10 16:14:03,181 INFO L226 Difference]: Without dead ends: 96 [2018-04-10 16:14:03,181 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-10 16:14:03,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-04-10 16:14:03,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2018-04-10 16:14:03,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-04-10 16:14:03,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2018-04-10 16:14:03,184 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 46 [2018-04-10 16:14:03,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:03,184 INFO L459 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2018-04-10 16:14:03,184 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 16:14:03,184 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2018-04-10 16:14:03,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-10 16:14:03,185 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:03,185 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-10 16:14:03,185 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-10 16:14:03,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1169266089, now seen corresponding path program 1 times [2018-04-10 16:14:03,185 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:03,186 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:03,186 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:03,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:03,186 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:03,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:03,202 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:03,292 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-10 16:14:03,292 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:03,292 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:03,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:03,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:03,307 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:14:03,348 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-10 16:14:03,348 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:14:03,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-04-10 16:14:03,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-10 16:14:03,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-10 16:14:03,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-04-10 16:14:03,349 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand 15 states. [2018-04-10 16:14:03,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:03,628 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2018-04-10 16:14:03,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 16:14:03,628 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48 [2018-04-10 16:14:03,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:03,628 INFO L225 Difference]: With dead ends: 121 [2018-04-10 16:14:03,628 INFO L226 Difference]: Without dead ends: 121 [2018-04-10 16:14:03,629 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-10 16:14:03,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-04-10 16:14:03,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 116. [2018-04-10 16:14:03,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-04-10 16:14:03,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 124 transitions. [2018-04-10 16:14:03,632 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 124 transitions. Word has length 48 [2018-04-10 16:14:03,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:03,632 INFO L459 AbstractCegarLoop]: Abstraction has 116 states and 124 transitions. [2018-04-10 16:14:03,632 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-10 16:14:03,632 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 124 transitions. [2018-04-10 16:14:03,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-10 16:14:03,633 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:03,633 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-10 16:14:03,633 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-10 16:14:03,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1096362099, now seen corresponding path program 1 times [2018-04-10 16:14:03,633 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:03,634 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:03,634 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:03,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:03,634 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:03,655 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:03,706 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-10 16:14:03,706 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:14:03,706 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 16:14:03,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 16:14:03,707 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 16:14:03,707 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-10 16:14:03,707 INFO L87 Difference]: Start difference. First operand 116 states and 124 transitions. Second operand 6 states. [2018-04-10 16:14:03,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:03,757 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2018-04-10 16:14:03,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 16:14:03,757 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2018-04-10 16:14:03,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:03,758 INFO L225 Difference]: With dead ends: 120 [2018-04-10 16:14:03,758 INFO L226 Difference]: Without dead ends: 120 [2018-04-10 16:14:03,758 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-10 16:14:03,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-04-10 16:14:03,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2018-04-10 16:14:03,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-04-10 16:14:03,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 125 transitions. [2018-04-10 16:14:03,762 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 125 transitions. Word has length 52 [2018-04-10 16:14:03,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:03,763 INFO L459 AbstractCegarLoop]: Abstraction has 117 states and 125 transitions. [2018-04-10 16:14:03,763 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 16:14:03,763 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 125 transitions. [2018-04-10 16:14:03,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-10 16:14:03,763 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:03,763 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-10 16:14:03,763 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-10 16:14:03,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1224161946, now seen corresponding path program 1 times [2018-04-10 16:14:03,764 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:03,764 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:03,764 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:03,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:03,764 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:03,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:03,774 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:03,865 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-10 16:14:03,866 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:03,866 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:03,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:03,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:03,882 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:14:03,941 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-10 16:14:03,941 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:14:03,941 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2018-04-10 16:14:03,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-10 16:14:03,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-10 16:14:03,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-04-10 16:14:03,942 INFO L87 Difference]: Start difference. First operand 117 states and 125 transitions. Second operand 16 states. [2018-04-10 16:14:04,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:04,262 INFO L93 Difference]: Finished difference Result 171 states and 181 transitions. [2018-04-10 16:14:04,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-10 16:14:04,263 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 57 [2018-04-10 16:14:04,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:04,263 INFO L225 Difference]: With dead ends: 171 [2018-04-10 16:14:04,264 INFO L226 Difference]: Without dead ends: 171 [2018-04-10 16:14:04,264 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-10 16:14:04,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-04-10 16:14:04,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 151. [2018-04-10 16:14:04,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-04-10 16:14:04,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2018-04-10 16:14:04,268 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 57 [2018-04-10 16:14:04,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:04,268 INFO L459 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2018-04-10 16:14:04,268 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-10 16:14:04,268 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2018-04-10 16:14:04,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-10 16:14:04,269 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:04,269 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-10 16:14:04,269 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-10 16:14:04,269 INFO L82 PathProgramCache]: Analyzing trace with hash -227989441, now seen corresponding path program 1 times [2018-04-10 16:14:04,269 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:04,270 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:04,270 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:04,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:04,270 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:04,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:04,278 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:04,376 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-10 16:14:04,376 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:04,376 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:04,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:04,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:04,387 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:14:04,420 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-10 16:14:04,420 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:14:04,421 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2018-04-10 16:14:04,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-10 16:14:04,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-10 16:14:04,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-04-10 16:14:04,421 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand 12 states. [2018-04-10 16:14:04,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:04,553 INFO L93 Difference]: Finished difference Result 149 states and 155 transitions. [2018-04-10 16:14:04,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 16:14:04,554 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2018-04-10 16:14:04,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:04,554 INFO L225 Difference]: With dead ends: 149 [2018-04-10 16:14:04,554 INFO L226 Difference]: Without dead ends: 140 [2018-04-10 16:14:04,555 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-10 16:14:04,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-04-10 16:14:04,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2018-04-10 16:14:04,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-10 16:14:04,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 144 transitions. [2018-04-10 16:14:04,558 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 144 transitions. Word has length 62 [2018-04-10 16:14:04,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:04,558 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 144 transitions. [2018-04-10 16:14:04,558 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-10 16:14:04,558 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 144 transitions. [2018-04-10 16:14:04,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-10 16:14:04,559 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:04,559 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-10 16:14:04,559 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-10 16:14:04,559 INFO L82 PathProgramCache]: Analyzing trace with hash 897277161, now seen corresponding path program 1 times [2018-04-10 16:14:04,560 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:04,560 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:04,560 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:04,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:04,561 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:04,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:04,573 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:04,582 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:14:04,582 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:04,582 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:04,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:04,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:04,601 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:14:04,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:14:04,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:04,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:04,620 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:14:04,633 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-10 16:14:04,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:04,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:04,637 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-10 16:14:04,637 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-10 16:14:04,648 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-10 16:14:04,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:04,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:04,659 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-10 16:14:04,660 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-10 16:14:04,662 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-10 16:14:04,674 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-10 16:14:04,675 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 16:14:04,691 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-10 16:14:04,691 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:58 [2018-04-10 16:14:04,791 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-10 16:14:04,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:04,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:04,806 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-10 16:14:04,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:04,807 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-10 16:14:04,807 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-04-10 16:14:04,820 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-10 16:14:04,836 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:04,837 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:04,838 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:04,838 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-10 16:14:04,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:04,855 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-10 16:14:04,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:14:04,874 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-10 16:14:04,874 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:49, output treesize:72 [2018-04-10 16:14:04,909 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-10 16:14:04,909 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:14:04,909 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-10 16:14:04,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-10 16:14:04,910 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-10 16:14:04,910 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=82, Unknown=5, NotChecked=110, Total=240 [2018-04-10 16:14:04,910 INFO L87 Difference]: Start difference. First operand 138 states and 144 transitions. Second operand 16 states. [2018-04-10 16:14:04,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-10 16:14:04,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-10 16:14:04,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-10 16:14:05,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:05,046 INFO L93 Difference]: Finished difference Result 161 states and 170 transitions. [2018-04-10 16:14:05,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-10 16:14:05,046 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2018-04-10 16:14:05,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:05,047 INFO L225 Difference]: With dead ends: 161 [2018-04-10 16:14:05,047 INFO L226 Difference]: Without dead ends: 161 [2018-04-10 16:14:05,047 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-10 16:14:05,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-04-10 16:14:05,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 151. [2018-04-10 16:14:05,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-04-10 16:14:05,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 159 transitions. [2018-04-10 16:14:05,051 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 159 transitions. Word has length 67 [2018-04-10 16:14:05,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:05,052 INFO L459 AbstractCegarLoop]: Abstraction has 151 states and 159 transitions. [2018-04-10 16:14:05,052 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-10 16:14:05,052 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 159 transitions. [2018-04-10 16:14:05,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-10 16:14:05,052 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:05,052 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-10 16:14:05,052 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-10 16:14:05,052 INFO L82 PathProgramCache]: Analyzing trace with hash -646521076, now seen corresponding path program 1 times [2018-04-10 16:14:05,053 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:05,053 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:05,053 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:05,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:05,053 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:05,063 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:05,069 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:14:05,069 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:05,069 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:05,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:05,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:05,083 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:14:05,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:14:05,104 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:05,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:05,108 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:14:05,124 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-10 16:14:05,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:05,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:05,130 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-10 16:14:05,131 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-10 16:14:05,141 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-10 16:14:05,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:14:05,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:05,150 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-10 16:14:05,150 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-10 16:14:05,152 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-10 16:14:05,165 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-10 16:14:05,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 16:14:05,178 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-10 16:14:05,178 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:58 [2018-04-10 16:14:05,258 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-10 16:14:05,266 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-10 16:14:05,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:05,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:05,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:05,271 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-10 16:14:05,271 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-04-10 16:14:05,282 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-10 16:14:05,290 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:05,290 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:05,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-10 16:14:05,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 16:14:05,323 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:05,324 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:05,325 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:05,325 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-10 16:14:05,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:05,340 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-10 16:14:05,340 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:49, output treesize:72 [2018-04-10 16:14:05,375 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-10 16:14:05,375 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:14:05,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-10 16:14:05,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-10 16:14:05,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-10 16:14:05,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=82, Unknown=5, NotChecked=110, Total=240 [2018-04-10 16:14:05,376 INFO L87 Difference]: Start difference. First operand 151 states and 159 transitions. Second operand 16 states. [2018-04-10 16:14:05,429 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-10 16:14:05,431 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-10 16:14:05,442 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-10 16:14:05,444 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-10 16:14:05,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:05,576 INFO L93 Difference]: Finished difference Result 172 states and 183 transitions. [2018-04-10 16:14:05,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-10 16:14:05,577 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2018-04-10 16:14:05,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:05,577 INFO L225 Difference]: With dead ends: 172 [2018-04-10 16:14:05,577 INFO L226 Difference]: Without dead ends: 172 [2018-04-10 16:14:05,578 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-10 16:14:05,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-04-10 16:14:05,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 149. [2018-04-10 16:14:05,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-04-10 16:14:05,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 157 transitions. [2018-04-10 16:14:05,581 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 157 transitions. Word has length 67 [2018-04-10 16:14:05,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:05,581 INFO L459 AbstractCegarLoop]: Abstraction has 149 states and 157 transitions. [2018-04-10 16:14:05,581 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-10 16:14:05,582 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 157 transitions. [2018-04-10 16:14:05,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-04-10 16:14:05,582 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:05,582 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-10 16:14:05,582 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-10 16:14:05,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1591994525, now seen corresponding path program 1 times [2018-04-10 16:14:05,582 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:05,583 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:05,583 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:05,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:05,583 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:05,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:05,590 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:05,607 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-10 16:14:05,608 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:05,608 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:05,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:05,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:05,618 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:14:05,625 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-10 16:14:05,625 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:14:05,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-04-10 16:14:05,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 16:14:05,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 16:14:05,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-04-10 16:14:05,625 INFO L87 Difference]: Start difference. First operand 149 states and 157 transitions. Second operand 6 states. [2018-04-10 16:14:05,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:05,662 INFO L93 Difference]: Finished difference Result 150 states and 157 transitions. [2018-04-10 16:14:05,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:14:05,664 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2018-04-10 16:14:05,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:05,665 INFO L225 Difference]: With dead ends: 150 [2018-04-10 16:14:05,665 INFO L226 Difference]: Without dead ends: 150 [2018-04-10 16:14:05,665 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-10 16:14:05,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-04-10 16:14:05,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 144. [2018-04-10 16:14:05,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-04-10 16:14:05,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 150 transitions. [2018-04-10 16:14:05,668 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 150 transitions. Word has length 80 [2018-04-10 16:14:05,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:05,669 INFO L459 AbstractCegarLoop]: Abstraction has 144 states and 150 transitions. [2018-04-10 16:14:05,669 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 16:14:05,669 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 150 transitions. [2018-04-10 16:14:05,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-10 16:14:05,669 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:05,670 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-10 16:14:05,670 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-10 16:14:05,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1581116616, now seen corresponding path program 1 times [2018-04-10 16:14:05,670 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:05,670 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:05,671 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:05,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:05,671 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:05,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:05,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:05,691 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:14:05,691 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:05,691 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:05,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:05,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:05,724 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:14:05,755 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-10 16:14:05,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:05,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:05,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:05,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:05,762 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-04-10 16:14:05,853 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-10 16:14:05,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:05,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:05,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:05,865 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-10 16:14:05,865 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:19, output treesize:15 [2018-04-10 16:14:05,942 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-10 16:14:05,983 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-10 16:14:05,983 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:14:05,983 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-10 16:14:05,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-10 16:14:05,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-10 16:14:05,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=283, Unknown=13, NotChecked=34, Total=380 [2018-04-10 16:14:05,984 INFO L87 Difference]: Start difference. First operand 144 states and 150 transitions. Second operand 20 states. [2018-04-10 16:14:06,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:06,624 INFO L93 Difference]: Finished difference Result 167 states and 174 transitions. [2018-04-10 16:14:06,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-10 16:14:06,624 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 84 [2018-04-10 16:14:06,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:06,625 INFO L225 Difference]: With dead ends: 167 [2018-04-10 16:14:06,625 INFO L226 Difference]: Without dead ends: 163 [2018-04-10 16:14:06,625 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-10 16:14:06,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-04-10 16:14:06,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 142. [2018-04-10 16:14:06,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-04-10 16:14:06,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 147 transitions. [2018-04-10 16:14:06,628 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 147 transitions. Word has length 84 [2018-04-10 16:14:06,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:06,628 INFO L459 AbstractCegarLoop]: Abstraction has 142 states and 147 transitions. [2018-04-10 16:14:06,628 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-10 16:14:06,628 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 147 transitions. [2018-04-10 16:14:06,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-10 16:14:06,629 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:06,629 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-10 16:14:06,629 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-10 16:14:06,629 INFO L82 PathProgramCache]: Analyzing trace with hash -999779067, now seen corresponding path program 1 times [2018-04-10 16:14:06,629 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:06,629 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:06,629 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:06,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:06,630 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:06,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:06,643 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:06,647 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:14:06,647 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:06,647 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:06,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:06,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:06,687 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:14:06,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-10 16:14:06,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:06,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:06,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:14:06,711 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-10 16:14:06,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 8 treesize of output 7 [2018-04-10 16:14:06,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:06,715 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-10 16:14:06,715 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-10 16:14:06,723 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-10 16:14:06,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:06,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:06,731 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-10 16:14:06,732 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-10 16:14:06,733 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-10 16:14:06,744 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-10 16:14:06,744 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 16:14:06,757 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-10 16:14:06,757 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:58 [2018-04-10 16:14:06,794 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:06,795 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14: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 29 treesize of output 23 [2018-04-10 16:14:06,796 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:06,807 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-10 16:14:06,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:23 [2018-04-10 16:14:06,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:06,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:06,839 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-10 16:14:06,840 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-10 16:14:06,850 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-10 16:14:06,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:06,853 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:06,857 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-10 16:14:06,857 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-10 16:14:06,859 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-10 16:14:06,875 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-10 16:14:06,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-10 16:14:06,905 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-10 16:14:06,905 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-04-10 16:14:06,970 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 16:14:06,970 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:06,982 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:06,983 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:06,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, 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-10 16:14:06,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:06,988 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-10 16:14:06,989 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:69, output treesize:23 [2018-04-10 16:14:07,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-10 16:14:07,058 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-10 16:14:07,083 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-10 16:14:07,083 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:31, output treesize:79 [2018-04-10 16:14:07,220 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-10 16:14:07,220 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:14:07,220 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-10 16:14:07,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-10 16:14:07,221 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-10 16:14:07,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=217, Unknown=5, NotChecked=170, Total=462 [2018-04-10 16:14:07,221 INFO L87 Difference]: Start difference. First operand 142 states and 147 transitions. Second operand 22 states. [2018-04-10 16:14:07,273 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-10 16:14:07,293 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-10 16:14:07,296 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-10 16:14:09,543 WARN L151 SmtUtils]: Spent 2048ms on a formula simplification. DAG size of input: 35 DAG size of output 31 [2018-04-10 16:14:10,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:10,057 INFO L93 Difference]: Finished difference Result 228 states and 244 transitions. [2018-04-10 16:14:10,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-10 16:14:10,058 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 84 [2018-04-10 16:14:10,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:10,058 INFO L225 Difference]: With dead ends: 228 [2018-04-10 16:14:10,059 INFO L226 Difference]: Without dead ends: 228 [2018-04-10 16:14:10,059 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=158, Invalid=663, Unknown=23, NotChecked=488, Total=1332 [2018-04-10 16:14:10,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-04-10 16:14:10,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 179. [2018-04-10 16:14:10,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-04-10 16:14:10,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 192 transitions. [2018-04-10 16:14:10,062 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 192 transitions. Word has length 84 [2018-04-10 16:14:10,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:10,062 INFO L459 AbstractCegarLoop]: Abstraction has 179 states and 192 transitions. [2018-04-10 16:14:10,062 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-10 16:14:10,063 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 192 transitions. [2018-04-10 16:14:10,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-04-10 16:14:10,063 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:10,064 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-10 16:14:10,064 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-10 16:14:10,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1195020517, now seen corresponding path program 2 times [2018-04-10 16:14:10,064 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:10,064 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:10,065 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:10,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:10,065 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:10,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:10,073 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:10,179 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-10 16:14:10,180 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:10,180 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:10,180 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:14:10,200 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:14:10,200 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:14:10,202 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:14:10,259 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-10 16:14:10,260 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:14:10,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-04-10 16:14:10,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-10 16:14:10,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-10 16:14:10,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2018-04-10 16:14:10,260 INFO L87 Difference]: Start difference. First operand 179 states and 192 transitions. Second operand 19 states. [2018-04-10 16:14:10,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:10,458 INFO L93 Difference]: Finished difference Result 228 states and 247 transitions. [2018-04-10 16:14:10,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-10 16:14:10,459 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 90 [2018-04-10 16:14:10,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:10,459 INFO L225 Difference]: With dead ends: 228 [2018-04-10 16:14:10,459 INFO L226 Difference]: Without dead ends: 228 [2018-04-10 16:14:10,460 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2018-04-10 16:14:10,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-04-10 16:14:10,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 209. [2018-04-10 16:14:10,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-04-10 16:14:10,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 226 transitions. [2018-04-10 16:14:10,464 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 226 transitions. Word has length 90 [2018-04-10 16:14:10,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:10,465 INFO L459 AbstractCegarLoop]: Abstraction has 209 states and 226 transitions. [2018-04-10 16:14:10,465 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-10 16:14:10,465 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 226 transitions. [2018-04-10 16:14:10,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-04-10 16:14:10,465 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:10,465 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-10 16:14:10,465 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-10 16:14:10,466 INFO L82 PathProgramCache]: Analyzing trace with hash -832613802, now seen corresponding path program 2 times [2018-04-10 16:14:10,466 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:10,466 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:10,466 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:10,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:14:10,466 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:10,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:10,478 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:10,616 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-10 16:14:10,616 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:10,616 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:10,617 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:14:10,637 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:14:10,637 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:14:10,640 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:14:10,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:14:10,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:10,678 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-10 16:14:10,678 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-04-10 16:14:11,025 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-10 16:14:11,025 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:14:11,025 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2018-04-10 16:14:11,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-10 16:14:11,026 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-10 16:14:11,026 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=255, Unknown=1, NotChecked=0, Total=306 [2018-04-10 16:14:11,026 INFO L87 Difference]: Start difference. First operand 209 states and 226 transitions. Second operand 18 states. [2018-04-10 16:14:11,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:11,289 INFO L93 Difference]: Finished difference Result 210 states and 227 transitions. [2018-04-10 16:14:11,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 16:14:11,290 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 99 [2018-04-10 16:14:11,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:11,291 INFO L225 Difference]: With dead ends: 210 [2018-04-10 16:14:11,291 INFO L226 Difference]: Without dead ends: 210 [2018-04-10 16:14:11,291 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=485, Unknown=1, NotChecked=0, Total=600 [2018-04-10 16:14:11,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-04-10 16:14:11,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 207. [2018-04-10 16:14:11,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-04-10 16:14:11,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 224 transitions. [2018-04-10 16:14:11,297 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 224 transitions. Word has length 99 [2018-04-10 16:14:11,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:11,297 INFO L459 AbstractCegarLoop]: Abstraction has 207 states and 224 transitions. [2018-04-10 16:14:11,297 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-10 16:14:11,298 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 224 transitions. [2018-04-10 16:14:11,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-04-10 16:14:11,298 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:11,298 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-10 16:14:11,299 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-10 16:14:11,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1370708101, now seen corresponding path program 2 times [2018-04-10 16:14:11,299 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:11,299 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:11,299 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:11,300 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:14:11,300 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:11,313 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:11,466 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-10 16:14:11,466 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:11,467 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:11,467 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:14:11,487 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:14:11,487 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:14:11,490 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:14:11,542 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-10 16:14:11,543 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:14:11,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 15 [2018-04-10 16:14:11,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-10 16:14:11,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-10 16:14:11,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-04-10 16:14:11,543 INFO L87 Difference]: Start difference. First operand 207 states and 224 transitions. Second operand 15 states. [2018-04-10 16:14:11,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:11,886 INFO L93 Difference]: Finished difference Result 243 states and 258 transitions. [2018-04-10 16:14:11,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-10 16:14:11,886 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 103 [2018-04-10 16:14:11,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:11,887 INFO L225 Difference]: With dead ends: 243 [2018-04-10 16:14:11,887 INFO L226 Difference]: Without dead ends: 201 [2018-04-10 16:14:11,888 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=599, Unknown=0, NotChecked=0, Total=756 [2018-04-10 16:14:11,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-04-10 16:14:11,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 193. [2018-04-10 16:14:11,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-04-10 16:14:11,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 205 transitions. [2018-04-10 16:14:11,892 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 205 transitions. Word has length 103 [2018-04-10 16:14:11,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:11,893 INFO L459 AbstractCegarLoop]: Abstraction has 193 states and 205 transitions. [2018-04-10 16:14:11,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-10 16:14:11,893 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 205 transitions. [2018-04-10 16:14:11,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-04-10 16:14:11,894 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:11,894 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-10 16:14:11,894 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-10 16:14:11,894 INFO L82 PathProgramCache]: Analyzing trace with hash -52037211, now seen corresponding path program 3 times [2018-04-10 16:14:11,894 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:11,894 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:11,895 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:11,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:14:11,895 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:11,905 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:12,050 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-10 16:14:12,050 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:12,050 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:12,051 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 16:14:12,080 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-10 16:14:12,080 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:14:12,084 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:14:12,175 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-10 16:14:12,175 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:14:12,175 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2018-04-10 16:14:12,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-10 16:14:12,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-10 16:14:12,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-04-10 16:14:12,176 INFO L87 Difference]: Start difference. First operand 193 states and 205 transitions. Second operand 19 states. [2018-04-10 16:14:12,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:12,445 INFO L93 Difference]: Finished difference Result 232 states and 245 transitions. [2018-04-10 16:14:12,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-10 16:14:12,445 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 109 [2018-04-10 16:14:12,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:12,446 INFO L225 Difference]: With dead ends: 232 [2018-04-10 16:14:12,446 INFO L226 Difference]: Without dead ends: 201 [2018-04-10 16:14:12,446 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-10 16:14:12,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-04-10 16:14:12,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2018-04-10 16:14:12,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-04-10 16:14:12,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 210 transitions. [2018-04-10 16:14:12,450 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 210 transitions. Word has length 109 [2018-04-10 16:14:12,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:12,451 INFO L459 AbstractCegarLoop]: Abstraction has 198 states and 210 transitions. [2018-04-10 16:14:12,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-10 16:14:12,451 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 210 transitions. [2018-04-10 16:14:12,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-04-10 16:14:12,451 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:12,451 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-10 16:14:12,452 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-10 16:14:12,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1577506560, now seen corresponding path program 4 times [2018-04-10 16:14:12,452 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:12,452 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:12,452 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:12,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:14:12,452 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:12,469 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:12,481 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:14:12,481 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:12,482 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:12,482 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 16:14:12,519 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 16:14:12,519 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:14:12,522 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:14:12,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:12,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:12,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:12,574 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:14:12,587 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-10 16:14:12,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:12,589 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:12,591 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-10 16:14:12,591 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-10 16:14:12,600 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-10 16:14:12,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-10 16:14:12,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:12,655 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-10 16:14:12,655 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-10 16:14:12,657 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-10 16:14:12,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 17 [2018-04-10 16:14:12,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 16:14:12,677 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-10 16:14:12,677 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:58 [2018-04-10 16:14:12,737 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:12,737 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:12,738 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-10 16:14:12,738 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:12,753 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-10 16:14:12,753 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:68, output treesize:30 [2018-04-10 16:14:12,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:12,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:12,793 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-10 16:14:12,793 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-10 16:14:12,816 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-10 16:14:12,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:12,821 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:12,825 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-10 16:14:12,825 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-10 16:14:12,827 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-10 16:14:12,847 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-10 16:14:12,848 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-10 16:14:12,875 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-10 16:14:12,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:50, output treesize:136 [2018-04-10 16:14:13,068 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-10 16:14:13,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:13,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:13,082 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-10 16:14:13,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:13,083 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-10 16:14:13,083 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-04-10 16:14:13,094 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-10 16:14:13,100 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:13,102 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:13,103 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:13,103 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-10 16:14:13,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:13,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-10 16:14:13,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:14:13,149 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-10 16:14:13,149 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:56, output treesize:86 [2018-04-10 16:14:13,223 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-10 16:14:13,223 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:14:13,223 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-10 16:14:13,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-10 16:14:13,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-10 16:14:13,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=144, Unknown=7, NotChecked=210, Total=420 [2018-04-10 16:14:13,224 INFO L87 Difference]: Start difference. First operand 198 states and 210 transitions. Second operand 21 states. [2018-04-10 16:14:13,292 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-10 16:14:13,294 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-10 16:14:13,316 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-10 16:14:13,319 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-10 16:14:13,321 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-10 16:14:13,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:13,570 INFO L93 Difference]: Finished difference Result 220 states and 235 transitions. [2018-04-10 16:14:13,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-10 16:14:13,570 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 114 [2018-04-10 16:14:13,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:13,571 INFO L225 Difference]: With dead ends: 220 [2018-04-10 16:14:13,571 INFO L226 Difference]: Without dead ends: 220 [2018-04-10 16:14:13,571 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=12, NotChecked=516, Total=870 [2018-04-10 16:14:13,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-04-10 16:14:13,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 200. [2018-04-10 16:14:13,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-04-10 16:14:13,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 212 transitions. [2018-04-10 16:14:13,574 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 212 transitions. Word has length 114 [2018-04-10 16:14:13,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:13,575 INFO L459 AbstractCegarLoop]: Abstraction has 200 states and 212 transitions. [2018-04-10 16:14:13,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-10 16:14:13,575 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 212 transitions. [2018-04-10 16:14:13,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-04-10 16:14:13,575 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:13,576 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-10 16:14:13,576 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-10 16:14:13,576 INFO L82 PathProgramCache]: Analyzing trace with hash 33708323, now seen corresponding path program 2 times [2018-04-10 16:14:13,576 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:13,576 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:13,577 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:13,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:14:13,577 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:13,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:13,594 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:13,606 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:14:13,606 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:13,607 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:13,607 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:14:13,628 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:14:13,628 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:14:13,632 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:14:13,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:13,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:13,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:13,638 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:14:13,654 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-10 16:14:13,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:13,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:13,659 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-10 16:14:13,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-10 16:14:13,671 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-10 16:14:13,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:14:13,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:13,682 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-10 16:14:13,682 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-10 16:14:13,684 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-10 16:14:13,696 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-10 16:14:13,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 16:14:13,715 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-10 16:14:13,716 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:58 [2018-04-10 16:14:13,761 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 16:14:13,762 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:13,769 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:13,770 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:13,770 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-10 16:14:13,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:13,775 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-10 16:14:13,775 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:54, output treesize:23 [2018-04-10 16:14:13,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:13,848 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:13,856 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-10 16:14:13,856 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-10 16:14:13,866 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-10 16:14:13,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:13,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:13,876 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-10 16:14:13,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-10 16:14:13,879 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-10 16:14:13,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-10 16:14:13,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-10 16:14:13,925 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-10 16:14:13,926 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-04-10 16:14:14,054 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-10 16:14:14,062 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-10 16:14:14,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:14,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:14:14,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:14,066 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-10 16:14:14,066 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-04-10 16:14:14,079 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-10 16:14:14,086 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:14,086 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:14,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-10 16:14:14,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 16:14:14,124 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:14,124 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:14,126 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:14,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 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-10 16:14:14,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:14,142 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-10 16:14:14,142 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:49, output treesize:72 [2018-04-10 16:14:14,203 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-10 16:14:14,203 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:14:14,203 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-10 16:14:14,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-10 16:14:14,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-10 16:14:14,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=144, Unknown=7, NotChecked=210, Total=420 [2018-04-10 16:14:14,204 INFO L87 Difference]: Start difference. First operand 200 states and 212 transitions. Second operand 21 states. [2018-04-10 16:14:14,263 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-10 16:14:14,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 (= 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-10 16:14:14,283 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-10 16:14:14,285 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-10 16:14:14,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:14,525 INFO L93 Difference]: Finished difference Result 221 states and 236 transitions. [2018-04-10 16:14:14,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-10 16:14:14,525 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 114 [2018-04-10 16:14:14,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:14,526 INFO L225 Difference]: With dead ends: 221 [2018-04-10 16:14:14,526 INFO L226 Difference]: Without dead ends: 221 [2018-04-10 16:14:14,526 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-10 16:14:14,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-04-10 16:14:14,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 211. [2018-04-10 16:14:14,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-04-10 16:14:14,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 225 transitions. [2018-04-10 16:14:14,531 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 225 transitions. Word has length 114 [2018-04-10 16:14:14,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:14,532 INFO L459 AbstractCegarLoop]: Abstraction has 211 states and 225 transitions. [2018-04-10 16:14:14,532 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-10 16:14:14,532 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 225 transitions. [2018-04-10 16:14:14,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-04-10 16:14:14,533 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:14,533 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-10 16:14:14,533 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-10 16:14:14,533 INFO L82 PathProgramCache]: Analyzing trace with hash -308556470, now seen corresponding path program 1 times [2018-04-10 16:14:14,533 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:14,533 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:14,534 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:14,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:14:14,534 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:14,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:14,547 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:14,602 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-10 16:14:14,603 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:14,603 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:14,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:14,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:14,622 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:14:14,654 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-10 16:14:14,654 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:14:14,654 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-04-10 16:14:14,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 16:14:14,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 16:14:14,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-04-10 16:14:14,655 INFO L87 Difference]: Start difference. First operand 211 states and 225 transitions. Second operand 7 states. [2018-04-10 16:14:14,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:14,706 INFO L93 Difference]: Finished difference Result 221 states and 237 transitions. [2018-04-10 16:14:14,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 16:14:14,706 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 122 [2018-04-10 16:14:14,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:14,707 INFO L225 Difference]: With dead ends: 221 [2018-04-10 16:14:14,707 INFO L226 Difference]: Without dead ends: 221 [2018-04-10 16:14:14,707 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-10 16:14:14,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-04-10 16:14:14,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 210. [2018-04-10 16:14:14,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-04-10 16:14:14,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 222 transitions. [2018-04-10 16:14:14,712 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 222 transitions. Word has length 122 [2018-04-10 16:14:14,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:14,713 INFO L459 AbstractCegarLoop]: Abstraction has 210 states and 222 transitions. [2018-04-10 16:14:14,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 16:14:14,713 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 222 transitions. [2018-04-10 16:14:14,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-04-10 16:14:14,714 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:14,714 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-10 16:14:14,714 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-10 16:14:14,714 INFO L82 PathProgramCache]: Analyzing trace with hash 737215377, now seen corresponding path program 2 times [2018-04-10 16:14:14,714 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:14,714 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:14,715 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:14,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:14,715 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:14,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:14,729 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:14,739 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:14:14,739 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:14,739 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:14,740 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:14:14,764 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:14:14,764 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:14:14,768 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:14:14,777 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-10 16:14:14,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:14,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:14,780 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-04-10 16:14:14,832 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:14,833 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-10 16:14:14,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:14,847 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:14,848 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:14,849 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-10 16:14:14,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:14,861 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-10 16:14:14,861 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:41, output treesize:38 [2018-04-10 16:14:14,908 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-10 16:14:14,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:14,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-10 16:14:14,917 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:31 [2018-04-10 16:14:14,983 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-10 16:14:14,983 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:14:14,984 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-10 16:14:14,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-10 16:14:14,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-10 16:14:14,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-04-10 16:14:14,984 INFO L87 Difference]: Start difference. First operand 210 states and 222 transitions. Second operand 13 states. [2018-04-10 16:14:15,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:15,359 INFO L93 Difference]: Finished difference Result 217 states and 229 transitions. [2018-04-10 16:14:15,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-10 16:14:15,359 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 131 [2018-04-10 16:14:15,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:15,360 INFO L225 Difference]: With dead ends: 217 [2018-04-10 16:14:15,360 INFO L226 Difference]: Without dead ends: 217 [2018-04-10 16:14:15,360 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-10 16:14:15,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-04-10 16:14:15,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 167. [2018-04-10 16:14:15,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-04-10 16:14:15,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 173 transitions. [2018-04-10 16:14:15,362 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 173 transitions. Word has length 131 [2018-04-10 16:14:15,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:15,362 INFO L459 AbstractCegarLoop]: Abstraction has 167 states and 173 transitions. [2018-04-10 16:14:15,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-10 16:14:15,363 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 173 transitions. [2018-04-10 16:14:15,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-04-10 16:14:15,363 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:15,363 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-10 16:14:15,364 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-10 16:14:15,364 INFO L82 PathProgramCache]: Analyzing trace with hash 900449447, now seen corresponding path program 3 times [2018-04-10 16:14:15,364 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:15,364 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:15,364 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:15,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:14:15,365 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:15,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:15,381 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:15,387 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:14:15,387 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:15,387 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:15,388 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 16:14:15,400 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-04-10 16:14:15,400 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:14:15,404 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:14:15,469 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:15,470 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-10 16:14:15,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:15,484 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:15,485 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:15,486 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-10 16:14:15,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:15,497 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-10 16:14:15,497 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:46, output treesize:43 [2018-04-10 16:14:15,532 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-10 16:14:15,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:15,557 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-10 16:14:15,557 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:33 [2018-04-10 16:14:15,641 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-10 16:14:15,641 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:14:15,641 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-10 16:14:15,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-10 16:14:15,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-10 16:14:15,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-04-10 16:14:15,641 INFO L87 Difference]: Start difference. First operand 167 states and 173 transitions. Second operand 12 states. [2018-04-10 16:14:15,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:15,971 INFO L93 Difference]: Finished difference Result 170 states and 176 transitions. [2018-04-10 16:14:15,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-10 16:14:15,971 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 137 [2018-04-10 16:14:15,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:15,972 INFO L225 Difference]: With dead ends: 170 [2018-04-10 16:14:15,972 INFO L226 Difference]: Without dead ends: 170 [2018-04-10 16:14:15,972 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-10 16:14:15,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-04-10 16:14:15,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 165. [2018-04-10 16:14:15,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-04-10 16:14:15,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 171 transitions. [2018-04-10 16:14:15,974 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 171 transitions. Word has length 137 [2018-04-10 16:14:15,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:15,974 INFO L459 AbstractCegarLoop]: Abstraction has 165 states and 171 transitions. [2018-04-10 16:14:15,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-10 16:14:15,974 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 171 transitions. [2018-04-10 16:14:15,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-04-10 16:14:15,974 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:15,975 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-10 16:14:15,975 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-10 16:14:15,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1558726796, now seen corresponding path program 5 times [2018-04-10 16:14:15,975 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:15,975 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:15,975 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:15,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:14:15,975 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:15,986 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:16,202 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-10 16:14:16,203 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:16,203 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:16,203 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 16:14:16,294 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-04-10 16:14:16,294 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:14:16,301 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:14:16,398 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-10 16:14:16,399 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:14:16,399 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 20 [2018-04-10 16:14:16,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-10 16:14:16,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-10 16:14:16,399 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2018-04-10 16:14:16,400 INFO L87 Difference]: Start difference. First operand 165 states and 171 transitions. Second operand 20 states. [2018-04-10 16:14:16,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:16,818 INFO L93 Difference]: Finished difference Result 184 states and 192 transitions. [2018-04-10 16:14:16,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-10 16:14:16,818 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 161 [2018-04-10 16:14:16,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:16,819 INFO L225 Difference]: With dead ends: 184 [2018-04-10 16:14:16,819 INFO L226 Difference]: Without dead ends: 175 [2018-04-10 16:14:16,819 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-10 16:14:16,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-04-10 16:14:16,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2018-04-10 16:14:16,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-04-10 16:14:16,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 177 transitions. [2018-04-10 16:14:16,823 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 177 transitions. Word has length 161 [2018-04-10 16:14:16,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:16,823 INFO L459 AbstractCegarLoop]: Abstraction has 171 states and 177 transitions. [2018-04-10 16:14:16,823 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-10 16:14:16,823 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 177 transitions. [2018-04-10 16:14:16,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-04-10 16:14:16,824 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:16,825 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-10 16:14:16,825 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-10 16:14:16,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1880915746, now seen corresponding path program 6 times [2018-04-10 16:14:16,825 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:16,825 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:16,825 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:16,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:14:16,826 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:16,837 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:17,077 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-10 16:14:17,077 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:17,077 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:17,078 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 16:14:17,129 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-04-10 16:14:17,129 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:14:17,134 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:14:17,246 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-10 16:14:17,246 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:14:17,247 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 21 [2018-04-10 16:14:17,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-10 16:14:17,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-10 16:14:17,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2018-04-10 16:14:17,248 INFO L87 Difference]: Start difference. First operand 171 states and 177 transitions. Second operand 21 states. [2018-04-10 16:14:17,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:17,557 INFO L93 Difference]: Finished difference Result 182 states and 189 transitions. [2018-04-10 16:14:17,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-10 16:14:17,557 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 167 [2018-04-10 16:14:17,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:17,558 INFO L225 Difference]: With dead ends: 182 [2018-04-10 16:14:17,558 INFO L226 Difference]: Without dead ends: 182 [2018-04-10 16:14:17,558 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-10 16:14:17,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-04-10 16:14:17,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 179. [2018-04-10 16:14:17,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-04-10 16:14:17,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 186 transitions. [2018-04-10 16:14:17,560 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 186 transitions. Word has length 167 [2018-04-10 16:14:17,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:17,561 INFO L459 AbstractCegarLoop]: Abstraction has 179 states and 186 transitions. [2018-04-10 16:14:17,561 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-10 16:14:17,561 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 186 transitions. [2018-04-10 16:14:17,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-04-10 16:14:17,561 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:17,561 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-10 16:14:17,561 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-10 16:14:17,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1181300643, now seen corresponding path program 7 times [2018-04-10 16:14:17,562 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:17,562 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:17,562 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:17,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:14:17,562 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:17,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:17,574 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:17,577 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:14:17,577 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:17,577 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:17,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:17,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:17,605 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:14:17,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:17,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:17,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:17,616 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:14:17,632 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-10 16:14:17,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:17,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:17,636 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-10 16:14:17,637 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-10 16:14:17,649 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-10 16:14:17,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:17,653 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:17,662 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-10 16:14:17,662 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-10 16:14:17,665 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-10 16:14:17,678 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-10 16:14:17,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 16:14:17,696 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-10 16:14:17,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:58 [2018-04-10 16:14:17,757 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:17,758 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:17,759 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-10 16:14:17,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:17,770 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-10 16:14:17,771 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:23 [2018-04-10 16:14:17,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:17,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:17,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:14:17,804 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-10 16:14:17,815 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-10 16:14:17,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:17,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:17,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-10 16:14:17,822 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-10 16:14:17,824 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-10 16:14:17,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 21 treesize of output 32 [2018-04-10 16:14:17,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-10 16:14:17,862 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-10 16:14:17,862 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-04-10 16:14:17,924 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 16:14:17,925 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:17,933 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:17,934 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:17,935 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-10 16:14:17,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:17,941 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-10 16:14:17,941 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:69, output treesize:23 [2018-04-10 16:14:17,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:14:17,985 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:17,987 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-10 16:14:17,987 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-10 16:14:18,005 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-10 16:14:18,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:18,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:18,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-10 16:14:18,013 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-10 16:14:18,016 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-10 16:14:18,045 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-10 16:14:18,045 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-10 16:14:18,080 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-10 16:14:18,080 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-04-10 16:14:18,214 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-10 16:14:18,221 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-10 16:14:18,222 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:18,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:18,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:18,225 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-10 16:14:18,225 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-04-10 16:14:18,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 (= 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-10 16:14:18,242 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:18,243 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:18,243 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-10 16:14:18,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:18,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-10 16:14:18,266 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:14:18,290 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-10 16:14:18,291 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:60, output treesize:86 [2018-04-10 16:14:18,415 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-10 16:14:18,415 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:14:18,415 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-10 16:14:18,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-10 16:14:18,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-10 16:14:18,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=193, Unknown=9, NotChecked=324, Total=600 [2018-04-10 16:14:18,416 INFO L87 Difference]: Start difference. First operand 179 states and 186 transitions. Second operand 25 states. [2018-04-10 16:14:18,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 (= 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-10 16:14:18,484 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-10 16:14:18,502 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-10 16:14:18,505 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-10 16:14:18,507 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-10 16:14:18,763 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-10 16:14:18,766 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-10 16:14:18,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:18,968 INFO L93 Difference]: Finished difference Result 210 states and 222 transitions. [2018-04-10 16:14:18,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-10 16:14:18,969 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 172 [2018-04-10 16:14:18,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:18,969 INFO L225 Difference]: With dead ends: 210 [2018-04-10 16:14:18,969 INFO L226 Difference]: Without dead ends: 210 [2018-04-10 16:14:18,970 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-10 16:14:18,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-04-10 16:14:18,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 192. [2018-04-10 16:14:18,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-04-10 16:14:18,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 201 transitions. [2018-04-10 16:14:18,972 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 201 transitions. Word has length 172 [2018-04-10 16:14:18,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:18,973 INFO L459 AbstractCegarLoop]: Abstraction has 192 states and 201 transitions. [2018-04-10 16:14:18,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-10 16:14:18,973 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 201 transitions. [2018-04-10 16:14:18,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-04-10 16:14:18,973 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:18,973 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-10 16:14:18,973 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-10 16:14:18,974 INFO L82 PathProgramCache]: Analyzing trace with hash -2055653370, now seen corresponding path program 8 times [2018-04-10 16:14:18,974 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:18,974 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:18,974 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:18,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:18,974 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:18,986 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:18,991 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:14:18,992 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:18,992 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:18,992 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:14:19,012 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:14:19,012 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:14:19,016 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:14:19,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 6 treesize of output 5 [2018-04-10 16:14:19,019 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:19,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:19,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:14:19,032 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-10 16:14:19,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-10 16:14:19,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:19,036 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-10 16:14:19,036 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-10 16:14:19,044 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-10 16:14:19,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:14:19,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:19,051 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-10 16:14:19,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-10 16:14:19,053 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-10 16:14:19,062 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-10 16:14:19,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 16:14:19,100 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-10 16:14:19,100 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:58 [2018-04-10 16:14:19,148 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 16:14:19,148 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:19,160 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:19,161 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:19,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, 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-10 16:14:19,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:19,170 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-10 16:14:19,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:54, output treesize:23 [2018-04-10 16:14:19,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-10 16:14:19,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:19,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-10 16:14:19,212 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-10 16:14:19,225 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-10 16:14:19,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:19,229 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:19,234 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-10 16:14:19,234 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-10 16:14:19,236 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-10 16:14:19,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-10 16:14:19,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-10 16:14:19,293 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-10 16:14:19,293 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-04-10 16:14:19,366 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 16:14:19,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:19,377 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:19,377 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:19,378 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-10 16:14:19,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:19,386 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-10 16:14:19,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:76, output treesize:34 [2018-04-10 16:14:19,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:14:19,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:19,421 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-10 16:14:19,421 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-10 16:14:19,431 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-10 16:14:19,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-10 16:14:19,434 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:19,438 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-10 16:14:19,438 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-10 16:14:19,440 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-10 16:14:19,455 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-10 16:14:19,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-10 16:14:19,485 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-10 16:14:19,485 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-04-10 16:14:19,622 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-10 16:14:19,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-10 16:14:19,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:19,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-10 16:14:19,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:19,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-10 16:14:19,643 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-04-10 16:14:19,653 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-10 16:14:19,665 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:19,666 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:19,668 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:19,669 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-10 16:14:19,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:19,700 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-10 16:14:19,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:14:19,723 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-10 16:14:19,723 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:56, output treesize:86 [2018-04-10 16:14:19,816 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-10 16:14:19,816 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:14:19,816 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-10 16:14:19,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-10 16:14:19,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-10 16:14:19,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=193, Unknown=9, NotChecked=324, Total=600 [2018-04-10 16:14:19,817 INFO L87 Difference]: Start difference. First operand 192 states and 201 transitions. Second operand 25 states. [2018-04-10 16:14:19,852 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-10 16:14:19,855 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-10 16:14:19,867 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-10 16:14:19,871 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-10 16:14:19,873 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)))))) is different from true [2018-04-10 16:14:20,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:20,194 INFO L93 Difference]: Finished difference Result 213 states and 227 transitions. [2018-04-10 16:14:20,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-10 16:14:20,195 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 172 [2018-04-10 16:14:20,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:20,196 INFO L225 Difference]: With dead ends: 213 [2018-04-10 16:14:20,196 INFO L226 Difference]: Without dead ends: 213 [2018-04-10 16:14:20,196 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 144 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=364, Unknown=14, NotChecked=742, Total=1260 [2018-04-10 16:14:20,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-04-10 16:14:20,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 184. [2018-04-10 16:14:20,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-04-10 16:14:20,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 193 transitions. [2018-04-10 16:14:20,200 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 193 transitions. Word has length 172 [2018-04-10 16:14:20,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:20,201 INFO L459 AbstractCegarLoop]: Abstraction has 184 states and 193 transitions. [2018-04-10 16:14:20,201 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-10 16:14:20,201 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 193 transitions. [2018-04-10 16:14:20,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-04-10 16:14:20,202 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:20,202 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-10 16:14:20,202 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-10 16:14:20,202 INFO L82 PathProgramCache]: Analyzing trace with hash -362497594, now seen corresponding path program 9 times [2018-04-10 16:14:20,202 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:20,202 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:20,203 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:20,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:14:20,203 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:20,221 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:20,225 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:14:20,225 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:20,225 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:20,225 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 16:14:20,259 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-10 16:14:20,259 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:14:20,263 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:14:20,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 6 treesize of output 5 [2018-04-10 16:14:20,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:20,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:20,267 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:14:20,278 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-10 16:14:20,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:20,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:20,281 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-10 16:14:20,282 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-10 16:14:20,290 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-10 16:14:20,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-10 16:14:20,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:20,297 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-10 16:14:20,297 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-10 16:14:20,299 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-10 16:14:20,308 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-10 16:14:20,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 16:14:20,320 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-10 16:14:20,320 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:58 [2018-04-10 16:14:20,357 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:20,358 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:20,358 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-10 16:14:20,358 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:20,401 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-10 16:14:20,401 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:23 [2018-04-10 16:14:20,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:20,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:20,447 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-10 16:14:20,447 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-10 16:14:20,461 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-10 16:14:20,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:20,466 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:20,472 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-10 16:14:20,472 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-10 16:14:20,475 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-10 16:14:20,495 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-10 16:14:20,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-10 16:14:20,533 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-10 16:14:20,533 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-04-10 16:14:20,715 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:20,715 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-10 16:14:20,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:20,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:14:20,720 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:20,723 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-10 16:14:20,723 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:20, output treesize:13 [2018-04-10 16:14:20,755 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-10 16:14:20,759 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:20,767 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-10 16:14:20,767 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 16:14:20,793 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:20,794 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:20,796 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:20,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2018-04-10 16:14:20,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:20,816 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-10 16:14:20,816 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:52, output treesize:71 [2018-04-10 16:14:20,876 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-10 16:14:20,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:14:20,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:20,889 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-10 16:14:20,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:20,890 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-10 16:14:20,891 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-04-10 16:14:20,913 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-10 16:14:20,918 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:20,919 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:20,920 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-10 16:14:20,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:20,940 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-10 16:14:20,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:14:20,960 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-10 16:14:20,960 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:60, output treesize:86 [2018-04-10 16:14:21,055 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-10 16:14:21,055 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:14:21,055 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-10 16:14:21,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-10 16:14:21,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-10 16:14:21,056 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=247, Unknown=8, NotChecked=312, Total=650 [2018-04-10 16:14:21,056 INFO L87 Difference]: Start difference. First operand 184 states and 193 transitions. Second operand 26 states. [2018-04-10 16:14:21,221 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-10 16:14:21,224 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-10 16:14:21,432 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-10 16:14:21,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:21,618 INFO L93 Difference]: Finished difference Result 213 states and 227 transitions. [2018-04-10 16:14:21,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-10 16:14:21,619 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 172 [2018-04-10 16:14:21,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:21,619 INFO L225 Difference]: With dead ends: 213 [2018-04-10 16:14:21,619 INFO L226 Difference]: Without dead ends: 213 [2018-04-10 16:14:21,620 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 143 SyntacticMatches, 7 SemanticMatches, 36 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=175, Invalid=560, Unknown=11, NotChecked=660, Total=1406 [2018-04-10 16:14:21,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-04-10 16:14:21,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 193. [2018-04-10 16:14:21,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-04-10 16:14:21,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 204 transitions. [2018-04-10 16:14:21,622 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 204 transitions. Word has length 172 [2018-04-10 16:14:21,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:21,622 INFO L459 AbstractCegarLoop]: Abstraction has 193 states and 204 transitions. [2018-04-10 16:14:21,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-10 16:14:21,622 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 204 transitions. [2018-04-10 16:14:21,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-04-10 16:14:21,623 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:21,623 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-10 16:14:21,623 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-10 16:14:21,623 INFO L82 PathProgramCache]: Analyzing trace with hash 695515689, now seen corresponding path program 3 times [2018-04-10 16:14:21,623 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:21,623 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:21,624 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:21,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:14:21,624 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:21,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:21,636 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:21,641 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:14:21,641 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:21,641 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:21,642 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 16:14:21,709 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-10 16:14:21,710 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:14:21,717 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:14:21,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:14:21,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:21,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:21,723 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:14:21,733 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-10 16:14:21,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 8 treesize of output 7 [2018-04-10 16:14:21,736 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:21,737 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-10 16:14:21,737 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-10 16:14:21,750 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-10 16:14:21,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:14:21,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:21,772 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-10 16:14:21,772 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-10 16:14:21,775 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-10 16:14:21,787 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-10 16:14:21,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 16:14:21,802 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-10 16:14:21,802 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:29, output treesize:52 [2018-04-10 16:14:21,841 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 16:14:21,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:21,849 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:21,850 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:21,851 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-10 16:14:21,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:21,856 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-10 16:14:21,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:48, output treesize:20 [2018-04-10 16:14:21,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:21,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:21,876 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-10 16:14:21,876 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-10 16:14:21,896 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-10 16:14:21,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:21,900 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:21,905 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-10 16:14:21,905 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-10 16:14:21,908 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-10 16:14:21,928 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-10 16:14:21,928 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-10 16:14:21,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-10 16:14:21,962 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:40, output treesize:106 [2018-04-10 16:14:22,100 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:22,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-04-10 16:14:22,101 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:22,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:22,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:22,112 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-10 16:14:22,112 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:20, output treesize:13 [2018-04-10 16:14:22,140 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-10 16:14:22,146 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:22,157 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:22,158 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-10 16:14:22,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:22,171 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:22,172 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:22,180 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-10 16:14:22,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:14:22,200 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-10 16:14:22,201 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:49, output treesize:65 [2018-04-10 16:14:22,397 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-10 16:14:22,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:22,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 8 treesize of output 7 [2018-04-10 16:14:22,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:22,400 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-10 16:14:22,400 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-04-10 16:14:22,431 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:22,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, 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-10 16:14:22,438 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 16:14:22,465 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:22,466 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:22,467 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:22,467 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-10 16:14:22,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:22,486 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-10 16:14:22,486 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:58, output treesize:82 [2018-04-10 16:14:22,594 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-10 16:14:22,595 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:14:22,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-10 16:14:22,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-10 16:14:22,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-10 16:14:22,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=375, Unknown=6, NotChecked=270, Total=756 [2018-04-10 16:14:22,595 INFO L87 Difference]: Start difference. First operand 193 states and 204 transitions. Second operand 28 states. [2018-04-10 16:14:23,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:23,972 INFO L93 Difference]: Finished difference Result 268 states and 298 transitions. [2018-04-10 16:14:23,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-10 16:14:23,972 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 172 [2018-04-10 16:14:23,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:23,974 INFO L225 Difference]: With dead ends: 268 [2018-04-10 16:14:23,974 INFO L226 Difference]: Without dead ends: 268 [2018-04-10 16:14:23,974 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 143 SyntacticMatches, 10 SemanticMatches, 52 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 838 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=376, Invalid=1896, Unknown=8, NotChecked=582, Total=2862 [2018-04-10 16:14:23,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-04-10 16:14:23,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 228. [2018-04-10 16:14:23,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-04-10 16:14:23,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 258 transitions. [2018-04-10 16:14:23,980 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 258 transitions. Word has length 172 [2018-04-10 16:14:23,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:23,980 INFO L459 AbstractCegarLoop]: Abstraction has 228 states and 258 transitions. [2018-04-10 16:14:23,980 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-10 16:14:23,980 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 258 transitions. [2018-04-10 16:14:23,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-04-10 16:14:23,981 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:23,981 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-10 16:14:23,981 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-10 16:14:23,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1312648301, now seen corresponding path program 4 times [2018-04-10 16:14:23,982 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:23,982 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:23,982 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:23,982 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:14:23,982 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:23,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:23,997 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:24,276 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-10 16:14:24,276 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:24,276 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:24,277 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 16:14:24,296 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 16:14:24,296 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:14:24,300 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:14:24,459 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-10 16:14:24,459 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:14:24,459 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 26 [2018-04-10 16:14:24,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-10 16:14:24,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-10 16:14:24,460 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2018-04-10 16:14:24,461 INFO L87 Difference]: Start difference. First operand 228 states and 258 transitions. Second operand 26 states. [2018-04-10 16:14:24,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:24,950 INFO L93 Difference]: Finished difference Result 259 states and 287 transitions. [2018-04-10 16:14:24,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-10 16:14:24,950 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 178 [2018-04-10 16:14:24,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:24,951 INFO L225 Difference]: With dead ends: 259 [2018-04-10 16:14:24,951 INFO L226 Difference]: Without dead ends: 249 [2018-04-10 16:14:24,951 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=232, Invalid=1408, Unknown=0, NotChecked=0, Total=1640 [2018-04-10 16:14:24,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-04-10 16:14:24,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 236. [2018-04-10 16:14:24,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-04-10 16:14:24,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 264 transitions. [2018-04-10 16:14:24,957 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 264 transitions. Word has length 178 [2018-04-10 16:14:24,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:24,957 INFO L459 AbstractCegarLoop]: Abstraction has 236 states and 264 transitions. [2018-04-10 16:14:24,957 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-10 16:14:24,957 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 264 transitions. [2018-04-10 16:14:24,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-04-10 16:14:24,958 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:24,958 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-10 16:14:24,959 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-10 16:14:24,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1697700589, now seen corresponding path program 2 times [2018-04-10 16:14:24,959 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:24,959 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:24,959 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:24,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:14:24,960 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:24,972 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:25,018 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-10 16:14:25,018 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:25,018 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:25,018 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:14:25,034 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:14:25,034 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:14:25,038 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:14:25,091 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-10 16:14:25,091 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:14:25,091 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-04-10 16:14:25,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 16:14:25,092 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 16:14:25,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:14:25,092 INFO L87 Difference]: Start difference. First operand 236 states and 264 transitions. Second operand 8 states. [2018-04-10 16:14:25,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:25,125 INFO L93 Difference]: Finished difference Result 272 states and 314 transitions. [2018-04-10 16:14:25,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 16:14:25,126 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 180 [2018-04-10 16:14:25,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:25,127 INFO L225 Difference]: With dead ends: 272 [2018-04-10 16:14:25,127 INFO L226 Difference]: Without dead ends: 272 [2018-04-10 16:14:25,127 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-10 16:14:25,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-04-10 16:14:25,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 252. [2018-04-10 16:14:25,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-04-10 16:14:25,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 280 transitions. [2018-04-10 16:14:25,131 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 280 transitions. Word has length 180 [2018-04-10 16:14:25,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:25,131 INFO L459 AbstractCegarLoop]: Abstraction has 252 states and 280 transitions. [2018-04-10 16:14:25,132 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 16:14:25,132 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 280 transitions. [2018-04-10 16:14:25,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-04-10 16:14:25,133 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:25,133 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-10 16:14:25,133 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-10 16:14:25,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1624569478, now seen corresponding path program 10 times [2018-04-10 16:14:25,134 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:25,134 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:25,134 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:25,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:14:25,134 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:25,149 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:25,365 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-10 16:14:25,365 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:25,365 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:25,366 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 16:14:25,381 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 16:14:25,381 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:14:25,385 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:14:25,463 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-10 16:14:25,463 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:14:25,464 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 21 [2018-04-10 16:14:25,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-10 16:14:25,464 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-10 16:14:25,464 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2018-04-10 16:14:25,464 INFO L87 Difference]: Start difference. First operand 252 states and 280 transitions. Second operand 21 states. [2018-04-10 16:14:25,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:25,921 INFO L93 Difference]: Finished difference Result 252 states and 274 transitions. [2018-04-10 16:14:25,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-10 16:14:25,921 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 230 [2018-04-10 16:14:25,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:25,922 INFO L225 Difference]: With dead ends: 252 [2018-04-10 16:14:25,922 INFO L226 Difference]: Without dead ends: 252 [2018-04-10 16:14:25,923 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=338, Invalid=1384, Unknown=0, NotChecked=0, Total=1722 [2018-04-10 16:14:25,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-04-10 16:14:25,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 209. [2018-04-10 16:14:25,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-04-10 16:14:25,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 221 transitions. [2018-04-10 16:14:25,939 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 221 transitions. Word has length 230 [2018-04-10 16:14:25,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:25,940 INFO L459 AbstractCegarLoop]: Abstraction has 209 states and 221 transitions. [2018-04-10 16:14:25,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-10 16:14:25,940 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 221 transitions. [2018-04-10 16:14:25,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-04-10 16:14:25,941 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:25,941 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-10 16:14:25,941 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-10 16:14:25,941 INFO L82 PathProgramCache]: Analyzing trace with hash 184031125, now seen corresponding path program 11 times [2018-04-10 16:14:25,942 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:25,942 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:25,942 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:25,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:14:25,942 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:25,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:25,973 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:25,989 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:14:25,989 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:25,989 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:25,990 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 16:14:26,196 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-04-10 16:14:26,197 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:14:26,219 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:14:26,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:26,222 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:26,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:26,225 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:14:26,240 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-10 16:14:26,240 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:26,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:26,244 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:12 [2018-04-10 16:14:26,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:14:26,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:26,270 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-10 16:14:26,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-10 16:14:26,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:26,288 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:26,291 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-10 16:14:26,291 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:17 [2018-04-10 16:14:26,302 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:26,306 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-10 16:14:26,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 16:14:26,317 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-10 16:14:26,318 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:44 [2018-04-10 16:14:26,340 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:26,341 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:26,341 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-10 16:14:26,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:26,360 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-10 16:14:26,360 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:68, output treesize:26 [2018-04-10 16:14:26,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:26,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:26,475 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-10 16:14:26,475 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:14, output treesize:13 [2018-04-10 16:14:26,540 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:26,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-10 16:14:26,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 16:14:26,558 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-10 16:14:26,558 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:23, output treesize:40 [2018-04-10 16:14:26,600 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:26,603 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:26,616 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-10 16:14:26,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-10 16:14:26,659 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-10 16:14:26,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:115 [2018-04-10 16:14:26,787 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 16:14:26,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:26,840 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:26,851 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:26,851 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-10 16:14:26,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:26,863 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-10 16:14:26,863 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:85, output treesize:30 [2018-04-10 16:14:27,038 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-10 16:14:27,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:27,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:27,050 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-10 16:14:27,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-10 16:14:27,071 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-10 16:14:27,109 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:27,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, 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-10 16:14:27,123 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-10 16:14:27,184 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-10 16:14:27,184 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:58, output treesize:156 [2018-04-10 16:14:27,474 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-10 16:14:27,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-10 16:14:27,485 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:27,486 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-10 16:14:27,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-10 16:14:27,498 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-10 16:14:27,503 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:27,505 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:27,506 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:27,514 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-10 16:14:27,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-10 16:14:27,550 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-10 16:14:27,550 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:49, output treesize:132 [2018-04-10 16:14:27,782 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-10 16:14:27,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:27,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:27,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-10 16:14:27,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:27,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:14:27,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-04-10 16:14:27,816 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-10 16:14:27,821 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:27,822 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:27,823 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:27,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, 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-10 16:14:27,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 16:14:27,857 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:27,858 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:27,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-10 16:14:27,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:27,876 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-10 16:14:27,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:56, output treesize:87 [2018-04-10 16:14:28,101 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-10 16:14:28,101 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:14:28,101 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-04-10 16:14:28,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-10 16:14:28,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-10 16:14:28,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1201, Unknown=10, NotChecked=450, Total=1806 [2018-04-10 16:14:28,103 INFO L87 Difference]: Start difference. First operand 209 states and 221 transitions. Second operand 43 states. [2018-04-10 16:14:29,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:29,957 INFO L93 Difference]: Finished difference Result 232 states and 250 transitions. [2018-04-10 16:14:29,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-10 16:14:29,958 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 241 [2018-04-10 16:14:29,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:29,959 INFO L225 Difference]: With dead ends: 232 [2018-04-10 16:14:29,959 INFO L226 Difference]: Without dead ends: 232 [2018-04-10 16:14:29,959 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 195 SyntacticMatches, 7 SemanticMatches, 65 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1144 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=393, Invalid=3277, Unknown=14, NotChecked=738, Total=4422 [2018-04-10 16:14:29,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-04-10 16:14:29,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 214. [2018-04-10 16:14:29,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-04-10 16:14:29,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 228 transitions. [2018-04-10 16:14:29,963 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 228 transitions. Word has length 241 [2018-04-10 16:14:29,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:29,963 INFO L459 AbstractCegarLoop]: Abstraction has 214 states and 228 transitions. [2018-04-10 16:14:29,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-10 16:14:29,963 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 228 transitions. [2018-04-10 16:14:29,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-04-10 16:14:29,965 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:29,965 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-10 16:14:29,965 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-10 16:14:29,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1359767112, now seen corresponding path program 12 times [2018-04-10 16:14:29,965 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:29,965 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:29,966 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:29,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:14:29,966 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:29,994 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:30,008 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:14:30,008 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:30,008 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:30,009 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 16:14:30,126 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-04-10 16:14:30,126 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:14:30,133 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:14:30,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:30,148 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:30,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:30,150 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:14:30,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-10 16:14:30,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:30,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:30,165 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-10 16:14:30,165 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-10 16:14:30,173 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-10 16:14:30,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:30,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:30,180 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-10 16:14:30,180 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-10 16:14:30,182 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-10 16:14:30,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-10 16:14:30,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 16:14:30,204 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-10 16:14:30,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:58 [2018-04-10 16:14:30,241 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:30,242 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:30,242 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-10 16:14:30,243 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:30,256 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-10 16:14:30,256 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:23 [2018-04-10 16:14:30,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:14:30,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:30,301 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-10 16:14:30,301 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-10 16:14:30,313 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-10 16:14:30,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:14:30,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:30,323 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-10 16:14:30,323 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-10 16:14:30,325 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-10 16:14:30,345 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-10 16:14:30,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-10 16:14:30,380 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-10 16:14:30,380 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-04-10 16:14:30,464 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:30,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23 [2018-04-10 16:14:30,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:30,481 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-10 16:14:30,482 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:69, output treesize:23 [2018-04-10 16:14:30,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:14:30,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:30,529 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-10 16:14:30,529 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-10 16:14:30,546 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-10 16:14:30,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:14:30,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:30,556 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-10 16:14:30,556 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-10 16:14:30,559 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-10 16:14:30,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, 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-10 16:14:30,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-10 16:14:30,631 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-10 16:14:30,631 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-04-10 16:14:30,723 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 16:14:30,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:30,732 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:30,758 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:30,759 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-10 16:14:30,759 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:30,765 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-10 16:14:30,765 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:69, output treesize:23 [2018-04-10 16:14:30,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:14:30,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:30,800 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-10 16:14:30,800 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-10 16:14:30,810 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-10 16:14:30,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:30,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:30,817 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-10 16:14:30,817 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-10 16:14:30,819 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-10 16:14:30,834 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-10 16:14:30,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-10 16:14:30,863 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-10 16:14:30,864 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-04-10 16:14:31,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 8 treesize of output 7 [2018-04-10 16:14:31,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:31,075 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-10 16:14:31,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:31,076 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-10 16:14:31,076 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-04-10 16:14:31,105 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:31,106 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:31,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, 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-10 16:14:31,113 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 16:14:31,139 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:31,140 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:31,141 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:31,141 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-10 16:14:31,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:31,158 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-10 16:14:31,158 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:45, output treesize:64 [2018-04-10 16:14:31,315 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-10 16:14:31,315 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:14:31,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-04-10 16:14:31,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-10 16:14:31,316 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-10 16:14:31,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=428, Unknown=9, NotChecked=450, Total=992 [2018-04-10 16:14:31,316 INFO L87 Difference]: Start difference. First operand 214 states and 228 transitions. Second operand 32 states. [2018-04-10 16:14:32,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:32,397 INFO L93 Difference]: Finished difference Result 230 states and 248 transitions. [2018-04-10 16:14:32,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-10 16:14:32,398 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 241 [2018-04-10 16:14:32,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:32,399 INFO L225 Difference]: With dead ends: 230 [2018-04-10 16:14:32,399 INFO L226 Difference]: Without dead ends: 230 [2018-04-10 16:14:32,400 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-10 16:14:32,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-04-10 16:14:32,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 212. [2018-04-10 16:14:32,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-04-10 16:14:32,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 225 transitions. [2018-04-10 16:14:32,405 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 225 transitions. Word has length 241 [2018-04-10 16:14:32,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:32,406 INFO L459 AbstractCegarLoop]: Abstraction has 212 states and 225 transitions. [2018-04-10 16:14:32,406 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-10 16:14:32,406 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 225 transitions. [2018-04-10 16:14:32,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-04-10 16:14:32,407 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:32,408 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-10 16:14:32,408 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-10 16:14:32,408 INFO L82 PathProgramCache]: Analyzing trace with hash -2128500513, now seen corresponding path program 3 times [2018-04-10 16:14:32,408 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:32,408 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:32,409 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:32,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:14:32,409 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:32,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:32,430 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:32,582 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-10 16:14:32,582 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:32,582 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:32,583 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 16:14:32,590 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-04-10 16:14:32,590 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:14:32,593 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:14:32,686 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-10 16:14:32,687 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:14:32,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2018-04-10 16:14:32,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-10 16:14:32,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-10 16:14:32,687 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-04-10 16:14:32,688 INFO L87 Difference]: Start difference. First operand 212 states and 225 transitions. Second operand 13 states. [2018-04-10 16:14:32,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:32,916 INFO L93 Difference]: Finished difference Result 221 states and 235 transitions. [2018-04-10 16:14:32,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-10 16:14:32,916 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 249 [2018-04-10 16:14:32,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:32,917 INFO L225 Difference]: With dead ends: 221 [2018-04-10 16:14:32,917 INFO L226 Difference]: Without dead ends: 221 [2018-04-10 16:14:32,917 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=296, Invalid=634, Unknown=0, NotChecked=0, Total=930 [2018-04-10 16:14:32,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-04-10 16:14:32,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 215. [2018-04-10 16:14:32,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-04-10 16:14:32,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 228 transitions. [2018-04-10 16:14:32,920 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 228 transitions. Word has length 249 [2018-04-10 16:14:32,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:32,921 INFO L459 AbstractCegarLoop]: Abstraction has 215 states and 228 transitions. [2018-04-10 16:14:32,921 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-10 16:14:32,921 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 228 transitions. [2018-04-10 16:14:32,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-04-10 16:14:32,922 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:32,923 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-10 16:14:32,923 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-10 16:14:32,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1754272029, now seen corresponding path program 13 times [2018-04-10 16:14:32,923 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:32,923 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:32,924 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:32,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:14:32,924 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:32,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:32,951 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:33,286 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-10 16:14:33,286 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:33,287 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:33,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:33,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:33,325 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:14:33,475 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-10 16:14:33,476 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:14:33,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 24 [2018-04-10 16:14:33,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-10 16:14:33,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-10 16:14:33,476 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2018-04-10 16:14:33,476 INFO L87 Difference]: Start difference. First operand 215 states and 228 transitions. Second operand 24 states. [2018-04-10 16:14:34,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:34,069 INFO L93 Difference]: Finished difference Result 234 states and 250 transitions. [2018-04-10 16:14:34,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-10 16:14:34,070 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 310 [2018-04-10 16:14:34,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:34,070 INFO L225 Difference]: With dead ends: 234 [2018-04-10 16:14:34,070 INFO L226 Difference]: Without dead ends: 234 [2018-04-10 16:14:34,071 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-10 16:14:34,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-04-10 16:14:34,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 230. [2018-04-10 16:14:34,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-04-10 16:14:34,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 246 transitions. [2018-04-10 16:14:34,074 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 246 transitions. Word has length 310 [2018-04-10 16:14:34,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:34,075 INFO L459 AbstractCegarLoop]: Abstraction has 230 states and 246 transitions. [2018-04-10 16:14:34,075 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-10 16:14:34,075 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 246 transitions. [2018-04-10 16:14:34,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-04-10 16:14:34,076 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:34,077 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-10 16:14:34,077 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-10 16:14:34,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1272749241, now seen corresponding path program 14 times [2018-04-10 16:14:34,077 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:34,077 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:34,078 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:34,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:34,078 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:34,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:34,104 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:34,577 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-10 16:14:34,577 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:34,577 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:34,578 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:14:34,612 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:14:34,613 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:14:34,618 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:14:34,856 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-10 16:14:34,856 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:14:34,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 31 [2018-04-10 16:14:34,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-10 16:14:34,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-10 16:14:34,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=799, Unknown=0, NotChecked=0, Total=930 [2018-04-10 16:14:34,858 INFO L87 Difference]: Start difference. First operand 230 states and 246 transitions. Second operand 31 states. [2018-04-10 16:14:35,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:35,577 INFO L93 Difference]: Finished difference Result 273 states and 296 transitions. [2018-04-10 16:14:35,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-10 16:14:35,578 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 316 [2018-04-10 16:14:35,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:35,579 INFO L225 Difference]: With dead ends: 273 [2018-04-10 16:14:35,579 INFO L226 Difference]: Without dead ends: 265 [2018-04-10 16:14:35,579 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-10 16:14:35,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-04-10 16:14:35,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 238. [2018-04-10 16:14:35,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-04-10 16:14:35,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 257 transitions. [2018-04-10 16:14:35,582 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 257 transitions. Word has length 316 [2018-04-10 16:14:35,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:35,583 INFO L459 AbstractCegarLoop]: Abstraction has 238 states and 257 transitions. [2018-04-10 16:14:35,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-10 16:14:35,583 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 257 transitions. [2018-04-10 16:14:35,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-04-10 16:14:35,585 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:35,585 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-10 16:14:35,585 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-10 16:14:35,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1088356460, now seen corresponding path program 15 times [2018-04-10 16:14:35,585 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:35,585 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:35,586 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:35,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:14:35,586 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:35,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:35,633 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:35,656 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:14:35,656 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:35,656 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:35,657 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 16:14:35,861 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-04-10 16:14:35,861 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:14:35,881 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:14:35,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:14:35,889 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:35,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:35,892 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:14:35,909 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-10 16:14:35,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:14:35,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:35,914 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-10 16:14:35,914 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-10 16:14:35,926 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-10 16:14:35,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:14:35,931 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:35,937 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-10 16:14:35,937 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-10 16:14:35,940 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-10 16:14:35,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-10 16:14:35,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 16:14:35,971 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-10 16:14:35,972 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:58 [2018-04-10 16:14:36,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:36,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:36,154 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:36,155 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-10 16:14:36,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:36,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:14:36,158 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:20, output treesize:13 [2018-04-10 16:14:36,215 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:36,216 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:36,217 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:36,218 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-10 16:14:36,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:36,231 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:36,231 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:36,239 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-10 16:14:36,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:14:36,259 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-10 16:14:36,259 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:48, output treesize:71 [2018-04-10 16:14:36,297 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:36,297 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-10 16:14:36,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:36,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:36,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:36,303 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-10 16:14:36,303 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:20, output treesize:13 [2018-04-10 16:14:36,329 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-10 16:14:36,333 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:36,333 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:36,335 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:36,336 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-10 16:14:36,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:36,349 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:36,350 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:36,357 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-10 16:14:36,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:14:36,377 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-10 16:14:36,377 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:48, output treesize:71 [2018-04-10 16:14:36,433 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:36,433 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-10 16:14:36,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:36,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:36,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:36,438 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-10 16:14:36,438 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:20, output treesize:13 [2018-04-10 16:14:36,463 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:36,464 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:36,465 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:36,466 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-10 16:14:36,466 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:36,478 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:36,478 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:36,485 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-10 16:14:36,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:14:36,505 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-10 16:14:36,505 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:48, output treesize:71 [2018-04-10 16:14:36,572 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:36,572 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-10 16:14:36,572 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:36,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:36,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:36,582 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-10 16:14:36,582 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:20, output treesize:13 [2018-04-10 16:14:36,610 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:36,612 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:36,613 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:36,613 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-10 16:14:36,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:36,643 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:36,645 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:36,697 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-10 16:14:36,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:14:36,724 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-10 16:14:36,725 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:48, output treesize:71 [2018-04-10 16:14:36,834 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-10 16:14:36,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-10 16:14:36,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:36,862 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-10 16:14:36,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:36,864 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-10 16:14:36,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-04-10 16:14:36,881 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-10 16:14:36,894 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:36,895 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:36,905 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-10 16:14:36,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 16:14:36,941 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:36,942 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:36,944 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:36,944 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-10 16:14:36,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:36,968 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-10 16:14:36,968 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:56, output treesize:86 [2018-04-10 16:14:37,263 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-10 16:14:37,263 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:14:37,263 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-10 16:14:37,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-10 16:14:37,264 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-10 16:14:37,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=371, Unknown=7, NotChecked=270, Total=756 [2018-04-10 16:14:37,264 INFO L87 Difference]: Start difference. First operand 238 states and 257 transitions. Second operand 28 states. [2018-04-10 16:14:37,636 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-10 16:14:37,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:37,828 INFO L93 Difference]: Finished difference Result 286 states and 317 transitions. [2018-04-10 16:14:37,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-10 16:14:37,828 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 321 [2018-04-10 16:14:37,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:37,829 INFO L225 Difference]: With dead ends: 286 [2018-04-10 16:14:37,829 INFO L226 Difference]: Without dead ends: 286 [2018-04-10 16:14:37,829 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-10 16:14:37,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-04-10 16:14:37,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 269. [2018-04-10 16:14:37,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-04-10 16:14:37,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 297 transitions. [2018-04-10 16:14:37,834 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 297 transitions. Word has length 321 [2018-04-10 16:14:37,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:37,834 INFO L459 AbstractCegarLoop]: Abstraction has 269 states and 297 transitions. [2018-04-10 16:14:37,834 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-10 16:14:37,834 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 297 transitions. [2018-04-10 16:14:37,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-04-10 16:14:37,837 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:37,837 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-10 16:14:37,837 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-10 16:14:37,837 INFO L82 PathProgramCache]: Analyzing trace with hash -455441777, now seen corresponding path program 16 times [2018-04-10 16:14:37,837 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:37,837 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:37,838 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:37,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:14:37,838 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:37,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:37,875 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:37,893 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:14:37,893 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:37,893 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:37,893 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 16:14:38,177 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 16:14:38,177 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:14:38,192 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:14:38,211 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-10 16:14:38,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:38,219 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-10 16:14:38,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:38,221 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:38,222 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:38,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:38,228 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:27, output treesize:15 [2018-04-10 16:14:38,296 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-10 16:14:38,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:38,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:38,301 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:38,303 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-10 16:14:38,303 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:11, output treesize:1 [2018-04-10 16:14:38,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:38,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:38,329 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-10 16:14:38,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:21, output treesize:20 [2018-04-10 16:14:38,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-10 16:14:38,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 20 treesize of output 19 [2018-04-10 16:14:38,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:38,374 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 17 treesize of output 25 [2018-04-10 16:14:38,375 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 16:14:38,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:14:38,396 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-10 16:14:38,396 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:30, output treesize:32 [2018-04-10 16:14:38,425 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 16:14:38,426 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:38,428 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:38,429 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:38,429 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-10 16:14:38,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:38,439 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-10 16:14:38,441 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:38,442 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-10 16:14:38,443 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:38,446 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:38,454 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-10 16:14:38,454 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:66, output treesize:22 [2018-04-10 16:14:38,553 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-10 16:14:38,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10 16:14:38,556 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:38,557 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-10 16:14:38,558 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:38,561 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:38,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:38,567 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-10 16:14:38,567 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:22, output treesize:1 [2018-04-10 16:14:38,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-10 16:14:38,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:38,602 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-10 16:14:38,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:33, output treesize:32 [2018-04-10 16:14:38,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 45 [2018-04-10 16:14:38,642 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:38,653 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 4 case distinctions, treesize of input 31 treesize of output 52 [2018-04-10 16:14:38,655 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 16:14:38,655 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:38,678 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:38,679 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:38,680 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:38,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, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 56 [2018-04-10 16:14:38,682 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:38,708 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:38,711 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:38,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, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 73 [2018-04-10 16:14:38,733 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-04-10 16:14:38,780 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:38,781 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:38,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 58 [2018-04-10 16:14:38,789 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-10 16:14:38,833 INFO L267 ElimStorePlain]: Start of recursive call 3: 4 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-04-10 16:14:38,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 32 treesize of output 34 [2018-04-10 16:14:38,890 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:38,891 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-10 16:14:38,891 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:38,896 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:38,938 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-04-10 16:14:38,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-04-10 16:14:38,990 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:51, output treesize:81 [2018-04-10 16:14:39,032 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 16:14:39,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:39,034 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,035 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,035 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-10 16:14:39,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:39,044 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-10 16:14:39,045 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,046 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,046 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,048 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 62 [2018-04-10 16:14:39,048 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:39,055 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:39,066 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-10 16:14:39,066 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:81, output treesize:31 [2018-04-10 16:14:39,248 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 25 treesize of output 22 [2018-04-10 16:14:39,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-04-10 16:14:39,250 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,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, 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 35 [2018-04-10 16:14:39,253 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,253 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,254 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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 58 [2018-04-10 16:14:39,256 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:39,261 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:39,264 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:39,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:39,271 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-10 16:14:39,272 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:34, output treesize:1 [2018-04-10 16:14:39,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:39,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:39,328 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-10 16:14:39,328 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:45, output treesize:44 [2018-04-10 16:14:39,387 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 59 [2018-04-10 16:14:39,390 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,390 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,392 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,395 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,414 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 93 [2018-04-10 16:14:39,419 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,419 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,420 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,421 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,422 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,423 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,429 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 65 treesize of output 107 [2018-04-10 16:14:39,432 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,433 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,434 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,435 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,436 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,436 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,437 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,438 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,439 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,439 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 146 [2018-04-10 16:14:39,448 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:39,471 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:39,548 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,548 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,550 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,552 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,552 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,570 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 4 case distinctions, treesize of input 45 treesize of output 102 [2018-04-10 16:14:39,574 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,574 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,575 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,575 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,578 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,579 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,592 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 83 treesize of output 149 [2018-04-10 16:14:39,593 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-10 16:14:39,687 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,688 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,689 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,689 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,690 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,699 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 2 case distinctions, treesize of input 49 treesize of output 116 [2018-04-10 16:14:39,700 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-10 16:14:39,805 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,806 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,806 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,807 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,807 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,808 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,812 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 49 treesize of output 113 [2018-04-10 16:14:39,812 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:39,856 INFO L267 ElimStorePlain]: Start of recursive call 6: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-10 16:14:39,943 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,944 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,944 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,945 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,947 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,959 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 45 treesize of output 94 [2018-04-10 16:14:39,962 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,962 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,963 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,964 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,967 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,968 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,968 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,969 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:39,980 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 1 case distinctions, treesize of input 81 treesize of output 152 [2018-04-10 16:14:39,981 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:40,024 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:40,024 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:40,025 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:40,026 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:40,027 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:40,028 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:40,033 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 51 treesize of output 115 [2018-04-10 16:14:40,033 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:40,061 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:14:40,558 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:40,559 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:40,562 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:40,574 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:40,580 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:40,606 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 3 new quantified variables, introduced 9 case distinctions, treesize of input 47 treesize of output 115 [2018-04-10 16:14:40,610 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 16:14:40,610 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:40,687 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:40,688 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:40,689 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:40,690 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:40,690 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:40,691 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:40,692 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:40,693 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:40,702 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 51 treesize of output 138 [2018-04-10 16:14:40,702 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:40,758 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:40,759 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:40,760 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:40,761 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:40,762 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:40,763 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:40,772 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:40,773 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:40,787 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 3 case distinctions, treesize of input 51 treesize of output 147 [2018-04-10 16:14:40,788 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-04-10 16:14:40,937 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:40,938 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:40,942 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:40,945 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:40,946 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:40,949 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:40,954 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:40,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 12 case distinctions, treesize of input 49 treesize of output 144 [2018-04-10 16:14:40,982 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 8 xjuncts. [2018-04-10 16:14:41,159 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:41,160 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:41,161 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:41,163 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:41,163 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:41,164 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:41,165 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:41,165 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:41,169 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:41,186 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 51 treesize of output 157 [2018-04-10 16:14:41,187 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 4 xjuncts. [2018-04-10 16:14:41,572 INFO L267 ElimStorePlain]: Start of recursive call 13: 8 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-04-10 16:14:41,778 INFO L267 ElimStorePlain]: Start of recursive call 3: 8 dim-1 vars, End of recursive call: and 17 xjuncts. [2018-04-10 16:14:42,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 50 [2018-04-10 16:14:42,042 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:42,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, 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 35 [2018-04-10 16:14:42,045 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:42,046 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:42,047 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:42,049 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 58 [2018-04-10 16:14:42,049 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:42,055 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:42,063 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:42,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 17 xjuncts. [2018-04-10 16:14:42,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 8 xjuncts. [2018-04-10 16:14:42,529 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 8 variables, input treesize:72, output treesize:197 [2018-04-10 16:14:42,593 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:42,594 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:42,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2018-04-10 16:14:42,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:42,595 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 16:14:42,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:42,614 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-10 16:14:42,616 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:42,616 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:42,617 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:42,617 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:42,618 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:42,618 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:42,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:42,629 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:42,629 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 111 [2018-04-10 16:14:42,629 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:42,647 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:42,654 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-10 16:14:42,654 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:90, output treesize:40 [2018-04-10 16:14:43,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2018-04-10 16:14:43,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 25 treesize of output 28 [2018-04-10 16:14:43,143 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 36 [2018-04-10 16:14:43,146 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,147 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,147 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 52 [2018-04-10 16:14:43,151 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,152 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,152 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,153 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,153 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,154 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,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, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 85 [2018-04-10 16:14:43,157 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:43,165 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:43,170 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:43,174 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:43,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:43,184 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-10 16:14:43,185 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:32, output treesize:1 [2018-04-10 16:14:43,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:14:43,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:43,254 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-10 16:14:43,254 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:44, output treesize:43 [2018-04-10 16:14:43,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 69 [2018-04-10 16:14:43,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10 16:14:43,346 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 36 [2018-04-10 16:14:43,350 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,350 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,351 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 52 [2018-04-10 16:14:43,356 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,356 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,357 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,357 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,358 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,359 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 85 [2018-04-10 16:14:43,363 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:43,372 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:43,377 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:43,387 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:43,438 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,439 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,440 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,444 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,445 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,448 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,461 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,470 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,497 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 138 [2018-04-10 16:14:43,502 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 16:14:43,503 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:43,655 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,656 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,656 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,657 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,657 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,658 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,658 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,659 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,659 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,660 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:14:43,662 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,664 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 137 [2018-04-10 16:14:43,670 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,670 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,671 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,671 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,673 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,673 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,674 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:14:43,680 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 60 treesize of output 117 [2018-04-10 16:14:43,684 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,684 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,685 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,685 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:14:43,685 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,686 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,698 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 47 treesize of output 95 [2018-04-10 16:14:43,698 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:43,710 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:43,725 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:43,836 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,836 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,837 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,837 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,838 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,838 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,839 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,839 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,839 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:14:43,845 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 55 treesize of output 112 [2018-04-10 16:14:43,848 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,848 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,848 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,849 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:14:43,849 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,850 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,850 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 91 [2018-04-10 16:14:43,858 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,859 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,859 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,860 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,861 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,861 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,862 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,862 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,863 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,864 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:43,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 126 [2018-04-10 16:14:43,871 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:43,884 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:43,898 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:44,161 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:44,162 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:44,163 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:44,164 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:44,165 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:44,167 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:44,169 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:44,172 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:44,176 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:44,200 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 4 new quantified variables, introduced 12 case distinctions, treesize of input 57 treesize of output 154 [2018-04-10 16:14:44,207 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:44,207 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:44,210 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:44,211 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:44,216 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:44,216 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:44,218 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:44,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 16 case distinctions, treesize of input 123 treesize of output 170 [2018-04-10 16:14:44,259 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 16:14:44,259 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:44,505 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:44,506 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:44,507 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:44,509 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:44,511 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:44,514 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:44,517 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:44,517 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:44,518 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:44,521 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:44,521 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:44,522 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:44,524 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:44,530 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:44,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 14 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 20 case distinctions, treesize of input 61 treesize of output 219 [2018-04-10 16:14:44,571 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 16 xjuncts. [2018-04-10 16:14:45,206 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:45,207 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:45,207 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:45,208 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:45,209 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:45,209 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:14:45,210 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:45,210 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:45,211 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:45,225 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:45,226 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:45,227 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:45,231 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:45,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 188 [2018-04-10 16:14:45,237 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:45,523 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:45,524 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:45,532 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:45,533 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:45,533 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:45,534 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:45,534 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:45,535 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:45,535 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:45,536 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:45,536 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:45,537 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:45,537 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:45,538 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:45,538 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:45,539 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:45,539 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:45,540 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:45,540 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:45,541 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:14:45,543 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:45,546 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:45,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 244 [2018-04-10 16:14:45,554 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:45,694 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:45,695 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:45,695 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:45,696 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:45,696 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:45,697 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:45,697 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:45,698 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:45,699 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:45,699 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:45,700 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:45,700 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:14:45,701 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:45,713 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 61 treesize of output 162 [2018-04-10 16:14:45,713 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:46,167 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:46,168 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:46,168 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:46,169 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:46,169 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:14:46,170 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:46,170 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:46,171 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:46,171 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:46,171 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:14:46,173 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:46,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 151 [2018-04-10 16:14:46,184 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:46,344 INFO L267 ElimStorePlain]: Start of recursive call 16: 16 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-04-10 16:14:46,622 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:46,623 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:46,623 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:46,624 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:46,624 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:46,625 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:46,626 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:46,626 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:46,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:46,635 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:46,637 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:46,637 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:46,638 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:46,638 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:46,639 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:14:46,641 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:46,644 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:46,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 181 [2018-04-10 16:14:46,652 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:46,653 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:46,653 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:46,654 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:46,655 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:46,655 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:46,656 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:46,656 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:46,657 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:14:46,657 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:46,658 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:46,658 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:46,668 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 64 treesize of output 164 [2018-04-10 16:14:46,668 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:46,698 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:46,950 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:46,951 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:46,952 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:46,952 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:46,953 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:46,953 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:46,954 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:46,954 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:46,954 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:14:46,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 123 [2018-04-10 16:14:46,966 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:46,967 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:46,967 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:46,968 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:14:46,968 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:46,969 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:46,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 98 [2018-04-10 16:14:46,975 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:46,991 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:47,204 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:47,205 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:47,205 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:47,206 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:47,207 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:47,207 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:47,208 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:47,208 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:47,209 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:47,209 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:47,213 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:47,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 154 [2018-04-10 16:14:47,220 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:47,221 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:47,221 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:47,222 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:47,223 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:47,224 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:47,226 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:47,227 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:47,227 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:47,228 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:47,229 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:47,229 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:47,230 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:47,230 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:47,239 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 67 treesize of output 212 [2018-04-10 16:14:47,239 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:47,271 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:48,236 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:48,236 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:48,237 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:48,237 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:14:48,238 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:48,239 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:48,240 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:48,241 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:48,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 137 [2018-04-10 16:14:48,250 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:48,251 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:48,252 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:48,252 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:48,253 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:48,253 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:48,254 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:48,254 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:48,255 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:48,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 135 [2018-04-10 16:14:48,262 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:48,290 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:48,456 INFO L267 ElimStorePlain]: Start of recursive call 15: 16 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-04-10 16:14:48,928 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:48,928 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:48,929 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:48,929 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:14:48,930 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:48,930 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:48,931 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:48,933 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:48,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 108 [2018-04-10 16:14:48,940 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:48,940 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:48,941 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:48,942 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:48,942 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:48,943 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:48,943 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:48,944 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:48,944 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:48,945 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:48,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 128 [2018-04-10 16:14:48,954 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:48,955 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:48,955 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:48,956 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:48,956 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:48,957 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:48,957 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:48,958 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:48,958 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:48,959 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:48,959 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:48,960 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:48,960 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:48,961 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:48,962 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:48,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 187 [2018-04-10 16:14:48,970 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:48,992 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:49,007 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:49,397 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,398 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,398 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,399 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,399 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,400 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,400 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,401 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,401 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,402 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,405 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 137 [2018-04-10 16:14:49,411 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,412 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,412 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,413 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,413 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,414 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,414 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,415 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,415 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,416 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,416 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,418 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 187 [2018-04-10 16:14:49,430 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,431 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,431 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,432 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,432 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,433 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,433 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,434 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,435 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,435 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,436 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,437 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,437 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,438 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,438 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,439 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,439 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,440 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,441 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,441 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 262 [2018-04-10 16:14:49,454 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:49,482 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:49,501 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:49,594 INFO L267 ElimStorePlain]: Start of recursive call 7: 16 dim-1 vars, End of recursive call: and 8 xjuncts. [2018-04-10 16:14:49,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 8 xjuncts. [2018-04-10 16:14:49,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 8 xjuncts. [2018-04-10 16:14:49,798 INFO L202 ElimStorePlain]: Needed 36 recursive calls to eliminate 8 variables, input treesize:80, output treesize:257 [2018-04-10 16:14:49,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 53 [2018-04-10 16:14:49,903 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,904 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,904 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,905 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,905 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,905 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,906 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,906 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,907 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,911 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,913 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,915 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,916 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:49,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 158 [2018-04-10 16:14:49,917 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:49,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:49,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:14:49,961 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:95, output treesize:63 [2018-04-10 16:14:51,700 WARN L148 SmtUtils]: Spent 105ms on a formula simplification that was a NOOP. DAG size: 66 [2018-04-10 16:14:51,703 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-10 16:14:51,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:51,832 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-10 16:14:51,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2018-04-10 16:14:51,836 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 29 treesize of output 31 [2018-04-10 16:14:51,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2018-04-10 16:14:51,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2018-04-10 16:14:51,853 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 35 treesize of output 42 [2018-04-10 16:14:51,853 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:51,858 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:51,863 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:51,868 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:51,874 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:51,884 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:51,888 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 93 treesize of output 82 [2018-04-10 16:14:51,889 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:51,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 68 [2018-04-10 16:14:51,906 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:51,908 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 62 treesize of output 66 [2018-04-10 16:14:51,951 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:51,952 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:51,957 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 40 treesize of output 51 [2018-04-10 16:14:51,979 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:51,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 55 [2018-04-10 16:14:51,988 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:51,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 63 [2018-04-10 16:14:51,997 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:52,007 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:52,007 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 16:14:52,008 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:52,015 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:52,023 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:52,024 WARN L288 Elim1Store]: Array PQE input equivalent to false [2018-04-10 16:14:52,024 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:52,032 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:52,042 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:52,047 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 74 treesize of output 71 [2018-04-10 16:14:52,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10 16:14:52,051 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 29 treesize of output 31 [2018-04-10 16:14:52,055 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 31 treesize of output 33 [2018-04-10 16:14:52,061 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 33 treesize of output 35 [2018-04-10 16:14:52,069 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 35 treesize of output 42 [2018-04-10 16:14:52,069 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:52,075 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:52,080 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:52,085 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:52,091 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:52,104 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:52,111 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 100 treesize of output 87 [2018-04-10 16:14:52,113 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,114 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 90 [2018-04-10 16:14:52,205 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,206 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,206 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:14:52,206 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,211 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 66 treesize of output 85 [2018-04-10 16:14:52,234 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,234 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,235 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,235 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,236 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,236 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,237 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,237 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,238 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:14:52,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 107 [2018-04-10 16:14:52,266 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,267 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,267 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,268 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,268 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:14:52,268 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,269 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,269 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,270 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,270 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,270 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,278 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 42 treesize of output 119 [2018-04-10 16:14:52,281 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,281 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,282 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,282 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,283 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,283 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,284 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,284 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,285 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,285 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,286 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,286 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:14:52,286 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,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 0 case distinctions, treesize of input 39 treesize of output 133 [2018-04-10 16:14:52,294 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:52,307 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:52,312 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:52,317 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:52,339 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,340 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,341 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,343 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,346 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,380 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 6 case distinctions, treesize of input 68 treesize of output 112 [2018-04-10 16:14:52,476 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,477 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,478 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,480 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,480 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,481 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,482 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,483 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,483 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,525 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 12 case distinctions, treesize of input 67 treesize of output 145 [2018-04-10 16:14:52,699 WARN L151 SmtUtils]: Spent 170ms on a formula simplification. DAG size of input: 201 DAG size of output 93 [2018-04-10 16:14:52,701 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,701 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,702 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,702 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,703 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,703 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,703 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,704 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,704 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,705 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,705 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,706 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,706 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:14:52,706 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,707 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,707 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,708 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,708 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,708 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,709 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 186 [2018-04-10 16:14:52,728 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,729 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,729 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,730 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,730 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,731 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,731 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,731 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,732 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,732 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,733 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,733 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,733 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,734 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,734 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,735 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,735 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,735 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,736 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,736 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,737 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,737 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:14:52,752 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 201 [2018-04-10 16:14:52,752 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:52,779 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:52,826 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,827 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,828 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,830 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,831 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,832 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,833 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,834 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,836 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,840 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,842 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,844 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,848 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,848 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:52,922 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 20 case distinctions, treesize of input 57 treesize of output 189 [2018-04-10 16:14:52,929 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 16:14:52,929 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:53,317 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:53,317 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:53,318 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:53,318 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:53,318 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:53,319 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:53,319 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:14:53,320 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:53,320 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:53,321 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:14:53,321 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:53,321 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:53,322 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:53,340 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 167 [2018-04-10 16:14:53,341 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:53,474 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:53,474 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:53,475 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:53,475 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:53,475 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:53,476 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:53,476 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:53,477 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:53,477 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:53,478 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:53,478 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:53,479 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:53,479 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:53,480 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:53,480 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:14:53,481 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:53,481 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:53,482 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:53,482 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:53,482 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:53,483 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:53,483 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:53,484 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:53,484 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:53,514 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 223 [2018-04-10 16:14:53,515 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:53,809 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:53,811 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:53,812 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:53,813 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:53,814 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:53,816 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:53,816 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:53,817 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:53,818 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:53,820 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:53,822 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:53,823 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:53,826 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:53,827 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:53,898 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 24 case distinctions, treesize of input 59 treesize of output 209 [2018-04-10 16:14:53,901 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 16 xjuncts. [2018-04-10 16:14:54,236 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,237 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,237 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,238 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,238 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,239 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,239 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,240 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,240 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,241 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,241 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,242 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,242 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,243 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,243 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,244 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,244 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,244 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:14:54,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 24 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 184 [2018-04-10 16:14:54,267 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:54,471 INFO L267 ElimStorePlain]: Start of recursive call 33: 16 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-10 16:14:54,558 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,559 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,559 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,560 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,560 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,561 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,561 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,562 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,562 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,563 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,563 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,564 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,564 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,565 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,565 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:14:54,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 18 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 148 [2018-04-10 16:14:54,584 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,584 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,585 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,585 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,586 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,586 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:14:54,587 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,587 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,587 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,588 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,588 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,589 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,589 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,590 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 147 [2018-04-10 16:14:54,602 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:54,631 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:54,748 INFO L267 ElimStorePlain]: Start of recursive call 30: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-10 16:14:54,911 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,911 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,912 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,912 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,913 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:14:54,913 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,914 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,914 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,915 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,915 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,925 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 59 treesize of output 121 [2018-04-10 16:14:54,960 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,961 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,961 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,962 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,962 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,962 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,963 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,963 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,964 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,964 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,964 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,965 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,965 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,966 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,966 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,966 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,967 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,967 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:14:54,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 166 [2018-04-10 16:14:54,981 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,981 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,981 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,982 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,982 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,983 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:14:54,983 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,984 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,984 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,984 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,985 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,985 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,986 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,986 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,987 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:54,998 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 152 [2018-04-10 16:14:54,998 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:55,017 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:55,026 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:55,090 INFO L267 ElimStorePlain]: Start of recursive call 29: 3 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-10 16:14:55,170 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-10 16:14:55,229 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-10 16:14:55,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 6 xjuncts. [2018-04-10 16:14:55,331 INFO L202 ElimStorePlain]: Needed 43 recursive calls to eliminate 9 variables, input treesize:119, output treesize:242 [2018-04-10 16:14:57,290 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset Int) (v_prenex_396 Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~i~0 Int) (v_prenex_394 Int) (v_prenex_395 Int) (v_prenex_393 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (let ((.cse0 (store (select |c_old(#memory_int)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0 v_prenex_393))) (let ((.cse5 (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~i~0)) (.cse1 (store .cse0 4 v_prenex_394))) (let ((.cse3 (store .cse1 8 v_prenex_395)) (.cse6 (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset .cse5))) (and (<= (select (select (store |c_old(#memory_int)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| .cse0) |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)) v_prenex_394) (<= (select (select (store |c_old(#memory_int)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| .cse1) |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_395) (= (store |c_old(#memory_int)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (let ((.cse2 (store .cse3 12 v_prenex_396))) (store .cse2 16 (select (select (store |c_old(#memory_int)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| .cse2) |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|) (<= (let ((.cse4 (select |c_#memory_int| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|))) (+ (select .cse4 (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset .cse5 (- 8))) (select .cse4 (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset .cse5 (- 16))) (select .cse4 (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset .cse5 (- 4))) (select .cse4 .cse6) (select .cse4 (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset .cse5 (- 12))))) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~ret4|) (<= (select |c_old(#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_393) (<= (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| 12)) v_prenex_396) (<= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset 0) (<= 16 .cse6) (<= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~i~0 4)))))) is different from true [2018-04-10 16:14:57,297 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset Int) (v_prenex_396 Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~i~0 Int) (v_prenex_394 Int) (v_prenex_395 Int) (v_prenex_393 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (let ((.cse0 (store (select |c_old(#memory_int)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0 v_prenex_393))) (let ((.cse5 (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~i~0)) (.cse1 (store .cse0 4 v_prenex_394))) (let ((.cse3 (store .cse1 8 v_prenex_395)) (.cse6 (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset .cse5))) (and (<= (select (select (store |c_old(#memory_int)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| .cse0) |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)) v_prenex_394) (<= (select (select (store |c_old(#memory_int)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| .cse1) |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_395) (= (store |c_old(#memory_int)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (let ((.cse2 (store .cse3 12 v_prenex_396))) (store .cse2 16 (select (select (store |c_old(#memory_int)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| .cse2) |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|) (<= (let ((.cse4 (select |c_#memory_int| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|))) (+ (select .cse4 (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset .cse5 (- 8))) (select .cse4 (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset .cse5 (- 16))) (select .cse4 (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset .cse5 (- 4))) (select .cse4 .cse6) (select .cse4 (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset .cse5 (- 12))))) 0) (<= (select |c_old(#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_393) (<= (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| 12)) v_prenex_396) (<= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset 0) (<= 16 .cse6) (<= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~i~0 4)))))) is different from true [2018-04-10 16:14:57,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1862 backedges. 491 proven. 808 refuted. 121 times theorem prover too weak. 418 trivial. 24 not checked. [2018-04-10 16:14:57,612 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:14:57,612 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-04-10 16:14:57,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-04-10 16:14:57,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-04-10 16:14:57,614 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=6331, Unknown=232, NotChecked=326, Total=7140 [2018-04-10 16:14:57,614 INFO L87 Difference]: Start difference. First operand 269 states and 297 transitions. Second operand 85 states. [2018-04-10 16:15:03,011 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 77 DAG size of output 71 [2018-04-10 16:15:06,002 WARN L151 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 82 DAG size of output 74 [2018-04-10 16:15:09,910 WARN L148 SmtUtils]: Spent 430ms on a formula simplification that was a NOOP. DAG size: 41 [2018-04-10 16:15:13,322 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 78 DAG size of output 69 [2018-04-10 16:15:13,882 WARN L151 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 83 DAG size of output 74 [2018-04-10 16:15:16,224 WARN L151 SmtUtils]: Spent 158ms on a formula simplification. DAG size of input: 99 DAG size of output 78 [2018-04-10 16:15:18,027 WARN L151 SmtUtils]: Spent 188ms on a formula simplification. DAG size of input: 83 DAG size of output 74 [2018-04-10 16:15:20,242 WARN L151 SmtUtils]: Spent 497ms on a formula simplification. DAG size of input: 88 DAG size of output 79 [2018-04-10 16:15:22,392 WARN L148 SmtUtils]: Spent 161ms on a formula simplification that was a NOOP. DAG size: 79 [2018-04-10 16:15:25,514 WARN L148 SmtUtils]: Spent 432ms on a formula simplification that was a NOOP. DAG size: 84 [2018-04-10 16:15:34,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:15:34,148 INFO L93 Difference]: Finished difference Result 307 states and 349 transitions. [2018-04-10 16:15:34,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-04-10 16:15:34,148 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 321 [2018-04-10 16:15:34,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:15:34,149 INFO L225 Difference]: With dead ends: 307 [2018-04-10 16:15:34,149 INFO L226 Difference]: Without dead ends: 307 [2018-04-10 16:15:34,151 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 236 SyntacticMatches, 1 SemanticMatches, 149 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 6396 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=737, Invalid=20749, Unknown=574, NotChecked=590, Total=22650 [2018-04-10 16:15:34,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-04-10 16:15:34,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 297. [2018-04-10 16:15:34,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-04-10 16:15:34,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 338 transitions. [2018-04-10 16:15:34,157 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 338 transitions. Word has length 321 [2018-04-10 16:15:34,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:15:34,158 INFO L459 AbstractCegarLoop]: Abstraction has 297 states and 338 transitions. [2018-04-10 16:15:34,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-04-10 16:15:34,158 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 338 transitions. [2018-04-10 16:15:34,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-04-10 16:15:34,160 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:15:34,160 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-10 16:15:34,160 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-10 16:15:34,160 INFO L82 PathProgramCache]: Analyzing trace with hash -497977668, now seen corresponding path program 17 times [2018-04-10 16:15:34,160 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:15:34,161 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:15:34,161 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:15:34,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:15:34,161 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:15:34,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:15:34,188 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:15:34,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1949 backedges. 875 proven. 111 refuted. 0 times theorem prover too weak. 963 trivial. 0 not checked. [2018-04-10 16:15:34,622 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:15:34,622 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:15:34,623 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 16:15:34,810 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-04-10 16:15:34,810 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:15:34,844 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:15:35,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1949 backedges. 884 proven. 97 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2018-04-10 16:15:35,048 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:15:35,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 33 [2018-04-10 16:15:35,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-10 16:15:35,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-10 16:15:35,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=902, Unknown=0, NotChecked=0, Total=1056 [2018-04-10 16:15:35,049 INFO L87 Difference]: Start difference. First operand 297 states and 338 transitions. Second operand 33 states. [2018-04-10 16:15:35,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:15:35,476 INFO L93 Difference]: Finished difference Result 305 states and 346 transitions. [2018-04-10 16:15:35,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-10 16:15:35,476 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 326 [2018-04-10 16:15:35,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:15:35,477 INFO L225 Difference]: With dead ends: 305 [2018-04-10 16:15:35,477 INFO L226 Difference]: Without dead ends: 305 [2018-04-10 16:15:35,477 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=415, Invalid=2237, Unknown=0, NotChecked=0, Total=2652 [2018-04-10 16:15:35,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-04-10 16:15:35,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 297. [2018-04-10 16:15:35,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-04-10 16:15:35,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 334 transitions. [2018-04-10 16:15:35,481 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 334 transitions. Word has length 326 [2018-04-10 16:15:35,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:15:35,481 INFO L459 AbstractCegarLoop]: Abstraction has 297 states and 334 transitions. [2018-04-10 16:15:35,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-10 16:15:35,481 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 334 transitions. [2018-04-10 16:15:35,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-04-10 16:15:35,483 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:15:35,484 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-10 16:15:35,484 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-10 16:15:35,484 INFO L82 PathProgramCache]: Analyzing trace with hash -2061679473, now seen corresponding path program 18 times [2018-04-10 16:15:35,484 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:15:35,484 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:15:35,485 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:15:35,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:15:35,485 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:15:35,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:15:35,524 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:15:35,545 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:15:35,545 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:15:35,545 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:15:35,546 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 16:15:35,752 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-04-10 16:15:35,753 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:15:35,768 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:15:35,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:15:35,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:35,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:15:35,780 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:15:35,790 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-10 16:15:35,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:15:35,793 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:35,795 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-10 16:15:35,795 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-10 16:15:35,808 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_429 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_429)) |c_#length|)) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_42| 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_42|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-10 16:15:35,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:15:35,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:35,818 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-10 16:15:35,819 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-10 16:15:35,821 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_42| 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_42|) (* 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_429 Int)) (and (= (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_429)) |c_#length|) (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0)))) is different from true [2018-04-10 16:15:35,834 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-10 16:15:35,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 16:15:35,851 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-10 16:15:35,851 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:29, output treesize:52 [2018-04-10 16:15:35,904 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:35,904 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:35,905 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-10 16:15:35,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:35,927 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-10 16:15:35,928 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:20 [2018-04-10 16:15:35,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:15:35,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:35,985 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-10 16:15:35,985 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:14, output treesize:13 [2018-04-10 16:15:36,092 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-10 16:15:36,094 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-10 16:15:36,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:36,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:15:36,099 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-10 16:15:36,100 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:37, output treesize:26 [2018-04-10 16:15:36,113 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:36,117 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-10 16:15:36,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 16:15:36,125 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-10 16:15:36,125 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:34 [2018-04-10 16:15:36,150 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:36,158 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-10 16:15:36,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 16:15:36,194 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-10 16:15:36,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:36,219 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-10 16:15:36,219 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:72, output treesize:91 [2018-04-10 16:15:36,290 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 16:15:36,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:36,297 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:36,297 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:36,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-10 16:15:36,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:36,302 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-10 16:15:36,302 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:59, output treesize:20 [2018-04-10 16:15:36,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:15:36,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:36,315 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-10 16:15:36,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-10 16:15:36,324 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_42| 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_42|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_443 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_443))))) is different from true [2018-04-10 16:15:36,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 6 treesize of output 5 [2018-04-10 16:15:36,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:36,331 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-10 16:15:36,331 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-10 16:15:36,332 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_42| 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_42|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_443 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_443)))))) is different from true [2018-04-10 16:15:36,347 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-10 16:15:36,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-10 16:15:36,373 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-10 16:15:36,374 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:40, output treesize:106 [2018-04-10 16:15:37,574 WARN L151 SmtUtils]: Spent 1168ms on a formula simplification. DAG size of input: 76 DAG size of output 46 [2018-04-10 16:15:37,577 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 16:15:37,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:37,587 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:37,588 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:37,588 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-10 16:15:37,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:37,596 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-10 16:15:37,596 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:70, output treesize:31 [2018-04-10 16:15:37,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:15:37,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:37,613 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-10 16:15:37,613 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-10 16:15:37,631 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_455 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_455)) |c_#length|)) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_42| 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_42|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-10 16:15:37,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:15:37,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:37,641 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-10 16:15:37,641 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-10 16:15:37,643 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_42| 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_42|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_455 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_455)) |c_#length|)))) is different from true [2018-04-10 16:15:37,658 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-10 16:15:37,658 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-10 16:15:37,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-04-10 16:15:37,687 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:40, output treesize:106 [2018-04-10 16:15:38,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:15:38,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:38,013 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:38,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-04-10 16:15:38,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:38,016 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-10 16:15:38,017 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:25, output treesize:18 [2018-04-10 16:15:38,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2018-04-10 16:15:38,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:38,173 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:38,173 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:38,175 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:38,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 67 [2018-04-10 16:15:38,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:38,262 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 51 treesize of output 63 [2018-04-10 16:15:38,262 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-04-10 16:15:38,274 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:38,275 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:38,292 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 5 case distinctions, treesize of input 53 treesize of output 84 [2018-04-10 16:15:38,293 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 8 xjuncts. [2018-04-10 16:15:38,430 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 47 treesize of output 41 [2018-04-10 16:15:38,430 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:38,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-04-10 16:15:38,530 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:38,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 4 dim-1 vars, End of recursive call: 27 dim-0 vars, and 7 xjuncts. [2018-04-10 16:15:38,615 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 15 variables, input treesize:120, output treesize:277 [2018-04-10 16:15:38,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:15:38,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:38,893 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:38,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-04-10 16:15:38,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:38,896 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-10 16:15:38,896 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:20, output treesize:13 [2018-04-10 16:15:39,109 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:39,111 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:39,111 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:39,112 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-10 16:15:39,112 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:39,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-10 16:15:39,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:15:39,148 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-10 16:15:39,148 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:45, output treesize:64 [2018-04-10 16:15:39,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1862 backedges. 561 proven. 451 refuted. 0 times theorem prover too weak. 366 trivial. 484 not checked. [2018-04-10 16:15:39,449 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:15:39,450 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-04-10 16:15:39,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-04-10 16:15:39,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-04-10 16:15:39,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1448, Unknown=10, NotChecked=588, Total=2256 [2018-04-10 16:15:39,450 INFO L87 Difference]: Start difference. First operand 297 states and 334 transitions. Second operand 48 states. [2018-04-10 16:15:42,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:15:42,499 INFO L93 Difference]: Finished difference Result 313 states and 353 transitions. [2018-04-10 16:15:42,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-04-10 16:15:42,500 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 321 [2018-04-10 16:15:42,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:15:42,501 INFO L225 Difference]: With dead ends: 313 [2018-04-10 16:15:42,501 INFO L226 Difference]: Without dead ends: 313 [2018-04-10 16:15:42,501 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 267 SyntacticMatches, 27 SemanticMatches, 85 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2883 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=722, Invalid=5609, Unknown=17, NotChecked=1134, Total=7482 [2018-04-10 16:15:42,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-04-10 16:15:42,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 304. [2018-04-10 16:15:42,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-04-10 16:15:42,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 344 transitions. [2018-04-10 16:15:42,505 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 344 transitions. Word has length 321 [2018-04-10 16:15:42,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:15:42,506 INFO L459 AbstractCegarLoop]: Abstraction has 304 states and 344 transitions. [2018-04-10 16:15:42,506 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-04-10 16:15:42,506 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 344 transitions. [2018-04-10 16:15:42,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-04-10 16:15:42,507 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:15:42,507 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-10 16:15:42,507 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-10 16:15:42,507 INFO L82 PathProgramCache]: Analyzing trace with hash 558312820, now seen corresponding path program 19 times [2018-04-10 16:15:42,507 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:15:42,507 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:15:42,508 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:15:42,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:15:42,508 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:15:42,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:15:42,526 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:15:42,832 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-10 16:15:42,832 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:15:42,833 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:15:42,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:15:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:15:42,872 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:15:43,012 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-10 16:15:43,012 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:15:43,012 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2018-04-10 16:15:43,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-10 16:15:43,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-10 16:15:43,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=636, Unknown=0, NotChecked=0, Total=756 [2018-04-10 16:15:43,013 INFO L87 Difference]: Start difference. First operand 304 states and 344 transitions. Second operand 28 states. [2018-04-10 16:15:43,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:15:43,324 INFO L93 Difference]: Finished difference Result 291 states and 322 transitions. [2018-04-10 16:15:43,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-10 16:15:43,325 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 332 [2018-04-10 16:15:43,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:15:43,326 INFO L225 Difference]: With dead ends: 291 [2018-04-10 16:15:43,326 INFO L226 Difference]: Without dead ends: 291 [2018-04-10 16:15:43,326 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=212, Invalid=978, Unknown=0, NotChecked=0, Total=1190 [2018-04-10 16:15:43,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-04-10 16:15:43,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 289. [2018-04-10 16:15:43,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-04-10 16:15:43,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 318 transitions. [2018-04-10 16:15:43,329 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 318 transitions. Word has length 332 [2018-04-10 16:15:43,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:15:43,329 INFO L459 AbstractCegarLoop]: Abstraction has 289 states and 318 transitions. [2018-04-10 16:15:43,329 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-10 16:15:43,329 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 318 transitions. [2018-04-10 16:15:43,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-04-10 16:15:43,331 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:15:43,331 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-10 16:15:43,331 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-10 16:15:43,331 INFO L82 PathProgramCache]: Analyzing trace with hash -130067974, now seen corresponding path program 2 times [2018-04-10 16:15:43,331 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:15:43,331 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:15:43,332 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:15:43,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:15:43,332 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:15:43,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:15:43,348 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:15:43,463 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-10 16:15:43,463 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:15:43,463 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:15:43,463 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:15:43,484 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:15:43,484 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:15:43,487 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:15:43,531 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-10 16:15:43,532 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:15:43,532 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-04-10 16:15:43,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 16:15:43,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 16:15:43,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-04-10 16:15:43,532 INFO L87 Difference]: Start difference. First operand 289 states and 318 transitions. Second operand 10 states. [2018-04-10 16:15:43,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:15:43,578 INFO L93 Difference]: Finished difference Result 299 states and 330 transitions. [2018-04-10 16:15:43,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 16:15:43,579 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 334 [2018-04-10 16:15:43,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:15:43,580 INFO L225 Difference]: With dead ends: 299 [2018-04-10 16:15:43,580 INFO L226 Difference]: Without dead ends: 299 [2018-04-10 16:15:43,580 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-10 16:15:43,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-04-10 16:15:43,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 293. [2018-04-10 16:15:43,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-04-10 16:15:43,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 322 transitions. [2018-04-10 16:15:43,584 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 322 transitions. Word has length 334 [2018-04-10 16:15:43,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:15:43,584 INFO L459 AbstractCegarLoop]: Abstraction has 293 states and 322 transitions. [2018-04-10 16:15:43,584 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 16:15:43,584 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 322 transitions. [2018-04-10 16:15:43,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2018-04-10 16:15:43,586 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:15:43,586 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-10 16:15:43,586 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-10 16:15:43,586 INFO L82 PathProgramCache]: Analyzing trace with hash 916267843, now seen corresponding path program 20 times [2018-04-10 16:15:43,586 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:15:43,587 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:15:43,587 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:15:43,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:15:43,587 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:15:43,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:15:43,607 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:15:43,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-10 16:15:43,971 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:15:43,972 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:15:43,972 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:15:44,011 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:15:44,012 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:15:44,020 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:15:44,192 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-10 16:15:44,192 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:15:44,193 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 27 [2018-04-10 16:15:44,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-10 16:15:44,193 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-10 16:15:44,193 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=567, Unknown=0, NotChecked=0, Total=702 [2018-04-10 16:15:44,194 INFO L87 Difference]: Start difference. First operand 293 states and 322 transitions. Second operand 27 states. [2018-04-10 16:15:44,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:15:44,938 INFO L93 Difference]: Finished difference Result 301 states and 330 transitions. [2018-04-10 16:15:44,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-10 16:15:44,938 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 401 [2018-04-10 16:15:44,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:15:44,939 INFO L225 Difference]: With dead ends: 301 [2018-04-10 16:15:44,939 INFO L226 Difference]: Without dead ends: 301 [2018-04-10 16:15:44,939 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-10 16:15:44,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-04-10 16:15:44,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 297. [2018-04-10 16:15:44,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-04-10 16:15:44,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 326 transitions. [2018-04-10 16:15:44,944 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 326 transitions. Word has length 401 [2018-04-10 16:15:44,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:15:44,944 INFO L459 AbstractCegarLoop]: Abstraction has 297 states and 326 transitions. [2018-04-10 16:15:44,944 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-10 16:15:44,944 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 326 transitions. [2018-04-10 16:15:44,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2018-04-10 16:15:44,947 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:15:44,947 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-10 16:15:44,947 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-10 16:15:44,947 INFO L82 PathProgramCache]: Analyzing trace with hash 2091701869, now seen corresponding path program 21 times [2018-04-10 16:15:44,947 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:15:44,947 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:15:44,948 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:15:44,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:15:44,948 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:15:44,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:15:44,967 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:15:45,412 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-10 16:15:45,412 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:15:45,412 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:15:45,413 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 16:15:45,502 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-04-10 16:15:45,502 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:15:45,516 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:15:45,752 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-10 16:15:45,752 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:15:45,752 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 35 [2018-04-10 16:15:45,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-10 16:15:45,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-10 16:15:45,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1022, Unknown=0, NotChecked=0, Total=1190 [2018-04-10 16:15:45,753 INFO L87 Difference]: Start difference. First operand 297 states and 326 transitions. Second operand 35 states. [2018-04-10 16:15:46,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:15:46,708 INFO L93 Difference]: Finished difference Result 308 states and 337 transitions. [2018-04-10 16:15:46,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-10 16:15:46,708 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 407 [2018-04-10 16:15:46,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:15:46,709 INFO L225 Difference]: With dead ends: 308 [2018-04-10 16:15:46,709 INFO L226 Difference]: Without dead ends: 300 [2018-04-10 16:15:46,710 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-10 16:15:46,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-04-10 16:15:46,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 297. [2018-04-10 16:15:46,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-04-10 16:15:46,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 325 transitions. [2018-04-10 16:15:46,714 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 325 transitions. Word has length 407 [2018-04-10 16:15:46,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:15:46,715 INFO L459 AbstractCegarLoop]: Abstraction has 297 states and 325 transitions. [2018-04-10 16:15:46,715 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-10 16:15:46,715 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 325 transitions. [2018-04-10 16:15:46,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-04-10 16:15:46,717 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:15:46,718 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-10 16:15:46,718 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-10 16:15:46,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1988970696, now seen corresponding path program 22 times [2018-04-10 16:15:46,718 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:15:46,718 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:15:46,719 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:15:46,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:15:46,719 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:15:46,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:15:46,771 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:15:46,793 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:15:46,793 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:15:46,793 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:15:46,794 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 16:15:47,303 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 16:15:47,303 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:15:47,320 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:15:47,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:15:47,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:47,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:15:47,326 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:15:47,350 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-10 16:15:47,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:15:47,352 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:47,353 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-10 16:15:47,353 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-10 16:15:47,361 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_492 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_492)))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_48| 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_48|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-10 16:15:47,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:15:47,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:47,368 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-10 16:15:47,369 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-10 16:15:47,370 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_48| 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_48|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_492 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_492)))))) is different from true [2018-04-10 16:15:47,379 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-10 16:15:47,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 16:15:47,393 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-10 16:15:47,393 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:58 [2018-04-10 16:15:47,429 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:47,430 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:47,430 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-10 16:15:47,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:47,445 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-10 16:15:47,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:68, output treesize:30 [2018-04-10 16:15:47,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:15:47,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:47,476 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-10 16:15:47,476 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-10 16:15:47,487 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_48| 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_48|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_497 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_497)) |c_#length|))) is different from true [2018-04-10 16:15:47,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 6 treesize of output 5 [2018-04-10 16:15:47,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:47,493 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-10 16:15:47,494 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-10 16:15:47,495 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_48| 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_48|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_497 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_497)) |c_#length|)))) is different from true [2018-04-10 16:15:47,531 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-10 16:15:47,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-10 16:15:47,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-10 16:15:47,567 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:50, output treesize:136 [2018-04-10 16:15:47,632 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 16:15:47,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:47,642 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:47,642 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:47,643 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-10 16:15:47,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:47,649 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-10 16:15:47,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:83, output treesize:30 [2018-04-10 16:15:47,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:15:47,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:47,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-10 16:15:47,682 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-10 16:15:47,694 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_509 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_509)))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_48| 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_48|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-10 16:15:47,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:15:47,699 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:47,705 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-10 16:15:47,705 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-10 16:15:47,707 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_48| 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_48|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_509 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_509)))))) is different from true [2018-04-10 16:15:47,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 32 [2018-04-10 16:15:47,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-10 16:15:47,756 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-10 16:15:47,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:50, output treesize:136 [2018-04-10 16:15:47,836 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 16:15:47,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:47,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:47,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:47,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-10 16:15:47,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:47,851 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-10 16:15:47,851 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:83, output treesize:30 [2018-04-10 16:15:47,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 8 treesize of output 7 [2018-04-10 16:15:47,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:47,883 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-10 16:15:47,883 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-10 16:15:47,893 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_521 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_521)) |c_#length|)) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_48| 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_48|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-10 16:15:47,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 6 treesize of output 5 [2018-04-10 16:15:47,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:47,899 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-10 16:15:47,899 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-10 16:15:47,900 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_48| 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_48|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_521 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_521)) |c_#length|)))) is different from true [2018-04-10 16:15:47,915 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-10 16:15:47,915 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-10 16:15:47,942 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-10 16:15:47,942 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:50, output treesize:136 [2018-04-10 16:15:48,026 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:48,027 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-10 16:15:48,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:48,044 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-10 16:15:48,044 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:83, output treesize:30 [2018-04-10 16:15:48,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:15:48,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:48,087 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-10 16:15:48,087 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-10 16:15:48,097 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_48| 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_48|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_533 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_533))))) is different from true [2018-04-10 16:15:48,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:15:48,099 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:48,104 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-10 16:15:48,104 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-10 16:15:48,106 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_48| 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_48|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_533 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_533)))))) is different from true [2018-04-10 16:15:48,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 21 treesize of output 32 [2018-04-10 16:15:48,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-10 16:15:48,151 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-10 16:15:48,151 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:50, output treesize:136 [2018-04-10 16:15:48,514 WARN L151 SmtUtils]: Spent 332ms on a formula simplification. DAG size of input: 82 DAG size of output 45 [2018-04-10 16:15:48,518 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:48,518 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-10 16:15:48,518 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:48,534 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-10 16:15:48,535 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:83, output treesize:30 [2018-04-10 16:15:48,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:15:48,582 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:48,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-10 16:15:48,583 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-10 16:15:48,599 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_48| 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_48|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_545 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_545)) |c_#length|))) is different from true [2018-04-10 16:15:48,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 6 treesize of output 5 [2018-04-10 16:15:48,601 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:48,606 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-10 16:15:48,606 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-10 16:15:48,608 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 (= (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_545)) |c_#length|))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_48| 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_48|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-10 16:15:48,624 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-10 16:15:48,625 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-10 16:15:48,661 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-10 16:15:48,661 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:50, output treesize:136 [2018-04-10 16:15:48,900 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-10 16:15:48,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:15:48,911 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:48,914 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-10 16:15:48,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:48,915 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-10 16:15:48,915 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-04-10 16:15:48,928 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_556 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_556))) (<= (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_48| 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_48|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-10 16:15:48,934 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:48,934 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:48,947 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-10 16:15:48,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 16:15:48,976 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:48,976 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:48,978 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:48,978 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:48,982 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-10 16:15:48,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:15:49,008 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-10 16:15:49,008 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:56, output treesize:86 [2018-04-10 16:15:49,372 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-10 16:15:49,373 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:15:49,373 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-04-10 16:15:49,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-10 16:15:49,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-10 16:15:49,374 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=404, Unknown=15, NotChecked=810, Total=1332 [2018-04-10 16:15:49,374 INFO L87 Difference]: Start difference. First operand 297 states and 325 transitions. Second operand 37 states. [2018-04-10 16:15:49,459 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_48| 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_48|) (* 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))) (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-10 16:15:49,461 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-10 16:15:49,482 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_492 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_492)))) (exists ((v_prenex_521 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_521)) |c_#length|)) (exists ((v_prenex_509 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_509)))) (exists ((v_prenex_556 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_556))) (<= (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_48| 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_48|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_497 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_497)) |c_#length|)) (exists ((v_prenex_533 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_533)))) (exists ((v_prenex_545 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_545)) |c_#length|))) is different from true [2018-04-10 16:15:49,484 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_492 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_492)))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_48| 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_48|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_497 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_497)) |c_#length|))) is different from true [2018-04-10 16:15:49,486 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_48| 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_48|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_497 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_497)) |c_#length|))) (exists ((v_prenex_492 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_492)))))) is different from true [2018-04-10 16:15:49,761 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_521 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_521)) |c_#length|)) (exists ((v_prenex_509 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_509)))) (exists ((v_prenex_556 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_556))) (<= (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_48| 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_48|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_533 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_533)))) (exists ((v_prenex_545 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_545)) |c_#length|))) is different from true [2018-04-10 16:15:49,764 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 (= (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_545)) |c_#length|))) (exists ((v_prenex_556 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_556))) (<= (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_48| 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_48|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_509 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_509))))) (exists ((v_prenex_521 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_521)) |c_#length|))) (exists ((v_prenex_533 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_533)))))) is different from true [2018-04-10 16:15:50,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:15:50,227 INFO L93 Difference]: Finished difference Result 325 states and 360 transitions. [2018-04-10 16:15:50,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-10 16:15:50,227 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 412 [2018-04-10 16:15:50,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:15:50,228 INFO L225 Difference]: With dead ends: 325 [2018-04-10 16:15:50,228 INFO L226 Difference]: Without dead ends: 325 [2018-04-10 16:15:50,229 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 366 SyntacticMatches, 10 SemanticMatches, 50 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=167, Invalid=769, Unknown=22, NotChecked=1694, Total=2652 [2018-04-10 16:15:50,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-04-10 16:15:50,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 308. [2018-04-10 16:15:50,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-04-10 16:15:50,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 340 transitions. [2018-04-10 16:15:50,232 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 340 transitions. Word has length 412 [2018-04-10 16:15:50,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:15:50,232 INFO L459 AbstractCegarLoop]: Abstraction has 308 states and 340 transitions. [2018-04-10 16:15:50,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-10 16:15:50,232 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 340 transitions. [2018-04-10 16:15:50,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-04-10 16:15:50,233 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:15:50,234 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-10 16:15:50,234 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-10 16:15:50,234 INFO L82 PathProgramCache]: Analyzing trace with hash 762198363, now seen corresponding path program 23 times [2018-04-10 16:15:50,234 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:15:50,234 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:15:50,234 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:15:50,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:15:50,235 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:15:50,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:15:50,266 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:15:50,285 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:15:50,285 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:15:50,285 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:15:50,285 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 16:15:50,635 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-04-10 16:15:50,636 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:15:50,699 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:15:50,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:15:50,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:50,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:15:50,704 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:15:50,711 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-10 16:15:50,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:15:50,713 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:50,714 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-10 16:15:50,714 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-10 16:15:50,722 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_561 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_561))) (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-10 16:15:50,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 6 treesize of output 5 [2018-04-10 16:15:50,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:50,729 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-10 16:15:50,729 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-10 16:15:50,731 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_561 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_561)))) is different from true [2018-04-10 16:15:50,758 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-10 16:15:50,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 16:15:50,777 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-10 16:15:50,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:29, output treesize:52 [2018-04-10 16:15:50,808 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:50,809 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:50,809 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-10 16:15:50,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:50,822 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-10 16:15:50,822 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:20 [2018-04-10 16:15:50,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:15:50,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:50,958 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-10 16:15:50,958 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:14, output treesize:13 [2018-04-10 16:15:51,004 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:51,008 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-10 16:15:51,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 16:15:51,018 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-10 16:15:51,018 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:46 [2018-04-10 16:15:51,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, 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-10 16:15:51,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:51,076 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:51,084 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-10 16:15:51,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:15:51,130 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-10 16:15:51,130 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:84, output treesize:109 [2018-04-10 16:15:51,214 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 16:15:51,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:51,222 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:51,222 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:51,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, 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-10 16:15:51,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:51,229 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-10 16:15:51,229 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:71, output treesize:26 [2018-04-10 16:15:51,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:15:51,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:51,318 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-10 16:15:51,318 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:14, output treesize:13 [2018-04-10 16:15:51,382 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:51,386 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-10 16:15:51,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 16:15:51,394 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-10 16:15:51,394 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:40 [2018-04-10 16:15:51,440 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:51,448 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-10 16:15:51,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 16:15:51,495 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-10 16:15:51,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:51,532 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-10 16:15:51,532 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:84, output treesize:109 [2018-04-10 16:15:51,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:15:51,741 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:51,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 16:15:51,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:51,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:15:51,745 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-04-10 16:15:51,753 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_583 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_583)))) is different from true [2018-04-10 16:15:51,758 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:51,759 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:51,766 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-10 16:15:51,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 16:15:51,789 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:51,789 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:51,790 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:51,791 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-10 16:15:51,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:51,806 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-10 16:15:51,806 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:52, output treesize:78 [2018-04-10 16:15:51,942 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-10 16:15:51,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:15:51,949 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:51,953 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-10 16:15:51,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:51,954 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-10 16:15:51,954 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-04-10 16:15:51,967 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_589 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_589)))) is different from true [2018-04-10 16:15:51,972 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:51,981 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-10 16:15:51,981 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 16:15:52,007 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:52,008 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:52,008 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-10 16:15:52,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:52,027 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-10 16:15:52,027 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:51, output treesize:78 [2018-04-10 16:15:52,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:15:52,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:52,281 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-10 16:15:52,282 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:14, output treesize:13 [2018-04-10 16:15:52,342 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:52,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 16:15:52,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 16:15:52,354 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-10 16:15:52,354 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:30, output treesize:54 [2018-04-10 16:15:52,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 0 case distinctions, treesize of input 49 treesize of output 43 [2018-04-10 16:15:52,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:52,435 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:52,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 61 [2018-04-10 16:15:52,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:15:52,489 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-10 16:15:52,489 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:104, output treesize:139 [2018-04-10 16:15:52,763 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-10 16:15:52,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:15:52,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:52,777 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-10 16:15:52,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:52,778 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-10 16:15:52,778 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-04-10 16:15:52,795 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_604 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54|) (* 4 v_prenex_604))) (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-10 16:15:52,801 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:52,802 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:52,802 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:52,804 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:15:52,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 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-10 16:15:52,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 16:15:52,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-10 16:15:52,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:15:52,857 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-10 16:15:52,857 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:62, output treesize:98 [2018-04-10 16:15:53,357 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-10 16:15:53,358 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:15:53,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-04-10 16:15:53,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-04-10 16:15:53,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-04-10 16:15:53,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1706, Unknown=12, NotChecked=728, Total=2652 [2018-04-10 16:15:53,359 INFO L87 Difference]: Start difference. First operand 308 states and 340 transitions. Second operand 52 states. [2018-04-10 16:15:53,876 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_561 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_561))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54| Int) (v_prenex_604 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54|) (* 4 v_prenex_604))) (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_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-10 16:15:53,879 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_561 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_561))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54| Int) (v_prenex_604 Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_54|) (* 4 v_prenex_604))) (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-10 16:15:56,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:15:56,418 INFO L93 Difference]: Finished difference Result 313 states and 347 transitions. [2018-04-10 16:15:56,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-10 16:15:56,418 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 412 [2018-04-10 16:15:56,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:15:56,419 INFO L225 Difference]: With dead ends: 313 [2018-04-10 16:15:56,419 INFO L226 Difference]: Without dead ends: 313 [2018-04-10 16:15:56,420 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 353 SyntacticMatches, 13 SemanticMatches, 80 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 1750 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=527, Invalid=4608, Unknown=17, NotChecked=1490, Total=6642 [2018-04-10 16:15:56,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-04-10 16:15:56,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 300. [2018-04-10 16:15:56,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-04-10 16:15:56,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 329 transitions. [2018-04-10 16:15:56,424 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 329 transitions. Word has length 412 [2018-04-10 16:15:56,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:15:56,425 INFO L459 AbstractCegarLoop]: Abstraction has 300 states and 329 transitions. [2018-04-10 16:15:56,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-04-10 16:15:56,425 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 329 transitions. [2018-04-10 16:15:56,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2018-04-10 16:15:56,427 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:15:56,428 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-10 16:15:56,428 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-10 16:15:56,428 INFO L82 PathProgramCache]: Analyzing trace with hash 547358382, now seen corresponding path program 3 times [2018-04-10 16:15:56,428 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:15:56,428 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:15:56,429 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:15:56,429 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:15:56,429 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:15:56,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:15:56,458 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:15:56,694 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-10 16:15:56,694 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:15:56,695 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:15:56,695 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 16:15:56,791 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-04-10 16:15:56,792 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:15:56,813 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:15:57,068 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-10 16:15:57,068 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:15:57,069 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 19] total 24 [2018-04-10 16:15:57,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-10 16:15:57,069 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-10 16:15:57,069 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2018-04-10 16:15:57,069 INFO L87 Difference]: Start difference. First operand 300 states and 329 transitions. Second operand 24 states. [2018-04-10 16:15:57,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:15:57,526 INFO L93 Difference]: Finished difference Result 402 states and 447 transitions. [2018-04-10 16:15:57,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-10 16:15:57,527 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 425 [2018-04-10 16:15:57,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:15:57,529 INFO L225 Difference]: With dead ends: 402 [2018-04-10 16:15:57,529 INFO L226 Difference]: Without dead ends: 399 [2018-04-10 16:15:57,529 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 412 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=401, Invalid=1669, Unknown=0, NotChecked=0, Total=2070 [2018-04-10 16:15:57,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-04-10 16:15:57,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 386. [2018-04-10 16:15:57,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-04-10 16:15:57,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 420 transitions. [2018-04-10 16:15:57,536 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 420 transitions. Word has length 425 [2018-04-10 16:15:57,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:15:57,536 INFO L459 AbstractCegarLoop]: Abstraction has 386 states and 420 transitions. [2018-04-10 16:15:57,536 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-10 16:15:57,536 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 420 transitions. [2018-04-10 16:15:57,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2018-04-10 16:15:57,539 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:15:57,539 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-10 16:15:57,540 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-10 16:15:57,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1369932012, now seen corresponding path program 24 times [2018-04-10 16:15:57,540 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:15:57,540 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:15:57,540 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:15:57,541 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:15:57,541 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:15:57,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:15:57,579 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:15:58,068 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-10 16:15:58,069 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:15:58,069 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:15:58,069 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 16:15:58,412 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-04-10 16:15:58,413 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:15:58,428 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:15:58,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:15:58,454 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:58,458 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-10 16:15:58,458 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-04-10 16:15:58,591 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-10 16:15:58,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:15:58,594 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-10 16:15:58,594 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:23, output treesize:3 [2018-04-10 16:15:58,811 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-10 16:15:58,811 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:15:58,812 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 37 [2018-04-10 16:15:58,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-10 16:15:58,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-10 16:15:58,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1141, Unknown=0, NotChecked=0, Total=1332 [2018-04-10 16:15:58,812 INFO L87 Difference]: Start difference. First operand 386 states and 420 transitions. Second operand 37 states. [2018-04-10 16:16:01,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:16:01,076 INFO L93 Difference]: Finished difference Result 481 states and 528 transitions. [2018-04-10 16:16:01,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-04-10 16:16:01,076 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 503 [2018-04-10 16:16:01,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:16:01,078 INFO L225 Difference]: With dead ends: 481 [2018-04-10 16:16:01,078 INFO L226 Difference]: Without dead ends: 457 [2018-04-10 16:16:01,078 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 584 GetRequests, 490 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2524 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1503, Invalid=7617, Unknown=0, NotChecked=0, Total=9120 [2018-04-10 16:16:01,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-04-10 16:16:01,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 430. [2018-04-10 16:16:01,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-04-10 16:16:01,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 466 transitions. [2018-04-10 16:16:01,082 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 466 transitions. Word has length 503 [2018-04-10 16:16:01,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:16:01,082 INFO L459 AbstractCegarLoop]: Abstraction has 430 states and 466 transitions. [2018-04-10 16:16:01,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-10 16:16:01,082 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 466 transitions. [2018-04-10 16:16:01,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2018-04-10 16:16:01,083 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:16:01,084 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-10 16:16:01,084 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-10 16:16:01,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1969617026, now seen corresponding path program 25 times [2018-04-10 16:16:01,084 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:16:01,084 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:16:01,084 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:16:01,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:16:01,084 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:16:01,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:16:01,120 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:16:01,216 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:16:01,217 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:16:01,217 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:16:01,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:16:01,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:16:01,253 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:16:01,437 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-10 16:16:01,438 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:16:01,438 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-10 16:16:01,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-10 16:16:01,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-10 16:16:01,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2018-04-10 16:16:01,438 INFO L87 Difference]: Start difference. First operand 430 states and 466 transitions. Second operand 18 states. [2018-04-10 16:16:01,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:16:01,696 INFO L93 Difference]: Finished difference Result 471 states and 514 transitions. [2018-04-10 16:16:01,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-10 16:16:01,696 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 509 [2018-04-10 16:16:01,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:16:01,698 INFO L225 Difference]: With dead ends: 471 [2018-04-10 16:16:01,698 INFO L226 Difference]: Without dead ends: 471 [2018-04-10 16:16:01,698 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-10 16:16:01,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2018-04-10 16:16:01,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 453. [2018-04-10 16:16:01,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2018-04-10 16:16:01,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 493 transitions. [2018-04-10 16:16:01,702 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 493 transitions. Word has length 509 [2018-04-10 16:16:01,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:16:01,702 INFO L459 AbstractCegarLoop]: Abstraction has 453 states and 493 transitions. [2018-04-10 16:16:01,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-10 16:16:01,702 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 493 transitions. [2018-04-10 16:16:01,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2018-04-10 16:16:01,705 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:16:01,705 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-10 16:16:01,705 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-10 16:16:01,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1813881472, now seen corresponding path program 26 times [2018-04-10 16:16:01,705 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:16:01,705 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:16:01,706 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:16:01,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:16:01,706 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:16:01,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:16:01,744 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:16:01,828 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:16:01,828 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:16:01,828 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:16:01,828 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:16:01,913 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:16:01,913 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:16:01,928 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:16:01,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 6 treesize of output 5 [2018-04-10 16:16:01,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:02,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:16:02,058 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:16:02,133 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-10 16:16:02,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:16:02,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:02,173 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-10 16:16:02,173 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-10 16:16:02,184 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_610 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_610)))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_58| 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_58|)))) is different from true [2018-04-10 16:16:02,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:16:02,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:02,195 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-10 16:16:02,195 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-10 16:16:02,198 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_610 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_610))))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_58| 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_58|)))) is different from true [2018-04-10 16:16:02,210 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-10 16:16:02,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 16:16:02,229 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-10 16:16:02,229 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:58 [2018-04-10 16:16:02,343 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 42 DAG size of output 30 [2018-04-10 16:16:02,346 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 16:16:02,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:02,357 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:02,375 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:02,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-10 16:16:02,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:02,384 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-10 16:16:02,384 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:54, output treesize:23 [2018-04-10 16:16:02,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-10 16:16:02,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:02,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:16:02,446 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-10 16:16:02,461 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_615 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_615)))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_58| 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_58|)))) is different from true [2018-04-10 16:16:02,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 6 treesize of output 5 [2018-04-10 16:16:02,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:02,472 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-10 16:16:02,472 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-10 16:16:02,474 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_58| 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_58|))) (exists ((v_prenex_615 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_615)))))) is different from true [2018-04-10 16:16:02,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-10 16:16:02,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-10 16:16:02,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-10 16:16:02,567 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-04-10 16:16:02,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:02,627 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-10 16:16:02,627 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:02,642 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-10 16:16:02,642 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:69, output treesize:23 [2018-04-10 16:16:02,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:16:02,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:02,686 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-10 16:16:02,687 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-10 16:16:02,696 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_58| 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_58|))) (exists ((v_prenex_627 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_627)) |c_#length|))) is different from true [2018-04-10 16:16:02,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-10 16:16:02,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:02,703 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-10 16:16:02,703 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-10 16:16:02,705 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_58| 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_58|))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (v_prenex_627 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_627)) |c_#length|)))) is different from true [2018-04-10 16:16:02,721 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-10 16:16:02,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-10 16:16:02,750 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-10 16:16:02,750 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-04-10 16:16:02,819 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:02,819 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-10 16:16:02,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:02,833 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-10 16:16:02,833 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:69, output treesize:23 [2018-04-10 16:16:02,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:16:02,873 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:02,874 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-10 16:16:02,874 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-10 16:16:02,883 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_58| 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_58|))) (exists ((v_prenex_639 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_639))))) is different from true [2018-04-10 16:16:02,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-10 16:16:02,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:02,890 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-10 16:16:02,890 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-10 16:16:02,892 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_58| 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_58|))) (exists ((v_prenex_639 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_639)))))) is different from true [2018-04-10 16:16:02,908 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-10 16:16:02,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-10 16:16:02,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-04-10 16:16:02,934 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-04-10 16:16:03,015 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 16:16:03,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:03,022 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:03,023 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:03,023 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-10 16:16:03,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:03,028 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-10 16:16:03,028 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:69, output treesize:23 [2018-04-10 16:16:03,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 8 treesize of output 7 [2018-04-10 16:16:03,079 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:03,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:16:03,081 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-10 16:16:03,094 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_651 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_651)) |c_#length|)) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_58| 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_58|)))) is different from true [2018-04-10 16:16:03,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:16:03,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:03,102 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-10 16:16:03,102 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-10 16:16:03,104 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_58| 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_58|))) (exists ((v_prenex_651 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_651)) |c_#length|)))) is different from true [2018-04-10 16:16:03,119 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-10 16:16:03,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-10 16:16:03,147 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-10 16:16:03,147 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-04-10 16:16:03,226 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:03,227 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-10 16:16:03,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:03,247 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-10 16:16:03,247 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:69, output treesize:23 [2018-04-10 16:16:03,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:16:03,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:03,311 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-10 16:16:03,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-10 16:16:03,325 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_58| 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_58|))) (exists ((v_prenex_663 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_663))))) is different from true [2018-04-10 16:16:03,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 6 treesize of output 5 [2018-04-10 16:16:03,328 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:03,333 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-10 16:16:03,333 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-10 16:16:03,335 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_58| 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_58|))) (exists ((v_prenex_663 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_663)))))) is different from true [2018-04-10 16:16:03,352 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-10 16:16:03,352 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-10 16:16:03,381 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-10 16:16:03,381 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-04-10 16:16:03,476 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:03,477 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:03,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-10 16:16:03,477 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:03,494 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-10 16:16:03,494 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:76, output treesize:34 [2018-04-10 16:16:03,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:16:03,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:03,557 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-10 16:16:03,557 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-04-10 16:16:03,572 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_58| 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_58|))) (exists ((v_prenex_675 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_675))))) is different from true [2018-04-10 16:16:03,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:16:03,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:03,577 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-10 16:16:03,577 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-04-10 16:16:03,579 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_675 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_675))))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_58| 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_58|)))) is different from true [2018-04-10 16:16:03,591 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-10 16:16:03,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-10 16:16:03,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-04-10 16:16:03,617 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:115 [2018-04-10 16:16:03,795 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-10 16:16:03,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 8 treesize of output 7 [2018-04-10 16:16:03,807 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:03,811 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-10 16:16:03,811 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:03,812 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-10 16:16:03,812 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-04-10 16:16:03,825 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_58| 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_58|))) (exists ((v_prenex_686 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|)) (= (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_686)) |c_#length|)))) is different from true [2018-04-10 16:16:03,830 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:03,831 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:03,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-10 16:16:03,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 16:16:03,886 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:03,887 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:03,889 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:03,889 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-10 16:16:03,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:03,910 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-10 16:16:03,910 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:56, output treesize:86 [2018-04-10 16:16:04,441 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-10 16:16:04,441 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:16:04,441 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-04-10 16:16:04,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-10 16:16:04,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-10 16:16:04,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=453, Unknown=17, NotChecked=1020, Total=1640 [2018-04-10 16:16:04,442 INFO L87 Difference]: Start difference. First operand 453 states and 493 transitions. Second operand 41 states. [2018-04-10 16:16:04,539 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_58| 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_58|))) (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-10 16:16:04,540 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-10 16:16:04,564 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_651 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_651)) |c_#length|)) (exists ((v_prenex_615 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_615)))) (exists ((v_prenex_610 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_610)))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_58| 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_58|))) (exists ((v_prenex_675 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_675)))) (exists ((v_prenex_639 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_639)))) (exists ((v_prenex_627 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_627)) |c_#length|)) (exists ((v_prenex_663 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_663)))) (exists ((v_prenex_686 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|)) (= (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_686)) |c_#length|)))) is different from true [2018-04-10 16:16:04,566 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_651 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_651)) |c_#length|)) (exists ((v_prenex_615 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_615)))) (exists ((v_prenex_610 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_610)))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_58| 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_58|)))) is different from true [2018-04-10 16:16:04,568 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_610 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_610))))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_58| 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_58|))) (exists ((v_prenex_615 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_615))))) (exists ((v_prenex_651 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_651)) |c_#length|)))) is different from true [2018-04-10 16:16:04,793 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_58| 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_58|))) (exists ((v_prenex_675 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_675)))) (exists ((v_prenex_639 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_639)))) (exists ((v_prenex_627 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_627)) |c_#length|)) (exists ((v_prenex_663 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_663)))) (exists ((v_prenex_686 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|)) (= (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_686)) |c_#length|)))) is different from true [2018-04-10 16:16:04,796 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_675 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_675))))) (exists ((|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_58| 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_58|))) (exists ((v_prenex_639 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_639))))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (v_prenex_627 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_627)) |c_#length|))) (exists ((v_prenex_686 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|)) (= (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_686)) |c_#length|))) (exists ((v_prenex_663 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_663)))))) is different from true [2018-04-10 16:16:07,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:16:07,665 INFO L93 Difference]: Finished difference Result 551 states and 623 transitions. [2018-04-10 16:16:07,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-10 16:16:07,665 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 514 [2018-04-10 16:16:07,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:16:07,667 INFO L225 Difference]: With dead ends: 551 [2018-04-10 16:16:07,667 INFO L226 Difference]: Without dead ends: 551 [2018-04-10 16:16:07,667 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 462 SyntacticMatches, 16 SemanticMatches, 61 ConstructedPredicates, 24 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=396, Invalid=1157, Unknown=25, NotChecked=2328, Total=3906 [2018-04-10 16:16:07,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2018-04-10 16:16:07,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 482. [2018-04-10 16:16:07,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2018-04-10 16:16:07,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 533 transitions. [2018-04-10 16:16:07,672 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 533 transitions. Word has length 514 [2018-04-10 16:16:07,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:16:07,672 INFO L459 AbstractCegarLoop]: Abstraction has 482 states and 533 transitions. [2018-04-10 16:16:07,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-10 16:16:07,672 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 533 transitions. [2018-04-10 16:16:07,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2018-04-10 16:16:07,674 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:16:07,674 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-10 16:16:07,674 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-10 16:16:07,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1812016317, now seen corresponding path program 27 times [2018-04-10 16:16:07,674 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:16:07,675 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:16:07,675 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:16:07,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:16:07,675 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:16:07,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:16:07,711 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:16:07,795 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:16:07,795 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:16:07,795 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:16:07,796 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 16:16:08,581 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-04-10 16:16:08,581 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:16:08,611 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:16:08,661 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-10 16:16:08,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 12 treesize of output 11 [2018-04-10 16:16:08,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:08,663 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:16:08,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:16:08,666 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:26 [2018-04-10 16:16:08,703 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__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 (select |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) |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-10 16:16:08,706 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1 Int) (v_prenex_691 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|) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset| v_prenex_691) (+ (* 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-10 16:16:08,710 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-10 16:16:08,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-04-10 16:16:08,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 27 [2018-04-10 16:16:08,717 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 16:16:08,730 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:16:08,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:16:08,742 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-10 16:16:08,742 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:18, output treesize:1 [2018-04-10 16:16:08,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:16:08,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:08,749 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-10 16:16:08,749 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:25, output treesize:24 [2018-04-10 16:16:08,751 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1 Int) (v_prenex_691 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|) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset| v_prenex_691) (+ (* 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-10 16:16:08,771 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-10 16:16:08,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10 16:16:08,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 27 [2018-04-10 16:16:08,780 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 16:16:08,790 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:16:08,823 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 39 treesize of output 46 [2018-04-10 16:16:08,832 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 29 treesize of output 48 [2018-04-10 16:16:08,832 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-10 16:16:08,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, 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 74 [2018-04-10 16:16:08,871 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 8 xjuncts. [2018-04-10 16:16:08,917 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-10 16:16:08,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-10 16:16:08,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 16:16:08,992 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:51, output treesize:43 [2018-04-10 16:16:09,015 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 46 [2018-04-10 16:16:09,016 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:09,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 49 [2018-04-10 16:16:09,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:09,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:16:09,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:16:09,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:83, output treesize:38 [2018-04-10 16:16:09,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-10 16:16:09,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:09,325 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-10 16:16:09,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10 16:16:09,328 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:09,328 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-10 16:16:09,330 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:09,330 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:09,330 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:09,332 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-10 16:16:09,332 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:09,336 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:16:09,339 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:16:09,343 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:16:09,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:16:09,346 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:27, output treesize:1 [2018-04-10 16:16:09,352 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:09,354 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:09,354 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:09,354 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-10 16:16:09,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:09,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2018-04-10 16:16:09,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-04-10 16:16:09,371 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:09,372 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-10 16:16:09,374 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:09,374 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:09,375 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:09,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, 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-10 16:16:09,377 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:09,382 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:16:09,386 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:16:09,391 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:16:09,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:16:09,400 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:67, output treesize:28 [2018-04-10 16:16:09,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-04-10 16:16:09,426 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:09,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 49 [2018-04-10 16:16:09,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:09,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:16:09,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:16:09,436 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:35 [2018-04-10 16:16:10,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 55 [2018-04-10 16:16:10,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 50 treesize of output 52 [2018-04-10 16:16:10,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2018-04-10 16:16:10,466 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 32 treesize of output 34 [2018-04-10 16:16:10,473 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 34 treesize of output 39 [2018-04-10 16:16:10,473 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:10,477 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:16:10,481 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:16:10,489 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:16:10,514 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,515 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,516 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,517 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,518 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,519 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,521 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,522 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,522 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,540 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 41 treesize of output 106 [2018-04-10 16:16:10,543 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,544 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,545 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,546 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,547 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,548 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,549 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,550 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,550 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,552 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,552 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 124 [2018-04-10 16:16:10,583 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,584 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,584 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,585 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,585 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,586 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,586 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,587 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,587 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:16:10,593 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 110 treesize of output 133 [2018-04-10 16:16:10,595 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,596 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,596 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,597 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,597 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:16:10,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2018-04-10 16:16:10,601 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:10,617 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:16:10,645 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,646 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,647 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,647 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,648 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,649 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,650 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,650 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,651 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,652 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,654 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,655 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,694 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 4 new quantified variables, introduced 7 case distinctions, treesize of input 42 treesize of output 147 [2018-04-10 16:16:10,697 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 16:16:10,697 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:10,798 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,798 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:16:10,800 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 26 treesize of output 36 [2018-04-10 16:16:10,801 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:10,836 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,837 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,837 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,838 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,838 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,839 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,843 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,843 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,844 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,844 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,847 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,848 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:10,888 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 4 new quantified variables, introduced 12 case distinctions, treesize of input 44 treesize of output 169 [2018-04-10 16:16:10,890 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 16 xjuncts. [2018-04-10 16:16:11,025 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:11,025 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:11,026 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:11,026 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:11,026 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:11,027 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:11,027 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:11,028 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:11,028 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:11,029 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:11,029 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:11,030 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:16:11,038 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 40 treesize of output 122 [2018-04-10 16:16:11,039 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:11,227 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:11,228 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:11,228 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:11,229 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:11,229 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:11,230 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:11,230 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:11,231 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:11,231 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:11,231 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:16:11,232 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:11,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 112 [2018-04-10 16:16:11,241 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:11,322 INFO L267 ElimStorePlain]: Start of recursive call 11: 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-10 16:16:11,357 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-10 16:16:11,394 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-10 16:16:11,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-10 16:16:11,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-04-10 16:16:11,473 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 6 variables, input treesize:133, output treesize:123 [2018-04-10 16:16:13,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:16:13,058 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:13,094 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-10 16:16:13,094 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:201, output treesize:200 [2018-04-10 16:16:13,407 WARN L151 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 98 DAG size of output 67 [2018-04-10 16:16:13,423 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 73 treesize of output 75 [2018-04-10 16:16:13,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 74 treesize of output 76 [2018-04-10 16:16:13,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2018-04-10 16:16:13,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2018-04-10 16:16:13,441 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 34 treesize of output 39 [2018-04-10 16:16:13,442 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:13,450 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:16:13,458 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:16:13,477 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:16:13,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:16:13,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 16:16:13,557 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:234, output treesize:145 [2018-04-10 16:16:13,714 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:13,715 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:13,715 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-10 16:16:13,715 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:13,752 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 127 treesize of output 116 [2018-04-10 16:16:13,755 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:13,756 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:13,756 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:13,757 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:16:13,757 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:13,758 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:13,758 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:13,759 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:13,760 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:13,760 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:13,761 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:13,764 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:13,773 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 75 treesize of output 204 [2018-04-10 16:16:13,773 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:13,799 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:16:13,823 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-10 16:16:13,823 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:162, output treesize:155 [2018-04-10 16:16:17,074 WARN L151 SmtUtils]: Spent 198ms on a formula simplification. DAG size of input: 71 DAG size of output 38 [2018-04-10 16:16:17,091 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 64 treesize of output 68 [2018-04-10 16:16:17,094 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,094 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,095 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,096 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,096 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,097 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,098 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,098 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,099 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,099 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,100 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,101 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,102 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,102 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,118 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 159 [2018-04-10 16:16:17,120 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,121 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,122 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,122 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,123 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,123 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,124 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,124 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,125 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,126 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,126 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,127 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,135 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,137 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,138 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,138 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,139 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 152 treesize of output 188 [2018-04-10 16:16:17,174 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 16:16:17,174 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:17,274 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,275 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,275 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,275 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,276 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,277 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,277 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,278 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,278 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,279 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,279 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,279 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,280 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,280 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,281 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,281 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,281 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,282 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:16:17,294 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 175 [2018-04-10 16:16:17,296 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,297 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,297 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,298 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,298 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,299 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,299 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,299 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,300 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,300 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,301 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,301 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,301 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,302 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,302 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:16:17,303 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,303 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 166 [2018-04-10 16:16:17,317 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,318 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,318 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,319 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,319 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,320 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,320 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,321 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,321 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:16:17,321 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,322 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,330 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 40 treesize of output 116 [2018-04-10 16:16:17,331 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:17,357 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:16:17,377 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:16:17,414 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,414 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,415 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,415 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,416 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,416 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,418 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,418 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,419 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,420 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,420 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,421 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,422 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,424 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,427 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,428 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,428 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,430 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,462 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 4 new quantified variables, introduced 7 case distinctions, treesize of input 58 treesize of output 205 [2018-04-10 16:16:17,467 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,468 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,468 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,469 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,469 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,470 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,470 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,471 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,472 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,472 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,473 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,474 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,474 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,475 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,478 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,479 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,481 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,482 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,482 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,484 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,532 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 5 new quantified variables, introduced 13 case distinctions, treesize of input 186 treesize of output 228 [2018-04-10 16:16:17,539 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 16:16:17,539 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:17,972 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,972 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,973 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,973 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,974 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,974 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,975 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,975 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,976 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,976 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,977 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,978 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,978 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,979 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,979 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,980 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,980 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,981 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,981 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,982 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,982 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,983 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,983 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,984 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,984 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:17,984 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:16:18,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 238 [2018-04-10 16:16:18,015 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:18,129 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:18,130 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:18,131 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:18,132 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:18,132 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:18,133 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:18,133 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:18,134 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:18,136 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:18,137 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:18,137 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:18,138 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:18,139 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:18,139 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:18,153 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:18,155 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:18,157 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:18,158 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:18,159 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:18,161 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:18,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 30 disjoint index pairs (out of 36 index pairs), introduced 5 new quantified variables, introduced 19 case distinctions, treesize of input 62 treesize of output 254 [2018-04-10 16:16:18,238 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 32 xjuncts. [2018-04-10 16:16:19,392 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:19,393 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:19,393 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:19,394 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:19,394 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:19,395 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:19,395 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:19,396 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:19,396 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:19,397 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:19,397 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:19,397 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:19,398 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:19,398 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:19,399 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:19,399 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:19,400 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:19,400 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:16:19,419 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 187 [2018-04-10 16:16:19,420 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:19,626 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:19,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:19,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:19,628 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:19,629 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:19,629 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:19,630 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:19,630 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:19,631 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:19,631 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:19,631 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:16:19,632 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:19,632 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:19,633 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:19,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 18 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 167 [2018-04-10 16:16:19,651 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:19,820 INFO L267 ElimStorePlain]: Start of recursive call 10: 16 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-10 16:16:20,130 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,130 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,131 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,131 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,132 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,132 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,132 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,133 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,133 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,134 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,134 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,135 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,135 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,135 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,136 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,136 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,137 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,137 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,137 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,138 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,138 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,139 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:16:20,163 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 201 [2018-04-10 16:16:20,166 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,166 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,167 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,167 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,168 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,168 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,169 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,169 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,169 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,170 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,175 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,175 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,176 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,176 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,177 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,177 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,178 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,178 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,178 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:16:20,179 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,179 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,195 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 195 [2018-04-10 16:16:20,195 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:20,227 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:16:20,331 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,332 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,332 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,333 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,333 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,334 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,334 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,335 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,335 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,336 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,336 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,337 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,337 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,338 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,338 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:16:20,356 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 168 [2018-04-10 16:16:20,359 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,359 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,360 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,360 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,361 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,361 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,362 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,362 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,362 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:16:20,363 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,364 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:16:20,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 17 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 127 [2018-04-10 16:16:20,375 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:20,404 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:16:20,497 INFO L267 ElimStorePlain]: Start of recursive call 9: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-10 16:16:20,644 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-10 16:16:20,777 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-10 16:16:20,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 61 treesize of output 63 [2018-04-10 16:16:20,887 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 29 treesize of output 31 [2018-04-10 16:16:20,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2018-04-10 16:16:20,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2018-04-10 16:16:20,906 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 35 treesize of output 42 [2018-04-10 16:16:20,907 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:20,913 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:16:20,919 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:16:20,926 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:16:20,937 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:16:21,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-10 16:16:21,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 5 xjuncts. [2018-04-10 16:16:21,093 INFO L202 ElimStorePlain]: Needed 24 recursive calls to eliminate 8 variables, input treesize:151, output treesize:181 [2018-04-10 16:16:24,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:16:24,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:24,354 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-10 16:16:24,354 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:211, output treesize:210 [2018-04-10 16:16:24,676 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-04-10 16:16:24,677 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 10 variables, input treesize:359, output treesize:1 [2018-04-10 16:16:25,337 INFO L134 CoverageAnalysis]: Checked inductivity of 5708 backedges. 3404 proven. 1009 refuted. 4 times theorem prover too weak. 1117 trivial. 174 not checked. [2018-04-10 16:16:25,338 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:16:25,338 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-04-10 16:16:25,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-04-10 16:16:25,338 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-04-10 16:16:25,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=11622, Unknown=55, NotChecked=654, Total=12656 [2018-04-10 16:16:25,339 INFO L87 Difference]: Start difference. First operand 482 states and 533 transitions. Second operand 113 states. [2018-04-10 16:16:34,393 WARN L151 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 64 DAG size of output 63 [2018-04-10 16:16:36,824 WARN L151 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 77 DAG size of output 76 [2018-04-10 16:16:37,415 WARN L151 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 75 DAG size of output 74 [2018-04-10 16:16:37,938 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 76 DAG size of output 75 [2018-04-10 16:16:38,452 WARN L151 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 75 DAG size of output 74 [2018-04-10 16:16:39,134 WARN L151 SmtUtils]: Spent 147ms on a formula simplification. DAG size of input: 103 DAG size of output 88 [2018-04-10 16:16:40,155 WARN L151 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 82 DAG size of output 81 [2018-04-10 16:16:44,103 WARN L151 SmtUtils]: Spent 165ms on a formula simplification. DAG size of input: 104 DAG size of output 100 [2018-04-10 16:16:47,237 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 83 DAG size of output 80 [2018-04-10 16:16:47,973 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 105 DAG size of output 102 Received shutdown request... [2018-04-10 16:16:49,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-04-10 16:16:49,642 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-10 16:16:49,646 WARN L197 ceAbstractionStarter]: Timeout [2018-04-10 16:16:49,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.04 04:16:49 BoogieIcfgContainer [2018-04-10 16:16:49,646 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-10 16:16:49,647 INFO L168 Benchmark]: Toolchain (without parser) took 170059.18 ms. Allocated memory was 401.6 MB in the beginning and 1.9 GB in the end (delta: 1.5 GB). Free memory was 341.4 MB in the beginning and 431.6 MB in the end (delta: -90.2 MB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. [2018-04-10 16:16:49,647 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 401.6 MB. Free memory is still 361.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 16:16:49,647 INFO L168 Benchmark]: CACSL2BoogieTranslator took 182.87 ms. Allocated memory is still 401.6 MB. Free memory was 341.4 MB in the beginning and 330.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-04-10 16:16:49,648 INFO L168 Benchmark]: Boogie Preprocessor took 28.98 ms. Allocated memory is still 401.6 MB. Free memory was 330.7 MB in the beginning and 329.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-04-10 16:16:49,648 INFO L168 Benchmark]: RCFGBuilder took 285.25 ms. Allocated memory was 401.6 MB in the beginning and 608.2 MB in the end (delta: 206.6 MB). Free memory was 329.4 MB in the beginning and 566.7 MB in the end (delta: -237.3 MB). Peak memory consumption was 26.4 MB. Max. memory is 5.3 GB. [2018-04-10 16:16:49,648 INFO L168 Benchmark]: TraceAbstraction took 169559.16 ms. Allocated memory was 608.2 MB in the beginning and 1.9 GB in the end (delta: 1.3 GB). Free memory was 566.7 MB in the beginning and 431.6 MB in the end (delta: 135.1 MB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. [2018-04-10 16:16:49,648 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.24 ms. Allocated memory is still 401.6 MB. Free memory is still 361.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 182.87 ms. Allocated memory is still 401.6 MB. Free memory was 341.4 MB in the beginning and 330.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.98 ms. Allocated memory is still 401.6 MB. Free memory was 330.7 MB in the beginning and 329.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 285.25 ms. Allocated memory was 401.6 MB in the beginning and 608.2 MB in the end (delta: 206.6 MB). Free memory was 329.4 MB in the beginning and 566.7 MB in the end (delta: -237.3 MB). Peak memory consumption was 26.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 169559.16 ms. Allocated memory was 608.2 MB in the beginning and 1.9 GB in the end (delta: 1.3 GB). Free memory was 566.7 MB in the beginning and 431.6 MB in the end (delta: 135.1 MB). Peak memory consumption was 1.4 GB. 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 constructing difference of abstraction (482states) and interpolant automaton (currently 91 states, 113 states before enhancement), while ReachableStatesComputation was computing reachable states (318 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 14]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 14). Cancelled while BasicCegarLoop was constructing difference of abstraction (482states) and interpolant automaton (currently 91 states, 113 states before enhancement), while ReachableStatesComputation was computing reachable states (318 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 23). Cancelled while BasicCegarLoop was constructing difference of abstraction (482states) and interpolant automaton (currently 91 states, 113 states before enhancement), while ReachableStatesComputation was computing reachable states (318 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 23). Cancelled while BasicCegarLoop was constructing difference of abstraction (482states) and interpolant automaton (currently 91 states, 113 states before enhancement), while ReachableStatesComputation was computing reachable states (318 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 23). Cancelled while BasicCegarLoop was constructing difference of abstraction (482states) and interpolant automaton (currently 91 states, 113 states before enhancement), while ReachableStatesComputation was computing reachable states (318 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 23). Cancelled while BasicCegarLoop was constructing difference of abstraction (482states) and interpolant automaton (currently 91 states, 113 states before enhancement), while ReachableStatesComputation was computing reachable states (318 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 37]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 37). Cancelled while BasicCegarLoop was constructing difference of abstraction (482states) and interpolant automaton (currently 91 states, 113 states before enhancement), while ReachableStatesComputation was computing reachable states (318 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 34]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 34). Cancelled while BasicCegarLoop was constructing difference of abstraction (482states) and interpolant automaton (currently 91 states, 113 states before enhancement), while ReachableStatesComputation was computing reachable states (318 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 37]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 37). Cancelled while BasicCegarLoop was constructing difference of abstraction (482states) and interpolant automaton (currently 91 states, 113 states before enhancement), while ReachableStatesComputation was computing reachable states (318 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 31). Cancelled while BasicCegarLoop was constructing difference of abstraction (482states) and interpolant automaton (currently 91 states, 113 states before enhancement), while ReachableStatesComputation was computing reachable states (318 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 34]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 34). Cancelled while BasicCegarLoop was constructing difference of abstraction (482states) and interpolant automaton (currently 91 states, 113 states before enhancement), while ReachableStatesComputation was computing reachable states (318 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 68 locations, 11 error locations. TIMEOUT Result, 169.5s OverallTime, 60 OverallIterations, 36 TraceHistogramMax, 94.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3688 SDtfs, 8681 SDslu, 27175 SDs, 0 SdLazy, 39598 SolverSat, 2264 SolverUnsat, 973 SolverUnknown, 0 SolverNotchecked, 40.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12055 GetRequests, 9881 SyntacticMatches, 163 SemanticMatches, 2011 ConstructedPredicates, 191 IntricatePredicates, 0 DeprecatedPredicates, 35205 ImplicationChecksByTransitivity, 81.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=482occurred in iteration=59, 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, 59 MinimizatonAttempts, 845 StatesRemovedByMinimization, 56 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 5.2s SatisfiabilityAnalysisTime, 67.7s InterpolantComputationTime, 21846 NumberOfCodeBlocks, 21449 NumberOfCodeBlocksAsserted, 199 NumberOfCheckSat, 16322 ConstructedInterpolants, 3714 QuantifiedInterpolants, 34621105 SizeOfPredicates, 506 NumberOfNonLiveVariables, 30910 ConjunctsInSsa, 1891 ConjunctsInUnsatCore, 86 InterpolantComputations, 12 PerfectInterpolantSequences, 76404/90822 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-10_16-16-49-653.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-10_16-16-49-653.csv Completed graceful shutdown