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/mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 01:02:06,099 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 01:02:06,101 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 01:02:06,115 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 01:02:06,116 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 01:02:06,117 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 01:02:06,118 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 01:02:06,119 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 01:02:06,121 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 01:02:06,122 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 01:02:06,122 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 01:02:06,123 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 01:02:06,123 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 01:02:06,124 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 01:02:06,125 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 01:02:06,127 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 01:02:06,130 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 01:02:06,132 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 01:02:06,133 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 01:02:06,134 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 01:02:06,136 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 01:02:06,137 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 01:02:06,137 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 01:02:06,138 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 01:02:06,139 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 01:02:06,140 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 01:02:06,140 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 01:02:06,141 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 01:02:06,141 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 01:02:06,141 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 01:02:06,142 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 01:02:06,142 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf [2018-01-21 01:02:06,152 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 01:02:06,153 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 01:02:06,154 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 01:02:06,154 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 01:02:06,154 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 01:02:06,154 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 01:02:06,154 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 01:02:06,155 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 01:02:06,155 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 01:02:06,155 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 01:02:06,156 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 01:02:06,156 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 01:02:06,156 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 01:02:06,156 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 01:02:06,156 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 01:02:06,156 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 01:02:06,157 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 01:02:06,157 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 01:02:06,157 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 01:02:06,157 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 01:02:06,157 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 01:02:06,158 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 01:02:06,158 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 01:02:06,158 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 01:02:06,158 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 01:02:06,158 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 01:02:06,159 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 01:02:06,159 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 01:02:06,159 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 01:02:06,159 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 01:02:06,159 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 01:02:06,159 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 01:02:06,160 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 01:02:06,160 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 01:02:06,160 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 01:02:06,160 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 01:02:06,160 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 01:02:06,161 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 01:02:06,161 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 01:02:06,195 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 01:02:06,207 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 01:02:06,210 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 01:02:06,211 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 01:02:06,211 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 01:02:06,212 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i [2018-01-21 01:02:06,376 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 01:02:06,381 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 01:02:06,382 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 01:02:06,382 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 01:02:06,387 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 01:02:06,388 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 01:02:06" (1/1) ... [2018-01-21 01:02:06,391 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b83b4c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:02:06, skipping insertion in model container [2018-01-21 01:02:06,391 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 01:02:06" (1/1) ... [2018-01-21 01:02:06,411 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 01:02:06,454 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 01:02:06,570 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 01:02:06,591 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 01:02:06,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:02:06 WrapperNode [2018-01-21 01:02:06,601 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 01:02:06,602 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 01:02:06,602 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 01:02:06,602 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 01:02:06,619 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:02:06" (1/1) ... [2018-01-21 01:02:06,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:02:06" (1/1) ... [2018-01-21 01:02:06,627 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:02:06" (1/1) ... [2018-01-21 01:02:06,627 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:02:06" (1/1) ... [2018-01-21 01:02:06,632 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:02:06" (1/1) ... [2018-01-21 01:02:06,637 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:02:06" (1/1) ... [2018-01-21 01:02:06,639 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:02:06" (1/1) ... [2018-01-21 01:02:06,641 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 01:02:06,641 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 01:02:06,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 01:02:06,641 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 01:02:06,642 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:02:06" (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-21 01:02:06,691 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 01:02:06,692 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 01:02:06,692 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 01:02:06,692 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 01:02:06,692 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 01:02:06,692 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 01:02:06,692 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 01:02:06,692 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 01:02:06,692 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 01:02:06,693 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 01:02:06,693 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 01:02:06,693 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 01:02:06,693 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 01:02:06,693 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-21 01:02:06,693 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 01:02:06,693 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 01:02:06,693 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 01:02:07,076 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 01:02:07,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 01:02:07 BoogieIcfgContainer [2018-01-21 01:02:07,076 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 01:02:07,077 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 01:02:07,077 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 01:02:07,079 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 01:02:07,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 01:02:06" (1/3) ... [2018-01-21 01:02:07,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76d62ac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 01:02:07, skipping insertion in model container [2018-01-21 01:02:07,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:02:06" (2/3) ... [2018-01-21 01:02:07,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76d62ac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 01:02:07, skipping insertion in model container [2018-01-21 01:02:07,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 01:02:07" (3/3) ... [2018-01-21 01:02:07,082 INFO L105 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i [2018-01-21 01:02:07,088 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 01:02:07,093 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-21 01:02:07,143 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 01:02:07,143 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 01:02:07,143 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 01:02:07,143 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 01:02:07,143 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 01:02:07,143 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 01:02:07,144 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 01:02:07,144 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 01:02:07,145 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 01:02:07,162 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states. [2018-01-21 01:02:07,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 01:02:07,166 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:02:07,167 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 01:02:07,167 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 01:02:07,171 INFO L82 PathProgramCache]: Analyzing trace with hash 261931, now seen corresponding path program 1 times [2018-01-21 01:02:07,173 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:02:07,219 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:02:07,219 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:02:07,219 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:02:07,220 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:02:07,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 01:02:07,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 01:02:07,275 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 01:02:07,284 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 01:02:07,290 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 01:02:07,290 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 01:02:07,290 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 01:02:07,290 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 01:02:07,290 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 01:02:07,291 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 01:02:07,291 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 01:02:07,291 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 01:02:07,291 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 01:02:07,294 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states. [2018-01-21 01:02:07,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-21 01:02:07,295 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:02:07,295 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-21 01:02:07,295 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:02:07,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1481030300, now seen corresponding path program 1 times [2018-01-21 01:02:07,296 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:02:07,297 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:02:07,297 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:02:07,297 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:02:07,297 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:02:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:02:07,331 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:02:07,469 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-21 01:02:07,470 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:02:07,471 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 01:02:07,471 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:02:07,473 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 01:02:07,488 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 01:02:07,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 01:02:07,491 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 2 states. [2018-01-21 01:02:07,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:02:07,522 INFO L93 Difference]: Finished difference Result 170 states and 228 transitions. [2018-01-21 01:02:07,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 01:02:07,524 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-01-21 01:02:07,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:02:07,535 INFO L225 Difference]: With dead ends: 170 [2018-01-21 01:02:07,535 INFO L226 Difference]: Without dead ends: 88 [2018-01-21 01:02:07,538 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 01:02:07,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-21 01:02:07,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-01-21 01:02:07,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-21 01:02:07,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2018-01-21 01:02:07,574 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 21 [2018-01-21 01:02:07,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:02:07,575 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2018-01-21 01:02:07,575 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 01:02:07,575 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2018-01-21 01:02:07,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-21 01:02:07,576 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:02:07,577 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-21 01:02:07,577 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:02:07,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1311117136, now seen corresponding path program 1 times [2018-01-21 01:02:07,577 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:02:07,578 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:02:07,579 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:02:07,579 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:02:07,579 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:02:07,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:02:07,602 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:02:07,683 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-21 01:02:07,684 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:02:07,684 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 01:02:07,684 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:02:07,686 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 01:02:07,686 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 01:02:07,686 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 01:02:07,686 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand 5 states. [2018-01-21 01:02:07,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:02:07,887 INFO L93 Difference]: Finished difference Result 139 states and 150 transitions. [2018-01-21 01:02:07,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 01:02:07,888 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-01-21 01:02:07,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:02:07,889 INFO L225 Difference]: With dead ends: 139 [2018-01-21 01:02:07,889 INFO L226 Difference]: Without dead ends: 120 [2018-01-21 01:02:07,890 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-21 01:02:07,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-21 01:02:07,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 92. [2018-01-21 01:02:07,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-01-21 01:02:07,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2018-01-21 01:02:07,898 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 30 [2018-01-21 01:02:07,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:02:07,899 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2018-01-21 01:02:07,899 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 01:02:07,899 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2018-01-21 01:02:07,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-21 01:02:07,900 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:02:07,900 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:02:07,900 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:02:07,900 INFO L82 PathProgramCache]: Analyzing trace with hash 491544981, now seen corresponding path program 1 times [2018-01-21 01:02:07,901 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:02:07,902 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:02:07,902 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:02:07,902 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:02:07,902 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:02:07,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 01:02:07,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 01:02:07,956 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 01:02:07,965 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 01:02:07,971 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 01:02:07,972 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 01:02:07,983 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 01:02:07,983 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 01:02:07,983 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 01:02:07,983 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 01:02:07,983 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 01:02:07,984 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 01:02:07,984 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 01:02:07,984 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 01:02:07,984 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 01:02:07,985 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states. [2018-01-21 01:02:07,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-21 01:02:07,986 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:02:07,986 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:02:07,986 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 01:02:07,987 INFO L82 PathProgramCache]: Analyzing trace with hash 55172353, now seen corresponding path program 1 times [2018-01-21 01:02:07,987 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:02:07,988 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:02:07,988 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:02:07,988 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:02:07,988 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:02:07,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:02:08,000 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:02:08,015 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-21 01:02:08,016 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:02:08,016 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 01:02:08,016 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:02:08,016 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 01:02:08,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 01:02:08,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 01:02:08,016 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 2 states. [2018-01-21 01:02:08,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:02:08,022 INFO L93 Difference]: Finished difference Result 170 states and 228 transitions. [2018-01-21 01:02:08,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 01:02:08,022 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-01-21 01:02:08,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:02:08,023 INFO L225 Difference]: With dead ends: 170 [2018-01-21 01:02:08,023 INFO L226 Difference]: Without dead ends: 86 [2018-01-21 01:02:08,024 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 01:02:08,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-21 01:02:08,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-01-21 01:02:08,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-21 01:02:08,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-01-21 01:02:08,028 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 19 [2018-01-21 01:02:08,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:02:08,029 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-01-21 01:02:08,029 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 01:02:08,029 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-01-21 01:02:08,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-21 01:02:08,030 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:02:08,030 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] [2018-01-21 01:02:08,030 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 01:02:08,030 INFO L82 PathProgramCache]: Analyzing trace with hash 2057227957, now seen corresponding path program 1 times [2018-01-21 01:02:08,030 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:02:08,031 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:02:08,031 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:02:08,031 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:02:08,031 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:02:08,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:02:08,041 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:02:08,092 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-21 01:02:08,092 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:02:08,092 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 01:02:08,092 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:02:08,093 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 01:02:08,093 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 01:02:08,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 01:02:08,093 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 5 states. [2018-01-21 01:02:08,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:02:08,325 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2018-01-21 01:02:08,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 01:02:08,326 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-01-21 01:02:08,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:02:08,327 INFO L225 Difference]: With dead ends: 135 [2018-01-21 01:02:08,328 INFO L226 Difference]: Without dead ends: 118 [2018-01-21 01:02:08,328 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-21 01:02:08,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-21 01:02:08,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 90. [2018-01-21 01:02:08,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-01-21 01:02:08,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2018-01-21 01:02:08,335 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 28 [2018-01-21 01:02:08,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:02:08,336 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2018-01-21 01:02:08,336 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 01:02:08,336 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2018-01-21 01:02:08,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-21 01:02:08,338 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:02:08,338 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:02:08,338 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 01:02:08,338 INFO L82 PathProgramCache]: Analyzing trace with hash 894365242, now seen corresponding path program 1 times [2018-01-21 01:02:08,338 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:02:08,340 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:02:08,340 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:02:08,340 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:02:08,340 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:02:08,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:02:08,361 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:02:08,512 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 01:02:08,513 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:02:08,513 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 01:02:08,514 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2018-01-21 01:02:08,516 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [9], [11], [14], [99], [103], [108], [112], [120], [121], [126], [130], [138], [142], [144], [145], [188], [190], [191], [197], [201], [203], [204], [215], [216], [217], [218], [219], [224], [226], [227], [228], [234], [235], [236] [2018-01-21 01:02:08,574 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 01:02:08,574 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 01:02:09,005 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 01:02:09,006 INFO L268 AbstractInterpreter]: Visited 40 different actions 82 times. Merged at 18 different actions 37 times. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 31 variables. [2018-01-21 01:02:09,020 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 01:02:09,020 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:02:09,020 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-21 01:02:09,041 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:02:09,041 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 01:02:09,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:02:09,074 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 01:02:09,188 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 01:02:09,188 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 01:02:09,336 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 01:02:09,357 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:02:09,357 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 01:02:09,363 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:02:09,363 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 01:02:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:02:09,402 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 01:02:09,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 01:02:09,553 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 01:02:09,601 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 01:02:09,603 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 01:02:09,603 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6, 7, 5] total 18 [2018-01-21 01:02:09,603 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 01:02:09,604 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-21 01:02:09,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-21 01:02:09,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=266, Unknown=9, NotChecked=0, Total=342 [2018-01-21 01:02:09,604 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand 9 states. [2018-01-21 01:02:09,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:02:09,895 INFO L93 Difference]: Finished difference Result 146 states and 156 transitions. [2018-01-21 01:02:09,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-21 01:02:09,895 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-01-21 01:02:09,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:02:09,896 INFO L225 Difference]: With dead ends: 146 [2018-01-21 01:02:09,897 INFO L226 Difference]: Without dead ends: 143 [2018-01-21 01:02:09,897 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 154 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=102, Invalid=395, Unknown=9, NotChecked=0, Total=506 [2018-01-21 01:02:09,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-21 01:02:09,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 126. [2018-01-21 01:02:09,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-21 01:02:09,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2018-01-21 01:02:09,908 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 42 [2018-01-21 01:02:09,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:02:09,909 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2018-01-21 01:02:09,909 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-21 01:02:09,909 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2018-01-21 01:02:09,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-21 01:02:09,911 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:02:09,911 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:02:09,911 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-21 01:02:09,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1706144563, now seen corresponding path program 1 times [2018-01-21 01:02:09,911 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:02:09,913 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:02:09,913 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:02:09,913 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:02:09,913 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:02:09,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:02:09,927 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:02:10,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:02:10,009 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:02:10,009 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 01:02:10,009 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-01-21 01:02:10,010 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [9], [11], [14], [99], [103], [108], [112], [120], [121], [126], [130], [138], [142], [144], [145], [188], [190], [191], [197], [201], [203], [204], [207], [208], [209], [210], [211], [212], [213], [224], [226], [227], [228], [234], [235], [236] [2018-01-21 01:02:10,012 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 01:02:10,012 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 01:02:10,351 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 01:02:10,351 INFO L268 AbstractInterpreter]: Visited 42 different actions 80 times. Merged at 20 different actions 34 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 33 variables. [2018-01-21 01:02:10,373 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 01:02:10,374 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:02:10,374 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-21 01:02:10,381 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:02:10,381 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 01:02:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:02:10,406 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 01:02:10,425 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-21 01:02:10,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-21 01:02:10,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:10,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:02:10,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:02:10,431 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-21 01:02:10,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-21 01:02:10,439 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 15 treesize of output 3 [2018-01-21 01:02:10,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:10,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:02:10,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:02:10,443 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-01-21 01:02:10,454 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 01:02:10,454 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 01:02:10,492 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 01:02:10,513 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-21 01:02:10,513 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [8] total 9 [2018-01-21 01:02:10,513 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:02:10,513 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 01:02:10,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 01:02:10,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-21 01:02:10,514 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand 4 states. [2018-01-21 01:02:10,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:02:10,593 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2018-01-21 01:02:10,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 01:02:10,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-01-21 01:02:10,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:02:10,595 INFO L225 Difference]: With dead ends: 145 [2018-01-21 01:02:10,595 INFO L226 Difference]: Without dead ends: 128 [2018-01-21 01:02:10,595 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 84 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-21 01:02:10,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-01-21 01:02:10,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2018-01-21 01:02:10,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-21 01:02:10,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 134 transitions. [2018-01-21 01:02:10,604 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 134 transitions. Word has length 44 [2018-01-21 01:02:10,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:02:10,604 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 134 transitions. [2018-01-21 01:02:10,604 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 01:02:10,604 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 134 transitions. [2018-01-21 01:02:10,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-21 01:02:10,606 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:02:10,606 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:02:10,606 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-21 01:02:10,606 INFO L82 PathProgramCache]: Analyzing trace with hash -256957715, now seen corresponding path program 2 times [2018-01-21 01:02:10,606 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:02:10,607 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:02:10,607 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:02:10,607 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:02:10,608 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:02:10,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:02:10,620 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:02:10,733 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:02:10,733 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:02:10,734 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 01:02:10,734 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 01:02:10,734 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 01:02:10,734 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:02:10,734 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-21 01:02:10,739 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 01:02:10,739 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 01:02:10,750 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 01:02:10,758 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 01:02:10,759 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 01:02:10,762 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 01:02:10,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-21 01:02:10,778 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 11 treesize of output 3 [2018-01-21 01:02:10,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:10,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:02:10,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:02:10,782 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-01-21 01:02:10,808 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:02:10,808 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 01:02:10,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2018-01-21 01:02:10,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-21 01:02:10,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:10,950 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 15 treesize of output 9 [2018-01-21 01:02:10,950 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:10,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-01-21 01:02:10,980 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:10,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 01:02:11,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-21 01:02:11,002 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:20, output treesize:17 [2018-01-21 01:02:11,040 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:02:11,069 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:02:11,069 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 01:02:11,072 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 01:02:11,072 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 01:02:11,087 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 01:02:11,106 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 01:02:11,118 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 01:02:11,122 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 01:02:11,147 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 19 treesize of output 16 [2018-01-21 01:02:11,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-01-21 01:02:11,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:11,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:02:11,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:02:11,166 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:3 [2018-01-21 01:02:11,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-21 01:02:11,224 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 11 treesize of output 3 [2018-01-21 01:02:11,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:11,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:02:11,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:02:11,226 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-01-21 01:02:11,230 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:02:11,230 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 01:02:11,321 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:02:11,322 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 01:02:11,323 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11, 12, 10] total 30 [2018-01-21 01:02:11,323 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 01:02:11,323 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-21 01:02:11,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-21 01:02:11,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=737, Unknown=0, NotChecked=0, Total=870 [2018-01-21 01:02:11,324 INFO L87 Difference]: Start difference. First operand 126 states and 134 transitions. Second operand 13 states. [2018-01-21 01:02:11,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:02:11,576 INFO L93 Difference]: Finished difference Result 220 states and 240 transitions. [2018-01-21 01:02:11,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-21 01:02:11,577 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 50 [2018-01-21 01:02:11,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:02:11,578 INFO L225 Difference]: With dead ends: 220 [2018-01-21 01:02:11,578 INFO L226 Difference]: Without dead ends: 146 [2018-01-21 01:02:11,579 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 178 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=1050, Unknown=0, NotChecked=0, Total=1260 [2018-01-21 01:02:11,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-01-21 01:02:11,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 109. [2018-01-21 01:02:11,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-21 01:02:11,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2018-01-21 01:02:11,584 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 50 [2018-01-21 01:02:11,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:02:11,584 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2018-01-21 01:02:11,584 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-21 01:02:11,584 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2018-01-21 01:02:11,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-21 01:02:11,585 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:02:11,585 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, 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-21 01:02:11,585 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-21 01:02:11,585 INFO L82 PathProgramCache]: Analyzing trace with hash 434425747, now seen corresponding path program 1 times [2018-01-21 01:02:11,585 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:02:11,586 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:02:11,586 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 01:02:11,586 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:02:11,586 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:02:11,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:02:11,607 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:02:11,923 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 01:02:11,924 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:02:11,924 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 01:02:11,924 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 68 with the following transitions: [2018-01-21 01:02:11,924 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [9], [11], [14], [16], [17], [18], [19], [20], [21], [22], [23], [24], [25], [28], [29], [45], [46], [51], [55], [63], [64], [69], [73], [81], [86], [90], [99], [103], [108], [112], [120], [121], [126], [130], [138], [142], [144], [145], [188], [190], [191], [197], [201], [203], [204], [215], [216], [217], [218], [219], [224], [226], [227], [228], [234], [235], [236] [2018-01-21 01:02:11,926 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 01:02:11,926 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 01:02:12,458 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 01:02:12,458 INFO L268 AbstractInterpreter]: Visited 63 different actions 168 times. Merged at 52 different actions 97 times. Widened at 1 different actions 1 times. Found 8 fixpoints after 6 different actions. Largest state had 41 variables. [2018-01-21 01:02:12,461 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 01:02:12,461 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:02:12,461 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-21 01:02:12,471 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:02:12,471 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 01:02:12,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:02:12,497 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 01:02:12,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index 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-21 01:02:12,513 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:12,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:02:12,514 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-21 01:02:12,525 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:02:12,525 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:02:12,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-21 01:02:12,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:12,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:02:12,531 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2018-01-21 01:02:12,554 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-21 01:02:12,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index 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-21 01:02:12,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:12,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:02:12,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:02:12,565 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-01-21 01:02:12,638 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:02:12,642 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 38 treesize of output 42 [2018-01-21 01:02:12,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-21 01:02:12,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:12,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:02:12,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:02:12,658 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-01-21 01:02:12,751 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2018-01-21 01:02:12,759 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 16 treesize of output 23 [2018-01-21 01:02:12,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-21 01:02:12,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 01:02:12,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-21 01:02:12,789 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:72 [2018-01-21 01:02:12,828 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 59 treesize of output 49 [2018-01-21 01:02:12,831 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:02:12,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 18 [2018-01-21 01:02:12,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:12,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:02:12,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:02:12,840 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:28 [2018-01-21 01:02:12,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2018-01-21 01:02:12,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-21 01:02:12,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:12,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-01-21 01:02:12,904 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:12,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:02:12,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:02:12,909 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:35, output treesize:4 [2018-01-21 01:02:12,960 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 01:02:12,961 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 01:02:13,016 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-21 01:02:13,018 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-21 01:02:13,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:02:13,021 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:23 [2018-01-21 01:02:13,230 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-01-21 01:02:13,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-01-21 01:02:13,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:13,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2018-01-21 01:02:13,279 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 28 treesize of output 22 [2018-01-21 01:02:13,280 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:13,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-01-21 01:02:13,305 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 18 treesize of output 10 [2018-01-21 01:02:13,306 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:13,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-01-21 01:02:13,307 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:13,314 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 01:02:13,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 33 [2018-01-21 01:02:13,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-01-21 01:02:13,364 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:13,366 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 25 treesize of output 19 [2018-01-21 01:02:13,366 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:13,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2018-01-21 01:02:13,411 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-01-21 01:02:13,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 25 [2018-01-21 01:02:13,416 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-01-21 01:02:13,437 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-01-21 01:02:13,457 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-01-21 01:02:13,462 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 1 case distinctions, treesize of input 20 treesize of output 24 [2018-01-21 01:02:13,464 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 19 treesize of output 13 [2018-01-21 01:02:13,464 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:13,472 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 11 [2018-01-21 01:02:13,473 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:13,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2018-01-21 01:02:13,484 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-01-21 01:02:13,494 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-21 01:02:13,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 8 xjuncts. [2018-01-21 01:02:13,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 8 xjuncts. [2018-01-21 01:02:13,549 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 3 variables, input treesize:42, output treesize:87 [2018-01-21 01:02:13,722 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 01:02:13,742 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:02:13,742 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 01:02:13,745 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:02:13,745 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 01:02:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:02:13,807 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 01:02:13,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-21 01:02:13,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:13,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:02:13,815 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-21 01:02:13,891 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:02:13,891 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:02:13,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-21 01:02:13,892 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:13,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:02:13,896 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-01-21 01:02:13,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-21 01:02:13,922 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-21 01:02:13,922 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:13,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:02:13,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:02:13,929 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2018-01-21 01:02:13,993 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:02:13,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 42 [2018-01-21 01:02:13,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-21 01:02:13,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:14,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:02:14,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:02:14,011 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-01-21 01:02:14,135 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2018-01-21 01:02:14,146 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 16 treesize of output 23 [2018-01-21 01:02:14,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-21 01:02:14,159 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 01:02:14,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-21 01:02:14,181 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:78 [2018-01-21 01:02:14,239 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 59 treesize of output 49 [2018-01-21 01:02:14,241 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:02:14,262 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 18 [2018-01-21 01:02:14,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:14,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:02:14,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:02:14,271 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:31 [2018-01-21 01:02:14,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2018-01-21 01:02:14,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-21 01:02:14,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:14,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-01-21 01:02:14,364 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:14,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:02:14,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:02:14,368 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:35, output treesize:4 [2018-01-21 01:02:14,381 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 01:02:14,381 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 01:02:14,392 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-21 01:02:14,393 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-21 01:02:14,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:02:14,395 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:18 [2018-01-21 01:02:14,792 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-01-21 01:02:14,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-01-21 01:02:14,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:14,817 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 1 case distinctions, treesize of input 20 treesize of output 24 [2018-01-21 01:02:14,819 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 19 treesize of output 13 [2018-01-21 01:02:14,819 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:14,833 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 7 [2018-01-21 01:02:14,833 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:14,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 12 [2018-01-21 01:02:14,844 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-21 01:02:14,853 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-21 01:02:14,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2018-01-21 01:02:14,861 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 28 treesize of output 22 [2018-01-21 01:02:14,861 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:14,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-01-21 01:02:14,886 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 18 treesize of output 5 [2018-01-21 01:02:14,887 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:14,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-01-21 01:02:14,888 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:14,896 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 01:02:14,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 33 [2018-01-21 01:02:14,943 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 25 treesize of output 19 [2018-01-21 01:02:14,944 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:14,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2018-01-21 01:02:14,947 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:14,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2018-01-21 01:02:14,978 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-01-21 01:02:14,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 26 [2018-01-21 01:02:14,990 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-01-21 01:02:15,014 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-01-21 01:02:15,034 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-01-21 01:02:15,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 8 xjuncts. [2018-01-21 01:02:15,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 8 xjuncts. [2018-01-21 01:02:15,099 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 3 variables, input treesize:37, output treesize:52 [2018-01-21 01:02:15,188 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 01:02:15,191 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 01:02:15,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16, 16, 15] total 55 [2018-01-21 01:02:15,191 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 01:02:15,192 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-21 01:02:15,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-21 01:02:15,193 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=2704, Unknown=0, NotChecked=0, Total=2970 [2018-01-21 01:02:15,193 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand 25 states. [2018-01-21 01:02:16,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:02:16,460 INFO L93 Difference]: Finished difference Result 253 states and 274 transitions. [2018-01-21 01:02:16,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-21 01:02:16,460 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 67 [2018-01-21 01:02:16,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:02:16,462 INFO L225 Difference]: With dead ends: 253 [2018-01-21 01:02:16,462 INFO L226 Difference]: Without dead ends: 226 [2018-01-21 01:02:16,464 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 222 SyntacticMatches, 8 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1563 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=614, Invalid=4788, Unknown=0, NotChecked=0, Total=5402 [2018-01-21 01:02:16,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-01-21 01:02:16,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 173. [2018-01-21 01:02:16,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-01-21 01:02:16,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 187 transitions. [2018-01-21 01:02:16,474 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 187 transitions. Word has length 67 [2018-01-21 01:02:16,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:02:16,475 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 187 transitions. [2018-01-21 01:02:16,475 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-21 01:02:16,475 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 187 transitions. [2018-01-21 01:02:16,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-21 01:02:16,476 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:02:16,476 INFO L322 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:02:16,476 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation]=== [2018-01-21 01:02:16,477 INFO L82 PathProgramCache]: Analyzing trace with hash 2108542814, now seen corresponding path program 1 times [2018-01-21 01:02:16,477 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:02:16,478 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:02:16,478 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:02:16,478 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:02:16,478 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:02:16,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:02:16,497 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:02:16,993 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-21 01:02:16,994 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:02:16,994 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 01:02:16,994 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 76 with the following transitions: [2018-01-21 01:02:16,994 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [9], [11], [14], [16], [17], [18], [19], [20], [21], [22], [23], [24], [25], [28], [29], [45], [46], [51], [55], [63], [64], [69], [73], [81], [86], [90], [99], [103], [108], [112], [120], [121], [126], [130], [138], [142], [144], [145], [188], [190], [191], [197], [201], [203], [204], [207], [208], [209], [210], [211], [212], [213], [224], [226], [227], [228], [234], [235], [236] [2018-01-21 01:02:16,996 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 01:02:16,996 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 01:02:17,594 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 01:02:17,595 INFO L268 AbstractInterpreter]: Visited 65 different actions 177 times. Merged at 54 different actions 103 times. Widened at 1 different actions 1 times. Found 8 fixpoints after 7 different actions. Largest state had 43 variables. [2018-01-21 01:02:17,607 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 01:02:17,607 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:02:17,607 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 01:02:17,612 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:02:17,612 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 01:02:17,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:02:17,636 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 01:02:17,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-21 01:02:17,676 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 15 treesize of output 3 [2018-01-21 01:02:17,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:17,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:02:17,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:02:17,677 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:3 [2018-01-21 01:02:17,693 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-01-21 01:02:17,693 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 01:02:17,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2018-01-21 01:02:17,764 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 20 treesize of output 12 [2018-01-21 01:02:17,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:17,770 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 12 treesize of output 3 [2018-01-21 01:02:17,771 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:17,778 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:17,779 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:17,779 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 17 treesize of output 11 [2018-01-21 01:02:17,780 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:17,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 01:02:17,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-21 01:02:17,786 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-21 01:02:17,814 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-01-21 01:02:17,833 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-21 01:02:17,833 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 7] imperfect sequences [18] total 27 [2018-01-21 01:02:17,833 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:02:17,834 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 01:02:17,834 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 01:02:17,834 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=581, Unknown=0, NotChecked=0, Total=702 [2018-01-21 01:02:17,834 INFO L87 Difference]: Start difference. First operand 173 states and 187 transitions. Second operand 6 states. [2018-01-21 01:02:17,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:02:17,960 INFO L93 Difference]: Finished difference Result 213 states and 230 transitions. [2018-01-21 01:02:17,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-21 01:02:17,960 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2018-01-21 01:02:17,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:02:17,962 INFO L225 Difference]: With dead ends: 213 [2018-01-21 01:02:17,962 INFO L226 Difference]: Without dead ends: 196 [2018-01-21 01:02:17,962 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 142 SyntacticMatches, 6 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=729, Unknown=0, NotChecked=0, Total=870 [2018-01-21 01:02:17,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-01-21 01:02:17,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 177. [2018-01-21 01:02:17,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-01-21 01:02:17,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 189 transitions. [2018-01-21 01:02:17,968 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 189 transitions. Word has length 75 [2018-01-21 01:02:17,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:02:17,969 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 189 transitions. [2018-01-21 01:02:17,969 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 01:02:17,969 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 189 transitions. [2018-01-21 01:02:17,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-01-21 01:02:17,969 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:02:17,970 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:02:17,970 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation]=== [2018-01-21 01:02:17,970 INFO L82 PathProgramCache]: Analyzing trace with hash -70106772, now seen corresponding path program 1 times [2018-01-21 01:02:17,970 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:02:17,971 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:02:17,971 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:02:17,971 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:02:17,971 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:02:18,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:02:18,004 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:02:18,450 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 01:02:18,451 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:02:18,451 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 01:02:18,451 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 77 with the following transitions: [2018-01-21 01:02:18,451 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [9], [11], [14], [16], [17], [18], [19], [20], [21], [22], [23], [24], [25], [31], [32], [33], [34], [35], [36], [37], [38], [39], [40], [41], [45], [46], [51], [55], [63], [64], [69], [73], [81], [86], [90], [99], [103], [108], [112], [120], [121], [126], [130], [138], [142], [144], [145], [188], [190], [191], [197], [201], [203], [204], [215], [216], [217], [218], [219], [224], [226], [227], [228], [234], [235], [236] [2018-01-21 01:02:18,453 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 01:02:18,453 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 01:02:18,823 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 01:02:18,824 INFO L268 AbstractInterpreter]: Visited 72 different actions 186 times. Merged at 61 different actions 106 times. Widened at 1 different actions 1 times. Found 8 fixpoints after 6 different actions. Largest state had 47 variables. [2018-01-21 01:02:18,826 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 01:02:18,826 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:02:18,826 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 01:02:18,834 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:02:18,834 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 01:02:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:02:18,863 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 01:02:18,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index 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-21 01:02:18,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:18,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:02:18,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-21 01:02:18,894 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:02:18,895 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:02:18,895 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-21 01:02:18,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:18,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:02:18,906 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:25 [2018-01-21 01:02:18,914 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-21 01:02:18,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index 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-21 01:02:18,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:18,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:02:18,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:02:18,927 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-01-21 01:02:18,973 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:02:18,976 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 47 treesize of output 51 [2018-01-21 01:02:18,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-21 01:02:18,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:18,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:02:18,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:02:18,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:50 [2018-01-21 01:02:19,086 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 48 [2018-01-21 01:02:19,094 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 16 treesize of output 23 [2018-01-21 01:02:19,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-21 01:02:19,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 01:02:19,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-21 01:02:19,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:100 [2018-01-21 01:02:19,173 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:02:19,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 58 [2018-01-21 01:02:19,178 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:02:19,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-01-21 01:02:19,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:19,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:02:19,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:02:19,193 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:64, output treesize:45 [2018-01-21 01:02:19,197 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:02:19,198 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:02:19,198 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:02:19,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-01-21 01:02:19,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:19,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:02:19,205 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:43 [2018-01-21 01:02:19,228 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:02:19,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2018-01-21 01:02:19,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-01-21 01:02:19,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:19,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:02:19,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:02:19,245 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:44 [2018-01-21 01:02:19,305 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:02:19,310 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 65 treesize of output 73 [2018-01-21 01:02:19,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 13 [2018-01-21 01:02:19,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:19,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:02:19,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:02:19,326 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:53 [2018-01-21 01:02:19,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 82 [2018-01-21 01:02:19,575 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:02:19,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 35 [2018-01-21 01:02:19,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-21 01:02:19,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 01:02:19,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-21 01:02:19,623 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:88, output treesize:140 [2018-01-21 01:02:19,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 76 [2018-01-21 01:02:19,676 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:02:19,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2018-01-21 01:02:19,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:19,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:02:19,688 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-21 01:02:19,688 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:103, output treesize:60 [2018-01-21 01:02:19,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 42 [2018-01-21 01:02:19,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 15 [2018-01-21 01:02:19,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:19,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 9 [2018-01-21 01:02:19,762 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:19,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-21 01:02:19,768 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:19,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:02:19,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:02:19,772 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:67, output treesize:4 [2018-01-21 01:02:19,830 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 01:02:19,830 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 01:02:19,893 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-21 01:02:19,898 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-21 01:02:19,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:02:19,902 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:23 [2018-01-21 01:02:20,223 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-21 01:02:20,225 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-21 01:02:20,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-21 01:02:20,231 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:68, output treesize:58 [2018-01-21 01:02:27,516 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 277 treesize of output 159 [2018-01-21 01:02:27,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-01-21 01:02:27,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:27,605 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 118 treesize of output 98 [2018-01-21 01:02:27,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 90 [2018-01-21 01:02:27,686 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:27,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 74 [2018-01-21 01:02:27,689 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:27,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 59 [2018-01-21 01:02:27,841 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:27,845 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 68 treesize of output 63 [2018-01-21 01:02:27,845 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:27,972 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 0 case distinctions, treesize of input 59 treesize of output 56 [2018-01-21 01:02:27,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 55 [2018-01-21 01:02:27,994 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:28,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 67 [2018-01-21 01:02:28,016 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:28,022 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:02:28,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 66 [2018-01-21 01:02:28,031 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:28,038 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:02:28,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 87 [2018-01-21 01:02:28,050 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:28,051 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:28,052 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:28,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 103 [2018-01-21 01:02:28,064 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-01-21 01:02:28,172 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:28,173 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:28,173 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:28,173 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:28,182 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 2 case distinctions, treesize of input 57 treesize of output 95 [2018-01-21 01:02:28,183 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-01-21 01:02:28,274 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:28,279 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:28,281 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:02:28,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 106 [2018-01-21 01:02:28,301 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 8 xjuncts. [2018-01-21 01:02:28,452 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:28,458 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:28,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 52 treesize of output 110 [2018-01-21 01:02:28,487 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 16 xjuncts. [2018-01-21 01:02:28,645 INFO L267 ElimStorePlain]: Start of recursive call 13: 4 dim-1 vars, End of recursive call: and 8 xjuncts. [2018-01-21 01:02:28,757 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:28,759 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:28,784 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 7 case distinctions, treesize of input 52 treesize of output 95 [2018-01-21 01:02:28,791 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:28,792 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:28,794 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:28,796 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:28,825 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 9 case distinctions, treesize of input 69 treesize of output 108 [2018-01-21 01:02:28,826 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 8 xjuncts. [2018-01-21 01:02:29,128 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:29,129 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:29,130 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:29,131 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:29,132 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:02:29,143 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 3 case distinctions, treesize of input 57 treesize of output 105 [2018-01-21 01:02:29,143 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-01-21 01:02:29,360 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:29,360 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:29,361 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:29,361 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:29,362 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:29,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 103 [2018-01-21 01:02:29,374 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-01-21 01:02:29,592 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:29,595 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:29,597 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:29,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 10 case distinctions, treesize of input 55 treesize of output 113 [2018-01-21 01:02:29,632 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 16 xjuncts. [2018-01-21 01:02:30,187 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:30,187 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:30,188 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:30,190 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 48 treesize of output 70 [2018-01-21 01:02:30,190 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:30,359 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:30,359 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:30,360 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:02:30,360 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:30,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 75 [2018-01-21 01:02:30,365 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:30,673 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:30,688 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:02:30,689 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:30,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 89 [2018-01-21 01:02:30,725 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 3 xjuncts. [2018-01-21 01:02:30,890 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:30,890 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:30,891 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:30,892 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:30,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 90 [2018-01-21 01:02:30,907 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2018-01-21 01:02:31,186 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:31,187 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:31,187 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:31,188 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:31,188 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:31,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 98 [2018-01-21 01:02:31,200 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 2 xjuncts. [2018-01-21 01:02:31,674 INFO L267 ElimStorePlain]: Start of recursive call 18: 16 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-01-21 01:02:31,844 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 13 xjuncts. [2018-01-21 01:02:32,095 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:32,105 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:02:32,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 70 [2018-01-21 01:02:32,124 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:32,133 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:02:32,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 88 [2018-01-21 01:02:32,173 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:32,174 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:32,175 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:32,175 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:32,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 69 treesize of output 115 [2018-01-21 01:02:32,196 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 4 xjuncts. [2018-01-21 01:02:32,388 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:32,398 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:32,400 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:02:32,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 54 treesize of output 109 [2018-01-21 01:02:32,466 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 16 xjuncts. [2018-01-21 01:02:33,332 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:33,340 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:33,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 11 case distinctions, treesize of input 50 treesize of output 123 [2018-01-21 01:02:33,385 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-01-21 01:02:33,390 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 32 xjuncts. [2018-01-21 01:02:33,807 INFO L267 ElimStorePlain]: Start of recursive call 29: 4 dim-1 vars, End of recursive call: and 17 xjuncts. [2018-01-21 01:02:34,060 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:34,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 10 case distinctions, treesize of input 51 treesize of output 105 [2018-01-21 01:02:34,105 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-01-21 01:02:34,115 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-21 01:02:34,116 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:35,399 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:35,400 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:35,400 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:35,403 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:35,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 110 [2018-01-21 01:02:35,454 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 4 xjuncts. [2018-01-21 01:02:36,206 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:36,207 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:36,208 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:36,220 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 3 case distinctions, treesize of input 51 treesize of output 80 [2018-01-21 01:02:36,221 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 2 xjuncts. [2018-01-21 01:02:36,605 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:36,605 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:36,606 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:02:36,607 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:36,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 82 [2018-01-21 01:02:36,614 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:36,972 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:36,979 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:36,981 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:02:37,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 12 case distinctions, treesize of input 58 treesize of output 109 [2018-01-21 01:02:37,016 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 16 xjuncts. [2018-01-21 01:02:38,906 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:38,908 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:38,909 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:38,909 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:02:38,920 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 3 case distinctions, treesize of input 49 treesize of output 91 [2018-01-21 01:02:38,920 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 2 xjuncts. [2018-01-21 01:02:39,880 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:39,880 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:39,881 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:39,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 62 [2018-01-21 01:02:39,883 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:40,347 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:40,348 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:40,374 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:40,393 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 3 case distinctions, treesize of input 49 treesize of output 76 [2018-01-21 01:02:40,393 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 2 xjuncts. [2018-01-21 01:02:40,872 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:40,873 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:40,873 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:40,873 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:40,875 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:40,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 112 [2018-01-21 01:02:40,895 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 4 xjuncts. [2018-01-21 01:02:41,424 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:41,425 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:41,425 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:41,426 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:41,436 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 2 case distinctions, treesize of input 52 treesize of output 89 [2018-01-21 01:02:41,437 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 2 xjuncts. [2018-01-21 01:02:41,927 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:41,927 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:41,928 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:41,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 94 [2018-01-21 01:02:41,949 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 4 xjuncts. [2018-01-21 01:02:42,954 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:42,956 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:42,958 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:42,960 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:02:42,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 109 [2018-01-21 01:02:42,978 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 4 xjuncts. [2018-01-21 01:02:44,865 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:44,866 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:44,868 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:44,869 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:02:44,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 107 [2018-01-21 01:02:44,887 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 4 xjuncts. [2018-01-21 01:02:45,358 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:45,366 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:45,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 14 case distinctions, treesize of input 54 treesize of output 127 [2018-01-21 01:02:45,446 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-01-21 01:02:45,449 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 32 xjuncts. [2018-01-21 01:02:46,835 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:46,837 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:02:46,839 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:46,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 108 [2018-01-21 01:02:46,862 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 5 xjuncts. [2018-01-21 01:02:47,624 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:47,624 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:47,625 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:47,625 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:47,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 64 treesize of output 110 [2018-01-21 01:02:47,643 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 4 xjuncts. [2018-01-21 01:02:48,708 INFO L267 ElimStorePlain]: Start of recursive call 33: 32 dim-1 vars, End of recursive call: and 26 xjuncts. [2018-01-21 01:02:49,203 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, End of recursive call: and 35 xjuncts. [2018-01-21 01:02:49,912 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:49,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 50 [2018-01-21 01:02:49,919 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:49,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 55 [2018-01-21 01:02:49,938 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:49,938 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:02:49,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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 47 [2018-01-21 01:02:49,941 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:49,986 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:49,986 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:49,987 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:49,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 54 [2018-01-21 01:02:49,989 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:50,013 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:50,016 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:50,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 69 [2018-01-21 01:02:50,034 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 4 xjuncts. [2018-01-21 01:02:50,069 INFO L267 ElimStorePlain]: Start of recursive call 51: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-01-21 01:02:50,099 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-01-21 01:02:50,753 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:50,758 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:02:50,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 60 [2018-01-21 01:02:50,767 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:50,772 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:02:50,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 76 [2018-01-21 01:02:50,787 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:50,788 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:50,788 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:50,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 88 [2018-01-21 01:02:50,798 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 2 xjuncts. [2018-01-21 01:02:50,890 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:50,896 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:50,920 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 7 case distinctions, treesize of input 55 treesize of output 95 [2018-01-21 01:02:50,921 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 8 xjuncts. [2018-01-21 01:02:51,046 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:51,051 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:51,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 50 treesize of output 100 [2018-01-21 01:02:51,076 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 16 xjuncts. [2018-01-21 01:02:51,198 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:51,199 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:51,199 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:51,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 83 [2018-01-21 01:02:51,207 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 2 xjuncts. [2018-01-21 01:02:51,306 INFO L267 ElimStorePlain]: Start of recursive call 56: 4 dim-1 vars, End of recursive call: and 8 xjuncts. [2018-01-21 01:02:51,414 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:51,437 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 7 case distinctions, treesize of input 46 treesize of output 81 [2018-01-21 01:02:51,441 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-21 01:02:51,441 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:51,608 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:51,609 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:51,610 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:51,611 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:02:51,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 93 [2018-01-21 01:02:51,621 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 2 xjuncts. [2018-01-21 01:02:51,940 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:51,941 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:51,942 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:51,945 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:51,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 89 [2018-01-21 01:02:51,958 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 2 xjuncts. [2018-01-21 01:02:52,133 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:52,133 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:02:52,135 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:02:52,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 69 [2018-01-21 01:02:52,144 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 2 xjuncts. [2018-01-21 01:02:52,310 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:52,315 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:52,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 9 case distinctions, treesize of input 54 treesize of output 94 [2018-01-21 01:02:52,341 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 8 xjuncts. [2018-01-21 01:02:53,114 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:53,114 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:53,115 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:53,117 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 46 treesize of output 64 [2018-01-21 01:02:53,117 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:53,295 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:53,296 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:02:53,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 75 [2018-01-21 01:02:53,309 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 3 xjuncts. [2018-01-21 01:02:53,478 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:53,478 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:53,478 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:53,488 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 2 case distinctions, treesize of input 52 treesize of output 82 [2018-01-21 01:02:53,489 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 2 xjuncts. [2018-01-21 01:02:53,930 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:53,934 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:53,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 10 case distinctions, treesize of input 49 treesize of output 99 [2018-01-21 01:02:53,968 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 16 xjuncts. [2018-01-21 01:02:54,247 INFO L267 ElimStorePlain]: Start of recursive call 61: 16 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-01-21 01:02:54,425 INFO L267 ElimStorePlain]: Start of recursive call 55: 2 dim-1 vars, End of recursive call: and 14 xjuncts. [2018-01-21 01:02:55,231 INFO L267 ElimStorePlain]: Start of recursive call 11: 4 dim-1 vars, End of recursive call: and 51 xjuncts. [2018-01-21 01:02:56,146 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:56,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 58 [2018-01-21 01:02:56,161 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:56,168 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:02:56,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 65 [2018-01-21 01:02:56,185 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:02:56,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 81 [2018-01-21 01:02:56,223 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:56,231 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:56,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 93 [2018-01-21 01:02:56,255 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 2 xjuncts. [2018-01-21 01:02:56,373 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:56,374 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:56,375 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:56,375 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:56,385 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 2 case distinctions, treesize of input 53 treesize of output 87 [2018-01-21 01:02:56,385 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 2 xjuncts. [2018-01-21 01:02:56,480 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:56,485 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:56,487 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:02:56,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 98 [2018-01-21 01:02:56,507 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 8 xjuncts. [2018-01-21 01:02:56,686 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:56,692 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:56,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 48 treesize of output 102 [2018-01-21 01:02:56,727 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 16 xjuncts. [2018-01-21 01:02:56,916 INFO L267 ElimStorePlain]: Start of recursive call 73: 4 dim-1 vars, End of recursive call: and 8 xjuncts. [2018-01-21 01:02:57,064 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:57,091 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 7 case distinctions, treesize of input 46 treesize of output 85 [2018-01-21 01:02:57,096 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:57,097 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:02:57,097 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:57,099 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:02:57,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 78 [2018-01-21 01:02:57,109 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 2 xjuncts. [2018-01-21 01:02:57,810 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:57,815 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:57,816 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:02:57,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 9 case distinctions, treesize of input 53 treesize of output 95 [2018-01-21 01:02:57,844 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 8 xjuncts. [2018-01-21 01:02:58,068 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:58,069 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:58,070 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:58,082 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 3 case distinctions, treesize of input 51 treesize of output 80 [2018-01-21 01:02:58,083 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 2 xjuncts. [2018-01-21 01:02:58,736 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:58,737 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:02:58,737 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:58,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 81 [2018-01-21 01:02:58,752 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 3 xjuncts. [2018-01-21 01:02:58,965 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:58,965 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:58,966 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:58,966 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:58,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, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 88 [2018-01-21 01:02:58,978 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 2 xjuncts. [2018-01-21 01:02:59,178 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:59,178 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:59,178 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:59,181 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 44 treesize of output 62 [2018-01-21 01:02:59,181 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-01-21 01:02:59,353 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:59,358 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:59,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 10 case distinctions, treesize of input 49 treesize of output 103 [2018-01-21 01:02:59,392 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 16 xjuncts. [2018-01-21 01:02:59,748 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:59,749 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:59,749 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:59,750 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:02:59,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 91 [2018-01-21 01:02:59,762 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 2 xjuncts. [2018-01-21 01:03:00,145 INFO L267 ElimStorePlain]: Start of recursive call 78: 16 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-01-21 01:03:00,318 INFO L267 ElimStorePlain]: Start of recursive call 72: 2 dim-1 vars, End of recursive call: and 13 xjuncts. [2018-01-21 01:03:00,505 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:03:00,508 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 44 treesize of output 46 [2018-01-21 01:03:00,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 49 [2018-01-21 01:03:00,527 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:03:00,527 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:03:00,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 53 [2018-01-21 01:03:00,530 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2018-01-21 01:03:00,558 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:03:00,559 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:03:00,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2018-01-21 01:03:00,562 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-01-21 01:03:00,588 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:03:00,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 63 [2018-01-21 01:03:00,606 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 4 xjuncts. [2018-01-21 01:03:00,663 INFO L267 ElimStorePlain]: Start of recursive call 88: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-01-21 01:03:00,693 INFO L267 ElimStorePlain]: Start of recursive call 87: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-01-21 01:03:00,875 INFO L267 ElimStorePlain]: Start of recursive call 71: 2 dim-1 vars, End of recursive call: and 15 xjuncts. [2018-01-21 01:03:01,768 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:03:01,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 56 [2018-01-21 01:03:01,781 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:03:01,786 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:03:01,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 58 [2018-01-21 01:03:01,796 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:03:01,821 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 7 case distinctions, treesize of input 53 treesize of output 83 [2018-01-21 01:03:01,827 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:03:01,828 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:03:01,828 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:03:01,840 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 3 case distinctions, treesize of input 58 treesize of output 85 [2018-01-21 01:03:01,840 INFO L267 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 2 xjuncts. [2018-01-21 01:03:02,082 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:03:02,083 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:03:02,083 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:03:02,098 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 2 case distinctions, treesize of input 50 treesize of output 80 [2018-01-21 01:03:02,099 INFO L267 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 2 xjuncts. [2018-01-21 01:03:02,283 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:03:02,288 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:03:02,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 9 case distinctions, treesize of input 52 treesize of output 92 [2018-01-21 01:03:02,318 INFO L267 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 8 xjuncts. [2018-01-21 01:03:03,125 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:03:03,126 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:03:03,127 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:03:03,128 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:03:03,138 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 3 case distinctions, treesize of input 49 treesize of output 91 [2018-01-21 01:03:03,139 INFO L267 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 2 xjuncts. [2018-01-21 01:03:03,355 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:03:03,356 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:03:03,357 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:03:03,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 67 [2018-01-21 01:03:03,366 INFO L267 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 2 xjuncts. [2018-01-21 01:03:03,581 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:03:03,582 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:03:03,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 73 [2018-01-21 01:03:03,595 INFO L267 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 3 xjuncts. [2018-01-21 01:03:03,955 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:03:03,955 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:03:03,956 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:03:03,958 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 44 treesize of output 62 [2018-01-21 01:03:03,958 INFO L267 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2018-01-21 01:03:04,440 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:03:04,440 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:03:04,441 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:03:04,442 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:03:04,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 87 [2018-01-21 01:03:04,452 INFO L267 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 2 xjuncts. [2018-01-21 01:03:04,618 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:03:04,622 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:03:04,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 10 case distinctions, treesize of input 47 treesize of output 97 [2018-01-21 01:03:04,655 INFO L267 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 16 xjuncts. Received shutdown request... [2018-01-21 01:03:04,697 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-21 01:03:04,697 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-21 01:03:04,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 01:03:04 BoogieIcfgContainer [2018-01-21 01:03:04,699 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 01:03:04,700 INFO L168 Benchmark]: Toolchain (without parser) took 58323.59 ms. Allocated memory was 304.1 MB in the beginning and 856.7 MB in the end (delta: 552.6 MB). Free memory was 261.4 MB in the beginning and 304.9 MB in the end (delta: -43.5 MB). Peak memory consumption was 526.6 MB. Max. memory is 5.3 GB. [2018-01-21 01:03:04,701 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 304.1 MB. Free memory is still 267.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 01:03:04,701 INFO L168 Benchmark]: CACSL2BoogieTranslator took 219.78 ms. Allocated memory is still 304.1 MB. Free memory was 261.4 MB in the beginning and 249.4 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-21 01:03:04,701 INFO L168 Benchmark]: Boogie Preprocessor took 38.87 ms. Allocated memory is still 304.1 MB. Free memory was 249.4 MB in the beginning and 247.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 01:03:04,701 INFO L168 Benchmark]: RCFGBuilder took 435.24 ms. Allocated memory is still 304.1 MB. Free memory was 247.5 MB in the beginning and 218.9 MB in the end (delta: 28.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 5.3 GB. [2018-01-21 01:03:04,701 INFO L168 Benchmark]: TraceAbstraction took 57622.43 ms. Allocated memory was 304.1 MB in the beginning and 856.7 MB in the end (delta: 552.6 MB). Free memory was 218.9 MB in the beginning and 304.9 MB in the end (delta: -85.9 MB). Peak memory consumption was 484.1 MB. Max. memory is 5.3 GB. [2018-01-21 01:03:04,703 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.15 ms. Allocated memory is still 304.1 MB. Free memory is still 267.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 219.78 ms. Allocated memory is still 304.1 MB. Free memory was 261.4 MB in the beginning and 249.4 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.87 ms. Allocated memory is still 304.1 MB. Free memory was 249.4 MB in the beginning and 247.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 435.24 ms. Allocated memory is still 304.1 MB. Free memory was 247.5 MB in the beginning and 218.9 MB in the end (delta: 28.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 57622.43 ms. Allocated memory was 304.1 MB in the beginning and 856.7 MB in the end (delta: 552.6 MB). Free memory was 218.9 MB in the beginning and 304.9 MB in the end (delta: -85.9 MB). Peak memory consumption was 484.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 38 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 370 LocStat_NO_SUPPORTING_DISEQUALITIES : 117 LocStat_NO_DISJUNCTIONS : -76 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 44 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 69 TransStat_NO_SUPPORTING_DISEQUALITIES : 15 TransStat_NO_DISJUNCTIONS : 50 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.373702 RENAME_VARIABLES(MILLISECONDS) : 0.395059 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.342066 PROJECTAWAY(MILLISECONDS) : 0.992862 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001690 DISJOIN(MILLISECONDS) : 0.767671 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.423697 ADD_EQUALITY(MILLISECONDS) : 0.024050 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.012254 #CONJOIN_DISJUNCTIVE : 127 #RENAME_VARIABLES : 247 #UNFREEZE : 0 #CONJOIN : 210 #PROJECTAWAY : 161 #ADD_WEAK_EQUALITY : 22 #DISJOIN : 17 #RENAME_VARIABLES_DISJUNCTIVE : 219 #ADD_EQUALITY : 74 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 11 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 40 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 393 LocStat_NO_SUPPORTING_DISEQUALITIES : 117 LocStat_NO_DISJUNCTIONS : -80 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 46 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 86 TransStat_NO_SUPPORTING_DISEQUALITIES : 16 TransStat_NO_DISJUNCTIONS : 55 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.739728 RENAME_VARIABLES(MILLISECONDS) : 0.784703 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.693119 PROJECTAWAY(MILLISECONDS) : 1.491757 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001395 DISJOIN(MILLISECONDS) : 1.213923 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.827931 ADD_EQUALITY(MILLISECONDS) : 0.031842 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.013346 #CONJOIN_DISJUNCTIVE : 124 #RENAME_VARIABLES : 237 #UNFREEZE : 0 #CONJOIN : 230 #PROJECTAWAY : 167 #ADD_WEAK_EQUALITY : 23 #DISJOIN : 16 #RENAME_VARIABLES_DISJUNCTIVE : 209 #ADD_EQUALITY : 83 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 11 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 60 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 554 LocStat_NO_SUPPORTING_DISEQUALITIES : 141 LocStat_NO_DISJUNCTIONS : -120 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 67 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 92 TransStat_NO_SUPPORTING_DISEQUALITIES : 23 TransStat_NO_DISJUNCTIONS : 74 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.448914 RENAME_VARIABLES(MILLISECONDS) : 0.617673 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.412159 PROJECTAWAY(MILLISECONDS) : 0.317384 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001658 DISJOIN(MILLISECONDS) : 1.331613 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.664371 ADD_EQUALITY(MILLISECONDS) : 0.025421 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.008902 #CONJOIN_DISJUNCTIVE : 245 #RENAME_VARIABLES : 471 #UNFREEZE : 0 #CONJOIN : 357 #PROJECTAWAY : 299 #ADD_WEAK_EQUALITY : 48 #DISJOIN : 22 #RENAME_VARIABLES_DISJUNCTIVE : 433 #ADD_EQUALITY : 114 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 16 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 62 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 578 LocStat_NO_SUPPORTING_DISEQUALITIES : 139 LocStat_NO_DISJUNCTIONS : -124 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 69 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 109 TransStat_NO_SUPPORTING_DISEQUALITIES : 24 TransStat_NO_DISJUNCTIONS : 79 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.486091 RENAME_VARIABLES(MILLISECONDS) : 0.440269 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.442320 PROJECTAWAY(MILLISECONDS) : 0.074919 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.002033 DISJOIN(MILLISECONDS) : 1.479342 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.480092 ADD_EQUALITY(MILLISECONDS) : 0.014651 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.014994 #CONJOIN_DISJUNCTIVE : 275 #RENAME_VARIABLES : 535 #UNFREEZE : 0 #CONJOIN : 418 #PROJECTAWAY : 341 #ADD_WEAK_EQUALITY : 49 #DISJOIN : 33 #RENAME_VARIABLES_DISJUNCTIVE : 489 #ADD_EQUALITY : 123 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 16 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 69 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 679 LocStat_NO_SUPPORTING_DISEQUALITIES : 210 LocStat_NO_DISJUNCTIONS : -138 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 76 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 110 TransStat_NO_SUPPORTING_DISEQUALITIES : 26 TransStat_NO_DISJUNCTIONS : 83 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.010442 RENAME_VARIABLES(MILLISECONDS) : 0.135743 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.000626 PROJECTAWAY(MILLISECONDS) : 0.023824 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.002392 DISJOIN(MILLISECONDS) : 0.747793 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.152170 ADD_EQUALITY(MILLISECONDS) : 0.013981 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.004227 #CONJOIN_DISJUNCTIVE : 271 #RENAME_VARIABLES : 507 #UNFREEZE : 0 #CONJOIN : 402 #PROJECTAWAY : 326 #ADD_WEAK_EQUALITY : 74 #DISJOIN : 23 #RENAME_VARIABLES_DISJUNCTIVE : 469 #ADD_EQUALITY : 149 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 16 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 3 procedures, 91 locations, 3 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=0, 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L994] EXPR, FCALL malloc(sizeof(struct TSLL)) VAL [malloc(sizeof(struct TSLL))={14:0}] [L994] struct TSLL* list = malloc(sizeof(struct TSLL)); VAL [list={14:0}, malloc(sizeof(struct TSLL))={14:0}] [L995] FCALL list->next = ((void*)0) VAL [list={14:0}, malloc(sizeof(struct TSLL))={14:0}] [L996] FCALL list->prev = ((void*)0) VAL [list={14:0}, malloc(sizeof(struct TSLL))={14:0}] [L997] FCALL list->colour = BLACK VAL [list={14:0}, malloc(sizeof(struct TSLL))={14:0}] [L999] struct TSLL* end = list; VAL [end={14:0}, list={14:0}, malloc(sizeof(struct TSLL))={14:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1028] end = ((void*)0) [L1029] end = list VAL [end={14:0}, list={14:0}, malloc(sizeof(struct TSLL))={14:0}] [L1032] COND FALSE !(!(((void*)0) != end)) VAL [end={14:0}, list={14:0}, malloc(sizeof(struct TSLL))={14:0}] [L1032] COND FALSE !(0) VAL [end={14:0}, list={14:0}, malloc(sizeof(struct TSLL))={14:0}] [L1033] EXPR, FCALL end->colour VAL [end={14:0}, end->colour=1, list={14:0}, malloc(sizeof(struct TSLL))={14:0}] [L1033] COND FALSE !(!(BLACK == end->colour)) [L1033] COND FALSE !(0) VAL [end={14:0}, list={14:0}, malloc(sizeof(struct TSLL))={14:0}] [L1034] COND TRUE ((void*)0) != end VAL [end={14:0}, list={14:0}, malloc(sizeof(struct TSLL))={14:0}] [L1036] EXPR, FCALL end->colour VAL [end={14:0}, end->colour=1, list={14:0}, malloc(sizeof(struct TSLL))={14:0}] [L1036] COND FALSE !(RED == end->colour) [L1043] EXPR, FCALL end->next VAL [end={14:0}, end->next={0:0}, list={14:0}, malloc(sizeof(struct TSLL))={14:0}] [L1043] end = end->next [L1034] COND FALSE !(((void*)0) != end) VAL [end={0:0}, list={14:0}, malloc(sizeof(struct TSLL))={14:0}] [L1047] COND TRUE ((void*)0) != list VAL [end={0:0}, list={14:0}, malloc(sizeof(struct TSLL))={14:0}] [L1049] EXPR, FCALL list->colour VAL [end={0:0}, list={14:0}, list->colour=1, malloc(sizeof(struct TSLL))={14:0}] [L1049] COND FALSE !(RED == list->colour) [L1058] EXPR, FCALL list->next VAL [end={0:0}, list={14:0}, list->next={0:0}, malloc(sizeof(struct TSLL))={14:0}] [L1058] end = list->next [L1059] FCALL free(list) VAL [end={0:0}, list={14:0}, malloc(sizeof(struct TSLL))={14:0}] [L1060] list = end VAL [end={0:0}, list={0:0}, malloc(sizeof(struct TSLL))={14:0}] [L1047] COND FALSE !(((void*)0) != list) VAL [end={0:0}, list={0:0}, malloc(sizeof(struct TSLL))={14:0}] [L1064] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 3 procedures, 91 locations, 3 error locations. UNSAFE Result, 0.6s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 167 SDtfs, 223 SDslu, 66 SDs, 0 SdLazy, 73 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=2, 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.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 28 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 95 NumberOfCodeBlocks, 95 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 49 ConstructedInterpolants, 0 QuantifiedInterpolants, 2807 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 991]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 991). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 86. - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 3 procedures, 91 locations, 3 error locations. TIMEOUT Result, 56.7s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 2.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 547 SDtfs, 1190 SDslu, 2213 SDs, 0 SdLazy, 1822 SolverSat, 137 SolverUnsat, 15 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 976 GetRequests, 784 SyntacticMatches, 24 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2172 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=177occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.3s AbstIntTime, 5 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 156 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 762 NumberOfCodeBlocks, 762 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1176 ConstructedInterpolants, 108 QuantifiedInterpolants, 669192 SizeOfPredicates, 77 NumberOfNonLiveVariables, 1219 ConjunctsInSsa, 161 ConjunctsInUnsatCore, 23 InterpolantComputations, 6 PerfectInterpolantSequences, 96/182 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_01-03-04-717.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-21_01-03-04-717.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-21_01-03-04-717.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-21_01-03-04-717.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-21_01-03-04-717.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-21_01-03-04-717.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-21_01-03-04-717.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-21_01-03-04-717.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-21_01-03-04-717.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-4-2018-01-21_01-03-04-717.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-4-2018-01-21_01-03-04-717.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_01-03-04-717.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_01-03-04-717.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_01-03-04-717.csv Completed graceful shutdown