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/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/memsafety-ext2/length_test03_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:10:26,046 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:10:26,048 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:10:26,062 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:10:26,063 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:10:26,064 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:10:26,065 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:10:26,066 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:10:26,068 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:10:26,068 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:10:26,069 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:10:26,069 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:10:26,070 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:10:26,071 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:10:26,071 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:10:26,074 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:10:26,076 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:10:26,078 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:10:26,080 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:10:26,081 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:10:26,083 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:10:26,084 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:10:26,084 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:10:26,085 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:10:26,086 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:10:26,087 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:10:26,088 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:10:26,088 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:10:26,088 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:10:26,089 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:10:26,089 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:10:26,090 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf [2018-01-24 12:10:26,100 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:10:26,101 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:10:26,101 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:10:26,102 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:10:26,102 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:10:26,102 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:10:26,102 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:10:26,103 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:10:26,103 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:10:26,103 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:10:26,104 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:10:26,104 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:10:26,104 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:10:26,104 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:10:26,104 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:10:26,105 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:10:26,105 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:10:26,105 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:10:26,105 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:10:26,105 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:10:26,106 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:10:26,106 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:10:26,106 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:10:26,106 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:10:26,106 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:10:26,107 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:10:26,107 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:10:26,107 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:10:26,107 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 12:10:26,107 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:10:26,108 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:10:26,108 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:10:26,109 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:10:26,109 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:10:26,144 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:10:26,158 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:10:26,163 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:10:26,164 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:10:26,165 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:10:26,166 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/length_test03_true-valid-memsafety.i [2018-01-24 12:10:26,365 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:10:26,370 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:10:26,370 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:10:26,371 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:10:26,376 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:10:26,377 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:10:26" (1/1) ... [2018-01-24 12:10:26,379 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d17d7d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:10:26, skipping insertion in model container [2018-01-24 12:10:26,380 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:10:26" (1/1) ... [2018-01-24 12:10:26,393 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:10:26,431 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:10:26,552 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:10:26,579 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:10:26,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:10:26 WrapperNode [2018-01-24 12:10:26,588 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:10:26,589 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:10:26,589 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:10:26,589 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:10:26,601 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:10:26" (1/1) ... [2018-01-24 12:10:26,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:10:26" (1/1) ... [2018-01-24 12:10:26,611 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:10:26" (1/1) ... [2018-01-24 12:10:26,612 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:10:26" (1/1) ... [2018-01-24 12:10:26,620 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:10:26" (1/1) ... [2018-01-24 12:10:26,624 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:10:26" (1/1) ... [2018-01-24 12:10:26,626 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:10:26" (1/1) ... [2018-01-24 12:10:26,629 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:10:26,629 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:10:26,629 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:10:26,630 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:10:26,631 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:10:26" (1/1) ... No working directory specified, using /storage/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-01-24 12:10:26,677 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:10:26,678 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:10:26,678 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-24 12:10:26,678 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:10:26,678 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 12:10:26,678 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 12:10:26,678 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 12:10:26,678 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 12:10:26,678 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:10:26,679 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:10:26,679 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:10:26,679 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 12:10:26,679 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-01-24 12:10:26,679 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:10:26,679 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-24 12:10:26,679 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:10:26,680 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:10:26,680 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:10:27,207 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:10:27,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:10:27 BoogieIcfgContainer [2018-01-24 12:10:27,207 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:10:27,208 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:10:27,208 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:10:27,210 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:10:27,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:10:26" (1/3) ... [2018-01-24 12:10:27,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26f1aa57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:10:27, skipping insertion in model container [2018-01-24 12:10:27,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:10:26" (2/3) ... [2018-01-24 12:10:27,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26f1aa57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:10:27, skipping insertion in model container [2018-01-24 12:10:27,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:10:27" (3/3) ... [2018-01-24 12:10:27,214 INFO L105 eAbstractionObserver]: Analyzing ICFG length_test03_true-valid-memsafety.i [2018-01-24 12:10:27,221 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:10:27,228 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-01-24 12:10:27,268 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:10:27,268 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:10:27,268 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:10:27,268 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:10:27,268 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:10:27,268 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:10:27,268 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:10:27,269 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:10:27,269 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:10:27,288 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2018-01-24 12:10:27,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 12:10:27,294 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:10:27,295 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:10:27,295 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-24 12:10:27,299 INFO L82 PathProgramCache]: Analyzing trace with hash -683315734, now seen corresponding path program 1 times [2018-01-24 12:10:27,301 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:10:27,301 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:10:27,342 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:10:27,342 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:10:27,343 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:10:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:10:27,388 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:10:27,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:10:27,454 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:10:27,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:10:27,457 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:10:27,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:10:27,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:10:27,475 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 4 states. [2018-01-24 12:10:27,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:10:27,876 INFO L93 Difference]: Finished difference Result 268 states and 291 transitions. [2018-01-24 12:10:27,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:10:27,877 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 12:10:27,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:10:27,889 INFO L225 Difference]: With dead ends: 268 [2018-01-24 12:10:27,889 INFO L226 Difference]: Without dead ends: 158 [2018-01-24 12:10:27,893 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:10:27,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-01-24 12:10:27,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 126. [2018-01-24 12:10:27,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-24 12:10:27,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 132 transitions. [2018-01-24 12:10:27,940 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 132 transitions. Word has length 8 [2018-01-24 12:10:27,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:10:27,941 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 132 transitions. [2018-01-24 12:10:27,941 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:10:27,941 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 132 transitions. [2018-01-24 12:10:27,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 12:10:27,942 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:10:27,942 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:10:27,942 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-24 12:10:27,943 INFO L82 PathProgramCache]: Analyzing trace with hash -683315733, now seen corresponding path program 1 times [2018-01-24 12:10:27,943 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:10:27,943 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:10:27,944 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:10:27,944 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:10:27,944 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:10:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:10:27,959 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:10:28,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:10:28,037 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:10:28,038 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:10:28,039 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:10:28,039 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:10:28,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:10:28,040 INFO L87 Difference]: Start difference. First operand 126 states and 132 transitions. Second operand 4 states. [2018-01-24 12:10:28,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:10:28,211 INFO L93 Difference]: Finished difference Result 128 states and 135 transitions. [2018-01-24 12:10:28,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:10:28,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 12:10:28,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:10:28,214 INFO L225 Difference]: With dead ends: 128 [2018-01-24 12:10:28,214 INFO L226 Difference]: Without dead ends: 126 [2018-01-24 12:10:28,215 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:10:28,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-24 12:10:28,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2018-01-24 12:10:28,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-24 12:10:28,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 130 transitions. [2018-01-24 12:10:28,226 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 130 transitions. Word has length 8 [2018-01-24 12:10:28,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:10:28,226 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 130 transitions. [2018-01-24 12:10:28,226 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:10:28,227 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2018-01-24 12:10:28,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-24 12:10:28,227 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:10:28,227 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:10:28,227 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-24 12:10:28,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1180912018, now seen corresponding path program 1 times [2018-01-24 12:10:28,228 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:10:28,228 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:10:28,229 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:10:28,229 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:10:28,229 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:10:28,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:10:28,247 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:10:28,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:10:28,290 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:10:28,290 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:10:28,290 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:10:28,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:10:28,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:10:28,291 INFO L87 Difference]: Start difference. First operand 124 states and 130 transitions. Second operand 4 states. [2018-01-24 12:10:28,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:10:28,442 INFO L93 Difference]: Finished difference Result 139 states and 147 transitions. [2018-01-24 12:10:28,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:10:28,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-01-24 12:10:28,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:10:28,444 INFO L225 Difference]: With dead ends: 139 [2018-01-24 12:10:28,444 INFO L226 Difference]: Without dead ends: 136 [2018-01-24 12:10:28,445 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:10:28,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-01-24 12:10:28,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 126. [2018-01-24 12:10:28,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-24 12:10:28,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 134 transitions. [2018-01-24 12:10:28,455 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 134 transitions. Word has length 12 [2018-01-24 12:10:28,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:10:28,455 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 134 transitions. [2018-01-24 12:10:28,456 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:10:28,456 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 134 transitions. [2018-01-24 12:10:28,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-24 12:10:28,456 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:10:28,456 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:10:28,456 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-24 12:10:28,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1180912017, now seen corresponding path program 1 times [2018-01-24 12:10:28,457 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:10:28,457 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:10:28,458 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:10:28,458 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:10:28,458 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:10:28,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:10:28,474 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:10:28,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:10:28,550 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:10:28,550 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:10:28,551 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:10:28,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:10:28,551 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:10:28,552 INFO L87 Difference]: Start difference. First operand 126 states and 134 transitions. Second operand 4 states. [2018-01-24 12:10:28,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:10:28,651 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2018-01-24 12:10:28,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:10:28,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-01-24 12:10:28,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:10:28,653 INFO L225 Difference]: With dead ends: 128 [2018-01-24 12:10:28,653 INFO L226 Difference]: Without dead ends: 126 [2018-01-24 12:10:28,653 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:10:28,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-24 12:10:28,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2018-01-24 12:10:28,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-24 12:10:28,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2018-01-24 12:10:28,660 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 12 [2018-01-24 12:10:28,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:10:28,661 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2018-01-24 12:10:28,661 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:10:28,661 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2018-01-24 12:10:28,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 12:10:28,661 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:10:28,661 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:10:28,662 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-24 12:10:28,662 INFO L82 PathProgramCache]: Analyzing trace with hash -424566030, now seen corresponding path program 1 times [2018-01-24 12:10:28,662 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:10:28,662 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:10:28,663 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:10:28,663 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:10:28,663 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:10:28,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:10:28,684 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:10:28,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:10:28,730 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:10:28,730 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:10:28,731 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:10:28,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:10:28,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:10:28,732 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand 4 states. [2018-01-24 12:10:28,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:10:28,852 INFO L93 Difference]: Finished difference Result 124 states and 132 transitions. [2018-01-24 12:10:28,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:10:28,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-24 12:10:28,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:10:28,854 INFO L225 Difference]: With dead ends: 124 [2018-01-24 12:10:28,854 INFO L226 Difference]: Without dead ends: 119 [2018-01-24 12:10:28,854 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:10:28,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-24 12:10:28,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-01-24 12:10:28,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-24 12:10:28,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2018-01-24 12:10:28,863 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 20 [2018-01-24 12:10:28,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:10:28,864 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2018-01-24 12:10:28,864 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:10:28,864 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2018-01-24 12:10:28,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 12:10:28,865 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:10:28,865 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:10:28,865 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-24 12:10:28,866 INFO L82 PathProgramCache]: Analyzing trace with hash -424566029, now seen corresponding path program 1 times [2018-01-24 12:10:28,866 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:10:28,866 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:10:28,867 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:10:28,867 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:10:28,867 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:10:28,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:10:28,891 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:10:28,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:10:28,985 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:10:28,985 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:10:28,986 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:10:28,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:10:28,986 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:10:28,986 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand 4 states. [2018-01-24 12:10:29,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:10:29,059 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2018-01-24 12:10:29,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:10:29,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-24 12:10:29,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:10:29,060 INFO L225 Difference]: With dead ends: 119 [2018-01-24 12:10:29,060 INFO L226 Difference]: Without dead ends: 114 [2018-01-24 12:10:29,061 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:10:29,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-24 12:10:29,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-01-24 12:10:29,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-24 12:10:29,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2018-01-24 12:10:29,068 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 20 [2018-01-24 12:10:29,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:10:29,068 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2018-01-24 12:10:29,068 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:10:29,068 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2018-01-24 12:10:29,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 12:10:29,068 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:10:29,069 INFO L322 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-01-24 12:10:29,069 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-24 12:10:29,069 INFO L82 PathProgramCache]: Analyzing trace with hash -276644944, now seen corresponding path program 1 times [2018-01-24 12:10:29,069 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:10:29,069 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:10:29,070 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:10:29,070 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:10:29,070 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:10:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:10:29,091 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:10:29,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:10:29,232 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:10:29,232 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:10:29,232 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:10:29,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:10:29,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:10:29,233 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand 8 states. [2018-01-24 12:10:29,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:10:29,543 INFO L93 Difference]: Finished difference Result 185 states and 205 transitions. [2018-01-24 12:10:29,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:10:29,544 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-01-24 12:10:29,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:10:29,545 INFO L225 Difference]: With dead ends: 185 [2018-01-24 12:10:29,545 INFO L226 Difference]: Without dead ends: 177 [2018-01-24 12:10:29,545 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:10:29,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-01-24 12:10:29,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 135. [2018-01-24 12:10:29,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-24 12:10:29,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 155 transitions. [2018-01-24 12:10:29,554 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 155 transitions. Word has length 21 [2018-01-24 12:10:29,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:10:29,554 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 155 transitions. [2018-01-24 12:10:29,554 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:10:29,554 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 155 transitions. [2018-01-24 12:10:29,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 12:10:29,555 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:10:29,555 INFO L322 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-01-24 12:10:29,555 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-24 12:10:29,555 INFO L82 PathProgramCache]: Analyzing trace with hash -276644943, now seen corresponding path program 1 times [2018-01-24 12:10:29,556 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:10:29,556 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:10:29,557 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:10:29,557 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:10:29,557 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:10:29,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:10:29,575 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:10:29,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:10:29,717 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:10:29,718 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 12:10:29,718 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:10:29,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:10:29,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:10:29,719 INFO L87 Difference]: Start difference. First operand 135 states and 155 transitions. Second operand 9 states. [2018-01-24 12:10:30,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:10:30,001 INFO L93 Difference]: Finished difference Result 196 states and 211 transitions. [2018-01-24 12:10:30,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:10:30,002 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-01-24 12:10:30,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:10:30,003 INFO L225 Difference]: With dead ends: 196 [2018-01-24 12:10:30,003 INFO L226 Difference]: Without dead ends: 187 [2018-01-24 12:10:30,003 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:10:30,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-01-24 12:10:30,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 162. [2018-01-24 12:10:30,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-01-24 12:10:30,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 195 transitions. [2018-01-24 12:10:30,010 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 195 transitions. Word has length 21 [2018-01-24 12:10:30,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:10:30,011 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 195 transitions. [2018-01-24 12:10:30,011 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:10:30,011 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 195 transitions. [2018-01-24 12:10:30,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 12:10:30,011 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:10:30,011 INFO L322 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] [2018-01-24 12:10:30,012 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-24 12:10:30,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1018638093, now seen corresponding path program 1 times [2018-01-24 12:10:30,012 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:10:30,012 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:10:30,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:10:30,013 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:10:30,013 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:10:30,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:10:30,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:10:30,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:10:30,335 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:10:30,335 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-24 12:10:30,335 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 12:10:30,335 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 12:10:30,336 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-01-24 12:10:30,336 INFO L87 Difference]: Start difference. First operand 162 states and 195 transitions. Second operand 14 states. [2018-01-24 12:10:30,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:10:30,999 INFO L93 Difference]: Finished difference Result 376 states and 463 transitions. [2018-01-24 12:10:30,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 12:10:30,999 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2018-01-24 12:10:31,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:10:31,002 INFO L225 Difference]: With dead ends: 376 [2018-01-24 12:10:31,003 INFO L226 Difference]: Without dead ends: 228 [2018-01-24 12:10:31,004 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2018-01-24 12:10:31,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-01-24 12:10:31,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 171. [2018-01-24 12:10:31,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-01-24 12:10:31,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 205 transitions. [2018-01-24 12:10:31,015 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 205 transitions. Word has length 30 [2018-01-24 12:10:31,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:10:31,015 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 205 transitions. [2018-01-24 12:10:31,016 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 12:10:31,016 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 205 transitions. [2018-01-24 12:10:31,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 12:10:31,016 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:10:31,017 INFO L322 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, 1] [2018-01-24 12:10:31,017 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-24 12:10:31,017 INFO L82 PathProgramCache]: Analyzing trace with hash 2019932176, now seen corresponding path program 1 times [2018-01-24 12:10:31,017 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:10:31,017 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:10:31,018 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:10:31,018 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:10:31,018 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:10:31,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:10:31,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:10:31,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:10:31,505 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:10:31,505 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-24 12:10:31,505 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 12:10:31,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 12:10:31,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-01-24 12:10:31,506 INFO L87 Difference]: Start difference. First operand 171 states and 205 transitions. Second operand 14 states. [2018-01-24 12:10:31,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:10:31,997 INFO L93 Difference]: Finished difference Result 324 states and 393 transitions. [2018-01-24 12:10:31,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 12:10:31,997 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2018-01-24 12:10:31,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:10:31,998 INFO L225 Difference]: With dead ends: 324 [2018-01-24 12:10:31,999 INFO L226 Difference]: Without dead ends: 176 [2018-01-24 12:10:32,000 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2018-01-24 12:10:32,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-01-24 12:10:32,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2018-01-24 12:10:32,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-01-24 12:10:32,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 208 transitions. [2018-01-24 12:10:32,016 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 208 transitions. Word has length 32 [2018-01-24 12:10:32,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:10:32,017 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 208 transitions. [2018-01-24 12:10:32,017 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 12:10:32,017 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 208 transitions. [2018-01-24 12:10:32,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-24 12:10:32,018 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:10:32,018 INFO L322 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:10:32,018 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-24 12:10:32,018 INFO L82 PathProgramCache]: Analyzing trace with hash -489397259, now seen corresponding path program 1 times [2018-01-24 12:10:32,018 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:10:32,018 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:10:32,019 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:10:32,019 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:10:32,019 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:10:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:10:32,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:10:32,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:10:32,084 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:10:32,084 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:10:32,085 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:10:32,085 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:10:32,085 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:10:32,085 INFO L87 Difference]: Start difference. First operand 174 states and 208 transitions. Second operand 3 states. [2018-01-24 12:10:32,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:10:32,104 INFO L93 Difference]: Finished difference Result 207 states and 225 transitions. [2018-01-24 12:10:32,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:10:32,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-01-24 12:10:32,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:10:32,109 INFO L225 Difference]: With dead ends: 207 [2018-01-24 12:10:32,109 INFO L226 Difference]: Without dead ends: 155 [2018-01-24 12:10:32,109 INFO L525 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-01-24 12:10:32,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-01-24 12:10:32,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 144. [2018-01-24 12:10:32,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-01-24 12:10:32,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 154 transitions. [2018-01-24 12:10:32,118 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 154 transitions. Word has length 40 [2018-01-24 12:10:32,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:10:32,118 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 154 transitions. [2018-01-24 12:10:32,119 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:10:32,119 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 154 transitions. [2018-01-24 12:10:32,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-24 12:10:32,120 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:10:32,120 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:10:32,120 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-24 12:10:32,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1159244567, now seen corresponding path program 1 times [2018-01-24 12:10:32,121 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:10:32,121 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:10:32,121 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:10:32,121 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:10:32,122 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:10:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:10:32,143 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:10:32,337 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:10:32,337 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:10:32,337 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:10:32,350 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:10:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:10:32,407 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:10:32,469 WARN L1029 $PredicateComparison]: unable to prove that (exists ((append_~node~4.base Int)) (and (= 0 (select |c_old(#valid)| append_~node~4.base)) (= |c_#valid| (store |c_old(#valid)| append_~node~4.base 1)))) is different from true [2018-01-24 12:10:32,502 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:32,503 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:32,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, 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-01-24 12:10:32,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:32,522 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-01-24 12:10:32,523 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-01-24 12:10:32,606 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 17 treesize of output 20 [2018-01-24 12:10:32,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:32,613 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-01-24 12:10:32,614 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:20 [2018-01-24 12:10:32,754 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-01-24 12:10:32,779 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:10:32,779 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-01-24 12:10:32,780 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-24 12:10:32,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-24 12:10:32,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=223, Unknown=1, NotChecked=30, Total=306 [2018-01-24 12:10:32,780 INFO L87 Difference]: Start difference. First operand 144 states and 154 transitions. Second operand 18 states. [2018-01-24 12:10:34,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:10:34,284 INFO L93 Difference]: Finished difference Result 179 states and 188 transitions. [2018-01-24 12:10:34,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 12:10:34,285 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 43 [2018-01-24 12:10:34,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:10:34,287 INFO L225 Difference]: With dead ends: 179 [2018-01-24 12:10:34,287 INFO L226 Difference]: Without dead ends: 177 [2018-01-24 12:10:34,288 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 37 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=115, Invalid=440, Unknown=1, NotChecked=44, Total=600 [2018-01-24 12:10:34,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-01-24 12:10:34,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 146. [2018-01-24 12:10:34,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-01-24 12:10:34,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 158 transitions. [2018-01-24 12:10:34,299 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 158 transitions. Word has length 43 [2018-01-24 12:10:34,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:10:34,300 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 158 transitions. [2018-01-24 12:10:34,300 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-24 12:10:34,300 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 158 transitions. [2018-01-24 12:10:34,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-24 12:10:34,301 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:10:34,302 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:10:34,302 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-24 12:10:34,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1159244566, now seen corresponding path program 1 times [2018-01-24 12:10:34,302 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:10:34,302 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:10:34,303 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:10:34,303 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:10:34,304 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:10:34,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:10:34,340 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:10:34,878 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:10:34,879 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:10:34,879 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:10:34,891 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:10:34,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:10:34,938 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:10:35,206 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:35,208 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-01-24 12:10:35,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:35,250 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:35,253 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:35,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-01-24 12:10:35,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:35,268 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-01-24 12:10:35,268 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:30 [2018-01-24 12:10:35,358 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:35,359 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:35,360 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:35,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 12:10:35,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:35,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 30 [2018-01-24 12:10:35,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:35,394 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-01-24 12:10:35,395 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:33 [2018-01-24 12:10:35,458 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:10:35,479 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:10:35,480 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-01-24 12:10:35,480 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 12:10:35,480 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 12:10:35,480 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=293, Unknown=3, NotChecked=0, Total=342 [2018-01-24 12:10:35,481 INFO L87 Difference]: Start difference. First operand 146 states and 158 transitions. Second operand 19 states. [2018-01-24 12:10:36,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:10:36,978 INFO L93 Difference]: Finished difference Result 176 states and 186 transitions. [2018-01-24 12:10:36,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 12:10:36,978 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 43 [2018-01-24 12:10:36,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:10:36,979 INFO L225 Difference]: With dead ends: 176 [2018-01-24 12:10:36,979 INFO L226 Difference]: Without dead ends: 167 [2018-01-24 12:10:36,980 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=92, Invalid=502, Unknown=6, NotChecked=0, Total=600 [2018-01-24 12:10:36,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-01-24 12:10:36,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 137. [2018-01-24 12:10:36,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-01-24 12:10:36,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 148 transitions. [2018-01-24 12:10:36,988 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 148 transitions. Word has length 43 [2018-01-24 12:10:36,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:10:36,989 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 148 transitions. [2018-01-24 12:10:36,989 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-24 12:10:36,989 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 148 transitions. [2018-01-24 12:10:36,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-24 12:10:36,990 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:10:36,990 INFO L322 BasicCegarLoop]: trace histogram [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, 1] [2018-01-24 12:10:36,990 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-24 12:10:36,991 INFO L82 PathProgramCache]: Analyzing trace with hash 570613669, now seen corresponding path program 1 times [2018-01-24 12:10:36,991 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:10:36,991 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:10:36,992 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:10:36,992 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:10:36,992 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:10:37,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:10:37,025 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:10:37,981 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:10:37,982 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:10:37,982 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:10:37,995 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:10:38,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:10:38,030 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:10:38,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-24 12:10:38,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:38,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:10:38,090 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-01-24 12:10:38,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-24 12:10:38,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 10 treesize of output 9 [2018-01-24 12:10:38,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:38,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:10:38,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:10:38,301 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-01-24 12:10:38,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-01-24 12:10:38,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-01-24 12:10:38,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:38,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 30 [2018-01-24 12:10:38,367 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 12:10:38,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:10:38,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:10:38,390 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:38, output treesize:70 [2018-01-24 12:10:38,452 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 33 treesize of output 28 [2018-01-24 12:10:38,455 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:38,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-01-24 12:10:38,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:38,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:10:38,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 65 [2018-01-24 12:10:38,506 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:38,507 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 61 treesize of output 76 [2018-01-24 12:10:38,508 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:38,540 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:38,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 53 [2018-01-24 12:10:38,550 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-24 12:10:38,574 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:10:38,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-01-24 12:10:38,595 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:102, output treesize:115 [2018-01-24 12:10:38,731 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:38,732 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:38,733 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 66 treesize of output 60 [2018-01-24 12:10:38,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:38,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:10:38,765 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:139, output treesize:60 [2018-01-24 12:10:38,927 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:38,927 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:38,928 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:38,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 52 [2018-01-24 12:10:38,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:38,942 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-01-24 12:10:38,943 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:74, output treesize:82 [2018-01-24 12:10:39,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 75 [2018-01-24 12:10:39,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-24 12:10:39,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:39,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:10:39,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 12:10:39,072 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:97, output treesize:82 [2018-01-24 12:10:39,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 73 [2018-01-24 12:10:39,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-24 12:10:39,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:39,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:10:39,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 12:10:39,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:98, output treesize:85 [2018-01-24 12:10:39,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 73 [2018-01-24 12:10:39,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-24 12:10:39,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:39,312 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:10:39,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-24 12:10:39,333 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:98, output treesize:94 [2018-01-24 12:10:39,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 65 [2018-01-24 12:10:39,410 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:39,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-01-24 12:10:39,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:39,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-24 12:10:39,423 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:39,431 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:10:39,432 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 21 [2018-01-24 12:10:39,433 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:39,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:10:39,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 12:10:39,449 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:103, output treesize:28 [2018-01-24 12:10:39,504 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:10:39,525 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:10:39,525 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2018-01-24 12:10:39,525 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-01-24 12:10:39,525 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-01-24 12:10:39,526 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1831, Unknown=0, NotChecked=0, Total=1980 [2018-01-24 12:10:39,526 INFO L87 Difference]: Start difference. First operand 137 states and 148 transitions. Second operand 45 states. [2018-01-24 12:10:45,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:10:45,004 INFO L93 Difference]: Finished difference Result 199 states and 217 transitions. [2018-01-24 12:10:45,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-01-24 12:10:45,004 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 50 [2018-01-24 12:10:45,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:10:45,005 INFO L225 Difference]: With dead ends: 199 [2018-01-24 12:10:45,006 INFO L226 Difference]: Without dead ends: 198 [2018-01-24 12:10:45,007 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=695, Invalid=5157, Unknown=0, NotChecked=0, Total=5852 [2018-01-24 12:10:45,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-01-24 12:10:45,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 143. [2018-01-24 12:10:45,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-24 12:10:45,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 152 transitions. [2018-01-24 12:10:45,017 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 152 transitions. Word has length 50 [2018-01-24 12:10:45,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:10:45,018 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 152 transitions. [2018-01-24 12:10:45,018 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-01-24 12:10:45,018 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 152 transitions. [2018-01-24 12:10:45,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-24 12:10:45,019 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:10:45,019 INFO L322 BasicCegarLoop]: trace histogram [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, 1] [2018-01-24 12:10:45,019 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-24 12:10:45,020 INFO L82 PathProgramCache]: Analyzing trace with hash 570613670, now seen corresponding path program 1 times [2018-01-24 12:10:45,020 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:10:45,020 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:10:45,021 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:10:45,021 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:10:45,021 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:10:45,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:10:45,052 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:10:45,899 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:10:45,900 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:10:45,900 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:10:45,905 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:10:45,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:10:45,945 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:10:46,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-24 12:10:46,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:46,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:10:46,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-01-24 12:10:46,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:10:46,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:46,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:10:46,162 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-01-24 12:10:46,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-24 12:10:46,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 10 treesize of output 9 [2018-01-24 12:10:46,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:46,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:10:46,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-24 12:10:46,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-24 12:10:46,262 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:46,263 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:10:46,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:10:46,272 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2018-01-24 12:10:46,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 53 [2018-01-24 12:10:46,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 36 treesize of output 35 [2018-01-24 12:10:46,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:46,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 48 [2018-01-24 12:10:46,350 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 12:10:46,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:10:46,395 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 47 treesize of output 57 [2018-01-24 12:10:46,399 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:46,401 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 43 treesize of output 54 [2018-01-24 12:10:46,401 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:46,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 43 [2018-01-24 12:10:46,424 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:46,434 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:10:46,436 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:10:46,439 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 54 treesize of output 48 [2018-01-24 12:10:46,442 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:10:46,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2018-01-24 12:10:46,444 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:46,451 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:10:46,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 12:10:46,501 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:66, output treesize:110 [2018-01-24 12:10:46,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 168 treesize of output 157 [2018-01-24 12:10:46,598 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:46,599 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 161 treesize of output 188 [2018-01-24 12:10:46,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:46,690 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:46,692 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:46,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 144 treesize of output 166 [2018-01-24 12:10:46,703 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 12:10:46,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:10:46,881 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 112 treesize of output 95 [2018-01-24 12:10:46,884 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:46,885 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:46,885 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:10:46,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 49 [2018-01-24 12:10:46,888 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:46,902 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:10:46,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 158 treesize of output 158 [2018-01-24 12:10:46,923 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:46,924 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 151 treesize of output 178 [2018-01-24 12:10:46,924 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:46,999 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:47,000 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:47,009 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 138 treesize of output 164 [2018-01-24 12:10:47,011 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-01-24 12:10:47,061 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:10:47,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 12:10:47,171 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:249, output treesize:210 [2018-01-24 12:10:47,256 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:47,257 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:47,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 150 [2018-01-24 12:10:47,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:47,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:10:47,300 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:226, output treesize:150 [2018-01-24 12:10:47,521 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 37 treesize of output 26 [2018-01-24 12:10:47,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:47,546 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:47,547 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:47,547 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-01-24 12:10:47,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:47,568 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-01-24 12:10:47,569 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:161, output treesize:144 [2018-01-24 12:10:47,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 150 [2018-01-24 12:10:47,762 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:47,780 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 124 treesize of output 160 [2018-01-24 12:10:47,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-01-24 12:10:47,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 105 [2018-01-24 12:10:47,880 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:47,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 12:10:47,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 115 [2018-01-24 12:10:47,991 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:47,994 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 78 [2018-01-24 12:10:47,994 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:48,008 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:10:48,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 152 [2018-01-24 12:10:48,030 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:48,044 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 135 treesize of output 171 [2018-01-24 12:10:48,045 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-01-24 12:10:48,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 126 [2018-01-24 12:10:48,132 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:48,176 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 12:10:48,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 115 [2018-01-24 12:10:48,187 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:48,189 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 78 [2018-01-24 12:10:48,190 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:48,203 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:10:48,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-01-24 12:10:48,255 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:174, output treesize:323 [2018-01-24 12:10:48,409 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 115 treesize of output 116 [2018-01-24 12:10:48,425 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:48,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 51 [2018-01-24 12:10:48,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:48,476 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:10:48,733 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 115 treesize of output 116 [2018-01-24 12:10:48,738 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:48,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 51 [2018-01-24 12:10:48,740 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:48,772 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:10:48,923 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 123 treesize of output 118 [2018-01-24 12:10:48,926 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:48,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 39 [2018-01-24 12:10:48,928 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:48,951 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:10:49,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 170 treesize of output 186 [2018-01-24 12:10:49,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 176 [2018-01-24 12:10:49,093 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:49,179 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:49,199 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 145 treesize of output 196 [2018-01-24 12:10:49,201 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-01-24 12:10:49,317 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 12:10:49,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 166 treesize of output 173 [2018-01-24 12:10:49,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 172 [2018-01-24 12:10:49,617 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:49,700 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:49,716 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 141 treesize of output 192 [2018-01-24 12:10:49,717 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2018-01-24 12:10:49,811 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 12:10:49,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 127 [2018-01-24 12:10:49,824 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:49,824 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:49,825 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:10:49,827 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 37 treesize of output 78 [2018-01-24 12:10:49,828 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:49,850 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:10:49,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 127 [2018-01-24 12:10:49,859 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:49,860 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:10:49,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 78 [2018-01-24 12:10:49,862 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:49,885 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:10:50,057 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 123 treesize of output 118 [2018-01-24 12:10:50,061 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:50,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 39 [2018-01-24 12:10:50,064 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:50,091 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:10:50,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 6 dim-2 vars, End of recursive call: 5 dim-0 vars, and 5 xjuncts. [2018-01-24 12:10:50,222 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 15 variables, input treesize:401, output treesize:529 [2018-01-24 12:10:50,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 170 treesize of output 186 [2018-01-24 12:10:50,471 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:50,475 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 160 treesize of output 183 [2018-01-24 12:10:50,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:50,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 166 [2018-01-24 12:10:50,568 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:50,621 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:10:51,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 141 [2018-01-24 12:10:51,417 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:51,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 63 [2018-01-24 12:10:51,418 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:51,437 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:10:52,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 141 [2018-01-24 12:10:52,095 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:52,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 63 [2018-01-24 12:10:52,096 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:52,122 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:10:52,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 128 [2018-01-24 12:10:52,652 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:52,653 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 36 treesize of output 63 [2018-01-24 12:10:52,653 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:52,669 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:10:53,039 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 155 treesize of output 148 [2018-01-24 12:10:53,042 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:53,042 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 36 treesize of output 63 [2018-01-24 12:10:53,043 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:53,062 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:10:53,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 131 [2018-01-24 12:10:53,372 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:53,373 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 36 treesize of output 63 [2018-01-24 12:10:53,373 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:53,391 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:10:53,616 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 145 treesize of output 128 [2018-01-24 12:10:53,618 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:53,619 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 36 treesize of output 63 [2018-01-24 12:10:53,619 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:53,635 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:10:53,802 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:10:53,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 148 [2018-01-24 12:10:53,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 21 [2018-01-24 12:10:53,806 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:53,821 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:10:53,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 166 treesize of output 173 [2018-01-24 12:10:53,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 172 [2018-01-24 12:10:53,973 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:54,100 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:10:54,214 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:10:54,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 110 [2018-01-24 12:10:54,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 21 [2018-01-24 12:10:54,216 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:54,227 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:10:54,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 10 dim-2 vars, End of recursive call: 7 dim-0 vars, and 5 xjuncts. [2018-01-24 12:10:54,329 INFO L202 ElimStorePlain]: Needed 22 recursive calls to eliminate 17 variables, input treesize:791, output treesize:661 [2018-01-24 12:10:54,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 102 [2018-01-24 12:10:54,543 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:10:54,543 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 44 treesize of output 32 [2018-01-24 12:10:54,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:54,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-01-24 12:10:54,586 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:54,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:10:54,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 123 [2018-01-24 12:10:54,675 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:10:54,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 60 [2018-01-24 12:10:54,676 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:54,694 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:54,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-01-24 12:10:54,694 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:54,708 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:10:54,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 53 [2018-01-24 12:10:54,771 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:10:54,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2018-01-24 12:10:54,772 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:54,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-24 12:10:54,785 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:54,792 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:10:54,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 63 [2018-01-24 12:10:54,844 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:10:54,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-01-24 12:10:54,845 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:54,857 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:54,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-01-24 12:10:54,857 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:54,865 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:10:54,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 134 [2018-01-24 12:10:54,913 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:54,913 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 27 treesize of output 20 [2018-01-24 12:10:54,914 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:54,932 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:10:54,933 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 63 treesize of output 47 [2018-01-24 12:10:54,933 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:54,946 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:10:54,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 64 [2018-01-24 12:10:54,983 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:10:54,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 30 [2018-01-24 12:10:54,984 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:54,996 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:10:54,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-01-24 12:10:54,997 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-01-24 12:10:55,004 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:10:55,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:10:55,029 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 15 variables, input treesize:418, output treesize:14 [2018-01-24 12:10:55,100 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:10:55,121 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:10:55,121 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 42 [2018-01-24 12:10:55,121 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-01-24 12:10:55,121 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-01-24 12:10:55,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1685, Unknown=0, NotChecked=0, Total=1806 [2018-01-24 12:10:55,122 INFO L87 Difference]: Start difference. First operand 143 states and 152 transitions. Second operand 43 states. [2018-01-24 12:10:56,177 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 98 DAG size of output 67 [2018-01-24 12:10:56,405 WARN L146 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 125 DAG size of output 112 [2018-01-24 12:10:57,485 WARN L146 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 247 DAG size of output 93 [2018-01-24 12:10:57,883 WARN L146 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 203 DAG size of output 80 [2018-01-24 12:10:58,212 WARN L146 SmtUtils]: Spent 145ms on a formula simplification. DAG size of input: 256 DAG size of output 99 [2018-01-24 12:10:58,569 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 89 DAG size of output 47 [2018-01-24 12:10:59,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:10:59,875 INFO L93 Difference]: Finished difference Result 197 states and 215 transitions. [2018-01-24 12:10:59,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-01-24 12:10:59,911 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 50 [2018-01-24 12:10:59,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:10:59,912 INFO L225 Difference]: With dead ends: 197 [2018-01-24 12:10:59,912 INFO L226 Difference]: Without dead ends: 196 [2018-01-24 12:10:59,914 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 995 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=593, Invalid=4809, Unknown=0, NotChecked=0, Total=5402 [2018-01-24 12:10:59,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-01-24 12:10:59,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 143. [2018-01-24 12:10:59,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-24 12:10:59,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 151 transitions. [2018-01-24 12:10:59,925 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 151 transitions. Word has length 50 [2018-01-24 12:10:59,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:10:59,925 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 151 transitions. [2018-01-24 12:10:59,925 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-01-24 12:10:59,925 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 151 transitions. [2018-01-24 12:10:59,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-24 12:10:59,926 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:10:59,926 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:10:59,926 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-24 12:10:59,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1254680052, now seen corresponding path program 1 times [2018-01-24 12:10:59,926 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:10:59,926 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:10:59,927 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:10:59,927 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:10:59,927 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:10:59,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:10:59,947 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:11:00,645 WARN L146 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 54 DAG size of output 51 [2018-01-24 12:11:00,839 WARN L146 SmtUtils]: Spent 140ms on a formula simplification. DAG size of input: 52 DAG size of output 49 [2018-01-24 12:11:01,364 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:11:01,364 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:11:01,364 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:11:01,370 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:11:01,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:11:01,406 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:11:01,417 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:01,418 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:01,419 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-01-24 12:11:01,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:11:01,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:11:01,420 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-01-24 12:11:01,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 12:11:01,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 12:11:01,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:11:01,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:11:01,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 12:11:01,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 12:11:01,493 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:11:01,494 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:11:01,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:11:01,499 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2018-01-24 12:11:01,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-01-24 12:11:01,512 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:01,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-24 12:11:01,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:11:01,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:11:01,526 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 26 treesize of output 21 [2018-01-24 12:11:01,531 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:01,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-24 12:11:01,532 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:11:01,536 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:11:01,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:11:01,543 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:60, output treesize:42 [2018-01-24 12:11:01,700 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:11:01,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:11:01,717 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:11:01,720 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:11:01,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 12:11:01,732 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:67, output treesize:69 [2018-01-24 12:11:02,064 WARN L1029 $PredicateComparison]: unable to prove that (exists ((append_~node~4.offset Int) (append_~head.offset Int) (append_~node~4.base Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_2 Int)) (let ((.cse1 (+ append_~node~4.offset 1)) (.cse2 (+ append_~node~4.offset 5)) (.cse4 (+ append_~head.offset 4))) (and (= 0 (select |c_old(#valid)| append_~node~4.base)) (= |c_#valid| (store |c_old(#valid)| append_~node~4.base 1)) (= |c_#memory_$Pointer$.offset| (let ((.cse0 (let ((.cse3 (store |c_old(#memory_$Pointer$.offset)| append_~node~4.base (store (select |c_old(#memory_$Pointer$.offset)| append_~node~4.base) append_~node~4.offset v_DerPreprocessor_4)))) (store .cse3 |c_append_#in~head.base| (store (store (select .cse3 |c_append_#in~head.base|) append_~head.offset append_~node~4.offset) .cse4 append_~node~4.offset))))) (store .cse0 append_~node~4.base (store (store (select .cse0 append_~node~4.base) .cse1 0) .cse2 0)))) (= |c_#memory_$Pointer$.base| (let ((.cse5 (let ((.cse6 (store |c_old(#memory_$Pointer$.base)| append_~node~4.base (store (select |c_old(#memory_$Pointer$.base)| append_~node~4.base) append_~node~4.offset v_DerPreprocessor_2)))) (store .cse6 |c_append_#in~head.base| (store (store (select .cse6 |c_append_#in~head.base|) append_~head.offset append_~node~4.base) .cse4 append_~node~4.base))))) (store .cse5 append_~node~4.base (store (store (select .cse5 append_~node~4.base) .cse1 0) .cse2 0))))))) is different from true [2018-01-24 12:11:02,081 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:02,084 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:02,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-24 12:11:02,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:11:02,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 73 [2018-01-24 12:11:02,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 12:11:02,252 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:11:02,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 66 [2018-01-24 12:11:02,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 46 [2018-01-24 12:11:02,362 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:02,363 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 40 treesize of output 44 [2018-01-24 12:11:02,363 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 12:11:02,400 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:02,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 54 [2018-01-24 12:11:02,415 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-01-24 12:11:02,453 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 12:11:02,537 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 58 treesize of output 53 [2018-01-24 12:11:02,543 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:02,544 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:02,568 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 61 [2018-01-24 12:11:02,572 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:02,573 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:02,574 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:02,575 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:02,576 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:02,577 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:11:02,583 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 47 treesize of output 78 [2018-01-24 12:11:02,583 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-24 12:11:02,641 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:02,642 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:02,643 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:02,643 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:02,644 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:02,645 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:02,652 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 35 treesize of output 78 [2018-01-24 12:11:02,652 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-24 12:11:02,706 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:02,708 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:02,711 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:02,714 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:02,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 35 treesize of output 74 [2018-01-24 12:11:02,742 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-01-24 12:11:02,885 INFO L267 ElimStorePlain]: Start of recursive call 10: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-01-24 12:11:02,949 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-01-24 12:11:02,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 53 [2018-01-24 12:11:02,960 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:02,960 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:02,961 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:02,964 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 28 treesize of output 52 [2018-01-24 12:11:02,968 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:02,968 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:02,969 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:02,970 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:02,971 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:02,972 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:02,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-01-24 12:11:02,979 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-24 12:11:02,996 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:11:03,011 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:11:03,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 51 [2018-01-24 12:11:03,025 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:03,026 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:03,027 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:03,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2018-01-24 12:11:03,033 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:03,034 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:03,035 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:03,035 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:03,036 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:03,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-01-24 12:11:03,042 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-01-24 12:11:03,057 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:11:03,072 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:11:03,280 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-01-24 12:11:03,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 67 [2018-01-24 12:11:03,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-01-24 12:11:03,323 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:03,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-24 12:11:03,324 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-01-24 12:11:03,336 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:11:03,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 65 [2018-01-24 12:11:03,392 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:03,394 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 35 [2018-01-24 12:11:03,398 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:03,399 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:03,401 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:03,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, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 64 [2018-01-24 12:11:03,407 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-01-24 12:11:03,423 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:11:03,449 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:11:03,474 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:11:03,668 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-01-24 12:11:03,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 73 [2018-01-24 12:11:03,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 12:11:03,911 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-01-24 12:11:03,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 67 [2018-01-24 12:11:03,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-01-24 12:11:03,967 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:03,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-24 12:11:03,967 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-01-24 12:11:03,973 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:11:03,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 65 [2018-01-24 12:11:04,001 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:04,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-01-24 12:11:04,009 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:04,010 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:04,010 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:04,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-01-24 12:11:04,013 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-01-24 12:11:04,020 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:11:04,033 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:11:04,045 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:11:04,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 66 [2018-01-24 12:11:04,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 46 [2018-01-24 12:11:04,078 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:04,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 44 [2018-01-24 12:11:04,079 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-01-24 12:11:04,110 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:04,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 54 [2018-01-24 12:11:04,122 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 2 xjuncts. [2018-01-24 12:11:04,157 INFO L267 ElimStorePlain]: Start of recursive call 35: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 12:11:04,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 51 [2018-01-24 12:11:04,209 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:04,210 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:04,211 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:04,215 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 28 treesize of output 50 [2018-01-24 12:11:04,218 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:04,219 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:04,219 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:04,220 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:04,221 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:04,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-01-24 12:11:04,225 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-01-24 12:11:04,236 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:11:04,247 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:11:04,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 53 [2018-01-24 12:11:04,259 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:04,260 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:04,261 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:04,264 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 28 treesize of output 52 [2018-01-24 12:11:04,268 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:04,269 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:04,270 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:04,270 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:04,271 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:04,272 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:04,277 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-01-24 12:11:04,277 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-01-24 12:11:04,291 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:11:04,304 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:11:04,314 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 58 treesize of output 53 [2018-01-24 12:11:04,321 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:04,322 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:04,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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 61 [2018-01-24 12:11:04,349 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:04,351 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:04,351 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:04,352 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:04,354 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:04,354 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:11:04,361 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 47 treesize of output 78 [2018-01-24 12:11:04,361 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-01-24 12:11:04,409 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:04,411 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:04,413 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:04,416 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:04,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 35 treesize of output 74 [2018-01-24 12:11:04,441 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 2 xjuncts. [2018-01-24 12:11:04,492 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:04,493 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:04,494 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:04,494 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:04,495 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:04,496 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:04,502 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 35 treesize of output 78 [2018-01-24 12:11:04,502 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-01-24 12:11:04,573 INFO L267 ElimStorePlain]: Start of recursive call 45: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-01-24 12:11:04,611 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-01-24 12:11:04,678 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-01-24 12:11:04,764 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-01-24 12:11:04,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 42 dim-0 vars, and 21 xjuncts. [2018-01-24 12:11:04,937 INFO L202 ElimStorePlain]: Needed 48 recursive calls to eliminate 9 variables, input treesize:205, output treesize:3010 [2018-01-24 12:11:07,484 WARN L146 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 660 DAG size of output 43 [2018-01-24 12:11:07,623 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:07,624 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:07,625 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:07,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 12:11:07,625 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:11:07,641 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-01-24 12:11:07,641 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:84, output treesize:77 [2018-01-24 12:11:07,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 57 [2018-01-24 12:11:07,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 1 [2018-01-24 12:11:07,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:11:07,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:11:07,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 57 [2018-01-24 12:11:07,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 1 [2018-01-24 12:11:07,819 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:11:07,827 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:11:07,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 12:11:07,841 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:107, output treesize:69 [2018-01-24 12:11:07,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-01-24 12:11:07,908 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:07,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 18 treesize of output 10 [2018-01-24 12:11:07,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:11:07,915 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:07,916 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 13 treesize of output 6 [2018-01-24 12:11:07,916 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:11:07,919 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:11:07,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-01-24 12:11:07,930 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:07,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-01-24 12:11:07,931 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 12:11:07,937 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:07,937 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 13 treesize of output 6 [2018-01-24 12:11:07,938 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 12:11:07,940 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:11:07,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:11:07,943 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:83, output treesize:7 [2018-01-24 12:11:08,036 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:11:08,056 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:11:08,056 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 40 [2018-01-24 12:11:08,056 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-24 12:11:08,056 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-24 12:11:08,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1333, Unknown=20, NotChecked=74, Total=1560 [2018-01-24 12:11:08,057 INFO L87 Difference]: Start difference. First operand 143 states and 151 transitions. Second operand 40 states. [2018-01-24 12:11:10,273 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 88 DAG size of output 54 [2018-01-24 12:11:11,493 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 92 DAG size of output 86 [2018-01-24 12:11:12,079 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 86 DAG size of output 82 [2018-01-24 12:11:14,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:11:14,366 INFO L93 Difference]: Finished difference Result 317 states and 343 transitions. [2018-01-24 12:11:14,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-24 12:11:14,366 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 52 [2018-01-24 12:11:14,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:11:14,367 INFO L225 Difference]: With dead ends: 317 [2018-01-24 12:11:14,367 INFO L226 Difference]: Without dead ends: 237 [2018-01-24 12:11:14,368 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 771 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=392, Invalid=3192, Unknown=80, NotChecked=118, Total=3782 [2018-01-24 12:11:14,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-01-24 12:11:14,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 167. [2018-01-24 12:11:14,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-01-24 12:11:14,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 184 transitions. [2018-01-24 12:11:14,387 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 184 transitions. Word has length 52 [2018-01-24 12:11:14,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:11:14,387 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 184 transitions. [2018-01-24 12:11:14,388 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-01-24 12:11:14,388 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 184 transitions. [2018-01-24 12:11:14,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-24 12:11:14,388 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:11:14,389 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2018-01-24 12:11:14,389 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-24 12:11:14,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1222988087, now seen corresponding path program 1 times [2018-01-24 12:11:14,389 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:11:14,389 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:11:14,390 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:11:14,390 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:11:14,390 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:11:14,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:11:14,427 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:11:15,304 WARN L146 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 55 DAG size of output 53 [2018-01-24 12:11:15,503 WARN L146 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 53 DAG size of output 51 [2018-01-24 12:11:16,096 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:11:16,097 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:11:16,097 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:11:16,101 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:11:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:11:16,153 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:11:16,185 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:16,185 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:16,186 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-01-24 12:11:16,186 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:11:16,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:11:16,188 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-24 12:11:16,280 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 13 treesize of output 10 [2018-01-24 12:11:16,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-24 12:11:16,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:11:16,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:11:16,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-24 12:11:16,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-24 12:11:16,292 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:11:16,294 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:11:16,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:11:16,299 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2018-01-24 12:11:16,439 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:11:16,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:11:16,455 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:11:16,458 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:11:16,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 12:11:16,469 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:67, output treesize:69 [2018-01-24 12:11:16,706 WARN L1029 $PredicateComparison]: unable to prove that (exists ((append_~node~4.offset Int) (append_~head.offset Int) (v_DerPreprocessor_8 Int) (v_DerPreprocessor_6 Int) (append_~node~4.base Int)) (let ((.cse1 (+ append_~node~4.offset 1)) (.cse2 (+ append_~node~4.offset 5)) (.cse4 (+ append_~head.offset 4))) (and (= 0 (select |c_old(#valid)| append_~node~4.base)) (= |c_#valid| (store |c_old(#valid)| append_~node~4.base 1)) (= (let ((.cse0 (let ((.cse3 (store |c_old(#memory_$Pointer$.base)| append_~node~4.base (store (select |c_old(#memory_$Pointer$.base)| append_~node~4.base) append_~node~4.offset v_DerPreprocessor_8)))) (store .cse3 |c_append_#in~head.base| (store (store (select .cse3 |c_append_#in~head.base|) append_~head.offset append_~node~4.base) .cse4 append_~node~4.base))))) (store .cse0 append_~node~4.base (store (store (select .cse0 append_~node~4.base) .cse1 0) .cse2 0))) |c_#memory_$Pointer$.base|) (= (let ((.cse5 (let ((.cse6 (store |c_old(#memory_$Pointer$.offset)| append_~node~4.base (store (select |c_old(#memory_$Pointer$.offset)| append_~node~4.base) append_~node~4.offset v_DerPreprocessor_6)))) (store .cse6 |c_append_#in~head.base| (store (store (select .cse6 |c_append_#in~head.base|) append_~head.offset append_~node~4.offset) .cse4 append_~node~4.offset))))) (store .cse5 append_~node~4.base (store (store (select .cse5 append_~node~4.base) .cse1 0) .cse2 0))) |c_#memory_$Pointer$.offset|)))) is different from true [2018-01-24 12:11:16,720 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:16,728 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:16,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-24 12:11:16,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:11:16,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 66 [2018-01-24 12:11:16,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 12:11:16,922 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:11:17,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 59 [2018-01-24 12:11:17,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 46 [2018-01-24 12:11:17,038 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:17,039 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 40 treesize of output 44 [2018-01-24 12:11:17,039 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 12:11:17,079 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:17,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 54 [2018-01-24 12:11:17,092 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-01-24 12:11:17,132 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 12:11:17,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 44 [2018-01-24 12:11:17,231 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:17,232 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:17,232 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:17,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2018-01-24 12:11:17,266 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:17,277 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:17,279 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:17,280 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:17,281 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:17,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-01-24 12:11:17,292 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-24 12:11:17,311 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:11:17,325 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:11:17,333 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 49 treesize of output 46 [2018-01-24 12:11:17,336 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:17,336 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:17,337 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:17,340 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 28 treesize of output 52 [2018-01-24 12:11:17,343 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:17,344 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:17,345 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:17,346 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:17,347 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:17,348 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:17,355 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-01-24 12:11:17,355 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-24 12:11:17,372 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:11:17,386 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:11:17,394 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 51 treesize of output 46 [2018-01-24 12:11:17,400 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:17,401 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:17,424 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 61 [2018-01-24 12:11:17,428 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:17,429 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:17,430 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:17,431 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:17,432 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:17,432 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:11:17,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 78 [2018-01-24 12:11:17,439 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-24 12:11:17,527 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:17,530 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:17,532 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:17,535 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:17,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 35 treesize of output 74 [2018-01-24 12:11:17,563 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-01-24 12:11:17,637 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:17,638 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:17,639 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:17,640 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:17,641 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:17,641 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:17,648 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 35 treesize of output 78 [2018-01-24 12:11:17,648 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-01-24 12:11:17,718 INFO L267 ElimStorePlain]: Start of recursive call 16: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-01-24 12:11:17,778 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-01-24 12:11:18,006 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-01-24 12:11:18,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2018-01-24 12:11:18,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-01-24 12:11:18,051 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:18,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-24 12:11:18,052 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-01-24 12:11:18,064 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:11:18,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 58 [2018-01-24 12:11:18,123 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:18,127 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 35 [2018-01-24 12:11:18,130 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:18,132 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:18,133 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:18,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 64 [2018-01-24 12:11:18,137 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-01-24 12:11:18,153 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:11:18,177 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:11:18,199 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:11:18,331 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-01-24 12:11:18,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 66 [2018-01-24 12:11:18,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 12:11:18,586 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-01-24 12:11:18,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2018-01-24 12:11:18,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-01-24 12:11:18,642 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:18,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-24 12:11:18,643 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-01-24 12:11:18,650 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:11:18,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 58 [2018-01-24 12:11:18,680 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:18,682 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-01-24 12:11:18,685 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:18,686 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:18,687 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:18,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-01-24 12:11:18,690 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-01-24 12:11:18,699 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:11:18,711 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:11:18,722 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:11:18,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 59 [2018-01-24 12:11:18,750 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 2 case distinctions, treesize of input 43 treesize of output 46 [2018-01-24 12:11:18,757 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:18,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 3 case distinctions, treesize of input 42 treesize of output 54 [2018-01-24 12:11:18,771 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 2 xjuncts. [2018-01-24 12:11:18,819 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:18,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 44 [2018-01-24 12:11:18,820 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-01-24 12:11:18,860 INFO L267 ElimStorePlain]: Start of recursive call 35: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 12:11:18,918 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 51 treesize of output 46 [2018-01-24 12:11:18,925 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:18,926 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:18,962 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 61 [2018-01-24 12:11:18,969 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:18,971 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:18,973 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:18,977 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:19,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 47 treesize of output 74 [2018-01-24 12:11:19,004 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 2 xjuncts. [2018-01-24 12:11:19,071 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:19,072 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:19,073 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:19,074 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:19,075 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:19,075 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:11:19,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 72 [2018-01-24 12:11:19,081 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-01-24 12:11:19,177 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:19,178 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:19,179 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:19,180 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:19,181 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:19,182 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:19,189 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 35 treesize of output 78 [2018-01-24 12:11:19,189 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-01-24 12:11:19,234 INFO L267 ElimStorePlain]: Start of recursive call 39: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-01-24 12:11:19,273 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-01-24 12:11:19,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 44 [2018-01-24 12:11:19,286 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:19,287 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:19,288 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:19,292 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 28 treesize of output 50 [2018-01-24 12:11:19,300 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:19,307 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:19,309 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:19,317 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:19,319 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:19,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-01-24 12:11:19,343 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-01-24 12:11:19,399 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:11:19,411 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:11:19,421 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 49 treesize of output 46 [2018-01-24 12:11:19,425 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:19,426 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:19,427 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:19,429 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 28 treesize of output 52 [2018-01-24 12:11:19,432 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:19,434 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:19,434 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:19,435 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:19,436 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:19,437 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:11:19,442 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-01-24 12:11:19,442 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-01-24 12:11:19,458 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:11:19,469 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:11:19,535 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-01-24 12:11:19,608 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-01-24 12:11:19,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 42 dim-0 vars, and 21 xjuncts. [2018-01-24 12:11:19,786 INFO L202 ElimStorePlain]: Needed 48 recursive calls to eliminate 9 variables, input treesize:194, output treesize:2719 Received shutdown request... [2018-01-24 12:11:21,953 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 12:11:21,953 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 12:11:21,983 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 12:11:21,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:11:21 BoogieIcfgContainer [2018-01-24 12:11:21,984 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 12:11:21,984 INFO L168 Benchmark]: Toolchain (without parser) took 55619.22 ms. Allocated memory was 308.8 MB in the beginning and 727.7 MB in the end (delta: 418.9 MB). Free memory was 268.8 MB in the beginning and 536.8 MB in the end (delta: -268.0 MB). Peak memory consumption was 150.9 MB. Max. memory is 5.3 GB. [2018-01-24 12:11:21,985 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 308.8 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:11:21,985 INFO L168 Benchmark]: CACSL2BoogieTranslator took 218.22 ms. Allocated memory is still 308.8 MB. Free memory was 267.8 MB in the beginning and 256.7 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. [2018-01-24 12:11:21,986 INFO L168 Benchmark]: Boogie Preprocessor took 39.95 ms. Allocated memory is still 308.8 MB. Free memory was 256.7 MB in the beginning and 254.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:11:21,986 INFO L168 Benchmark]: RCFGBuilder took 578.19 ms. Allocated memory is still 308.8 MB. Free memory was 254.8 MB in the beginning and 221.2 MB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 5.3 GB. [2018-01-24 12:11:21,986 INFO L168 Benchmark]: TraceAbstraction took 54775.38 ms. Allocated memory was 308.8 MB in the beginning and 727.7 MB in the end (delta: 418.9 MB). Free memory was 221.2 MB in the beginning and 536.8 MB in the end (delta: -315.6 MB). Peak memory consumption was 103.3 MB. Max. memory is 5.3 GB. [2018-01-24 12:11:21,988 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.20 ms. Allocated memory is still 308.8 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 218.22 ms. Allocated memory is still 308.8 MB. Free memory was 267.8 MB in the beginning and 256.7 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.95 ms. Allocated memory is still 308.8 MB. Free memory was 256.7 MB in the beginning and 254.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 578.19 ms. Allocated memory is still 308.8 MB. Free memory was 254.8 MB in the beginning and 221.2 MB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 54775.38 ms. Allocated memory was 308.8 MB in the beginning and 727.7 MB in the end (delta: 418.9 MB). Free memory was 221.2 MB in the beginning and 536.8 MB in the end (delta: -315.6 MB). Peak memory consumption was 103.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 575). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 580). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 583). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 582). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 576). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 589). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 554]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 575). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 580). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 583). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 582). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 589). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 576). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 131 locations, 55 error locations. TIMEOUT Result, 54.7s OverallTime, 17 OverallIterations, 2 TraceHistogramMax, 22.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1396 SDtfs, 3272 SDslu, 7525 SDs, 0 SdLazy, 8932 SolverSat, 665 SolverUnsat, 118 SolverUnknown, 0 SolverNotchecked, 12.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 558 GetRequests, 190 SyntacticMatches, 31 SemanticMatches, 337 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3658 ImplicationChecksByTransitivity, 19.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=174occurred in iteration=10, 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, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 422 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 23.5s InterpolantComputationTime, 700 NumberOfCodeBlocks, 700 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 679 ConstructedInterpolants, 105 QuantifiedInterpolants, 819292 SizeOfPredicates, 79 NumberOfNonLiveVariables, 1267 ConjunctsInSsa, 241 ConjunctsInUnsatCore, 21 InterpolantComputations, 11 PerfectInterpolantSequences, 6/76 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/length_test03_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-11-21-996.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/length_test03_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_12-11-21-996.csv Completed graceful shutdown